{"title":"基于潜行路径感知可靠性的rram系统LDPC码迭代多数逻辑解码算法","authors":"Lingjun Kong;Yingnan Qi;Haiyang Liu;Chao Meng","doi":"10.1109/LCOMM.2025.3584075","DOIUrl":null,"url":null,"abstract":"The performance of classical channel decoding algorithms in resistive random access memory (ReRAM) channels is severely degraded due to the sneak path interference (SPI) caused by the crossbar array structure. In this letter, we first propose a sneak path-aware reliability-based iterative majority-logic decoding (SPR-IMLGD) algorithm for low-density parity-check (LDPC) codes by integrating the sneak path information into reliability metrics. In particular, we introduce the sneak path distance, derived from the associated sneak path probability, which provides a desirable characterization of the presence and extent of sneak paths within a given memory cell. Moreover, we present an enhanced version of the SPR-IMLGD algorithm (ESPR-IMLGD) that further improves the error correction performance. We also optimize the calculation of sneak path distance, ensuring that the SPR-IMLGD and ESPR-IMLGD algorithms have the same level of computational complexity. Simulation results demonstrate that the SPR-IMLGD and ESPR-IMLGD algorithms can achieve better performance with lower computational cost compared with the existing methods.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 9","pages":"2018-2022"},"PeriodicalIF":4.4000,"publicationDate":"2025-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sneak Path-Aware Reliability-Based Iterative Majority-Logic Decoding Algorithms for LDPC Codes in ReRAM Systems\",\"authors\":\"Lingjun Kong;Yingnan Qi;Haiyang Liu;Chao Meng\",\"doi\":\"10.1109/LCOMM.2025.3584075\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The performance of classical channel decoding algorithms in resistive random access memory (ReRAM) channels is severely degraded due to the sneak path interference (SPI) caused by the crossbar array structure. In this letter, we first propose a sneak path-aware reliability-based iterative majority-logic decoding (SPR-IMLGD) algorithm for low-density parity-check (LDPC) codes by integrating the sneak path information into reliability metrics. In particular, we introduce the sneak path distance, derived from the associated sneak path probability, which provides a desirable characterization of the presence and extent of sneak paths within a given memory cell. Moreover, we present an enhanced version of the SPR-IMLGD algorithm (ESPR-IMLGD) that further improves the error correction performance. We also optimize the calculation of sneak path distance, ensuring that the SPR-IMLGD and ESPR-IMLGD algorithms have the same level of computational complexity. Simulation results demonstrate that the SPR-IMLGD and ESPR-IMLGD algorithms can achieve better performance with lower computational cost compared with the existing methods.\",\"PeriodicalId\":13197,\"journal\":{\"name\":\"IEEE Communications Letters\",\"volume\":\"29 9\",\"pages\":\"2018-2022\"},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2025-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Communications Letters\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/11059237/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"TELECOMMUNICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Communications Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11059237/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
Sneak Path-Aware Reliability-Based Iterative Majority-Logic Decoding Algorithms for LDPC Codes in ReRAM Systems
The performance of classical channel decoding algorithms in resistive random access memory (ReRAM) channels is severely degraded due to the sneak path interference (SPI) caused by the crossbar array structure. In this letter, we first propose a sneak path-aware reliability-based iterative majority-logic decoding (SPR-IMLGD) algorithm for low-density parity-check (LDPC) codes by integrating the sneak path information into reliability metrics. In particular, we introduce the sneak path distance, derived from the associated sneak path probability, which provides a desirable characterization of the presence and extent of sneak paths within a given memory cell. Moreover, we present an enhanced version of the SPR-IMLGD algorithm (ESPR-IMLGD) that further improves the error correction performance. We also optimize the calculation of sneak path distance, ensuring that the SPR-IMLGD and ESPR-IMLGD algorithms have the same level of computational complexity. Simulation results demonstrate that the SPR-IMLGD and ESPR-IMLGD algorithms can achieve better performance with lower computational cost compared with the existing methods.
期刊介绍:
The IEEE Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of communication over different media and channels including wire, underground, waveguide, optical fiber, and storage channels. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of communication systems.