Concatenated decoding with a reduced-search BCJR algorithm

Franz, V

doi:10.1109/49.661107

Return

Concatenated decoding with a reduced-search BCJR algorithm

1998-01-01

141

PRE

Franz, V

John B. Anderson

DOI：10.1109/49.661107

Original

Original request for help

Save

Abstract

En 中文

We apply two reduced-computation variants of the BCJR algorithm to the decoding of serial and parallel cancatenated convolutional codes, One computes its recursions at only M states per trellis stage; one computes only at states with values above a threshold, The threshold scheme is much more efficient, and it greatly reduces the computation of the BCJR algorithm, By computing only when the channel demands it, the threshold scheme reduces the turbo decoder computation to one-four nodes per trellis stage after the second iteration.

Keywords:

complexity reduction

concatenated coding

decoders

error correction

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.