Channel Coding for Telecommunications
Channel Coding for Telecommunications
Error Control Coding, Second Edition
Error Control Coding, Second Edition
An improved decoding algorithm for finite-geometry LDPC codes
IEEE Transactions on Communications
Unveiling turbo codes: some results on parallel concatenated coding schemes
IEEE Transactions on Information Theory
Iterative decoding of binary block and convolutional codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory - Part 1
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Low-density parity-check codes based on finite geometries: a rediscovery and new results
IEEE Transactions on Information Theory
On iterative soft-decision decoding of linear binary block codes and product codes
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In this letter, a low complexity decoding algorithm for binary linear block codes is applied to low-density parity-check (LDPC) codes and improvements are described, namely an extension to soft-decision decoding and a loop detection mechanism. For soft decoding, only one real-valued addition per code symbol is needed, while the remaining operations are only binary as in the hard decision case. The decoding performance is considerably increased by the loop detection. Simulation results are used to compare the performance with other known decoding strategies for LDPC codes, with the result that the presented algorithms offer excellent performances at smaller complexity.