Optimizing LDPC Decoder Implementation on FPGA for Improved Wireless Communication Efficiency

Authors

  • Maryam Imad Subhi Control and Systems Engineering Department, University of Technology, Baghdad 10066, Iraq
  • Qusay Al-Doori Control and Systems Engineering Department, University of Technology, Baghdad 10066, Iraq

Keywords:

FPGA, implementation, LDPC decoder, MSA, synthesis, VHDL

Abstract

Low-density parity check (LDPC) decoders face challenges such as high computational complexity and limited scalability. This research explores the optimal implementation of an LDPC decoder on a Field Programmable Gate Array (FPGA) to improve communication efficiency. The decoder is implemented using the min sum algorithm in two approaches. The study highlights notable disparities in gate efficiency, pin count, and thermal dissipation metrics. The direct VHDL approach requires considerably fewer logic gates, at a reduction of 37.13%, and exhibits a minor improvement in core static thermal power dissipation, indicating a more streamlined designthat might contribute to smaller and more economical FPGA designs. Conversely, the MATLAB to VHDL conversion is more effective in minimizing pin usage, with a 52.19% decrease, which could simplify design complexity and enhance scalability. Nonetheless, the direct VHDL method incurs higher input/output thermal power dissipation, marked by a 27.39% increase, which introduces additional considerations for thermal management in system design. Application requirements, available resources, and the target trade-off between design complexity and resource efficiency all play a role in the method selection process.

Downloads

Published

2024-01-10

How to Cite

Maryam Imad Subhi, & Qusay Al-Doori. (2024). Optimizing LDPC Decoder Implementation on FPGA for Improved Wireless Communication Efficiency. Journal of Computational Analysis and Applications (JoCAAA), 33(06), 580–593. Retrieved from https://eudoxuspress.com/index.php/pub/article/view/843

Issue

Section

Articles

Similar Articles

1 2 3 > >> 

You may also start an advanced similarity search for this article.