LDPC code design considerations for non-uniform channels

IEEE Transactions on Communications

Volumn 58, Issue 1, 2010, Pages 101-109

  Sanaei, Ali ^a   Ardakani, Masoud ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Allotted LDPC code; Code design; Discrete multi tone systems; Irregular low density parity check codes; Linear programming; Mixed integer programming; Non uniform channels; OFDM systems

Indexed keywords

CODE DESIGNS; DISCRETE MULTI TONE SYSTEMS; IRREGULAR LOW-DENSITY PARITY-CHECK CODES; LDPC CODES; MIXED INTEGER PROGRAMMING; NONUNIFORM; OFDM SYSTEMS;

CODES (SYMBOLS); CODING ERRORS; DESIGN; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; MULTICARRIER MODULATION; MULTIPLEXING EQUIPMENT; OPTIMAL SYSTEMS; OPTIMIZATION; ORTHOGONAL FREQUENCY DIVISION MULTIPLEXING; SIGNAL ENCODING; TELECOMMUNICATION SYSTEMS;

INTEGER PROGRAMMING;

EID: 76649142412     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2010.01.060685     Document Type: Article

References (24)

1. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
2. A. Shokrollahi, "New sequence of linear time erasure codes approaching the channel capacity," in Proc. International Symp. Applied Algebra, Algebraic Algorithms Error-Correcting Codes, no.1719, Lecture Notes in Computer Science, 1999, pp. 65-67.
3. S.-Y. Chung, G. D. Forney Jr., T. J. Richardson, and R. L. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit," IEEE Commun. Lett., vol.5, no.2, pp. 58-60, Feb. 2001.
4. H. Pishro-Nik, N. Rahnavard, and F. Fekri, "Non-uniform error correction using low-density parity-check codes," IEEE Trans. Inf. Theory, vol.51, pp. 2702-2714, July 2005.
5. J. Ha, J. Kim, and S. W. McLaughlin, "Rate-compatible puncturing of low-density parity-check codes," IEEE Trans. Inf. Theory, vol.50, no.11, pp. 2824-2836, Nov. 2004.
6. V. Mannoni, G. Gelle, and D. Declercq, "A linear criterion to optimize irregular LDPC codes for OFDM communications," in Proc. IEEE Veh. Technol. Conf. (VTC), vol.1, 2005.
7. A. de Baynast, A. Sabharwal, and B. Aazhang, "LDPC code design for OFDM channel: graph connectivity and information bits positioning," in Int. Symp. Signals, Circuits Systems. (SCS), Iasi, Romania, July 2005, pp. 649-652.
8. S.-Y. Chung, T. J. Richardson, and R. L. Urbanke, "Analysis of sumproduct decoding of low-density parity-check codes using a Gaussian approximation," IEEE Trans. Inf. Theory, vol.47, no.2, pp. 657-670, Feb. 2001.
9. I. Sason and G. Wiechman, "On achievable rates and complexity of LDPC codes over parallel channels: bounds and applications," IEEE Trans. Inf. Theory, vol.53, no.2, pp. 580-598, Feb. 2007. (Pubitemid 46358437)
10. A. Goldsmith, Wireless Communications. Cambridge, UK: Cambridge University Press, 2005.
11. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inf. Theory, vol.47, no.2, pp. 585-598, Feb. 2001.
12. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol.27, no.5, pp. 533-547, Sep. 1981.
13. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol.47, no.2, pp. 498-519, Feb. 2001.
14. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol.47, no.2, pp. 619-637, Feb. 2001.
15. J. Hou, P. Siegel, L. Milstein, and H. Pfister, "Capacity- approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes," IEEE Trans. Inf. Theory, vol.49, no.9, pp. 2141- 2155, 2003.
16. G. Caire, G. Taricco, and E. Biglieri, "Bit-interleaved coded modulation," IEEE Trans. Inf. Theory, vol.44, pp. 927-946, May 1998.
17. H. Imai and S. Hirakawa, "A new multilevel coding method using error correcting codes," IEEE Trans. Inf. Theory, vol.23, pp. 371-377, May 1977.
18. M. Ardakani, B. Smith, W. Yu, and F. R. Kschischang, " Complexityoptimized LDPC codes," in Proc. 43rd Annual Allerton Conf. Commun., Control Computing, Allerton House, Sep. 2005.
19. A. J. Goldsmith and P. P. Varaiya, "Capacity of fading channels with channel side information," IEEE Trans. Inf. Theory, vol.43, no.6, pp. 1986-1992, Nov. 1997.
20. R. Liu, P. Spasojevic, and E. Soljanin, "Reliable channel regions for good binary codes transmitted over parallel channels," IEEE Trans. Inf. Theory, vol.52, no.4, pp. 1405-1424, Apr. 2006.
21. T. Richardson and R. Urbanke, Modern Coding Theory. New York: Cambridge University Press, 2008.
22. T. J. Richardson and R. L. Urbanke, "The capacity of low-density paritycheck codes under message-passing decoding," IEEE Trans. Inf. Theory, vol.47, no.2, pp. 599-618, Feb. 2001.
23. A. Khandekar and R. J. McEliece, "On the complexity of reliable communication on the erasure channel," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), 2001, p. 1.
24. I. Sason and R. Urbanke, "Complexity versus performance of capacityachieving irregular repeat-accumulate codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol.50, no.6, pp. 1247-1256, June 2004.