Please use this identifier to cite or link to this item: https://doi.org/10.1109/ICC.2009.5199107
Title: Iterative receiver for multi-input multi-output (MIMO) two-way wireless relay systems
Authors: Pham, T.-H. 
Liang, Y.-C.
Nallanathan, A.
Krishna, G.H.
Issue Date: 2009
Citation: Pham, T.-H.,Liang, Y.-C.,Nallanathan, A.,Krishna, G.H. (2009). Iterative receiver for multi-input multi-output (MIMO) two-way wireless relay systems. IEEE International Conference on Communications : -. ScholarBank@NUS Repository. https://doi.org/10.1109/ICC.2009.5199107
Abstract: In this paper, we propose an iterative receiver for a multi-input multi-output (MIMO) two-way wireless relay system. The two-way relay system requires two time slots to accomplish one information exchange. Compared to the traditional one-way relay system, which demands four time slots to complete one information exchange, our system only uses half as many time slots. Our proposed iterative receiver consists of two loops. One is the minimum mean square error (MMSE)-based iterative soft interference cancelation (SIC) algorithm which is extended from the algorithm in [1] to cover correlated noise environment incurred from the nature of signalling. The other is the Expectation Conditional Maximization (ECM)-based estimation algorithm. The MMSE-SIC algorithm provides the soft information of the transmitted signals and this information is transferred to the ECM-based estimation algorithm to update the channel information. Simulation results show that the performance of the iterative receiver proposed here is close to that given by perfect channel information with small number of iterations. ©2009 IEEE.
Source Title: IEEE International Conference on Communications
URI: http://scholarbank.nus.edu.sg/handle/10635/70726
ISBN: 9781424434350
ISSN: 05361486
DOI: 10.1109/ICC.2009.5199107
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.