Please use this identifier to cite or link to this item:
Title: Design and performance analysis of MIMO space-time block coding systems over general fading channels
Authors: HE JUN
Keywords: Space-Time Block Codes, Performance Analysis, Code Design, Time-Selective Channels, Relay Channels, Non-identical Channels
Issue Date: 2-Jul-2009
Citation: HE JUN (2009-07-02). Design and performance analysis of MIMO space-time block coding systems over general fading channels. ScholarBank@NUS Repository.
Abstract: Space-time block coding (STBC) is a well known technology to exploit the spatial diversity. The existing work, however, are often based on ideal assumptions, which simplify the analysis and design of STBC, but reduce their generality. The purpose of this thesis is to relax some of these unrealistic assumptions, and study STBC in more general channel models. Three different kinds of fading channels, namely non-identical channels, time-selective channels and relay channels, are considered. Using these channels models, ML decoder structure is investigated, optimum decoder and new Symbol-by-Symbol decoder are proposed. Exact bit error probability (BEP), simple BEP bounds and approximations are derived. The different effects of non-identical channel statistics on the performance are examined, and the optimum power allocation scheme is introduced. We also reveal the relationship between the inter-symbol interference and the row positions in the code matrix, so that one proposition and two design criteria are proposed for the optimum code design over time-selective channel. For STBC over relay channels, adaptive cooperative transmission schemes are proposed and analyzed, and the energy efficiencies of these adaptive schemes are discussed as well.
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
Thesis_JunHe_Final.pdf622.56 kBAdobe PDF



Page view(s)

checked on Nov 17, 2018


checked on Nov 17, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.