DocumentCode
66205
Title
Design of Generalized Analog Network Coding for a Multiple-Access Relay Channel
Author
Sha Wei ; Jun Li ; Wen Chen ; Lizhong Zheng ; Hang Su
Author_Institution
Dept. of Electron. Eng., Shanghai Jiaotong Univ., Shanghai, China
Volume
63
Issue
1
fYear
2015
fDate
Jan. 2015
Firstpage
170
Lastpage
185
Abstract
In this paper, we propose a generalized analog network coding (GANC) scheme for a non-orthogonal multiple-access relay channel (MARC), where two sources transmit their information simultaneously to the destination with the help of a relay. In the GANC scheme, the relay receives interfered signals from the two sources and generates signals to be transmitted with a relay function. We focus on the design of the optimal relay function to achieve the minimum pair-wise error probability (PEP) of the system. Specifically, we first covert the relay function optimization problem to a transformation matrix (TM) design problem by presenting the received complex signals as signal matrices composed of real and imaginary parts. Then, we propose an optimization criteria, i.e., maximizing the minimal squared Euclidean distance (MMSED), to improve the PEP performance, since the PEP is determined by the Euclidean distance of the received constellation at destination. Next, we prove that the MMSED can be equivalently converted to a convex problem by introducing an intermediate matrix. We solve this convex problem by using the Lagrangian method and obtain the closed-form expression of the optimal TM. We further improve the PEP performance by optimizing transmission power of the two sources. Simulation results show that the proposed GANC scheme has a better PEP performance compared to other alternative schemes.
Keywords
channel coding; convex programming; cooperative communication; error statistics; multi-access systems; network coding; telecommunication channels; Euclidean distance; GANC; MMSED; PEP performance; cooperative communication; generalized analog network coding; intermediate matrix; maximizing the minimal squared Euclidean distance; multiple-access relay channel; nonorthogonal multiple-access relay channel; optimal relay function; optimization criteria; pair-wise error probability; relay function optimization; transformation matrix; Euclidean distance; Matrix converters; Modulation; Network coding; Optimization; Relays; Vectors; Euclidean distance; Relay function; error probability; multiple access relay channel; relay function;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOMM.2014.2376954
Filename
6971155
Link To Document