Minimum bit-error rate design for space-time equalization-based multiuser detection
Minimum bit-error rate design for space-time equalization-based multiuser detection
A novel minimum bit-error rate (MBER) space–time equalization (STE)-based multiuser detector (MUD) is proposed for multiple-receive-antenna-assisted space-division multiple-access systems. It is shown that the MBER-STE-aided MUD significantly outperforms the standard minimum mean-square error design in terms of the achievable bit-error rate (BER). Adaptive implementations of the MBER STE are considered, and both the block-data-based and sample-by-sample adaptive MBER algorithms are proposed. The latter, referred to as the least BER (LBER) algorithm, is compared with the most popular adaptive algorithm, known as the least mean square (LMS) algorithm. It is shown that in case of binary phase-shift keying, the computational complexity of the LBER-STE is about half of that required by the classic LMS-STE. Simulation results demonstrate that the LBER algorithm performs consistently better than the classic LMS algorithm, both in terms of its convergence speed and steady-state BER performance. Index Terms—Adaptive algorithm, minimum bit-error rate (MBER), multiuser detection (MUD), space–time processing.
824-832
Chen, Sheng
9310a111-f79a-48b8-98c7-383ca93cbb80
Livingstone, A.
9899a7a8-8517-4b86-9d15-cd52d57efbfc
Hanzo, L.
66e7266f-3066-4fc0-8391-e000acce71a1
1 May 2006
Chen, Sheng
9310a111-f79a-48b8-98c7-383ca93cbb80
Livingstone, A.
9899a7a8-8517-4b86-9d15-cd52d57efbfc
Hanzo, L.
66e7266f-3066-4fc0-8391-e000acce71a1
Chen, Sheng, Livingstone, A. and Hanzo, L.
(2006)
Minimum bit-error rate design for space-time equalization-based multiuser detection.
IEEE Transactions on Communications, 54 (5), .
(doi:10.1109/TCOMM.2006.873999).
Abstract
A novel minimum bit-error rate (MBER) space–time equalization (STE)-based multiuser detector (MUD) is proposed for multiple-receive-antenna-assisted space-division multiple-access systems. It is shown that the MBER-STE-aided MUD significantly outperforms the standard minimum mean-square error design in terms of the achievable bit-error rate (BER). Adaptive implementations of the MBER STE are considered, and both the block-data-based and sample-by-sample adaptive MBER algorithms are proposed. The latter, referred to as the least BER (LBER) algorithm, is compared with the most popular adaptive algorithm, known as the least mean square (LMS) algorithm. It is shown that in case of binary phase-shift keying, the computational complexity of the LBER-STE is about half of that required by the classic LMS-STE. Simulation results demonstrate that the LBER algorithm performs consistently better than the classic LMS algorithm, both in terms of its convergence speed and steady-state BER performance. Index Terms—Adaptive algorithm, minimum bit-error rate (MBER), multiuser detection (MUD), space–time processing.
Text
01632096.pdf
- Other
Text
01632096
- Version of Record
Restricted to Repository staff only
Request a copy
More information
Published date: 1 May 2006
Organisations:
Southampton Wireless Group
Identifiers
Local EPrints ID: 262598
URI: http://eprints.soton.ac.uk/id/eprint/262598
PURE UUID: d4b9cc23-0511-460e-afc0-bc2c8ca4c0fb
Catalogue record
Date deposited: 16 May 2006
Last modified: 18 Mar 2024 02:33
Export record
Altmetrics
Contributors
Author:
Sheng Chen
Author:
A. Livingstone
Author:
L. Hanzo
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics