A parallel MAP algorithm for low latency turbo decoding

Document Type

Article

Publication Date

7-1-2002

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.

Identifier

0036648368 (Scopus)

Publication Title

IEEE Communications Letters

External Full Text Location

https://doi.org/10.1109/LCOMM.2002.801310

ISSN

10897798

First Page

288

Last Page

290

Issue

7

Volume

6

Grant

CCR-0085846

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS