Reduced complexity equalization of MIMO systems with a fixed-lag smoothed M-BCJR algorithm

CM Vithanage; C Andrieu; RJ Piechocki

doi:10.1109/SPAWC.2005.1505887

Reduced complexity equalization of MIMO systems with a fixed-lag smoothed M-BCJR algorithm

CM Vithanage, C Andrieu, RJ Piechocki

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

10 Citations (Scopus)

369 Downloads (Pure)

Abstract

M-BCJR algorithm is a reduced state version of the BCJR algorithm and selects a set of active states in the forward recursion based on an estimation of the filtered probability distribution of states at each time. We propose to use instead an estimation of the fixed-lag smoothed probability distribution of states with a non zero lag. Our implementation uses a Gaussian approximation to estimate these distributions with a low complexity, using the principle of probabilistic data association (PDA). The performance of the M-BCJR can be seen to be greatly improved as a result while remaining robust against changes in the channel multipath profile

Translated title of the contribution	Reduced complexity equalization of MIMO systems with a fixed-lag smoothed M-BCJR algorithm
Original language	English
Title of host publication	Workshop on Signal Processing Advances in Wireless Communications, New York, United States
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	136 - 140
ISBN (Print)	0780388674
DOIs	https://doi.org/10.1109/SPAWC.2005.1505887
Publication status	Published - Jun 2005
Event	6th Workshop on Signal Processing Advances in Wireless Communications - New York, United States Duration: 1 Jun 2005 → …

Conference

Conference	6th Workshop on Signal Processing Advances in Wireless Communications
Country/Territory	United States
City	New York
Period	1/06/05 → …

Bibliographical note

Conference Proceedings/Title of Journal: IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005
Rose publication type: Conference contribution

Sponsorship: The authors would like to thank Toshiba Research Europe Limited, Bristol, U.K. for financially supporting this work

Terms of use: Copyright © 2005 IEEE. Reprinted from Proceedings of IEEE Workshop on Signal Processing Advances in Wireless Communications, 2005. 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

BCJR algorithm
M algorithm
probabilistic data association
MIMO equalization

Access to Document

10.1109/SPAWC.2005.1505887

Vithanage IEEE SPAWC 2005Accepted author manuscript, 882 KB

http://hdl.handle.net/1983/869

Handle.net

Persistent link

Cite this

@inproceedings{29c3871ba6a74c1781b5fd424ad7d343,

title = "Reduced complexity equalization of MIMO systems with a fixed-lag smoothed M-BCJR algorithm",

abstract = "M-BCJR algorithm is a reduced state version of the BCJR algorithm and selects a set of active states in the forward recursion based on an estimation of the filtered probability distribution of states at each time. We propose to use instead an estimation of the fixed-lag smoothed probability distribution of states with a non zero lag. Our implementation uses a Gaussian approximation to estimate these distributions with a low complexity, using the principle of probabilistic data association (PDA). The performance of the M-BCJR can be seen to be greatly improved as a result while remaining robust against changes in the channel multipath profile",

keywords = "BCJR algorithm, M algorithm, probabilistic data association, MIMO equalization",

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

note = "Conference Proceedings/Title of Journal: IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005 Rose publication type: Conference contribution Sponsorship: The authors would like to thank Toshiba Research Europe Limited, Bristol, U.K. for financially supporting this work Terms of use: Copyright {\textcopyright} 2005 IEEE. Reprinted from Proceedings of IEEE Workshop on Signal Processing Advances in Wireless Communications, 2005. 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. ; 6th Workshop on Signal Processing Advances in Wireless Communications ; Conference date: 01-06-2005",

year = "2005",

month = jun,

doi = "10.1109/SPAWC.2005.1505887",

language = "English",

isbn = "0780388674",

pages = "136 -- 140",

booktitle = "Workshop on Signal Processing Advances in Wireless Communications, New York, United States",

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

address = "United States",

}

Vithanage, CM, Andrieu, C & Piechocki, RJ 2005, Reduced complexity equalization of MIMO systems with a fixed-lag smoothed M-BCJR algorithm. in Workshop on Signal Processing Advances in Wireless Communications, New York, United States. Institute of Electrical and Electronics Engineers (IEEE), pp. 136 - 140, 6th Workshop on Signal Processing Advances in Wireless Communications, New York, United States, 1/06/05. https://doi.org/10.1109/SPAWC.2005.1505887

Reduced complexity equalization of MIMO systems with a fixed-lag smoothed M-BCJR algorithm. / Vithanage, CM; Andrieu, C ; Piechocki, RJ.
Workshop on Signal Processing Advances in Wireless Communications, New York, United States. Institute of Electrical and Electronics Engineers (IEEE), 2005. p. 136 - 140.

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

TY - GEN

T1 - Reduced complexity equalization of MIMO systems with a fixed-lag smoothed M-BCJR algorithm

AU - Vithanage, CM

AU - Andrieu, C

AU - Piechocki, RJ

N1 - Conference Proceedings/Title of Journal: IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005 Rose publication type: Conference contribution Sponsorship: The authors would like to thank Toshiba Research Europe Limited, Bristol, U.K. for financially supporting this work Terms of use: Copyright © 2005 IEEE. Reprinted from Proceedings of IEEE Workshop on Signal Processing Advances in Wireless Communications, 2005. 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 - 2005/6

Y1 - 2005/6

N2 - M-BCJR algorithm is a reduced state version of the BCJR algorithm and selects a set of active states in the forward recursion based on an estimation of the filtered probability distribution of states at each time. We propose to use instead an estimation of the fixed-lag smoothed probability distribution of states with a non zero lag. Our implementation uses a Gaussian approximation to estimate these distributions with a low complexity, using the principle of probabilistic data association (PDA). The performance of the M-BCJR can be seen to be greatly improved as a result while remaining robust against changes in the channel multipath profile

AB - M-BCJR algorithm is a reduced state version of the BCJR algorithm and selects a set of active states in the forward recursion based on an estimation of the filtered probability distribution of states at each time. We propose to use instead an estimation of the fixed-lag smoothed probability distribution of states with a non zero lag. Our implementation uses a Gaussian approximation to estimate these distributions with a low complexity, using the principle of probabilistic data association (PDA). The performance of the M-BCJR can be seen to be greatly improved as a result while remaining robust against changes in the channel multipath profile

KW - BCJR algorithm

KW - M algorithm

KW - probabilistic data association

KW - MIMO equalization

U2 - 10.1109/SPAWC.2005.1505887

DO - 10.1109/SPAWC.2005.1505887

M3 - Conference Contribution (Conference Proceeding)

SN - 0780388674

SP - 136

EP - 140

BT - Workshop on Signal Processing Advances in Wireless Communications, New York, United States

PB - Institute of Electrical and Electronics Engineers (IEEE)

T2 - 6th Workshop on Signal Processing Advances in Wireless Communications

Y2 - 1 June 2005

ER -

Reduced complexity equalization of MIMO systems with a fixed-lag smoothed M-BCJR algorithm

Abstract

Conference

Bibliographical note

Keywords

Access to Document

Handle.net

Fingerprint

Cite this