Concatenated decoding with a reduced-search BCJR algorithm

Authors:
V. Franz;J. B. Anderson
Affiliations:
Siemens AG, Munich;-
Venue:
IEEE Journal on Selected Areas in Communications
Year:
2006

Citing 0
Cited 5

Soft-in soft-output detection in the presence of parametric uncertainty via the Bayesian EM algorithm

EURASIP Journal on Wireless Communications and Networking - Special issue on advanced signal processing algorithms for wireless communications
Successive interference cancellation in multistream faster-than-Nyquist Signaling

Proceedings of the 2006 international conference on Wireless communications and mobile computing
Hard- and soft-output trellis-based conflict resolution for bidirectional decision feedback equalization

IEEE Transactions on Wireless Communications
A new framework for soft decision equalization in frequency selective MIMO channels

IEEE Transactions on Communications
Markov chain monte carlo detectors for channels with intersymbol interference

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.08

Visualization

Abstract

We apply two reduced-computation variants of the BCJR algorithm to the decoding of serial and parallel concatenated 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