Title :
Soft-decision decoding of binary linear block codes using reduced breadth-first search algorithms
Author :
Kokkonen, Mikko ; Kalliojärvi, Kari
Author_Institution :
Nokia Res. Center, Espoo, Finland
fDate :
6/1/2000 12:00:00 AM
Abstract :
The article discusses soft-decision decoding of binary linear block codes using the t-algorithm and its variants. New variants of the basic algorithm are presented that reduce the decoding complexity using a threshold adaptive to the signal-to-noise ratio and address the variable decoding complexity by either limiting the memory or using a generalized M-algorithm with a nonconstant state profile
Keywords :
binary codes; block codes; computational complexity; decoding; linear codes; search problems; adaptive threshold; binary linear block codes; decoding complexity reduction; generalized M-algorithm; memory size limitation; near-optimal error-rate performance; nonconstant state profile; reduced breadth-first search algorithms; signal-to-noise ratio; soft-decision decoding; t-algorithm; variable decoding complexity; AWGN; Block codes; Communications Society; Data communication; Limiting; Maximum likelihood decoding; Random variables; Signal to noise ratio; Tree graphs; Vectors;
Journal_Title :
Communications, IEEE Transactions on
