Abstract
In this paper, we investigate a multiple input multiple output (MIMO) multiuser relay channel, where a source with multiple antennas sends data to multiple users via a relay with multiple antennas. The relay applies linear processing to the received signal and forwards the processed signal to multiple users. In our system model, the direct links from the source to the users are neglected. We propose algorithms to compute achievable sum rates of this system based on dirty paper coding. An achievable sum rate defines a sum rate that can be achieved in the MIMO multiuser relay channel with zero error probability for any user, hence it is also a lower bound of the capacity of this channel. These algorithms also produce coefficients of the precoder at the source node and the coefficients of the linear processing unit at the relay. Simulations show that the proposed system architecture and algorithms achieve sum rate performance that is close to the derived performance upper bound.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006 |
| Pages | 1026-1030 |
| Number of pages | 5 |
| DOIs | |
| Publication status | Published - 2006 Dec 1 |
| Event | 2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, WA, United States Duration: 2006 Jul 9 → 2006 Jul 14 |
Publication series
| Name | IEEE International Symposium on Information Theory - Proceedings |
|---|---|
| ISSN (Print) | 2157-8101 |
Other
| Other | 2006 IEEE International Symposium on Information Theory, ISIT 2006 |
|---|---|
| Country | United States |
| City | Seattle, WA |
| Period | 06/7/9 → 06/7/14 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Modelling and Simulation
- Applied Mathematics
Cite this
}
On achievable sum rates of a multiuser MIMO relay channel. / Tang, Taiwen; Chae, Chan-Byoung; Heath, Robert W.; Cho, Sunghyun.
Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006. 2006. p. 1026-1030 4036120 (IEEE International Symposium on Information Theory - Proceedings).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - On achievable sum rates of a multiuser MIMO relay channel
AU - Tang, Taiwen
AU - Chae, Chan-Byoung
AU - Heath, Robert W.
AU - Cho, Sunghyun
PY - 2006/12/1
Y1 - 2006/12/1
N2 - In this paper, we investigate a multiple input multiple output (MIMO) multiuser relay channel, where a source with multiple antennas sends data to multiple users via a relay with multiple antennas. The relay applies linear processing to the received signal and forwards the processed signal to multiple users. In our system model, the direct links from the source to the users are neglected. We propose algorithms to compute achievable sum rates of this system based on dirty paper coding. An achievable sum rate defines a sum rate that can be achieved in the MIMO multiuser relay channel with zero error probability for any user, hence it is also a lower bound of the capacity of this channel. These algorithms also produce coefficients of the precoder at the source node and the coefficients of the linear processing unit at the relay. Simulations show that the proposed system architecture and algorithms achieve sum rate performance that is close to the derived performance upper bound.
AB - In this paper, we investigate a multiple input multiple output (MIMO) multiuser relay channel, where a source with multiple antennas sends data to multiple users via a relay with multiple antennas. The relay applies linear processing to the received signal and forwards the processed signal to multiple users. In our system model, the direct links from the source to the users are neglected. We propose algorithms to compute achievable sum rates of this system based on dirty paper coding. An achievable sum rate defines a sum rate that can be achieved in the MIMO multiuser relay channel with zero error probability for any user, hence it is also a lower bound of the capacity of this channel. These algorithms also produce coefficients of the precoder at the source node and the coefficients of the linear processing unit at the relay. Simulations show that the proposed system architecture and algorithms achieve sum rate performance that is close to the derived performance upper bound.
UR - http://www.scopus.com/inward/record.url?scp=39049153896&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=39049153896&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2006.261883
DO - 10.1109/ISIT.2006.261883
M3 - Conference contribution
AN - SCOPUS:39049153896
SN - 1424405041
SN - 9781424405046
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1026
EP - 1030
BT - Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
ER -