Analysis and Implementation of Resource Efficient Probabilistic Gallager B LDPC Decoder
Name:
NEWCAS_2017_final_Analysis_and ...
Size:
429.2Kb
Format:
PDF
Description:
Final Accepted Manuscript
Affiliation
Univ Arizona, Dept Elect & Comp EngnIssue Date
2017-08
Metadata
Show full item recordPublisher
IEEECitation
Ünal, B., Ghaffari, F., Akoglu, A., Declercq, D., & Vasić, B. (2017, June). Analysis and implementation of resource efficient probabilistic Gallager B LDPC decoder. In New Circuits and Systems Conference (NEWCAS), 2017 15th IEEE International (pp. 333-336). IEEE.Rights
Copyright © 2017, IEEE.Collection Information
This item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at repository@u.library.arizona.edu.Abstract
Low-Density-Parity-Check (LDPC) codes have gained popularity in communication systems and standards due to their capacity-approaching error-correction performance. In this paper, we first expose the tradeoff between decoding performance and hardware performance across three LDPC hard-decision decoding algorithms: Gallager B (GaB), Gradient Descent Bit Flipping (GDBF), and Probabilistic Gradient Descent Bit Flipping (PGDBF). We show that GaB architecture delivers the best throughput while using fewest Field Programmable Gate Array (FPGA) resources, however performs the worst in terms of decoding performance. We then modify the GaB architecture, introduce a new Probabilistic stimulation function (PGaB), and achieve dramatic decoding performance improvement over the GaB, exceeding the performance of GDBF, without sacrificing its superior maximum operating frequency.ISSN
2472-467XVersion
Final accepted manuscriptAdditional Links
http://ieeexplore.ieee.org/document/8010173/ae974a485f413a2113503eed53cd6c53
10.1109/NEWCAS.2017.8010173