- Design and Decoding LDPC Codes With Low Complexity
- Zheng, Chao
- Jan 30, 2012 4:00 PM
- Adobe PDF
- 596403 bytes
- 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.
- Master of Science
- Department of Electrical and Computer Engineering
- Spring 2012
- Masoud Ardakani (Electrical and Computer Engineering)
Vicky Zhao (Electrical and Computer Engineering)
Ioanis Nikolaidis (Computing Science)
Theses and Dissertations Spring 2009 to present
Department of Electrical and Computer Engineering
Delete your item from era
Do you really want to delete "Design and Decoding LDPC Codes With Low Complexity" ?
Resotre your item to era
Do you really want to restore "Design and Decoding LDPC Codes With Low Complexity" ?
Purge your item from era
Do you really want to permanently delete "Design and Decoding LDPC Codes With Low Complexity" ?
Remove your item from era
Do you really want to remove "Design and Decoding LDPC Codes With Low Complexity" ?