Browse > Article
http://dx.doi.org/10.3745/KIPSTC.2004.11C.1.075

An Iterative Soft-Decision Decoding Algorithm of Block Codes Using Reliability Values  

Shim, Yong-Geol (단국대학교 전자·컴퓨터학부)
Publication Information
The KIPS Transactions:PartC / v.11C, no.1, 2004 , pp. 75-80 More about this Journal
Abstract
An iterative soft-decision decoding algorithm of block codes is proposed. With careful examinations of the first hard-decision decoding result, the candidate codewords are efficiently searched for. An approach to reducing decoding complexity and lowering error probability is to select a small number of candidate codewords. With high probability, we include the codewords which are at the short distance from the received signal. The decoder then computes the distance to each of the candidate codewords and selects the codeword which is the closest. We can search for the candidate codewords which make the error patterns contain the bits with small reliability values. Also, we can reduce the cases that we select the same candidate codeword already searched for. Computer simulation results are presented for (23,12) Golay code. They show that decoding complexity is considerably reduced and the block error probability is lowered.
Keywords
Soft-Decision Decoding; Error Correcting Codes;
Citations & Related Records
연도 인용수 순위
  • Reference
1 G. C. Clark, Jr. and J. B. Cain, Error-Correction Coding for Digital Communications, Plenum Press, New York, 1981
2 S. Lin and D. J. Costello, Jr., Error Control Coding, Prentice-Hall, Englewood Cliffs, N. J., 1983
3 G. D. Forney, Jr., Concatenated codes, MIT Press, Cambridge, Mass., 1966
4 D. Chase, 'A class of algorithms for decoding block codes with channel measurement information,' IEEE Trans. Inform. Theory, Vol.IT-18, pp.170-182, Jan., 1972
5 C. M. Hacket, 'An efficient algorithm for decoding of the (23,12) extended Golay code,' IEEE Trans. Commun., vol. COM-29, pp.909-911, June, 1981
6 N. N. Tendolkar and C. R. P. Hartmann, 'Generalization of Chase algorithms for soft-decision decoding of binary linear codes,' IEEE Trans. Inform Theory, Vol.IT-30, pp.714-721, Sept., 1984
7 D. J. Taipale and M. B. Pursley, 'An improvement to generalized-minimum-distance decoding,' IEEE Trans. Inform Theory, Vol.IT-37, pp.167-172, Jan., 1991   DOI   ScienceOn
8 Y. G. Shim and C. W. Lee, 'Soft-decision decoding algorithm for binary linear block codes,' IEICE Trans. on Fundamentals of Electronics, Communications & Computer Sciences, Vol.E76-A, No.ll, pp.2016-2021, Nov., 1993
9 V. Ponnampalam, A. Grant and B. Vucetic, 'A Class of Soft Decoding Algorithms,' Proceedings of the 2001 IEEE International Symposium on Information Theory, pp. 258-258, June, 2001   DOI
10 H. Tokushige, K. Nakamaye, T. Koumoto, Y. S. Tang and T. Kasami, 'Selection of Search Centers in Iterative Soft-Decision Decoding Algorithms,' IEICE Trans, on Fundamentals of Electronics, Communications & Computer Sciences, Vol.E84-A, No.10, pp.2397-2403, Oct., 2001