High-performance decoders for regular and irregular repeat-accumulate codes

GLOBECOM - IEEE Global Telecommunications Conference

Volumn 4, Issue , 2004, Pages 2583-2588

  Mansour, Mohammad M ^a  

^a AMERICAN UNIVERSITY OF BEIRUT   (Lebanon)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; DECODING; GRAPH THEORY; ITERATIVE METHODS; MAGNETIC RECORDING; MULTIMEDIA SYSTEMS; OPTIMIZATION; TELECOMMUNICATION SERVICES; WIRELESS TELECOMMUNICATION SYSTEMS;

BROADBAND SERVICES; MAGNETIC RECORDING SYSTEMS; PRECISION IMAGING; REPEAT-ACCUMULATE (RA) CODES;

BLOCK CODES;

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

References (18)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo codes," in IEEE Int. Conf. on Comm., 1993, pp. 1064-1070.
2. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. on Info. Theory, vol. 20. pp. 284-287, Mar. 1974.
3. R. G. Gallager, Low-Density Parity-Check Codes, MIT Press, Cambridge, MA, 1963.
4. T. Richardson, M. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. on Info. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
5. M. M. Mansour and N. R. Shanbhag, "High-throughput LDPC decoders," IEEE Transactions on VLSI Systems, vol. 11, no. 6, pp. 976-996, Dec. 2003.
6. D. Divsalar, H. Jin, and R. J. McEliece, "Coding theorems for turbo-like codes," in Proc. of the 36th Allerton Conf. Sep. 1998, pp. 201-210.
7. H. Jin, A. Khandekar, and R. J. McEliece, "Irregular repeat-accumulate codes." in Proc. of 2nd Int. Conf. on Turbo Codes, Brest, France, Sep. 2000, pp. 1-8.
8. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. on Info. Theory, vol. IT-27, pp. 533-547, Sep. 1981.
9. A. Roumy, S. Guemghar, G. Caire, and S. Verdu, "Design methods for irregular repeat-accumulate codes," IEEE Trans. on Info. Theory, vol. 50, no. 8, pp. 1711-1727, Aug. 2004.
10. R. M. Tanner, "On quasi-cyclic repeat-accumulate codes,'" in Proc. of the 37th Allerton Conf., Sep. 1999.
11. M. M. Mansour and N. R. Shanbhag, "Architecture-aware low-density parity-check codes," in Proc. IEEE Int. Sympos. on Circuits and Systems 2003 (ISCAS'03), Bangkok. Thailand, May 2003, vol. 2. pp. 57-60.
12. A. Lubotzky, R. Phillips, and P. Sarnak, "Ramanujan graphs," Combinatorica, vol. 8, no. 3, pp. 261-277, 1988.
13. J. Rosenthal and P. O. Vontobel, "Constructions of LDPC codes using Ramanujan graphs and ideas from Margulis," in Proc. of the 38th Allerton Conf., 2000. pp. 248-257.
14. M. M. Mansour and N. R. Shanbhag, "Construction of LDPC codes from Ramanujan graphs," in Conf. on Info. Sciences and Systems, Princeton University, Mar. 2002.
15. M. M. Mansour and N. R. Shanbhag, "On the architecture-aware structure of LDPC codes from generalized Ramanujan graphs and their decoder architectures," in Conf. on Info. Sciences and Systems, The Johns Hopkins University, Mar. 2003, pp. 215-220.
16. M. M. Mansour and N. R. Shanbhag, "Low-power VLSI decoder architectures for LDPC codes," in ISLPED 2002, Monterey, CA, Aug. 2002, pp. 284-289.
17. M. M. Mansour and N. R. Shanbhag. "Turbo decoder architectures for low-density' parity-check codes," in Proc. IEEE Global Telecomm. Conf. 2002 (GLOBECOM'02). Taipet, Taiwan, Nov. 2002, pp. 1383-1388.
18. M. M. Mansour and N. R. Shanbhag. "A 1.6-Gbit/sec 2048-bit programmable and code-rate tunable LDPC decoder chip." in 3rd Int. Sympos. on Turbo Codes, Brest, France, Sep. 2003, pp. 137-140.