Reduced-complexity iterative multiuser detection

In this thesis, we consider iterative multiuser detection for coded code-division multipleaccess (CDMA) systems. In contrast to most previous work that considers convolutionally coded systems, we propose iterative receivers for turbo coded and serially concatenated convolutionally coded (SCCC) syste...

Full description

Saved in:
Bibliographic Details
Main Author: Qin, Zhiliang
Other Authors: Teh, Kah Chan
Format: Theses and Dissertations
Published: 2008
Subjects:
Online Access:http://hdl.handle.net/10356/3155
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
id sg-ntu-dr.10356-3155
record_format dspace
spelling sg-ntu-dr.10356-31552023-07-04T15:18:31Z Reduced-complexity iterative multiuser detection Qin, Zhiliang Teh, Kah Chan School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems In this thesis, we consider iterative multiuser detection for coded code-division multipleaccess (CDMA) systems. In contrast to most previous work that considers convolutionally coded systems, we propose iterative receivers for turbo coded and serially concatenated convolutionally coded (SCCC) systems. The proposed receiver consists of a full-complexity a posteriori probability (APP) multiuser detector and a bank of iterative channel decoders, which are tightly combined at each iteration. Simulation results show that near-single-user performance can be achieved at the expense of exponentially growing computational complexity with the number of users. To reduce the computational complexity of multiuser detection, we then focus on developing reduced search soft-input soft-output (SISO) multiuser detectors for synchronous coded systems. Based on the snapshot property of synchronous CDMA channels, the proposed multiuser detector limits APP multiuser detection to certain neighbors of tentative hard estimates fed back from channel decoders. As a further simplification of reduced-search multiuser detection, an iterative interference cancellation (IC) scheme is also investigated. Extensive simulation results are presented and semi-analysis is also conducted. It is shown that the proposed multiuser receiver can provide reasonable and adjustable computational complexity. Following that, we develop reduced-state SISO multiuser detectors over an asynchronous coded CDMA channel based on a channel trellis simplification approach. Tentative soft/hard information is used to select survivor states in the channel trellis. Compared with the full-complexity iterative receiver or single-user performance, the proposed receiver has small performance degradation and can provide an excellent performance/complexity tradeoff. Doctor of Philosophy (EEE) 2008-09-17T09:23:27Z 2008-09-17T09:23:27Z 2003 2003 Thesis http://hdl.handle.net/10356/3155 Nanyang Technological University application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
topic DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems
spellingShingle DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems
Qin, Zhiliang
Reduced-complexity iterative multiuser detection
description In this thesis, we consider iterative multiuser detection for coded code-division multipleaccess (CDMA) systems. In contrast to most previous work that considers convolutionally coded systems, we propose iterative receivers for turbo coded and serially concatenated convolutionally coded (SCCC) systems. The proposed receiver consists of a full-complexity a posteriori probability (APP) multiuser detector and a bank of iterative channel decoders, which are tightly combined at each iteration. Simulation results show that near-single-user performance can be achieved at the expense of exponentially growing computational complexity with the number of users. To reduce the computational complexity of multiuser detection, we then focus on developing reduced search soft-input soft-output (SISO) multiuser detectors for synchronous coded systems. Based on the snapshot property of synchronous CDMA channels, the proposed multiuser detector limits APP multiuser detection to certain neighbors of tentative hard estimates fed back from channel decoders. As a further simplification of reduced-search multiuser detection, an iterative interference cancellation (IC) scheme is also investigated. Extensive simulation results are presented and semi-analysis is also conducted. It is shown that the proposed multiuser receiver can provide reasonable and adjustable computational complexity. Following that, we develop reduced-state SISO multiuser detectors over an asynchronous coded CDMA channel based on a channel trellis simplification approach. Tentative soft/hard information is used to select survivor states in the channel trellis. Compared with the full-complexity iterative receiver or single-user performance, the proposed receiver has small performance degradation and can provide an excellent performance/complexity tradeoff.
author2 Teh, Kah Chan
author_facet Teh, Kah Chan
Qin, Zhiliang
format Theses and Dissertations
author Qin, Zhiliang
author_sort Qin, Zhiliang
title Reduced-complexity iterative multiuser detection
title_short Reduced-complexity iterative multiuser detection
title_full Reduced-complexity iterative multiuser detection
title_fullStr Reduced-complexity iterative multiuser detection
title_full_unstemmed Reduced-complexity iterative multiuser detection
title_sort reduced-complexity iterative multiuser detection
publishDate 2008
url http://hdl.handle.net/10356/3155
_version_ 1772827577206964224