Efficient quantization algorithm for low-density parity-check code decoding
From MaRDI portal
Publication:3500767
Recommendations
- A low complexity LDPC decoder with a modified sum-product algorithm
- Min-sum decoding algorithm of LDPC codes based on integer quantification
- scientific article; zbMATH DE number 5260071
- An enhanced algorithm based on sum-product decoding of LDPC
- Hard-decision decoding algorithm with low complexity based on check-sum updating for LDPC codes
Cited in
(8)- scientific article; zbMATH DE number 5260071 (Why is no real title available?)
- Min-sum decoding algorithm of LDPC codes based on integer quantification
- A low complexity LDPC decoder with a modified sum-product algorithm
- Decoding algorithm of low-density parity-check codes based on Bowman-Levin approximation
- About Low DFR for QC-MDPC Decoding
- scientific article; zbMATH DE number 6831541 (Why is no real title available?)
- Vectorizing computations at decoding of nonbinary codes with small density of checks
- Reducing the complexity of the layer scheduled LDPC decoder based on the information bottleneck method
This page was built for publication: Efficient quantization algorithm for low-density parity-check code decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3500767)