Construction of irregular LDPC convolutional codes with fast encoding

IEEE International Conference on Communications

Volumn 3, Issue , 2006, Pages 1160-1165

  Pusane, Ali Emre ^a   Zigangirov, Kamil Sh ^a   Costello, Daniel J ^a  

^a University of Notre Dame   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CODING; COMPUTER SIMULATION; ENCODING (SYMBOLS); SHIFT REGISTERS; STORAGE ALLOCATION (COMPUTER);

CONSTRUCTED CODES; FAST ENCODING; HARDWARE COMPLEXITY; SHIFT-REGISTER BASED ENCODERS;

CONVOLUTIONAL CODES;

EID: 42549144119     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2006.254904     Document Type: Conference Paper

References (22)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error correcting coding and decoding: turbo codes," in Proc. of the IEEE International Conference on Communications, (Geneva, Switzerland), pp. 1064-1070, May 1993.
2. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
3. N. Wiberg, Codes and Decoding on General Graphs. PhD thesis, Linkoping University, Sweden, 1996.
4. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electronics Letters, vol. 32, pp. 1645-1646, August 1996.
5. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Analysis of low density codes and improved designs using irregular graphs," in Proc. 30th Annual ACM Symp. Theory of Computation, pp. 249-258, May 1998.
6. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inform. Theory, vol. IT-47, pp. 585-598, Feb. 2001.
7. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. IT-47, pp. 599-618, Feb. 2001.
8. S. Y. Chung, T. J. Richardson, and R. L. Urbanke, "Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation," IEEE Trans. Inform. Theory, vol. IT-47, pp. 657-670, Feb. 2001.
9. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
10. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. IT-47, pp. 619-637, Feb. 2001.
11. 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 Communications Letters, vol. 5, pp. 58-60, Feb. 2001.
12. A. Jiménez-Feltström and K. Sh. Zigangirov, "Time-varying periodic convolutional codes with low-density parity-check matrix," IEEE Trans. Inform. Theory, vol. IT-45, pp. 2181-2191, Sept. 1999.
13. S. Bates, Z. Chen, and X. Dong, "Low-density parity check convolutional codes for Ethernet networks," in Proc. IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, (Victoria, B.C., Canada), Aug. 2005.
14. S. Bates, D. Elliot, and R. Swamy, "Termination sequence generation circuits for low-density parity-check convolutional codes," submitted to IEEE Trans. Circuits and Systems I, March 2005.
15. S. Bates, L. Guntorphe, A. E. Pusane, Z. Chen, K. Sh. Zigangirov, and D. J. Costello, Jr., "Decoders for low-density parity-check convolutional codes with large memory," in Proc. 12th NASA Symposium on VLSI Design, (Coeur d'Alene, Idaho, U.S.A.), Oct. 2005.
16. X. Y Hu, E. Eleftheriou, and D. M. Arnold, "Progressive edge-growth Tanner graphs," in Proc. IEEE Global Telecommun. Conf, (San Antonio, TX), pp. 995-1001, Nov. 2001.
17. A. E. Pusane, M. Lentmaier, K. Sh. Zigangirov, and D. J. Costello, Jr., "Reduced complexity decoding strategies for LDPC convolutional codes," in Proc. IEEE Intl. Symposium on Information Theory, (Chicago, Illinois, USA), p. 490, June 2004.
18. S. Lin and D. J. Costello, Jr., Error Control Coding. Englewood Cliffs, NJ: Prentice-Hall, 2nd ed., 2004.
19. A. E. Pusane, A. Jiménez-Feltström, A. Sridharan, M. Lentmaier, K. Sh. Zigangirov, and D. J. Costello, Jr., "Implementation aspects of LDPC convolutional codes," submitted to IEEE Trans. Commun., Nov. 2005.
20. R. M. Tanner, D. Sridhara, A. Sridharan, T. E. Fuja, and D. J. Costello, Jr., "LDPC block and convolutional codes based on circulant matrices," IEEE Trans. Inform. Theory, vol. IT-50, pp. 2966-2984, Dec. 2004.
21. A. Sridharan, D. Truhachev, M. Lentmaier, D. J. Costello, Jr., and K. Sh. Zigangirov, "On the free distance of LDPC convolutional codes," in Proc. IEEE Intl. Symposium on Information Theory, (Chicago, Illinois, USA), p. 311, June 2004.
22. A. Sridharan, D. Truhachev, M. Lentmaier, D. J. Costello, Jr., and K. Sh. Zigangirov, "Distance bounds for a class of LDPC convolutional codes constructed from permutation matrices," submitted to IEEE Trans. Inform. Theory, Jan. 2005.