DocumentCode :
2942979
Title :
Soft-decision decoding of binary linear block codes based on an iterative search algorithm
Author :
Moorthy, Hari T. ; Lin, Shu ; Kasami, Tadao
Author_Institution :
Dept. of Electr. Eng., Hawaii Univ., Honolulu, HI, USA
fYear :
1995
fDate :
17-22 Sep 1995
Firstpage :
474
Abstract :
This paper presents a suboptimum soft-decision decoding scheme for binary linear block codes based on an iterative search algorithm using a purged trellis diagram. The scheme achieves near optimum error performance with a significant reduction in computational complexity
Keywords :
maximum likelihood decoding; BCH code; Golay code; binary linear block codes; computational complexity; iterative search algorithm; maximum likelihood decoding; near optimum error performance; purged trellis diagram; suboptimum soft-decision decoding; Bit error rate; Block codes; Hamming distance; Iterative algorithms; Iterative decoding; Sufficient conditions; Test pattern generators; Testing; Upper bound; Viterbi algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location :
Whistler, BC
Print_ISBN :
0-7803-2453-6
Type :
conf
DOI :
10.1109/ISIT.1995.550461
Filename :
550461
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2942979
بازگشت