Comparisons of parallelization strategies for min-sum decoding of irregular LDPC codes

DOI10.1109/TST.2013.6678903MaRDI QIDQ2926875zbMATH OpenOpenAlexFDO

Authors Hua Xu, Wei Wang, Jiadong Yang, Yun Wen, Wei Wan, Jun Wang

Publication date 3 November 2014

Published in Tsinghua Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tst.2013.6678903

zbMATH Keywords

graphic processor unitlow-density parity-check codesmulticore

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• An enhanced algorithm based on sum-product decoding of LDPC
• A low complexity LDPC decoder with a modified sum-product algorithm
• An FPGA implementation of \((3,6)\)-regular low-density parity-check code decoder
• scientific article; zbMATH DE number 5260071
• High-throughput architectures for circular block-type low-density parity-check codes

Cited in

(3)

• Fully Parallel Stochastic LDPC Decoders
• Reducing the complexity of the layer scheduled LDPC decoder based on the information bottleneck method
• High-throughput architectures for circular block-type low-density parity-check codes

This page was built for publication: Comparisons of parallelization strategies for min-sum decoding of irregular LDPC codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2926875)