An extrinsic Kalman filter for iterative multiuser decoding

One powerful approach for multiuser decoding is to iterate between a linear multiuser filter (which ignores coding constraints) and individual decoders (which ignore multiple-access interference). Subject to clearly formulated statistical assumptions and the history of input signals provided by the...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 50; no. 4; pp. 642 - 648
Main Authors: Rasmussen, L.K., Grant, A.J., Alexander, P.D.
Format: Journal Article
Language:English
Published: New York IEEE 01.04.2004
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Additives
Analysis
Coding
Convergence
Correlation
Crosstalk
Cryptography
Decoders
Decoding
Estimation theory
Filters
Image quality
Interference
Iterative decoding
Iterative methods
Kalman filtering
Kalman filters
Mathematics
multiple access
Multiple access interference
multiuser detection
Multiuser systems
Optimized production technology
recursive filters
Statistics
ISSN:0018-9448, 1557-9654, 1557-9654
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:One powerful approach for multiuser decoding is to iterate between a linear multiuser filter (which ignores coding constraints) and individual decoders (which ignore multiple-access interference). Subject to clearly formulated statistical assumptions and the history of input signals provided by the outer decoders over all previous iterations, an extrinsic Kalman filter is suggested. This approach is motivated by the recent observation that decoder outputs are loosely correlated during initial iterations. Numerical results show that iterative decoding using this filter provides better performance in terms of the supportable load and convergence speed as compared to previously suggested linear-filter-based iterative decoders.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0018-9448
1557-9654
1557-9654
DOI:10.1109/TIT.2004.825031