Convergence-optimized variable node structure for stochastic LDPC decoder

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

By using stochastic computation, a fully-parallel low-density parity-check (LDPC) decoder can be implemented using a lower wire complexity. In order to enhance the decoder performance, probability tracers, such as up/down counters, are added at each edge between variable nodes and check nodes, as described in previous literature. However, this causes a large decoding latency and a high number of decoding failures. In this paper, a convergence-optimized structure for variable nodes is proposed that is able to overcome these issues. As a result, the throughput for the proposed decoder is 20.5Gb/s, which is 101% higher than the original counter-based decoder presented in the previous literature.

Cite

CITATION STYLE

APA

Zhang, Q., Chen, Y., Wu, D., Zeng, X., & Ueng, Y. L. (2016). Convergence-optimized variable node structure for stochastic LDPC decoder. In ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings (Vol. 2016-May, pp. 6535–6539). Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.1109/ICASSP.2016.7472936

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free