Browse > Article

Minimum Distance Search Algorithms of LDPC Codes and RA Codes  

Chung Kyu-Hyuk (단국대학교 정보컴퓨터학부)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.31, no.3A, 2006 , pp. 207-213 More about this Journal
Abstract
In this paper, we reduce the computational complexity to find the minimum distance of RA codes by searching only valid codewords using repetition part. Since LDPC codes have repetition part like RA codes, we also apply this algorithm for computing the minimum distance of LDPC codes. The minimum distance dominates the code performance at high signal-to-noise ratios(SNRs) and in turn allows an estimate of the error floor. The proposed algorithm computes the minimum distance without any constraint on code structures. The minimum distances of LDPC codes and RA codes with large interleavers of practical importance are computed and used to obtain the error floor, which is compared with the performance of the iterative decoding.
Keywords
LDPC 부호;RA 부호;최소 거리;상향 한계;오류 마루;
Citations & Related Records
연도 인용수 순위
  • Reference
1 C. Berrou and A. Glavieux, 'Near optimum error correcting coding and decoding: turbo-codes,' IEEE Trans. Commun., vol. 44, pp. 1261-1271, October 1996   DOI   ScienceOn
2 S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, 'Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding,' IEEE Trans. Inform. Theory, pp. 909-926, May 1998
3 D. J. C. MacKay, 'Good error-correcting codes based on very sparse matrices,' Electronic Letters, vol. 33, pp. 457-458, March 1997   DOI   ScienceOn
4 S. Y. Chung, G. D. Forney, T. J. Richardson, and R. L. Urbanke, 'On the design of low-density parity-check codes within 0.0045 db of the shannon limit,' Communication letters, vol. 5, pp. 58-60, February 2001   DOI   ScienceOn
5 G. Poltyrev, 'Bounds on the decoding error probability of binary linear codes via their spectra,' IEEE Trans. Inform. Theory, vol. 40, pp. 1284-1292, July 1994   DOI   ScienceOn
6 I. Sason and S. Shamai, 'Improved upper bounds on the decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum,' IEEE Trans. Inform. Theory, vol. 46, pp. 24-47, January 2000   DOI   ScienceOn
7 A. M. Viterbi and A. J. Viterbi, 'Improved union bound on linear codes for the inputbinary awgn channel with applications to turbo codes,' Proc. IEEE Symposium on Information Theory, p. 29, August 1998
8 H. J. D. Divsalar and R. J. McEliece, 'Coding Theorems for 'Turbo-like' Codes,' 2Pro. 36th Annual Allerton Conf. on Commun., Contol, and Comp, Monticello, IL, USA, pp. 201-210, September 1998
9 G. D. Forney, 'The Viterbi Algorithm,' Proc. of IEEE, pp. 268-278, March 1973   DOI   ScienceOn
10 L. Ping, and K. Y. Wu, 'Concatenated tree codes: A low-complexity, high-performance approach,' IEEE Trans. Inform. Theory, pp. 791-799, February 200 1
11 R. Garello, P. Pierleoni, and S. Benedetto, 'Computing the free distance of turbo codes and serially concatenated codes with interleavers: Algorithms and applications,' IEEE J. Select. Areas Commun., vol. 19, pp, 800-812, May 2001   DOI   ScienceOn
12 T. M. Duman and M. Salehi, 'New performance bounds for turbo codes,' IEEE Trans. Commun., vol. 46, pp. 565-567, May 1998   DOI   ScienceOn
13 R. Gallager, 'Low Density Parity Check Codes,' MIT press, 1963