Please use this identifier to cite or link to this item: https://doi.org/10.1109/TWC.2012.060212111755
Title: Blind detection with unique identification in two-way relay channel
Authors: Li, L.
Ding, Y.
Zhang, J.-K.
Zhang, R. 
Keywords: blind detection
generalized likelihood ratio test
least square error
Two-way relay
unique identification
Issue Date: 2012
Source: Li, L., Ding, Y., Zhang, J.-K., Zhang, R. (2012). Blind detection with unique identification in two-way relay channel. IEEE Transactions on Wireless Communications 11 (7) : 2640-2648. ScholarBank@NUS Repository. https://doi.org/10.1109/TWC.2012.060212111755
Abstract: This paper considers the blind detection for a two-way relay system in which two source nodes exchange information via a relay node by amplify-and-forward relaying. An efficient transmission scheme is first proposed to achieve unique identifications of both the transmitted symbols and channel coefficients at a noise-free receiver using the M-ary phase shift keying modulation. Blind receivers based on the generalized likelihood ratio test are then derived for both the reciprocal and nonreciprocal channels with additive Gaussian noise. The least square error-based receiver is also studied for the case without prior knowledge of the noise power for detection. Moreover, constellation selection algorithms are proposed to achieve a uniform transmission bit rate for the ease of implementation. Finally, numerical results are provided to validate the proposed schemes. © 2012 IEEE.
Source Title: IEEE Transactions on Wireless Communications
URI: http://scholarbank.nus.edu.sg/handle/10635/82017
ISSN: 15361276
DOI: 10.1109/TWC.2012.060212111755
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

31
checked on Feb 13, 2018

WEB OF SCIENCETM
Citations

27
checked on Feb 19, 2018

Page view(s)

16
checked on Feb 18, 2018

Google ScholarTM

Check

Altmetric


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