Memory-efficient turbo decoder architectures for LDPC codes
- 27 August 2003
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Turbo decoder architectures for low-density parity-check codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Irregular codes from regular graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- High throughput low-density parity-check decoder architecturesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Parallel decoding architectures for low density parity check codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- VLSI architectures for iterative decoders in magnetic recording channelsIEEE Transactions on Magnetics, 2001
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- Ramanujan graphsCombinatorica, 1988
- Explicit constructions of graphs without short cycles and low density codesCombinatorica, 1982
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974