文件名称:New-Iterative-Decoding-Algorithms-for-Low-Density
介绍说明－－下载内容均来自于网络，请自行研究使用
Low-Density Parity-Check (LDPC) codes have gained lots of popularity due to their
capacity achieving/approaching property. This work studies the iterative decoding
also known as message-passing algorithms applied to LDPC codes. Belief propagation
(BP) algorithm and its approximations, most notably min-sum (MS), are popular
iterative decoding algorithms used for LDPC and turbo codes. The thesis is divided
in two parts. In the rst part, a low-complexity binary message-passing algorithm
derived the dynamic of analog decoders is presented and thoroughly studied.
In the second part, a modi cation for improving the performance of BP and MS
algorithms is proposed. It uses adaptive normalization of variable node message-Low-Density Parity-Check (LDPC) codes have gained lots of popularity due to their
capacity achieving/approaching property. This work studies the iterative decoding
also known as message-passing algorithms applied to LDPC codes. Belief propagation
(BP) algorithm and its approximations, most notably min-sum (MS), are popular
iterative decoding algorithms used for LDPC and turbo codes. The thesis is divided
in two parts. In the rst part, a low-complexity binary message-passing algorithm
derived the dynamic of analog decoders is presented and thoroughly studied.
In the second part, a modi cation for improving the performance of BP and MS
algorithms is proposed. It uses adaptive normalization of variable node message
capacity achieving/approaching property. This work studies the iterative decoding
also known as message-passing algorithms applied to LDPC codes. Belief propagation
(BP) algorithm and its approximations, most notably min-sum (MS), are popular
iterative decoding algorithms used for LDPC and turbo codes. The thesis is divided
in two parts. In the rst part, a low-complexity binary message-passing algorithm
derived the dynamic of analog decoders is presented and thoroughly studied.
In the second part, a modi cation for improving the performance of BP and MS
algorithms is proposed. It uses adaptive normalization of variable node message-Low-Density Parity-Check (LDPC) codes have gained lots of popularity due to their
capacity achieving/approaching property. This work studies the iterative decoding
also known as message-passing algorithms applied to LDPC codes. Belief propagation
(BP) algorithm and its approximations, most notably min-sum (MS), are popular
iterative decoding algorithms used for LDPC and turbo codes. The thesis is divided
in two parts. In the rst part, a low-complexity binary message-passing algorithm
derived the dynamic of analog decoders is presented and thoroughly studied.
In the second part, a modi cation for improving the performance of BP and MS
algorithms is proposed. It uses adaptive normalization of variable node message
(系统自动生成,下载前可以参看下载内容)
下载文件列表
New Iterative Decoding Algorithms for Low-Density Parity-Check.pdf