Download the full-sized PDF of Design and Decoding LDPC Codes With Low ComplexityDownload the full-sized PDF


Download  |  Analytics

Export to: EndNote  |  Zotero  |  Mendeley


This file is in the following communities:

Faculty of Graduate Studies and Research


This file is not currently in any collections.

Design and Decoding LDPC Codes With Low Complexity Open Access


Other title
iterative decoding
universal codes
LDPC codes
Type of item
Degree grantor
University of Alberta
Author or creator
Zheng, Chao
Supervisor and department
Masoud Ardakani (Electrical and Computer Engineering)
Examining committee member and department
Ioanis Nikolaidis (Computing Science)
Vicky Zhao (Electrical and Computer Engineering)
Department of Electrical and Computer Engineering

Date accepted
Graduation date
Master of Science
Degree level
This thesis presents low complexity design and decoding schemes for low density parity check (LDPC) codes. First, we consider the iterative decoding of LDPC codes on multiple-input-multiple-output bit-interleaved coded modulation (MIMO-BICM) channels and two-way relay channels. More specifically, we study the log-likelihood ratio (LLR) calculation under MIMO-BICM channels when perfect channel information is known and LLR calculation for two-way relay channels when no channel information is known at the receiver. We propose the optimum piece-wise linear approximation in the sense of maximizing the achievable rate of the channel. Second, we introduce a novel “universal” LDPC code design method. We design universal LDPC codes based on our method and show that, compared to existing methods, a lager percentage of capacity is obtained. Then, we propose two conjectures about the extreme distributions under min-sum decoding based on numerical observations.
Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of these terms. The author reserves all other publication and other rights in association with the copyright in the thesis and, except as herein before provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.
Citation for previous publication

File Details

Date Uploaded
Date Modified
Audit Status
Audits have not yet been run on this file.
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 596403
Last modified: 2015:10:12 19:40:18-06:00
Filename: Zheng_Chao_Spring 2012.pdf
Original checksum: e16a0676939c8f96dd71962c3d5d64a2
Well formed: true
Valid: false
Status message: Invalid page tree node offset=1833
File title: final_theisis.dvi
Activity of users you follow
User Activity Date