Constrained Coding and Deep Learning Aided Threshold Detection for Resistive Memories

Abstract

Resistive random access memory (ReRAM) is a promising emerging non-volatile memory (NVM) technology that shows high potential for both data storage and computing. However, its crossbar array architecture leads to the sneak path problem, which may severely degrade the reliability of data stored in the ReRAM cell. Due to the complication of memory physics and unique features of the sneak path induced interference (SPI), it is difficult to derive an accurate channel model for it. The deep learning (DL)-based detection scheme [5] can better mitigate the SPI, at the cost of additional power consumption and read latency. In this letter, we first propose a novel CC scheme which can not only reduce the SPI in the memory array, but also effectively differentiate the memory arrays into two categories of sneak-path-free and sneak-path-affected arrays. For the sneakpath-free arrays, we can use a simple middle-point threshold detector to detect the low and high resistance cells of ReRAM. For the sneak-path-affected arrays, a DL detector is first trained off-line (prior to the data detection of ReRAM). To avoid the additional power consumption and latency introduced by the DL detector, we further propose a DL-based threshold detector, whose detection threshold can be derived based on the outputs of the DL detector. It is then utilized for the online data detection of all the identified sneak-path-affected arrays. Simulation results demonstrate that the above CC and DL aided threshold detection scheme can effectively mitigate the SPI of the ReRAM array and achieve better error rate performance than the prior art detection schemes, without the prior knowledge of the channel.

Adding RLL Properties to Four CCSDS LDPC Codes without Increasing Their Redundancy

“…This tradition also continues nowadays. Examples of recent advances in constructing ECCs are found in [15,16,17,18,19,20], while the up to date progress examples in constructing LCs are found in [21,22,23,24,25].…”

“…63, 94, 178, 217, 363, 446, 448}, S 2 = {1, 2, 96, 180, 219, 365, 384, 450}, S 3 = {3, 4, 98, 182, 221, 367, 386, 452}, S 4 = {5, 6, 100, 184, 223, 369, 388, 454}, S 5 = {7, 8, 102, 186, 225, 371, 390, 456}, S 6 = {9, 10, 104, 188, 227, 373, 392, 458}, S 7 = {11, 12, 106, 190, 229, 375, 394, 460}, S 8 = {13, 14, 108, 128, 231, 377, 396, 462}, S 9 = {15, 16, 110, 130, 233, 379, 398, 464}, S 10 = {17, 18, 112, 132, 235, 381, 400, 466}, S 11 = {19, 20, 114, 134, 237, 383, 402, 468}, S 12 = {21, 22, 116, 136, 239, 321, 404, 470}, S 13 = {23, 24, 118, 138, 241, 323, 406, 472}, S 14 = {25, 26, 120, 140, 243, 325, 408, 474}, S 15 = {27, 28, 122, 142, 245, 327, 410, 476}, S 16 = {29, 30, 124, 144, 247, 329, 412, 478}, S 17 = {31, 32, 126, 146, 249, 331, 414, 480}, S 18 = {33, 34, 64, 148, 251, 333, 416, 482}, S 19 = {35, 36, 66, 150, 253, 335, 418, 484}, S 20 = {37, 38, 68, 152, 255, 337, 420, 486}, S 21 = {39, 40, 70, 154, 193, 339, 422, 488},beginning with 0 and starting from left in the final word it is necessary to subtract 18 from all numbers listed in Appendix VI(8.6).Example of possible order of symbols in the RLL ECC obtained from the CCSDS LDPC code defined by matrix(23):18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 80, 256, 603, 830, 1 102, 1 454, 1 533, 1 637, 2 124, 2 516, 2 786, 3 044, 3 146, 3 497, 3 666, 4 016, 4 168, 4 271, 4 475, 4 732, 5 008, 5 190, 5 397, 5 719, 5 982, 6 212, 6 669, 6 925, 7 234, 7 481, 7 781, 8 006,…”