Abstract
In this paper, a novel relaying strategy that uses multiple-input multiple-output (MIMO) fixed relays with linear processing to support multiuser transmission in cellular networks is proposed. The fixed relay processes the received signal with linear operations and forwards the processed signal to multiple users creating a multiuser MIMO relay. This paper proposes upper and lower bounds on the achievable sum rate for this architecture assuming zero-forcing dirty paper coding at the base station, neglecting the direct links from the base station to the users, and with certain structure in the relay. These bounds are used to motivate an implementable multiuser precoding strategy that combines Tomlinson-Harashima precoding at the base station and linear signal processing at the relay, adaptive stream selection, and QAM modulation. Reduced complexity algorithms based on the sum rate lower bounds are used to select a subset of users. We compare the sum rates achieved by the proposed system architecture and algorithms with the sum rate upper bound and the sum rate achieved by the decode-and-forward relaying.
| Original language | English |
|---|---|
| Pages (from-to) | 727-738 |
| Number of pages | 12 |
| Journal | IEEE Transactions on Signal Processing |
| Volume | 56 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2008 Feb 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Signal Processing
- Electrical and Electronic Engineering
Cite this
}
MIMO relaying with linear processing for multiuser transmission in fixed relay networks. / Chae, Chan Byoung; Tang, Taiwen; Heath, Robert W.; Cho, Sunghyun.
In: IEEE Transactions on Signal Processing, Vol. 56, No. 2, 01.02.2008, p. 727-738.Research output: Contribution to journal › Article
TY - JOUR
T1 - MIMO relaying with linear processing for multiuser transmission in fixed relay networks
AU - Chae, Chan Byoung
AU - Tang, Taiwen
AU - Heath, Robert W.
AU - Cho, Sunghyun
PY - 2008/2/1
Y1 - 2008/2/1
N2 - In this paper, a novel relaying strategy that uses multiple-input multiple-output (MIMO) fixed relays with linear processing to support multiuser transmission in cellular networks is proposed. The fixed relay processes the received signal with linear operations and forwards the processed signal to multiple users creating a multiuser MIMO relay. This paper proposes upper and lower bounds on the achievable sum rate for this architecture assuming zero-forcing dirty paper coding at the base station, neglecting the direct links from the base station to the users, and with certain structure in the relay. These bounds are used to motivate an implementable multiuser precoding strategy that combines Tomlinson-Harashima precoding at the base station and linear signal processing at the relay, adaptive stream selection, and QAM modulation. Reduced complexity algorithms based on the sum rate lower bounds are used to select a subset of users. We compare the sum rates achieved by the proposed system architecture and algorithms with the sum rate upper bound and the sum rate achieved by the decode-and-forward relaying.
AB - In this paper, a novel relaying strategy that uses multiple-input multiple-output (MIMO) fixed relays with linear processing to support multiuser transmission in cellular networks is proposed. The fixed relay processes the received signal with linear operations and forwards the processed signal to multiple users creating a multiuser MIMO relay. This paper proposes upper and lower bounds on the achievable sum rate for this architecture assuming zero-forcing dirty paper coding at the base station, neglecting the direct links from the base station to the users, and with certain structure in the relay. These bounds are used to motivate an implementable multiuser precoding strategy that combines Tomlinson-Harashima precoding at the base station and linear signal processing at the relay, adaptive stream selection, and QAM modulation. Reduced complexity algorithms based on the sum rate lower bounds are used to select a subset of users. We compare the sum rates achieved by the proposed system architecture and algorithms with the sum rate upper bound and the sum rate achieved by the decode-and-forward relaying.
UR - http://www.scopus.com/inward/record.url?scp=39649100853&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=39649100853&partnerID=8YFLogxK
U2 - 10.1109/TSP.2007.907821
DO - 10.1109/TSP.2007.907821
M3 - Article
AN - SCOPUS:39649100853
VL - 56
SP - 727
EP - 738
JO - IEEE Transactions on Signal Processing
JF - IEEE Transactions on Signal Processing
SN - 1053-587X
IS - 2
ER -