Joint (3, k)-Regular LDPC Code and Decoder/Encoder Design

IEEE Transactions on Signal Processing

Volumn 52, Issue 4, 2004, Pages 1065-1079

  Zhang, Tong ^a   Parhi, Keshab K ^b  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b University of Minnesota   (United States)

Author keywords

Architecture; Decoding; Encoding; Low density parity check

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; DECODING; ENCODING (SYMBOLS); ERROR CORRECTION; RANDOM NUMBER GENERATION; RANDOM PROCESSES;

DECODING SPEED; LOW-DENSITY PARITY-CHECK (LDPC) CODES;

CODES (SYMBOLS);

EID: 1842586031     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2004.823508     Document Type: Article

References (30)

1. R. O. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: M.I.T. Press, 1963.
2. _, "Low-density parity-check codes," IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
3. V. Zyablov and M. Pinsker, "Estimation of the error-correction complexity of Gallager low-density codes," Problemy Peredachi Informatsii, vol. 11, pp. 23-26, Jan. 1975.
4. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Information Theory, vol. IT-27, pp. 533-547, Sept. 1981.
5. G. A. Margulis, "Explicit constructions of graphs without short cycles and low density codes," Combinatorica, vol. 2, pp. 71-78, 1982.
6. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near shannon limit error-correcting coding and decoding: turbo-codes," in Proc. ICC, Geneva, Switzerland, May 1993, pp. 1064-1070.
7. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electron. Lett., vol. 32, pp. 1645-1646, Aug. 1996.
8. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, Mar. 1999.
9. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, vol. 47, pp. 498-519, Feb. 2001.
10. M. C. Davey and D. J. C. MacKay, "Low-density parity check codes over GF(q)," IEEE Commun. Lett., vol. 2, pp. 165-167, June 1998.
11. M. G. Luby, M. Shokrolloahi, M. A. Mizenmacher, and D. Spielman, "Improved low-density parity-check codes using irregular graphs and belief propagation," in Proc. IEEE Int. Symp. Inform. Theory, Cambridge, MA, Aug. 1998, p. 117.
12. Y. Mao and A. Banihashemi, "A heuristic search for good low-density parity-check codes at short block lengths," in Proc. IEEE Int. Conf. Commun., 2001, pp. 41-44.
13. T. Richardson and R. Urbanke, "The capacity of low-density parity check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.
14. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching low-density parity check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb.
15. 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. 47, pp. 657-670, Feb. 2001.
16. 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. 47, pp. 585-598, Feb. 2001.
17. S. Chung, G. D. Forney, T. Richardson, and R. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the shannon limit," IEEE Commun. Lett., vol. 5, pp. 58-60, Feb. 2001.
18. G. Miller and D. Burshtein, "Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 2696-2710, Nov. 2001.
19. C. Howland and A. Blanksby, "A 690-mw 1-gb/s 1024-b, rate-1/2 low-density parity-check code decoder," IEEE J. Solid-State Circuits, vol. 37, pp. 404-412, Mar. 2002.
20. K. K. Parhi, VLSI Digital Signal Processing Systems: Design and Implementation. New York: Wiley, 1999.
21. E. Boutillon, J. Castura, and F. R. Kschischang, "Decoder-first code design," in Proc. 2nd Int. Symp. Turbo Codes Related Topics, Brest, France, Sept. 2000, pp. 459-462.
22. T. Zhang and K. K. Parhi, "VLSI implementation-oriented (3, k)-regular low-density parity-check codes," in Proc. IEEE Workshop Signal Process. Syst., Sept. 2001, pp. 25-36.
23. M. Chiani, A. Conti, and A. Ventura, "Evaluation of low-density parity-check codes over block fading channels," in Proc. IEEE Int. Conf. Commun., 2000, pp. 1183-1187.
24. D. J. C. MacKay, S. T. Wilson, and M. C. Davey, "Comparison of constructions of irregular Gallager codes," IEEE Trans. Commun., vol. 47, pp. 1449-1454, Oct. 1999.
25. T. Richardson and R. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 638-656, Feb. 2001.
26. T. Zhang and K. K. Parhi, "A class of efficient-encoding generalized low-density parity-check codes," in Proc. IEEE Int. Conf. Acoust., Speech, Signal Processing, Salt Lake City, UT, May 2001.
27. P. J. Cameron and J. H. Van Lint, Graph Theory, Coding Theory and Block Designs. Cambridge, U.K.: Cambridge Univ. Press, 1975.
28. H. V. Maldeghem, Generalized Polygons. Boston, MA: Birkhauser Verlag, 1998.
29. A. Lubotzky, R. Philips, and P. Sarnak, "Ramanujan graphs," Combinatorica, vol. 8, pp. 261-277, 1988.
30. T. Zhang, Z. Wang, and K. K. Parhi, "On finite precision implementation of low-density parity-check codes decoder," in Proc. IEEE Int. Symp. Circuits Syst., Sydney, Australia, May 2001.