Title :
Low complexity maximum-likelihood decoding of product codes
Author :
Al-Askary, Ornar
Author_Institution :
Dept. of Electr. Eng., Linkpingsuniv., Linkping, Sweden
Abstract :
Many block codes can be represented as an intersection of two or more easily decoded codes. We present a new decoding algorithm for decoding product codes that utilizes this property. It will be shown that this algorithm is maximum-likelihood decoding. The complexity of the algorithm depends on the decoding complexity of the constituent codes and the quality of the channel
Keywords :
block codes; computational complexity; maximum likelihood decoding; algorithm complexity; channel quality; decoding algorithm; decoding complexity; low complexity maximum-likelihood decoding; product codes; Block codes; Euclidean distance; Hamming distance; Iterative decoding; Maximum likelihood decoding; Maximum likelihood estimation; Memoryless systems; Product codes;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866377
