Search Results for author:
Found 4 papers, 0 papers with code
Reconstruction-Computation-Quantization (RCQ): A Paradigm for Low Bit Width LDPC Decoding
RCQ facilitates dynamic non-uniform quantization to achieve good frame error rate (FER) performance with very low message precision.
A Reconstruction-Computation-Quantization (RCQ) Approach to Node Operations in LDPC Decoding
In contrast, the proposed RCQ decoder may be applied to any off-the-shelf LDPC code, including those with a large fraction of degree-2 variable nodes. Our simulations show that a 4-bit Min-Sum RCQ decoder delivers frame error rate (FER) performance around 0. 1dB of full-precision belief propagation (BP) for the IEEE 802. 11 standard LDPC code in the low SNR region. The RCQ decoder actually outperforms full-precision BP in the high SNR region because it overcomes elementary trapping sets that create an error floor under BP decoding.
Decoding of Non-Binary LDPC Codes Using the Information Bottleneck Method
Recently, a novel lookup table based decoding method for binary low-density parity-check codes has attracted considerable attention.
Bounds on the Error Probability of Raptor Codes under Maximum Likelihood Decoding
The latter construction resembles the one employed by RaptorQ codes, which at the time of writing this article represents the state of the art in fountain codes.
Information Theory Information Theory
