File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

이훈

Lee, Hoon
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Robust Beamforming Designs for Nonregenerative Multipair Two-Way Relaying Systems

Author(s)
Song, ChangickPark, HaewookLee, HoonLee, Inkyu
Issued Date
2016-09
DOI
10.1109/TVT.2015.2485498
URI
https://scholarworks.unist.ac.kr/handle/201301/65485
Fulltext
https://ieeexplore.ieee.org/document/7286848
Citation
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, v.65, no.9, pp.7802 - 7808
Abstract
In this paper, we consider nonregenerative multipair two-way relaying systems, where a relay node supports K pairs of two-way communications in the presence of imperfect channel state information (CSI). We employ a stochastic approach to model the channel uncertainties and study a robust beamforming design at the relay. It is shown that the proposed beamformer provides a reduction in the computational complexity, as well as good robustness against channel errors, compared with conventional designs. To reduce the estimation overhead at the users, we also suggest an efficient downlink training method to inform the users of the channel-dependent self-interference cancellation (SIC) parameters. With the training method, the additive noise may incur a malfunction of the SIC. To address this issue, we develop an intelligent selection criterion that decides whether the SIC should be adopted or not. Finally, from simulation results, we demonstrate the efficiency of our proposed schemes.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
ISSN
0018-9545
Keyword (Author)
Imperfect channel-state information (CSI)minimum mean squared error (MMSE) beamformingmulti-antennamultipair two-way relayself interference cancellation
Keyword
TRANSCEIVER DESIGNSEFFICIENT PROTOCOLSOUTAGE BEHAVIORMIMOCHANNELSOPTIMIZATIONDIVERSITY

qrcode

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