Efficient quantization algorithm for low-density parity-check code decoding
From MaRDI portal
Publication:3500767
zbMATH Open1150.94343MaRDI QIDQ3500767FDOQ3500767
Authors: Yukui Pei, Liuguo Yin, Jianhua Lu
Publication date: 3 June 2008
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)
- A low complexity LDPC decoder with a modified sum-product algorithm
- About Low DFR for QC-MDPC Decoding
- Min-sum decoding algorithm of LDPC codes based on integer quantification
- Decoding algorithm of low-density parity-check codes based on Bowman-Levin approximation
- Title not available (Why is that?)
- Reducing the complexity of the layer scheduled LDPC decoder based on the information bottleneck method
- Vectorizing computations at decoding of nonbinary codes with small density of checks
- Title not available (Why is that?)
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)