Random redundant iterative soft-in soft-out decoding

IEEE Transactions on Communications

Volumn 56, Issue 4, 2008, Pages 513-517

  Halford, Thomas R ^a,b   Chugg, Keith M ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b TRELLISWARE TECHNOLOGIES INC   (United States)

Author keywords

Iterative decoding; Linear block codes; Permutation groups; Redundant Tanner graphs

Indexed keywords

BLOCK CODES; CODES (STANDARDS); CODES (SYMBOLS); DECODING; ITERATIVE METHODS; MATHEMATICAL TRANSFORMATIONS;

DECODING ALGORITHMS; LINEAR BLOCK CODES; LINEAR BLOCK CODING; PERMUTATION GROUPS; REDUNDANT PARITY-CHECKS; REDUNDANT TANNER GRAPHS; SOFT-IN-SOFT-OUT; TANNER GRAPHS;

ITERATIVE DECODING;

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

References (23)

1. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
2. T. R. Halford, A. J. Grant, and K. M. Chugg, "Which codes have 4-cycle-free Tanner graphs?" IEEE Trans. Inform. Theory, vol. 52, no. 9, pp. 4219-4223, Sept. 2006.
3. T. R. Halford and K. M. Chugg, "An algorithm for counting short cycles in bipartite graphs," IEEE Trans. Inform. Theory, vol. 52, no. 1, pp. 287-292, Jan. 2006.
4. L. Lan, Y. Y. Tai, L. Chen, and K. Abdel-Ghaffer, "A trellis-based method for removing cycles from bipartite graphs and construction of low density parity check codes," IEEE Commun. Lett., vol. 8, no. 7, pp. 443-445, July 2004.
5. J. Jiang and K. R. Narayanan, "Iterative soft decision decoding of Reed-Solomon codes," IEEE Commun. Lett., vol. 8, no. 4, pp. 244-246, Apr. 2004.
6. A. Kothiyal, O. Y. Takeshita, W. Jin, and M. Fossorier, "Iterative reliability-based decoding of linear block codes with adaptive belief propagation," IEEE Commun. Lett., vol. 9, no. 12, pp. 1067-1069, Dec. 2005.
7. J. Jiang and K. R. Narayanan, "Iterative soft decision decoding of Reed-Solomon codes based on adaptive parity check matrices," in Proc. IEEE International Symp. on Information Theory, Chicago, II., June 2004, p. 261.
8. A. Kothiyal and O. Y. Takeshita, "A comparison of adaptive belief propagation and the best graph algorithm for the decoding of linear block codes," in Proc. IEEE International Symp. on Information Theory, Adelaide, Australia, Sept. 2005, pp. 724-728.
9. R. Lucas, M. P. C. Fossorier, Y. Kou, and S. Lin, "Iterative decoding of one-step majority logic decodable codes based on belief propagation," IEEE Trans. Commun., vol. 48, no. 6, pp. 931-937, June 2000.
10. D. J. C. MacKay and R. M. Neal, Codes, Systems and Graphical Models Springer-Verlag, 2000, ch. Evaluation of Gallager codes for short block lengths and high rate applications, pp. 113-130, eds.: B. Marcus and J. Rosenthal.
11. Y. Kou, J. Xu, H. Tan, S. Lin, and K. Abdel-Ghaffar, "On circulant low density parity check codes," in Proc. IEEE International Symp. on Information Theory, Lausanne, Switzerland, June 2002, p. 200.
12. K. Andrews, S. Dolinar, and F. Pollara, "LDPC decoding using multiple representations," in Proc. IEEE International Symp. on Information Theory, Lausanne, Switzerland, July 2002, p. 456.
13. O. Yeung and K. M. Chugg, "An iterative algorithm and low complexity hardware architecture for fast acquisition of PN codes in UWB systems," Springer J. VLSI Signal Processing (special issue on ultrawideband systems), vol. 43, no. 1, Apr. 2006.
14. M. Schwartz and A. Vardy, "On the stopping distance and the stopping redundancy of codes," in Proc. IEEE International Symp. on Information Theory, Adelaide, Australia, Sept. 2005, pp. 975-979.
15. G. D. Forney, Jr., "Codes on graphs: Normal realizations," IEEE Trans. Inform. Theory, pp. 520-548, Feb. 2001.
16. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. North-Holland, 1978.
17. C.-C. Lu and L. R. Welch, "On automorphism groups of binary primitive BCH codes," in Proc. IEEE International Symp. on Information Theory Trondheim, Norway, June 1994, p. 51.
18. J. Leon, "Computing automorphism groups of error-correcting codes," IEEE Trans. Inform. Theory, vol. 28, no. 3, pp. 496-511, May 1982.
19. N. Sendrier and G. Skersys, "On the computation of the automorphism group of a linear code," in Proc. IEEE International Symp. on Information Theory, Washington, DC, June 2001, p. 13.
20. J. Chen and M. P. C. Fossorier, "Near optimum universal belief propagation based decoding of low-density parity check codes," IEEE Trans. Commun., vol. 50, no. 3, pp. 406-414, Mar. 2002.
21. Y. Mao and A. H. Banihashemi, "A heuristic search for good low-density parity-check codes at short block lengths," in Proc. International Conf. Communications, vol. 1, Helsinki, Finland, June 2001, pp. 41-44.
22. F. Celler, C. R. Leedham-Green, S. H. Murray, A. C. Niemeyer, and E. A. O'Brien, "Generating random elements of a finite group," Commun. in Algebra, vol. 23, pp. 4931-4948, 1995.
23. T. Kasami, T. Takata, T. Fujiwara, and S. Lin, "On complexity of trellis structure of linear block codes," IEEE Trans. Inform. Theory vol. 39, no. 3, pp. 1057-1064, May 1993.