A parallel MAP algorithm for low latency turbo decoding
Seokhyun Yoon
Bar-Ness, Y.
Center for Commun. & Signal Process. Res., New Jersey Inst. of Technol., Newark, NJ;
This paper appears in: Communications Letters, IEEE
Publication Date: Jul 2002
Volume: 6,
Issue: 7
On page(s): 288-290
ISSN: 1089-7798
References Cited: 8
CODEN: ICLEF6
INSPEC Accession Number: 7338432
Digital Object Identifier: 10.1109/LCOMM.2002.801310
Current Version Published: 2002-08-07
Abstract
To reduce the computational decoding delay of turbo codes, we
propose a parallel algorithm for maximum a posteriori (MAP) decoders. We
divide a whole noisy codeword into sub-blocks and use multiple
processors to perform sub-block MAP decoding in parallel. Unlike the
previously proposed approach with sub-block overlapping, we utilize the
forward and backward variables computed in the previous iteration to
provide boundary distributions for each sub-block MAP decoder. Our
scheme depicts asymptotically optimal performance in the sense that the
BER is the same as that of the regular turbo decoder
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
