Iterative Receiver Techniques for Data-Driven Channel Estimation and Interference Mitigation in Wireless Communications
Creators: name: Zhao, Ming
Publisher: name: The Australian National University
Year: 2009
Subjects: Iterative, Channel Estimation, Interferece Mitigation, Data-Driven

description: Wireless mobile communications were initially a way for people to communicate through low data rate voice call connections. As data enabled devices allow users the ability to do much more with their mobile devices, so to will the demand for more reliable and pervasive wireless data. This is being addressed by so-called 4th generation wireless systems based on orthogonal frequency division multiplexing (OFDM) and multiple-input multiple-output (MIMO) antenna systems. Mobile wireless customers are becoming more demanding and expecting to have a great user experience over high speed broadband access at any time and anywhere, both indoor and outdoor. However, these promising improvements cannot be realized without an e±cient design of the receiver. Recently, receivers utilizing iterative detection and decoding have changed the fundamental receiver design paradigm from traditional separated parameter estimation and data detection blocks to an integrated iterative parameter estimator and data detection unit. Motivated by this iterative data driven approach, we develop low complexity iterative receivers with improved sensitivity compared to the conventional receivers, this brings potential benefits for the wireless communication system, such as improving the overall system throughput, increasing the macro cell coverage, and reducing the cost of the equipments in both the base station and mobile terminal. It is a challenge to design receivers that have good performance in a highly dynamic mobile wireless environment. One of the challenges is to minimize overhead reference signal energy (preamble, pilot symbols) without compromising the performance. We investigate this problem, and develop an iterative receiver with enhanced data-driven channel estimation. We discuss practical realizations of the iterative receiver for SISO-OFDM system. We utilize the channel estimation from soft decoded data (the a priori information) through frequency-domain combining and time-domain combining strategies in parallel with limited pilot signals. We analyze the performance and complexity of the iterative receiver, and show that the receiver's sensitivity can be improved even with this low complexity solution. Hence, seamless communications can be achieved with better macro cell coverage and mobility without compromising the overall system performance. Another challenge is that a massive amount of interference caused by MIMO transmission (spatial multiplexing MIMO) reduces the performance of the channel estimation, and further degrades data detection performance. We extend the iterative channel estimation from SISO systems to MIMO systems, and work with linear detection methods to perform joint interference mitigation and channel estimation. We further show the robustness of the iterative receivers in both indoor and outdoor environment compared to the conventional receiver approach. Finally, we develop low complexity iterative spatial multiplexed MIMO receivers for nonlinear methods based on two known techniques, that is, the Sphere Decoder (SD) method and the Markov Chain Monte Carlo (MCMC) method. These methods have superior performance, however, they typically demand a substantial increase in computational complexity, which is not favorable in practical realizations. We investigate and show for the first time how to utilize the a priori information in these methods to achieve performance enhancement while simultaneously substantially reducing the computational complexity. In our modified sphere decoder method, we introduce a new accumulated a priori metric in the tree node enumeration process. We show how we can improve the performance by obtaining the reliable tree node candidate from the joint Maximum Likelihood (ML) metric and an approximated a priori metric. We also show how we can improve the convergence speed of the sphere decoder (i.e., reduce the com- plexity) by selecting the node with the highest a priori probability as the starting node in the enumeration process. In our modified MCMC method, the a priori information is utilized for the firrst time to qualify the reliably decoded bits from the entire signal space. Two new robust MCMC methods are developed to deal with the unreliable bits by using the reliably decoded bit information to cancel the interference that they generate. We show through complexity analysis and performance comparison that these new techniques have improved performance compared to the conventional approaches, and further complexity reduction can be obtained with the assistance of the a priori information. Therefore, the complexity and performance tradeoff of these nonlinear methods can be optimized for practical realizations.