Massachusetts Institute of Technology
Iterative detection for overloaded OFDMA with spatial diversity
Abstract
dc:description.abstractOrthogonal Frequency Division Multiple Access (OFDMA) systems have built-in mechanisms to mitigate the effects of the wireless multipath channel but are limited in system capacity to available bandwidth. This shortcoming can be worked around through the process of "overloading," where users are additionally multiplexed in the spatial domain to each frequency resource. To efficiently resolve non-orthogonally multiplexed users within the system, sophisticated multiple antenna receivers with multiuser detection methods are necessary. The focus of this thesis will be the formulation of an iterative multiple antenna receiver framework for overloaded uplink OFDMA systems. Specifically, we formulate optimal MAP and reduced complexity MMSE symbol detection algorithms for the multiuser detection and single user decoding turbo loop. We verify the performance of each algorithm through Monte Carlo simulation with randomly generated multipath MIMO channels. From the results we determine the tradeoffs of algorithm complexity with performance and the effect of channel correlation on the supportable user load. Our MMSE algorithm with soft interference cancellation is observed to closely approach single user performance in low to moderately correlated MIMO channels after turbo loop iteration. Additionally, we observe that increasing the number of antennas relative to the number of overloaded users can mitigate the effects of moderate correlation to provide acceptable error performance.
Degree
thesis:*- Department dc:contributor.department
- Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
- Grantor dc:publisher
- Massachusetts Institute of Technology
- Year dc:date.issued
- 2006
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Baik, Eugene
- Advisor dc:contributor.advisor
-
- Moe Z Win.
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
- Licence dc:rights.uri
- Language dc:language.iso
- eng
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/1721.1/41254
- OAI identifier oai:identifier
- oai:dspace.mit.edu:1721.1/41254