Adaptive joint detection and decoding in flat-fading channels via mixture kaiman filtering

188Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A novel adaptive Bayesian receiver for signal detection and decoding in fading channels with known channel statistics is developed; it is based on the sequential Monte Carlo methodology that recently emerged in the field of statistics. The basic idea is to treat the transmitted signals as "missing data" and to sequentially impute multiple samples of them based on the observed signals. The imputed signal sequences, together with their importance weights, provide a way to approximate the Bayesian estimate of the transmitted signals and the channel states. Adaptive receiver algorithms for both uncoded and convolutionally coded systems are developed. The proposed techniques can easily handle the nonGaussian ambient channel noise. It is shown through simulations that the proposed sequential Monte Carlo receivers achieve nearbound performance in fading channels for both uncoded and coded systems, without the use of any training/pilot symbols or decision feedback. Moreover, the proposed receiver structure exhibits massive parallelism and is ideally suited for high-speed parallel implementation using the very large scale integration (VLSI) systolic array technology. © 2000 IEEE.

Cite

CITATION STYLE

APA

Chen, R., Wang, X., & Liu, J. S. (2000). Adaptive joint detection and decoding in flat-fading channels via mixture kaiman filtering. IEEE Transactions on Information Theory, 46(6), 2079–2094. https://doi.org/10.1109/18.868479

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free