Performance analysis of BP-based algorithms for irregular low-density parity-check codes on fast rayleigh fading channel

IEEE Vehicular Technology Conference

Volumn 60, Issue 4, 2004, Pages 2530-2534

  Ohhashi, Akinori ^a   Ohtsuki, Tomoaki ^a  

^a TOKYO UNIVERSITY OF SCIENCE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; DECODING; ENCODING (SYMBOLS); GAUSSIAN NOISE (ELECTRONIC); INTEGER PROGRAMMING; OPTIMIZATION; RAYLEIGH FADING; WHITE ACOUSTIC NOISE;

BELIEF PROPAGATION (BP); DENSITY EVOLUTION (DE); FADING CHANNELS; LOW-DENSITY PARITY-CHECK (LDPC) CODES;

CODES (SYMBOLS);

EID: 17144414111     PISSN: 15502252     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. R. G. Gallager, Low-density parity-check codes. Cambridge, MA: M. I. T. Press, 1963.
2. D. J. C. MaoKay, "Good error-correcting Codes based on very sparse matrices, "IEEE Trans. Inform. Theory, vol. 45, pp. 339-431, Mar. 1999.
3. D. J. C. MacKay and R. M. Neal, "Near shannon limit performance of low density parity check codes, "Electron. Letters, pp. 1645-1646, Aug. 1996.
4. F. Zarkeshvari and A.H. Banihashemi, "On implementation of min-sum algorithm for decoding low-density parity-check (LDPC) codes," IEEE Globecom 2002, pp. 1349-1353, Nov. 2002.
5. M. Fossorier, M. Mihaljevic, and H. Imai, "Reduced complexity iterative decoding of low density parity check codes based on belief propagation," IEEE Trans. Commun., vol. 47, pp. 673-680, May 1999.
6. J. Chen and M. Fossorier, "Near optimum universal belief propagation based decoding of LDPC codes," IEEE Trans. Commun., vol. 50, pp. 404-416, Mar. 2002.
7. J. Chen and M. Fossorier, "Density evolution for two improved BP-Based decoding algorithms of LDPC codes", IEEE Commun. Letters, vol. 6, pp. 208-210, May 2002.
8. S. Y. Chung, "On the construction of some capacity-approaching coding schemes," Ph.D. dissertation, MIT, Sept. 2000.
9. T. J. Richardson annd R. Urbanke, "The capacity of low-density paritycheck codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.
10. H. Jilei, P. H. Siegel and L. B. Milstein, "Performance analysis and code optimization of low-density parity-check codes on Rayleigh fading channels, " IEEE. Journal., vol. 19, pp. 924-934, May. 2001.
11. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
12. X. Wei and A. N. Akansu, "Density evolution for low-density paritycheck codes under Max-Log-MAP decoding," Electron. Lett., vol. 37, pp. 1225-1226, Aug. 2001.
13. L. Ping, W. K. Leung, and N. Phamdo, "Low-density parity-check codes with semi-random parity-check matrix,"Electron. Lett., vol. 35, pp. 38-39, Jan. 1999.
14. M. Rashidpour and S. H. Jamali, "Low-density parity-check codes with simple irregular semi-random parity check matrix for finite-length application," IEEE PIMRC 2003.
15. S. Y. Chung, T. Richardson, and R. Urbanke, "Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation," IEEE Trans. Inform. Theory, vol. 47, pp. 657-671, Feb. 2001.
16. S. Chung; G.D. Forney, T. J. Richardson, and R. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit," IEEE Comm. Letters, vol.5, pp.58-60, Feb. 2001.