The University of Southampton
University of Southampton Institutional Repository

Minimum Bit-Error Rate Design for Space-Time Equalisation-Based Multiuser Detection

Minimum Bit-Error Rate Design for Space-Time Equalisation-Based Multiuser Detection
Minimum Bit-Error Rate Design for Space-Time Equalisation-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, S.
ac405529-3375-471a-8257-bda5c0d10e53
Livingstone, A.
9899a7a8-8517-4b86-9d15-cd52d57efbfc
Hanzo, L.
66e7266f-3066-4fc0-8391-e000acce71a1
Chen, S.
ac405529-3375-471a-8257-bda5c0d10e53
Livingstone, A.
9899a7a8-8517-4b86-9d15-cd52d57efbfc
Hanzo, L.
66e7266f-3066-4fc0-8391-e000acce71a1

Chen, S., Livingstone, A. and Hanzo, L. (2006) Minimum Bit-Error Rate Design for Space-Time Equalisation-Based Multiuser Detection. IEEE Transactions on Communications, 54 (5), 824-832.

Record type: Article

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.

PDF
01632096.pdf - Other
Download (690kB)

More information

Published date: May 2006
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 262598
URI: https://eprints.soton.ac.uk/id/eprint/262598
PURE UUID: d4b9cc23-0511-460e-afc0-bc2c8ca4c0fb
ORCID for L. Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 16 May 2006
Last modified: 06 Jun 2018 13:14

Export record

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×