A low complexity LDPC decoder with a modified sum-product algorithm
From MaRDI portal
Recommendations
- An enhanced algorithm based on sum-product decoding of LDPC
- scientific article; zbMATH DE number 5260071
- Efficient quantization algorithm for low-density parity-check code decoding
- Hard-decision decoding algorithm with low complexity based on check-sum updating for LDPC codes
- A configurable min-sum decoding algorithm for LDPC codes
Cited in
(16)- On analyzing LDPC codes over multiantenna MC-CDMA system
- Analysis of error-correcting codes for lattice-based key exchange
- A low rate coding and decoding scheme based on the LDPC-BCH graph
- Comparisons of parallelization strategies for min-sum decoding of irregular LDPC codes
- Min-sum decoding algorithm of LDPC codes based on integer quantification
- Low-power LDPC decoding by exploiting the fault-tolerance of the sum-product algorithm
- An enhanced algorithm based on sum-product decoding of LDPC
- An Impulse C Application in the LDPC Decoding Algorithm
- Efficient decoding implementations of LDPC codes
- Efficient quantization algorithm for low-density parity-check code decoding
- A Low-Complexity Hybrid LDPC Code Encoder for IEEE 802.3an (10GBase-T) Ethernet
- Hard-decision decoding algorithm with low complexity based on check-sum updating for LDPC codes
- Vectorizing computations at decoding of nonbinary codes with small density of checks
- Modified self-corrected min-sum algorithm based on variable node update
- A configurable min-sum decoding algorithm for LDPC codes
- Reducing the complexity of the layer scheduled LDPC decoder based on the information bottleneck method
This page was built for publication: A low complexity LDPC decoder with a modified sum-product algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4980571)
