IEEE Transactions on Signal Processing · 2013 · 39 citations · 29 references
EngineeringCommunicationElectrical EngineeringAntennasInformation TheoryWireless CommunicationsAntenna ParametersBeamformingMimo AntennasWireless Channel ModelingMimoMimo SystemsMultiple-input Multiple-output CommunicationRelay ChannelUpper Bound Computation
We study the degrees of freedom (DOF) of a multiple-input multiple-output (MIMO) two-way X relay channel, where there are two groups of source nodes and one relay node, each equipped with multiple antennas, and each of the two source nodes in one group exchanges independent messages with the two source nodes in the other group via the relay node. It is assumed that every source node is equipped with <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</i> antennas while the relay is equipped with <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i> antennas. We first show that the upper bound on the total DOF for this network is 2min{2 <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</i> , <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i> } and then focus on the case of <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i> ≤ 2 <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</i> so that the DOF is upper bounded by twice the number of antennas at the relay. By applying signal alignment for network coding and joint transceiver design for interference cancellation, we show that this upper bound can be achieved when <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i> ≤ [8 <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</i> /5]. We also show that with signal alignment only but no joint transceiver design, the upper bound is achievable when <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i> ≤ [4 <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</i> /3]. Simulation results are provided to corroborate the theoretical results and to demonstrate the performance of the proposed scheme in the finite signal-to-noise ratio regime.
29
Rudolf Ahlswede, Ning Cai, Shuo Li et al. · IEEE Transactions on Information Theory · 2000 · 7.9K citations
Capacity theorems for the relay channel
Thomas M. Cover, Abbas El Gamal · IEEE Transactions on Information Theory · 1979 · 4.2K citations
Linear algebra and its applications
Mathematics and Computers in Simulation · 1989 · 2K citations