Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/35724
Title: Transceiver Design with Iterative Decoding of Capacity-Approaching codes over Fading channels
Authors: YUAN HAIFENG
Keywords: low-density parity-check codes, turbo codes, fading channels, iterative decoding, channel estimation, pilot-symbol-assisted modulation
Issue Date: 24-Aug-2012
Source: YUAN HAIFENG (2012-08-24). Transceiver Design with Iterative Decoding of Capacity-Approaching codes over Fading channels. ScholarBank@NUS Repository.
Abstract: Firstly, we consider LDPC and turbo coded transmissions with pilot-symbol-assisted (PSA) channel estimation over time correlated Rayleigh channels with known statistics. The correct conceptual approach is presented for deriving the LLR metric, which is shown to outperform the conventional metric in both error performance and convergence speed. Our work demonstrates the importance of incorporating the knowledge of channel estimation accuracy into iterative decoding processes. We also propose a joint maximum-likelihood detector based on soft-output Viterbi algorithm for LDPC coded transmissions over block-wise static fading channels with unknown fading statistics. Computer simulations show that the proposed detector has substantially better error performance than the conventional system with PSA channel estimation. Finally, a doubly multistage decoder (DMD) is proposed for LDPC codes over integer residue rings. Two variants of the DMD are considered and shown to achieve significant coding gains over standard BP decoding, with remarkably lower computational complexity.
URI: http://scholarbank.nus.edu.sg/handle/10635/35724
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
YuanHF.pdf1.01 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

292
checked on Dec 11, 2017

Download(s)

305
checked on Dec 11, 2017

Google ScholarTM

Check


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