LOW-LATENCY APPROXIMATE ADDERIN FPGA

Approximate computing has gained significant attention for applications where absolute precision isnot critical, such as image processing, machine learning, and signal processing. The proposeddesign divides the addition process into two stages: a main sub-adder for high-speed approximatecomputation and an error sub-adder for refining accuracy. By limiting carry propagation in the mainsub-adder, the critical path delay is significantly reduced, achieving low latency. Simultaneously,the error sub-adder operates in parallel to correct errors, ensuring a balance between performanceand precision. Experimental results demonstrate the design’s superior trade-off between speed,accuracy, and energy efficiency compared to conventional adders. The proposed architecture ishighly scalable and suitable for resource-constrained and performance-critical applications, such asreal-time image processing and low-power machine learning accelerators.

Authors

Publication Details

Journal
International Journal of Engineering Technology and Management Sciences
Published
2025-01-01
DOI
https://doi.org/10.46647/ijetms.2025.v09i02.005
Primary Topic
Image Processing Techniques and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

LOW-LATENCY APPROXIMATE ADDERIN FPGA

P Sowmiyaa, P. Saranya, R. Saranya, M Sabena et al.
International Journal of Engineering Technology and Management Sciences
Image Processing Techniques and Applications
article

LOW-LATENCY APPROXIMATE ADDERIN FPGA

P Sowmiyaa, P. Saranya, R. Saranya, M Sabena, K Subhisha
article en

Abstract

Approximate computing has gained significant attention for applications where absolute precision isnot critical, such as image processing, machine learning, and signal processing. The proposeddesign divides the addition process into two stages: a main sub-adder for high-speed approximatecomputation and an error sub-adder for refining accuracy. By limiting carry propagation in the mainsub-adder, the critical path delay is significantly reduced, achieving low latency. Simultaneously,the error sub-adder operates in parallel to correct errors, ensuring a balance between performanceand precision. Experimental results demonstrate the design’s superior trade-off between speed,accuracy, and energy efficiency compared to conventional adders. The proposed architecture ishighly scalable and suitable for resource-constrained and performance-critical applications, such asreal-time image processing and low-power machine learning accelerators.

International Journal of Engineering Technology and Management SciencesVol. 9(2)
Openalex Percentile: Top 93%
Image Processing Techniques and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

LOW-LATENCY APPROXIMATE ADDERIN FPGA — P Sowmiyaa, P. Saranya, et al. · International Journal of Engineering Technology and Management Sciences (2025) | TGRS Research Map | TGRS