An Information Theoretic Study on Linear Dispersion Codes and Low -Density Parity -Check Codes
Jiang, Yibo
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/80926
Description
Title
An Information Theoretic Study on Linear Dispersion Codes and Low -Density Parity -Check Codes
Author(s)
Jiang, Yibo
Issue Date
2005
Doctoral Committee Chair(s)
Singer, Andrew C.
Ralf Koetter
Department of Study
Electrical Engineering
Discipline
Electrical Engineering
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Electronics and Electrical
Language
eng
Abstract
In this dissertation, we focus on an information theoretic study of linear dispersion (LD) codes and low-density parity-check (LDPC) codes. For bit-linear LD codes, we find necessary and sufficient conditions on the dispersion matrices for the a posteriori distribution of the information bit vector to be a product distribution. We also study the design of dispersion matrices to maximize the mutual information between the information bits and the output of a multiple-antenna channel. We derive several bounds on mutual information, and based on the bounds, we propose design guidelines for dispersion matrices. We design two sets of dispersion matrices based on a random search technique. In order to obtain rigorous bounds on the mutual information trajectory of the belief propagation decoding of LDPC codes, we study the extremal problems of moments and information combining. Among all binary-input symmetric-output channels with a fixed mutual information value, the binary symmetric channel (BSC) and the binary erasure channel (BEC) are the extremal channel distributions for an optimization problem related to the second conditional moment of the channel soft-bit. The properties of moments are used to solve the original information combining problem. In order to obtain a better prediction of the convergence behavior of the belief propagation decoding of LDPC codes, we extend the information combining problem at the check nodes by adding a constraint on the second conditional moment of the channel soft-bit. This problem is also solved from a moments approach. The solution to the extension problem can be used to derive potentially better performance bounds on mutual information, provided that another optimization problem be solved.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
