The University of Southampton
University of Southampton Institutional Repository

EXIT Chart Analysis of Low-Complexity Bayesian Turbo Multiuser Detection for Rank-Deficient Multiple Antenna Aided OFDM

EXIT Chart Analysis of Low-Complexity Bayesian Turbo Multiuser Detection for Rank-Deficient Multiple Antenna Aided OFDM
EXIT Chart Analysis of Low-Complexity Bayesian Turbo Multiuser Detection for Rank-Deficient Multiple Antenna Aided OFDM
This paper studies the mutual information transfer characteristics of a novel low-complexity Bayesian Multiuser Detector (MUD) proposed for employment in Space Division Multiple Access (SDMA) aided Orthogonal Frequency Division Multiplexing (OFDM) systems. The design of the Bayesian MUD advocated is based on extending the optimum single-user Bayesian design to multiuser OFDM signals modeled by a Gaussian mixture, rather than by a single Gaussian distribution, when characterizing the conditional PDF of the received signal. In order to reduce the complexity of the Bayesian MUD, we introduce an a priori information threshold and then discard the lowprobability terms during the calculation of the extrinisic information generated . The achievable complexity reduction as a function of different threhold values is analyzed and the best tradeoff values are derived with the aid of simulation. Both non-systematic and recursive systematic convolutional codes are used for exchanging extrinsic information with the MUD for the sake of achieving a turbo-detection aided iteration gain. The convergence behavior of the proposed low-complexity Bayesian turbo MUD is investigated using EXtrinsic Information Transfer (EXIT) chart analysis and compared to that of Soft Interference Cancellation aided Minimum Mean Square Error (SIC-MMSE) MUD schemes. As expected, the simulation results show that the proposed low-complexity Bayesian Turbo MUD outperforms the SIC-MMSE MUDs. A substantial benefit of the proposed MUD is that it is potentially capable of supporting up to three times higher number of users than the number of receiver antennas. In this challenging multiuser scenario, the resultant channelmatrix becomes rank-deficient, resulting in a linearly non-separable detector output phasor constellation, when classic linear receivers tend to exhibit a poor performance.
576-580
Xu, L.
5802ae7f-4a22-4308-a6d8-8d8ae171553d
Chen, S.
ac405529-3375-471a-8257-bda5c0d10e53
Hanzo, L.
66e7266f-3066-4fc0-8391-e000acce71a1
Xu, L.
5802ae7f-4a22-4308-a6d8-8d8ae171553d
Chen, S.
ac405529-3375-471a-8257-bda5c0d10e53
Hanzo, L.
66e7266f-3066-4fc0-8391-e000acce71a1

Xu, L., Chen, S. and Hanzo, L. (2007) EXIT Chart Analysis of Low-Complexity Bayesian Turbo Multiuser Detection for Rank-Deficient Multiple Antenna Aided OFDM. IEEE VTC'07 (Fall), United States. 30 Sep - 03 Oct 2007. pp. 576-580 .

Record type: Conference or Workshop Item (Paper)

Abstract

This paper studies the mutual information transfer characteristics of a novel low-complexity Bayesian Multiuser Detector (MUD) proposed for employment in Space Division Multiple Access (SDMA) aided Orthogonal Frequency Division Multiplexing (OFDM) systems. The design of the Bayesian MUD advocated is based on extending the optimum single-user Bayesian design to multiuser OFDM signals modeled by a Gaussian mixture, rather than by a single Gaussian distribution, when characterizing the conditional PDF of the received signal. In order to reduce the complexity of the Bayesian MUD, we introduce an a priori information threshold and then discard the lowprobability terms during the calculation of the extrinisic information generated . The achievable complexity reduction as a function of different threhold values is analyzed and the best tradeoff values are derived with the aid of simulation. Both non-systematic and recursive systematic convolutional codes are used for exchanging extrinsic information with the MUD for the sake of achieving a turbo-detection aided iteration gain. The convergence behavior of the proposed low-complexity Bayesian turbo MUD is investigated using EXtrinsic Information Transfer (EXIT) chart analysis and compared to that of Soft Interference Cancellation aided Minimum Mean Square Error (SIC-MMSE) MUD schemes. As expected, the simulation results show that the proposed low-complexity Bayesian Turbo MUD outperforms the SIC-MMSE MUDs. A substantial benefit of the proposed MUD is that it is potentially capable of supporting up to three times higher number of users than the number of receiver antennas. In this challenging multiuser scenario, the resultant channelmatrix becomes rank-deficient, resulting in a linearly non-separable detector output phasor constellation, when classic linear receivers tend to exhibit a poor performance.

Text
vtc07f-02-08-04.pdf - Other
Download (232kB)

More information

Published date: September 2007
Additional Information: Event Dates: 30 September-3 October 2007
Venue - Dates: IEEE VTC'07 (Fall), United States, 2007-09-30 - 2007-10-03
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 264657
URI: http://eprints.soton.ac.uk/id/eprint/264657
PURE UUID: 001f05eb-6c88-4552-be76-475e1d33b252
ORCID for L. Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 08 Oct 2007
Last modified: 20 Jul 2019 01:26

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 http://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.

×