Title :
New SISO decoding algorithms
Author :
Tan, Jun ; Stüber, Gordon L.
Author_Institution :
Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
fDate :
6/1/2003 12:00:00 AM
Abstract :
A new maximum a posteriori (MAP)-equivalent soft-input soft-output (SISO) algorithm is derived together with its simplified versions. The proposed SISO algorithms provide a good compromise between complexity and performance. Our simplest SISO algorithm has lower complexity than the log-MAP, the max-log-MAP, and the soft-output Viterbi (1998) algorithm SISO algorithms, and it is an equivalent max-log-MAP algorithm. When this algorithm is used, turbo codes with block length as short as 150 bits will outperform convolutional codes when compared on the basis of equal decoder complexity.
Keywords :
Viterbi decoding; convolutional codes; error statistics; maximum likelihood decoding; turbo codes; BER performance; MAP-equivalent SISO algorithm; SISO algorithms; SISO decoding algorithms; bit-error rate performance; block length; complexity; convolutional codes; decoder complexity; log-MAP algorithm; max-log-MAP algorithm; maximum a posteriori SISO algorithm; soft-output Viterbi algorithm; turbo codes; Binary codes; Convolutional codes; Industrial relations; Iterative algorithms; Iterative decoding; Partitioning algorithms; Probability; Table lookup; Turbo codes; Viterbi algorithm;
Journal_Title :
Communications, IEEE Transactions on
DOI :
10.1109/TCOMM.2003.813263
