Please use this identifier to cite or link to this item:
|Title:||Optimal training sequence design for bi-directional relay networks||Authors:||Pham, T.-H.
|Issue Date:||2008||Citation:||Pham, T.-H., Liang, Y.-C., Nallanathan, A. (2008). Optimal training sequence design for bi-directional relay networks. GLOBECOM - IEEE Global Telecommunications Conference : 3675-3679. ScholarBank@NUS Repository. https://doi.org/10.1109/GLOCOM.2008.ECP.706||Abstract:||In this paper, the problem of training sequence design in a bi-directional relay network is investigated. The two nodes Tx1 and Tx2 communicate with each other via a relay (RL). The RL receives the signals that are transmitted simultaneously from both nodes and then broadcasts the superposition back to the two nodes. By doing so, bi-directional relaying reduces half the channel resources required by the conventional relaying. In frequency-selective fading channels, single carrier cyclic prefic (SCCP) is efficient in combatting intersymbol interference (ISI). Hence, in this paper, SCCP is deployed in the transmission from the two nodes and the RL as well. We are interested in the channel estimation problem in this scenario. We propose a design of training sequences from two nodes to minimize the mean square error (MSE) of the channel estimation according to zero forcing (ZF) criterion. We do not separate the links between each node to RL but corporate them into composite channel. Simulation results show that our design performance suffers only 1dB loss in terms of bitor-rate (BER) as compared to the case with perfect channel information case. © 2008 IEEE.||Source Title:||GLOBECOM - IEEE Global Telecommunications Conference||URI:||http://scholarbank.nus.edu.sg/handle/10635/71309||ISBN:||9781424423248||DOI:||10.1109/GLOCOM.2008.ECP.706|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 17, 2019
checked on May 14, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.