Open Access. Powered by Scholars. Published by Universities.®
Electrical and Computer Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Electrical and Computer Engineering
Finite Tree-Based Decoding Of Low-Density Parity-Check Codes, Eric T. Psota
Finite Tree-Based Decoding Of Low-Density Parity-Check Codes, Eric T. Psota
Department of Electrical and Computer Engineering: Dissertations, Theses, and Student Research
Low-density parity-check codes are commonly decoded using iterative message-passing decoders, such as the min-sum and sum-product decoders. Computer simulations demonstrate that these suboptimal decoders are capable of achieving low probability of bit error at signal-to-noise ratios close to capacity. However, current methods for analyzing the behavior of the min-sum and sum-product decoders fails to produce usable bounds on the probability of bit error. Thus, the resulting probability of bit error when using these decoders remains largely unknown for signal-to-noise ratios beyond the reach of simulation. For this reason, it is worth considering alternative methods for decoding low-density parity-check codes. New …