Novel reduced-state BCJR algorithms

CM Vithanage; C Andrieu; RJ Piechocki

doi:10.1109/TCOMM.2007.898830

Novel reduced-state BCJR algorithms

CM Vithanage, C Andrieu, RJ Piechocki

Research output: Contribution to journal › Article (Academic Journal) › peer-review

12 Citations (Scopus)

595 Downloads (Pure)

Abstract

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.

Translated title of the contribution	Novel Reduced-State BCJR Algorithms
Original language	English
Pages (from-to)	1144 - 1152
Number of pages	9
Journal	IEEE Transactions on Communications
Volume	55
Issue number	6
DOIs	https://doi.org/10.1109/TCOMM.2007.898830
Publication status	Published - Jun 2007

Bibliographical note

Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Rose publication type: Journal article

Sponsorship: This work was supported by Toshiba Research
Europe, Ltd., Bristol, U.K.

Terms of use: Copyright © 2007 IEEE. Reprinted from IEEE Transactions on Communications. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected].

By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Keywords

fading channels
state space methods
decoding
digital communication
multiple-input multiple-output (MIMO) systems
nonlinear detection
signal detection

Access to Document

10.1109/TCOMM.2007.898830

Vithanage transComms June2007Accepted author manuscript, 550 KB

Handle.net

Persistent link

Cite this

@article{7734e84a8f2c46e5b30b24539fcd71d6,

title = "Novel reduced-state BCJR algorithms",

abstract = "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.",

keywords = "fading channels, state space methods, decoding, digital communication, multiple-input multiple-output (MIMO) systems, nonlinear detection, signal detection",

author = "CM Vithanage and C Andrieu and RJ Piechocki",

note = "Publisher: Institute of Electrical and Electronics Engineers (IEEE) Rose publication type: Journal article Sponsorship: This work was supported by Toshiba Research Europe, Ltd., Bristol, U.K. Terms of use: Copyright {\textcopyright} 2007 IEEE. Reprinted from IEEE Transactions on Communications. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. ",

year = "2007",

month = jun,

doi = "10.1109/TCOMM.2007.898830",

language = "English",

volume = "55",

pages = "1144 -- 1152",

journal = "IEEE Transactions on Communications",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

number = "6",

}

TY - JOUR

T1 - Novel reduced-state BCJR algorithms

AU - Vithanage, CM

AU - Andrieu, C

AU - Piechocki, RJ

N1 - Publisher: Institute of Electrical and Electronics Engineers (IEEE) Rose publication type: Journal article Sponsorship: This work was supported by Toshiba Research Europe, Ltd., Bristol, U.K. Terms of use: Copyright © 2007 IEEE. Reprinted from IEEE Transactions on Communications. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

PY - 2007/6

Y1 - 2007/6

N2 - 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.

AB - 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.

KW - fading channels

KW - state space methods

KW - decoding

KW - digital communication

KW - multiple-input multiple-output (MIMO) systems

KW - nonlinear detection

KW - signal detection

U2 - 10.1109/TCOMM.2007.898830

DO - 10.1109/TCOMM.2007.898830

M3 - Article (Academic Journal)

VL - 55

SP - 1144

EP - 1152

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 6

ER -

Novel reduced-state BCJR algorithms

Abstract

Bibliographical note

Keywords

Access to Document

Handle.net

Fingerprint

Cite this