{"title":"可靠的多电平快闪记忆体快速、紧凑的纠错方案","authors":"Daniele Rossi, C. Metra, B. Riccò","doi":"10.1109/MTDT.2002.1029759","DOIUrl":null,"url":null,"abstract":"This paper presents a method to reduce area and timing overhead due to the implementation of standard single symbol correcting codes to provide ML flash memories with error correction capability. In particular, the proposed method is based on the manipulation of the parity check matrix which defines a code, which allows one to minimize the matrix weight and the maximum row weight. Furthermore, we show that a minimal increase in the redundancy, with respect to the standard case, allows a further considerable reduction of the impact on the memory access time, as well as on the area overhead due to the error correction circuitry.","PeriodicalId":230758,"journal":{"name":"Proceedings of the 2002 IEEE International Workshop on Memory Technology, Design and Testing (MTDT2002)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Fast and compact error correcting scheme for reliable multilevel flash memories\",\"authors\":\"Daniele Rossi, C. Metra, B. Riccò\",\"doi\":\"10.1109/MTDT.2002.1029759\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a method to reduce area and timing overhead due to the implementation of standard single symbol correcting codes to provide ML flash memories with error correction capability. In particular, the proposed method is based on the manipulation of the parity check matrix which defines a code, which allows one to minimize the matrix weight and the maximum row weight. Furthermore, we show that a minimal increase in the redundancy, with respect to the standard case, allows a further considerable reduction of the impact on the memory access time, as well as on the area overhead due to the error correction circuitry.\",\"PeriodicalId\":230758,\"journal\":{\"name\":\"Proceedings of the 2002 IEEE International Workshop on Memory Technology, Design and Testing (MTDT2002)\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2002 IEEE International Workshop on Memory Technology, Design and Testing (MTDT2002)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MTDT.2002.1029759\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2002 IEEE International Workshop on Memory Technology, Design and Testing (MTDT2002)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MTDT.2002.1029759","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fast and compact error correcting scheme for reliable multilevel flash memories
This paper presents a method to reduce area and timing overhead due to the implementation of standard single symbol correcting codes to provide ML flash memories with error correction capability. In particular, the proposed method is based on the manipulation of the parity check matrix which defines a code, which allows one to minimize the matrix weight and the maximum row weight. Furthermore, we show that a minimal increase in the redundancy, with respect to the standard case, allows a further considerable reduction of the impact on the memory access time, as well as on the area overhead due to the error correction circuitry.