Interconnection network for structured low-density parity-check decoders

2005 Asia-Pacific Conference on Communications

Volumn 2005, Issue , 2005, Pages 537-540

  Malema, Gabofetswe ^a   Liebelt, Michael ^a  

^a UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE EDGES; COMMUNICATION PATTERNS;

ALGORITHMS; COMMUNICATION SYSTEMS; DECODING; ELECTRONIC MAIL; SCHEDULING; SWITCHING NETWORKS;

INTERCONNECTION NETWORKS;

EID: 33845295482     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/APCC.2005.1554118     Document Type: Conference Paper

References (11)

1. M. Karkooti and J. Cavallaro, "Semi-parallel reconfigurable architectures for real-time ldpc decoding," International Conference on Information Technology(ITCC), vol. 1, pp. 579-585, April 2004.
2. A. Selvarathinam, A. Prabkar, E. Kim, G. Choi, and K. Narayanan, "A massively scalable decoder architecture for low-density parity-check codes," Intenational Symposium of Circuits and Systems,ISCAS, pp. II-61-64, 2003,Bangkok,Thailand.
3. S. Olcer, "Decoding architecture for array-code-based lpdc codes," Proc. IEEE GLOBECOM, pp. 2046-2050, December 2003.
4. J. Lu, J. Moura, and U. Niesen, "Grouping-and-shifting designs for structured ldpc codes with large girth," IEEE Internatinal Symposium on Information Theory, July 2004.
5. Y. Chen and D. Hocevar, "A fpga and asic implementation of rate 1/2 8088-b irregular low-density parity-check decoder," IEEE Global Telecommunications Conference,GLOBECOM, 2003.
6. J. K.-S. Lee, B. Lee, J. Hamkins, J. Thorpe, K. Andrews, and S. Dolinar, "A scalable architecture for structured ldpc decoder," IEEE Internatinal Symposium on Information Theory, July 2004.
7. T. Richarson and N. Vladimir, "Methods and apparatus for decoding ldpc codes," US Patent, October 2003.
8. R. Tanner, D. Sridhara, and T. Fuja, "A class of group-structured ldpc codes," Proceedings of ISTA,Ambleside, England, 2001.
9. D. Konig, "Uber graphen und ihre anwendung auf determinantetheorie und mengenlhere," Math.Ann.77, pp. 453-465, 1916.
10. D. Opferman and N. Tsao-Wu, "On a class of rearangeable switching networks,part i: Control," Bell Systems Technology Journal, vol. 5, pp. 1579-1600, May-June 1971.
11. D. Nassimi and S. Sahni, "A self-routing benes network and parallel permutation algorithms," IEEE Transactions on Computers, vol. C-30, pp. 332-340, May 1981.