Please use this identifier to cite or link to this item:
|Title:||Optimum training sequence design for multi-input multi-output (MIMO) two-way wireless relay networks||Authors:||Pham, T.-H.
|Issue Date:||2009||Citation:||Pham, T.-H.,Liang, Y.-C.,Nallanathan, A.,Krishna, G.H. (2009). Optimum training sequence design for multi-input multi-output (MIMO) two-way wireless relay networks. ICICS 2009 - Conference Proceedings of the 7th International Conference on Information, Communications and Signal Processing : -. ScholarBank@NUS Repository. https://doi.org/10.1109/ICICS.2009.5397702||Abstract:||In this paper, we consider a multi-input multi-output (MIMO) two-way wireless relay network in which two users, U1 and U2, exchange their information via a relay station, R. Single carrier cyclic prefix (SCCP) is used in the system to combat intersymbol interference (ISI) in frequency-selective fading channels. The transmission process is divided into two Phases. At Phase 1, both users send their information to R simultaneously. R then amplifies and transmits its received signals at Phase 2. We propose an algorithm to estimate the channel information at end users based on the least-square principle. To further minimize the mean square error (MSE) of the estimate, a method to design the optimal training sequences is also proposed. The proposed method does not estimate individual channels between each end user and R but incorporates them into composite channels. Simulation results show that the performance achieved by our optimal design is close to that with perfect channel information. © 2009 IEEE.||Source Title:||ICICS 2009 - Conference Proceedings of the 7th International Conference on Information, Communications and Signal Processing||URI:||http://scholarbank.nus.edu.sg/handle/10635/71333||ISBN:||9781424446575||DOI:||10.1109/ICICS.2009.5397702|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.