Greedy Detection

Authors:
Amina Alrustamani;Branimir Vojcic;Andrej Stefanov
Affiliations:
Dubai Internet City, Dubai, P.O. Box: 73000, UAE;Department of Electrical & Computer Engineering, The George Washington University, Washington DC 20052, USA;Telecommunications Research Center, Department of Electrical Engineering, Arizona State Unversity, Tempe, AZ 85287-7206, USA
Venue:
Journal of VLSI Signal Processing Systems
Year:
2002

Citing 20
Cited 0

Minimum probability of error for asynchronous Gaussian multiple-access channels

IEEE Transactions on Information Theory
A solvable case of quadratic 0-1 programming

Discrete Applied Mathematics
Experiments in quadratic 0-1 programming

Mathematical Programming: Series A and B
Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture

Annals of Operations Research
Computational aspects of a branch and bound algorithm for quadratic zero-one programming

Computing
Construction of test problems in quadratic bivalent programming

ACM Transactions on Mathematical Software (TOMS)
An improved branch and bound algorithm for mixed integer nonlinear programs

Computers and Operations Research
Multiuser Detection

Multiuser Detection
Introductory Combinatorics

Introductory Combinatorics
Topics in Parellel Computing in Mathematical Programming

Topics in Parellel Computing in Mathematical Programming
Combinatorial Algorithms

Combinatorial Algorithms
On Limits of Wireless Communications in a Fading Environment when UsingMultiple Antennas

Wireless Personal Communications: An International Journal
Low complexity optimal joint detection for oversaturated multipleaccess communications

IEEE Transactions on Signal Processing
Parallel group detection for synchronous CDMA communication over frequency-selective Rayleigh fading channels

IEEE Transactions on Information Theory
Bit-interleaved coded modulation

IEEE Transactions on Information Theory
Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading

IEEE Transactions on Information Theory
Limiting performance of block-fading channels with multiple antennas

IEEE Transactions on Information Theory
Group detection for synchronous Gaussian code-division multiple-access channels

IEEE Transactions on Information Theory
Trellis-coded modulation with bit interleaving and iterative decoding

IEEE Journal on Selected Areas in Communications
Turbo-coded modulation for systems with transmit and receive antenna diversity over block fading channels: system model, decoding approaches, and practical considerations

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a new greedy algorithm developed for communication systems characterized with multiple simultaneous data transmission. Specifically, we consider code-division multiple-access (CDMA) systems and systems employing space-time coding (STC). The optimum detection in such systems has an exponential complexity and cannot be used in practical systems. We show that performance close to the optimum performance yet with significantly lower complexity can be achieved by the proposed algorithm. Also, we show that its performance is significantly better than that of most of the existing sub-optimum schemes for a wide range of operating conditions.