Box-constrained multiuser detection based on multiplication-free coordinate descent optimisation

Y V Zakharov; T C Tozer

Box-constrained multiuser detection based on multiplication-free coordinate descent optimisation

Electronic Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Multiuser detection can often be described as a constrained quadratic optimisation problem. Many iterative techniques are available to solve this problem; however, due to high complexity they cannot be effectively implemented in real-time. We propose a novel iterative technique, the DCD (Dichotomous Coordinate Descent) algorithm which guarantees convergence in the box-constrained quadratic optimisation problem. We investigate application of the DCD algorithm to multiuser detection and show that it provides a high detection performance and complexity lower than other known box-constrained multiuser detectors. Moreover, the proposed algorithm is multiplication-free and division-free; this makes it attractive for real-time implementation in hardware (FPGA, ASIC) or fixed point (DSP) software.

Original language	English
Title of host publication	2004 IEEE 5TH WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS
Place of Publication	NEW YORK
Publisher	IEEE
Pages	483-486
Number of pages	4
ISBN (Print)	0-7803-8337-0
Publication status	Published - 2004
Event	5th IEEE Workshop on Signal Processing Advances in Wireless Communications - Lisbon Duration: 11 Jul 2004 → 14 Jul 2004

Conference

Conference	5th IEEE Workshop on Signal Processing Advances in Wireless Communications
City	Lisbon
Period	11/07/04 → 14/07/04

Keywords

MULTIPLE-ACCESS CHANNELS

Cite this

@inproceedings{6b61702f04ca4078b5d8a7b1605d0f84,

title = "Box-constrained multiuser detection based on multiplication-free coordinate descent optimisation",

abstract = "Multiuser detection can often be described as a constrained quadratic optimisation problem. Many iterative techniques are available to solve this problem; however, due to high complexity they cannot be effectively implemented in real-time. We propose a novel iterative technique, the DCD (Dichotomous Coordinate Descent) algorithm which guarantees convergence in the box-constrained quadratic optimisation problem. We investigate application of the DCD algorithm to multiuser detection and show that it provides a high detection performance and complexity lower than other known box-constrained multiuser detectors. Moreover, the proposed algorithm is multiplication-free and division-free; this makes it attractive for real-time implementation in hardware (FPGA, ASIC) or fixed point (DSP) software.",

keywords = "MULTIPLE-ACCESS CHANNELS",

author = "Zakharov, {Y V} and Tozer, {T C}",

year = "2004",

language = "English",

isbn = "0-7803-8337-0",

pages = "483--486",

booktitle = "2004 IEEE 5TH WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS",

publisher = "IEEE",

address = "United States",

note = "5th IEEE Workshop on Signal Processing Advances in Wireless Communications ; Conference date: 11-07-2004 Through 14-07-2004",

}

TY - GEN

T1 - Box-constrained multiuser detection based on multiplication-free coordinate descent optimisation

AU - Zakharov, Y V

AU - Tozer, T C

PY - 2004

Y1 - 2004

N2 - Multiuser detection can often be described as a constrained quadratic optimisation problem. Many iterative techniques are available to solve this problem; however, due to high complexity they cannot be effectively implemented in real-time. We propose a novel iterative technique, the DCD (Dichotomous Coordinate Descent) algorithm which guarantees convergence in the box-constrained quadratic optimisation problem. We investigate application of the DCD algorithm to multiuser detection and show that it provides a high detection performance and complexity lower than other known box-constrained multiuser detectors. Moreover, the proposed algorithm is multiplication-free and division-free; this makes it attractive for real-time implementation in hardware (FPGA, ASIC) or fixed point (DSP) software.

AB - Multiuser detection can often be described as a constrained quadratic optimisation problem. Many iterative techniques are available to solve this problem; however, due to high complexity they cannot be effectively implemented in real-time. We propose a novel iterative technique, the DCD (Dichotomous Coordinate Descent) algorithm which guarantees convergence in the box-constrained quadratic optimisation problem. We investigate application of the DCD algorithm to multiuser detection and show that it provides a high detection performance and complexity lower than other known box-constrained multiuser detectors. Moreover, the proposed algorithm is multiplication-free and division-free; this makes it attractive for real-time implementation in hardware (FPGA, ASIC) or fixed point (DSP) software.

KW - MULTIPLE-ACCESS CHANNELS

M3 - Conference contribution

SN - 0-7803-8337-0

SP - 483

EP - 486

BT - 2004 IEEE 5TH WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS

PB - IEEE

CY - NEW YORK

T2 - 5th IEEE Workshop on Signal Processing Advances in Wireless Communications

Y2 - 11 July 2004 through 14 July 2004

ER -