Method and system for decoding

摘要

Low-Density Parity-Check (LDPC) codes offer error correction at rates approaching the link channel capacity and reliable and efficient information transfer over bandwidth or return-channel constrained links with data-corrupting noise present. LDPC codes also offer error correction performance approaching channel capacity exponentially fast in terms of the code length, linear processing complexity, and parallelism that scales with the code length. They also offer challenges relating to the decoding complexity of the binary error-correction codes themselves and error floors limiting achievable bit-error rates. A new Relaxed Half-Stochastic (RHS) decoding algorithm is presented that reduces decoding complexity for high decoding throughput applications. The RHS algorithm uses an approach based on stochastic decoding algorithms but differs significantly from the conventional approaches of LDPC decoder implementation. The RHS algorithm also leads to a randomized decoding technique called redecoding that addresses the error floor limitation.

主权项

1. A device comprising:
at least a generator of a plurality of generators, each generator receiving extrinsic input data relating to a different transmission channel and applying a process to the extrinsic input data to generate first output data, the first output data generated in dependence upon the extrinsic input data and at least a first probability calculation and a relaxation factor; a summation node connected to the plurality of generators to receive the plurality of first output data, receive a channel log-likelihood ratio, and generate summation result data; a uniform random number generator to generate a second output, the second output generated in dependence upon at least a second probability calculation; and a comparator generating a code in dependence upon the summation result data and the second output by comparing the summation result data with the second output.