skip to main content
Primo Search

Performance of iterative detection and decoding for MIMO-BICM systems

Yang, Tao, Electrical Engineering & Telecommunications, Faculty of Engineering, UNSW

2006

  • Title:
    Performance of iterative detection and decoding for MIMO-BICM systems
  • Author/Creator: Yang, Tao, Electrical Engineering & Telecommunications, Faculty of Engineering, UNSW
  • Subjects: MIMO systems; Signal processing; Iterative methods (Mathematics); Coding theory
  • Resource type: Thesis
  • Type of thesis: Masters
  • Date: 2006
  • Description: Multiple-input multiple-output (MIMO) wireless technology is an emerging cost-effective approach to offer multiple-fold capacity improvement relative to the conventional single-antenna systems. To achieve the capacities of MIMO channels, MIMO bit-interleaved-coded-modulation (BICM) systems with iterative detection and decoding (IDD) are studied in this thesis. The research for this dissertation is conducted based on the iterative receivers with convolutional codes and turbo codes. A variety of MIMO detectors, such as a maximum a posteriori probability (MAP) detector, a list sphere detector (LSD) and a parallel interference canceller (PIC) together with a decision statistic combiner (DSC), are studied. The performance of these iterative receivers is investigated via bounding techniques or Monte-Carlos simulations. Moreover, the computational complexities of the components are quantified and compared. The convergence behaviors of the iterative receivers are analyzed via variance transfer (VTR) functions and variance exchange graphs (VEGs). The analysis of convergence behavior facilitates the finding of components with good matching. For a fast fading channel, we show that the "waterfall region" of an iterative receiver can be predicted by VEG. For a slow fading channel, it is shown that the performance of an iterative receiver is essentially limited by the early interception ratio (ECR) which is obtained via simulations. After the transfer properties of the detectors are unveiled, a detection switching (DSW) methodology is proposed and the switching criterion based on cross entropy (CE) is derived. By employing DSW, the performance of an iterative receiver with a list sphere detector (LSD) of a small list size is considerably improved. It is shown that the iterative receiver achieves a performance very close to that with a maximum a posteriori probability (MAP) detector but with a significantly reduced complexity. For an iterative receiver with more than two components, various iteration schedules are explored. The schedules are applied in an iterative receiver with PIC-DSC. It is shown that the iterative receiver with a periodic scheduling outperforms that with the conventional scheduling at the same level of complexity.
  • Language: English
  • Rights: http://unsworks.unsw.edu.au/copyright; http://unsworks.unsw.edu.au/copyright

Searching Remote Databases, Please Wait