Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Analysis and Design of Cost-Effective, High-Throughput LDPC Decoders (1709.10396v1)

Published 23 Aug 2017 in eess.SP and cs.AR

Abstract: This paper introduces a new approach to cost-effective, high-throughput hardware designs for Low Density Parity Check (LDPC) decoders. The proposed approach, called Non-Surjective Finite Alphabet Iterative Decoders (NS-FAIDs), exploits the robustness of message-passing LDPC decoders to inaccuracies in the calculation of exchanged messages, and it is shown to provide a unified framework for several designs previously proposed in the literature. NS-FAIDs are optimized by density evolution for regular and irregular LDPC codes, and are shown to provide different trade-offs between hardware complexity and decoding performance. Two hardware architectures targeting high-throughput applications are also proposed, integrating both Min-Sum (MS) and NS-FAID decoding kernels. ASIC post synthesis implementation results on 65nm CMOS technology show that NS-FAIDs yield significant improvements in the throughput to area ratio, by up to 58.75% with respect to the MS decoder, with even better or only slightly degraded error correction performance.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Thien Truong Nguyen-Ly (1 paper)
  2. Valentin Savin (33 papers)
  3. David Declercq (24 papers)
  4. Fakhreddine Ghaffari (1 paper)
  5. Oana Boncalo (2 papers)
  6. Khoa Le (8 papers)
Citations (39)

Summary

We haven't generated a summary for this paper yet.