A decoupling approach for low-complexity vector perturbation in multiuser downlink systems

Seok Hwan Park, Hyeon Seung Han, Sunho Lee, Inkyu Lee

Research output: Contribution to journalArticle

19 Citations (Scopus)

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 languageEnglish
Article number5751188
Pages (from-to)1697-1701
Number of pages5
JournalIEEE Transactions on Wireless Communications
Volume10
Issue number6
DOIs
Publication statusPublished - 2011

Fingerprint

Decoupling
Low Complexity
Perturbation
Precoding
Transmitter
Transmitters
Efficient Algorithms
Maximise
Subspace
Minimise

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 journalArticle

@article{235280054a684dff9619d388b7b8f5ce,
title = "A decoupling approach for low-complexity vector perturbation in multiuser downlink systems",
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.",
keywords = "Multiuser downlink, vector perturbation",
author = "Park, {Seok Hwan} and Han, {Hyeon Seung} and Sunho Lee and Inkyu Lee",
year = "2011",
doi = "10.1109/TWC.2011.040411.101024",
language = "English",
volume = "10",
pages = "1697--1701",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

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

AN - SCOPUS:85027916962

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 -