Coding assisted blind MIMO equalization and decoding
Xu Zhao,Michael Davies +1 more
- 24 Aug 2009
- pp 2401-2405
TL;DR: This work exploits the iterative channel estimation and decoding performance for blind MIMO equalization to improve blind multiple input multiple output (MIMO) channel estimates.
read more
Abstract: Despite the widespread use of forward-error coding (FEC), most MIMO blind channel estimation techniques ignore its presence, and instead make the simplifying assumption that the transmitted symbols are uncoded. However, FEC induces code structure in the transmitted sequence that can be exploited to improve blind multiple input multiple output (MIMO) channel estimates. In this work we exploit the iterative channel estimation and decoding performance for blind MIMO equalization. Experiments show the attractive improvements by exploiting the existence of coding structures.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas
TL;DR: This paper addresses digital communication in a Rayleigh fading environment when the channel characteristic is unknown at the transmitter but is known (tracked) at the receiver with the aim of leveraging the already highly developed 1-D codec technology.
7.2K
•Journal Article
Optimal decoding of linear codes for minimizing symbol error rate
TL;DR: The general problem of estimating the a posteriori probabilities of the states and transitions of Markov source observed through a discrete memoryless channel is considered.
6.8K
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
TL;DR: The general problem of estimating the a posteriori probabilities of the states and transitions of a Markov source observed through a discrete memoryless channel is considered and an optimal decoding algorithm is derived.
5.1K
On the convergence properties of the em algorithm
TL;DR: In this paper, the EM algorithm converges to a local maximum or a stationary value of the (incomplete-data) likelihood function under conditions that are applicable to many practical situations.