Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Qike Pang

dblp:403/3294 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
0009-0004-0813-5302ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Memory systems · 78% Storage systems · 22%
Theoretical computer science
2 papers
Coding theory · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems
non-volatile memory
1.822026
Across-Array LDPC Codes Design for Resistive Random-Access Memories · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Unreliability normalization weighted bit-flipping algorithms of LDPC decoding for ReRAM systems · Sci. China Inf. Sci. 2024
Memory systems › non-volatile memory
resistive memory
1.822026
Across-Array LDPC Codes Design for Resistive Random-Access Memories · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Unreliability normalization weighted bit-flipping algorithms of LDPC decoding for ReRAM systems · Sci. China Inf. Sci. 2024
Storage systems
storage reliability
1.012026
Across-Array LDPC Codes Design for Resistive Random-Access Memories · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Coding theory › error-correcting codes
code construction
1.012026
Across-Array LDPC Codes Design for Resistive Random-Access Memories · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Coding theory › error-correcting codes
LDPC codes
1.012026
Across-Array LDPC Codes Design for Resistive Random-Access Memories · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Coding theory
error-correcting codes
0.212024
Unreliability normalization weighted bit-flipping algorithms of LDPC decoding for ReRAM systems · Sci. China Inf. Sci. 2024
Coding theory › error-correcting codes › LDPC codes
LDPC decoding
0.212024
Unreliability normalization weighted bit-flipping algorithms of LDPC decoding for ReRAM systems · Sci. China Inf. Sci. 2024

Methods — techniques the papers use, named apart from their topics

belief propagation decoding · 2.0asymmetric discrete density evolution · 2.0unreliability normalization · 1.5bit-flipping decoding · 1.5
YearPublicationVenuePosition
2026 Across-Array LDPC Codes Design for Resistive Random-Access Memories
abstract
Resistive Random-Access Memory (ReRAM) has garnered significant attention due to its high storage density, rapid read/write speeds, and compatibility with CMOS devices. However, the simple crossbar structure of ReRAM introduces sneak path (SP) interference, which impairs the storage reliability of the ReRAM system. To address this, we propose a novel Zoned Namespace (ZNS)-based ReRAM storage scheme, which is well-suited for scenarios with hybrid storage protection of multi-type data and employs low-density parity-check (LDPC) codes to mitigate the impact of sneak paths. Furthermore, considering the asymmetric nature of the ReRAM channel, we first develop a computer-calculable Asymmetric Discrete Density Evolution method for the belief propagation decoding algorithm (ADDE-BP). Due to the across-array storage structure, sneak path interference and noise vary across sub-arrays, resulting in codewords experiencing a non-uniform “sum channel”. To address this, we further propose criteria based on ADDE-BP for non-uniform error correction, specifically for the design of low-density parity-check (LDPC) codewords. Simulation results show that the proposed codes achieve 1–2 orders of magnitude lower BER than IEEE standard codes and Mackay codes under most channel conditions, thus demonstrating that our proposed LDPC code design for across-array applications enhances data storage reliability compared to conventional methods. Most importantly, the maximum check node degree and node type of the designed code were reduced, thus greatly simplifying the hardware implementation. This work establishes a co-design framework for ReRAM that simultaneously improves the reliability and efficiency of storage systems.
Qike Pang, Zheng Ma 0001
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
2024 Unreliability normalization weighted bit-flipping algorithms of LDPC decoding for ReRAM systems
Qike Pang, Zheng Ma 0001, Xiaohu Tang 0004
Sci. China Inf. Sci.1