Andrieu, C

Piechocki, RJ

Vithanage, CM

English

BCJR algorithm is an exact and efficient algorithm to compute the marginal posterior distributions of state variables and pairs of consecutive state variables of a trellis structure. Due to its overwhelming complexity, reduced complexity variations, such as the M-BCJR algorithm, have been developed. In this paper, we propose improvements upon the conventional M-BCJR algorithm based on modified active state selection criteria. We propose selecting the active states based on estimates of the fixed-lag smoothed distributions of the state variables. We also present Gaussian approximation techniques for the low-complexity estimation of these fixed-lag smoothed distributions. The improved performance over the M-BCJR algorithm is shown via computer simulations

Explore Bristol Research

A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain,” in

A generalized probabilistic data association detector for multiple antenna systems,”

Capacity of the multi antenna Gaussian channel,”

Concatenated decoding with a reducedsearch BCJR algorithm,”

Delayeddecision-feedback sequence estimation,”

Early detection and trellis splicing: Reduced-complexity iterative

F.D.NeeserandJ.L.Massey,“Propercomplexrandomprocesseswith applications to information theory,”

Factor graphs and the sum-product algorithm,”

Feynman-Kac Formulae. Genealogical and Interacting Particle Systems With Applications.

Instrumentable tree encoding of informationsources,”IEEETrans.Inf.Theory,vol.17,no.1,pp.118–119,Jan.

Limited search trellis decoding of convolutional codes,”IEEETrans.Inf.Theory,vol.35,no.9,pp.944–955,Sep.1989.

Minimum mean squared error equalization using a priori information,”

multi-carrier modulation using iterative based receiver for MIMO system,” presented at

Near-optimal multiuser detection in synchronous CDMA using probabilistic data association,”

Near-optimum soft decision equalization for frequency selective MIMO channels,”

Optimal decoding of linear codes for minimizing symbol error rate,”

Optimum soft-output detection for channels with intersymbol interference,”

Performance and design of a reduced complexity iterative equalizer for precoded ISI channels,”

Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference.

Reduced complexity equalization of MIMO systems with a ﬁxed-lag smoothed M-BCJR algorithm,” in

Reduced-complexity sequence estimation using state partitioning,”

Reduced-state BCJR-type algorithms,”

Reduced-state sequence estimation with set partitioning and decision feedback,”

Reduced-state soft-input/output algorithms for complexity reduction in iterative and non-iterative data detection,” in

Statistical detection for communication channels with intersymbol interference,”

The Viterbi algorithm,”

Novel reduced-state BCJR algorithms

https://research-information.bris.ac.uk/files/3007072/Vithanage_transComms_June2007.pdf

Novel reduced-state BCJR algorithms

Abstract

Similar works

Full text

Available Versions

Explore Bristol Research