Show simple item record

dc.contributor.authorXiao, Xin
dc.contributor.authorVasic, Bane
dc.contributor.authorTandon, Ravi
dc.contributor.authorLin, Shu
dc.date.accessioned2020-09-14T22:29:46Z
dc.date.available2020-09-14T22:29:46Z
dc.date.issued2019-12
dc.identifier.citationX. Xiao, B. Vasic, R. Tandon and S. Lin, "Finite Alphabet Iterative Decoding of LDPC Codes with Coarsely Quantized Neural Networks," 2019 IEEE Global Communications Conference (GLOBECOM), Waikoloa, HI, USA, 2019, pp. 1-6, doi: 10.1109/GLOBECOM38437.2019.9013364.en_US
dc.identifier.issn2334-0983
dc.identifier.doi10.1109/globecom38437.2019.9013364
dc.identifier.urihttp://hdl.handle.net/10150/643340
dc.description.abstractIn this paper, we introduce a method of using quantized neural networks (QNN) to design finite alphabet message passing decoders (FAID) for Low-Density Parity Check (LDPC) codes. Specifically, we construct a neural network with low precision activations to optimize a FAID over Additive White Gaussian Noise Channel (AWGNC). The low precision activations cause a critical issue that their gradients vanish almost everywhere, making it difficult to use classical backward propagation. We introduce straight-through estimators (STE) [1] to avoid this problem, by replacing zero derivatives of quantized activations with surrogate gradients in the chain rules. We present a systematic approach to train such networks while minimizing the bit error rate, which is a widely used and accurate metric to measure the performance of iterative decoders. Examples and simulations show that by training a QNN, a FAID with 3-bit of message and 4-bit of channel output can be obtained, which performs better than the more complex floating-point minsum decoding algorithm. This methodology is promising in the sense that it facilitates designing low-precision FAID for LDPC codes while maintaining good error performance in a flexible and efficient manner.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.rightsCopyright © 2019 IEEE.en_US
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en_US
dc.source2019 IEEE Global Communications Conference (GLOBECOM)
dc.titleFinite Alphabet Iterative Decoding of LDPC Codes with Coarsely Quantized Neural Networksen_US
dc.typeArticleen_US
dc.contributor.departmentUniv Arizonaen_US
dc.identifier.journal2019 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM)en_US
dc.description.collectioninformationThis 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.en_US
dc.eprint.versionFinal accepted manuscripten_US
refterms.dateFOA2020-09-14T22:29:47Z


Files in this item

Thumbnail
Name:
Globecom-2019.pdf
Size:
368.6Kb
Format:
PDF
Description:
Final Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record