A Precision-Adaptive ECC Strategy with Computing Fusion Decoding for Near/In-Memory Computing

With the rapid growth of data amount in artificial intelligence (AI), near-memory computing (NMC) and in-memory computing (IMC) have emerged as promising solutions to overcome the "memory wall". Traditional storage-centric error-correcting code (ECC) schemes perform error correction on arbitrary bits, introducing significant area and energy overhead. Such bit-level ECC is unnecessary for NMC/IMC architectures, as AI workloads prioritize overall computational accuracy over exact bit correctness. While recent IMC ECC methods focus on computational results rather than bit-level precision, they still lack adaptivity to meet the dynamic precision requirements of AI workloads and the fixed code length results in high area and power overhead.To address these challenges, this paper proposes a precision-adaptive ECC strategy for NMC/IMC for the first time. Our approach dynamically adjusts the encoded data size based on the target workload’s precision requirements and employs an orthogonal compression method to lessen the number of parity bits. By fusing the decoding process into the computational features of NMC/IMC, we reuse existing computational circuits to minimize overhead. Experimental results demonstrate that the proposed method achieves a 45.24% improvement in energy efficiency and a 12.04% reduction in area compared to traditional ECC schemes.

Authors

Institutions

Publication Details

Published
2025-05-18
DOI
https://doi.org/10.1109/imw61990.2025.11026950
Primary Topic
Distributed systems and fault tolerance
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Precision-Adaptive ECC Strategy with Computing Fusion Decoding for Near/In-Memory Computing

Jianshi Tang, Bin Gao, Pufan Xu, Peng Yao et al.
Distributed systems and fault tolerance
article

A Precision-Adaptive ECC Strategy with Computing Fusion Decoding for Near/In-Memory Computing

Jianshi Tang, Bin Gao, Pufan Xu, Peng Yao, Huaqiang Wu, He Qian
article en

Abstract

With the rapid growth of data amount in artificial intelligence (AI), near-memory computing (NMC) and in-memory computing (IMC) have emerged as promising solutions to overcome the "memory wall". Traditional storage-centric error-correcting code (ECC) schemes perform error correction on arbitrary bits, introducing significant area and energy overhead. Such bit-level ECC is unnecessary for NMC/IMC architectures, as AI workloads prioritize overall computational accuracy over exact bit correctness. While recent IMC ECC methods focus on computational results rather than bit-level precision, they still lack adaptivity to meet the dynamic precision requirements of AI workloads and the fixed code length results in high area and power overhead.To address these challenges, this paper proposes a precision-adaptive ECC strategy for NMC/IMC for the first time. Our approach dynamically adjusts the encoded data size based on the target workload’s precision requirements and employs an orthogonal compression method to lessen the number of parity bits. By fusing the decoding process into the computational features of NMC/IMC, we reuse existing computational circuits to minimize overhead. Experimental results demonstrate that the proposed method achieves a 45.24% improvement in energy efficiency and a 12.04% reduction in area compared to traditional ECC schemes.

Tsinghua University (CN)
Affordable and clean energy
Openalex Percentile: Top 86%
Distributed systems and fault tolerance
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.