Abstract
In this letter, we propose an efficient algorithm which reduces the complexity of conventional vector perturbation schemes by searching the real and imaginary components of a perturbation vector individually. To minimize a performance loss induced from the decoupled joint search, we apply diagonal precoding at the transmitter whose parameters are iteratively optimized to maximize the chordal distance between subspaces spanned by the real and imaginary components. We also propose a simple non-iterative method with a slight performance loss which can achieve a significant complexity reduction compared to the conventional vector perturbation schemes.
| Original language | English |
|---|---|
| Article number | 5751188 |
| Pages (from-to) | 1697-1701 |
| Number of pages | 5 |
| Journal | IEEE Transactions on Wireless Communications |
| Volume | 10 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - 2011 |
Fingerprint
Keywords
- Multiuser downlink
- vector perturbation
ASJC Scopus subject areas
- Computer Science Applications
- Applied Mathematics
- Electrical and Electronic Engineering
Cite this
A decoupling approach for low-complexity vector perturbation in multiuser downlink systems. / Park, Seok Hwan; Han, Hyeon Seung; Lee, Sunho; Lee, Inkyu.
In: IEEE Transactions on Wireless Communications, Vol. 10, No. 6, 5751188, 2011, p. 1697-1701.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - A decoupling approach for low-complexity vector perturbation in multiuser downlink systems
AU - Park, Seok Hwan
AU - Han, Hyeon Seung
AU - Lee, Sunho
AU - Lee, Inkyu
PY - 2011
Y1 - 2011
N2 - In this letter, we propose an efficient algorithm which reduces the complexity of conventional vector perturbation schemes by searching the real and imaginary components of a perturbation vector individually. To minimize a performance loss induced from the decoupled joint search, we apply diagonal precoding at the transmitter whose parameters are iteratively optimized to maximize the chordal distance between subspaces spanned by the real and imaginary components. We also propose a simple non-iterative method with a slight performance loss which can achieve a significant complexity reduction compared to the conventional vector perturbation schemes.
AB - In this letter, we propose an efficient algorithm which reduces the complexity of conventional vector perturbation schemes by searching the real and imaginary components of a perturbation vector individually. To minimize a performance loss induced from the decoupled joint search, we apply diagonal precoding at the transmitter whose parameters are iteratively optimized to maximize the chordal distance between subspaces spanned by the real and imaginary components. We also propose a simple non-iterative method with a slight performance loss which can achieve a significant complexity reduction compared to the conventional vector perturbation schemes.
KW - Multiuser downlink
KW - vector perturbation
UR - http://www.scopus.com/inward/record.url?scp=85027916962&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85027916962&partnerID=8YFLogxK
U2 - 10.1109/TWC.2011.040411.101024
DO - 10.1109/TWC.2011.040411.101024
M3 - Article
VL - 10
SP - 1697
EP - 1701
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
SN - 1536-1276
IS - 6
M1 - 5751188
ER -