A Low Redundancy Matrix Code Technique for Resistant to Single-Particle Flip-Flops

A low redundancy matrix code technique is proposed to address the problem that Static Random Memories (SRAM) are prone to single-particle Multiple Bit Upsets (MBU) within a single memory word. The design of the low-redundancy matrix code is based on the idea of using low-complexity multi-bit error detection methods for each row and column of information bits, respectively. It is verified that the proposed low redundancy matrix code requires fewer redundant memory cells to correct all soft errors up to four consecutive and non-consecutive bits, which greatly improves the reliability of the memory. The encoder and decoder of the low-redundancy matrix code are implemented in Vivado integrated environment using Verilog hardware description language, and their functions are simulated and verified and performance analyzed. Compared with currently known matrix codes, the proposed low-redundancy matrix code technique can reduce the redundancy overhead of parity bits by up to 30% and achieve a code rate of 0.35.

Authors

Institutions

Publication Details

Published
2024-10-25
DOI
https://doi.org/10.1109/icemce64157.2024.10862347
Primary Topic
Quantum-Dot Cellular Automata
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Low Redundancy Matrix Code Technique for Resistant to Single-Particle Flip-Flops

Qing-Quan Liu, Yu Wang, Ronghua Shi, Di Zheng et al.
Quantum-Dot Cellular Automata
article

A Low Redundancy Matrix Code Technique for Resistant to Single-Particle Flip-Flops

Qing-Quan Liu, Yu Wang, Ronghua Shi, Di Zheng, Zhenpeng Jiang
article en

Abstract

A low redundancy matrix code technique is proposed to address the problem that Static Random Memories (SRAM) are prone to single-particle Multiple Bit Upsets (MBU) within a single memory word. The design of the low-redundancy matrix code is based on the idea of using low-complexity multi-bit error detection methods for each row and column of information bits, respectively. It is verified that the proposed low redundancy matrix code requires fewer redundant memory cells to correct all soft errors up to four consecutive and non-consecutive bits, which greatly improves the reliability of the memory. The encoder and decoder of the low-redundancy matrix code are implemented in Vivado integrated environment using Verilog hardware description language, and their functions are simulated and verified and performance analyzed. Compared with currently known matrix codes, the proposed low-redundancy matrix code technique can reduce the redundancy overhead of parity bits by up to 30% and achieve a code rate of 0.35.

Shenyang Ligong University (CN)
Openalex Percentile: Top 69%
Quantum-Dot Cellular Automata
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.

A Low Redundancy Matrix Code Technique for Resistant to Single-Particle Flip-Flops — Qing-Quan Liu, Yu Wang, et al. · (2024) | TGRS Research Map | TGRS