skip to main content
10.1145/3194554.3194570acmconferencesArticle/Chapter ViewAbstractPublication PagesglsvlsiConference Proceedingsconference-collections
research-article
Public Access

Low Complexity Burst Error Correcting Codes to Correct MBUs in SRAMs

Published: 30 May 2018 Publication History

Abstract

Multiple bit upsets (MBUs) caused by high energy radiation is the most common source of soft errors in static random-access memories (SRAMs) affecting multiple cells. Burst error correcting Hamming codes have most commonly been used to correct MBUs in SRAM cell since they have low redundancy and low decoder latency. But with technology scaling, the number of bits being affected increases, thus requiring a need for increasing the burst size that can be corrected. However, this is a problem because it increases the number of syndromes exponentially thus increasing the decoder complexity exponentially as well. In this paper, a new burst error correcting code based on Hamming codes is proposed which allows much better scaling of decoder complexity as the burst size is increased. For larger burst sizes, it can provide significantly smaller and faster decoders than existing methods thus providing higher reliability at an affordable cost. Moreover, there is frequently no increase in the number of check bits or a very minimal increase in comparison with existing methods. A general construction and decoding methodology for the new codes is proposed. Experimental results are presented comparing the decoder complexity for the proposed codes with conventional burst error correcting Hamming codes demonstrating the significant improvements that can be achieved.

References

[1]
L. S. Adalid, P. Reviriego, P. Gil, S. Pontarelli and J. A. Maestro, "MCU Tolerance in SRAMs Through Low-Redundancy Triple Adjacent Error Correction," in IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 23, no. 10, pp. 2332--2336, Oct. 2015.
[2]
C. Argyrides, D. Pradhan and T. Kocak, "Matrix codes for reliable and cost efficient memory chips," in IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 19, no. 3, pp. 420--428, Mar. 2011.
[3]
S. Baeg, S. Wen and R. Wong, "SRAM Interleaving Distance Selection with a Soft Error Failure Model," in IEEE Transactions on Nuclear Science, vol. 56, no. 4, pp. 2111--2118, Aug. 2009.
[4]
R. Baumann, "Soft errors in advanced computer systems," in IEEE Design & Test of Computers, vol. 22, no. 3, pp. 258--266, May-Jun. 2005.
[5]
H. O. Burton, "Some asymptotically optimal burst-correction codes and their relation to single-error-correcting reed-solom codes," in IEEE Transactions on Information Theory, vol. 17, no. 1, pp. 92--95, Jan. 1971.
[6]
A. Dutta and N.A. Touba "Multiple Bit Upset Tolerant Memory Using a Selective Cycle Avoidance Based SEC-DED-DAEC Code," in Proc. of IEEE VLSI Test Symposium, pp. 349--354, 2007.
[7]
R. Datta and N.A. Touba, "Generating Burst-Error Correcting Codes from Orthogonal Latin Square Codes - A Graph Theoretic Approach," in Proc. of IEEE Symposium on Defect and Fault Tolerance, pp. 367--373, 2011.
[8]
E. Ibe, H. Taniguchi, Y. Yahagi, K. Shimbo and T. Toba, "Impact of scaling on neutron-induced soft error in SRAMs from a 250 mm to a 22 nm design rule," in IEEE Transactions on Electron Devices, vol. 57, no. 7, pp. 1527--1538, Jul. 2010
[9]
J. Kim, N. Hardavellas, K. Mai, B. Falsafi and J. Hoe, "Multi-bit error tolerant caches using two-dimensional error coding," in Annual IEEE/ACM International Symposium on Microarchitecture (MICRO), pp. 197--209, 2007.
[10]
K. Namba, S. Pontarelli, M. Ottavi and F. Lombardi, "A Single-Bit and Double-Adjacent Error Correcting Parallel Decoder for Multiple-Bit Error Correcting BCH Codes," in IEEE Transactions on Device and Materials Reliability, vol. 14, no. 2, pp. 664--671, Jun. 2014.
[11]
R. Naseer and J. Draper, "Parallel double error correcting code design to mitigate multi-bit upsets in SRAMs," in Proc. of Eurpoean Solid-State Circuits Conference (ESSCIRC), pp. 222--225, 2008.
[12]
A. Neale and M. Sachdev, "A new SEC-DED error correction code subclass for adjacent MBU tolerance in embedded memory," in IEEE Transactions on Device and Materials Reliability, vol. 13, no. 1, pp. 223--230, Mar. 2013.
[13]
D. Radaelli, H. Puchner, S. Wong and S. Daniel, "Investigation of multi-bit upsets in a 150 nm technology SRAM device," in IEEE Transactions on Nuclear Science, vol. 52, no. 6, pp. 2433--2437, Dec. 2005.
[14]
P. Reviriego, M. Flanagan, S.-F. Liu and J. Maestro, "Multiple cell upset correction in memories using difference set codes," in IEEE Transactions on Circuits and Systems-I: Regular Papers, vol. 59, no. 11, pp. 2592--2599, Nov. 2012.
[15]
P. Reviriego, S. Liu, J.A. Maestro, S. Lee, N.A. Touba and R. Datta, "Implementing Triple Adjacent Error Correction in Double Error Correction Orthogonal Latin Square Codes," in Proc. of IEEE Symposium on Defect and Fault Tolerance, pp. 167--171, 2013.
[16]
P. Reviriego, S. Pontarelli, A. Evans and J. A. Maestro, "A Class of SEC-DED-DAEC Codes Derived from Orthogonal Latin Square Codes", in IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 23, no. 5, pp. 968--972, May 2015.
[17]
S. Shamshiri and K. T. Cheng, "Error-locality-aware linear coding to correct multi-bit upsets in SRAMs," in Proc. of IEEE International Test Conference (ITC), Paper 7.1, 2010.

Cited By

View all

Index Terms

  1. Low Complexity Burst Error Correcting Codes to Correct MBUs in SRAMs

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    GLSVLSI '18: Proceedings of the 2018 Great Lakes Symposium on VLSI
    May 2018
    533 pages
    ISBN:9781450357241
    DOI:10.1145/3194554
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 30 May 2018

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. burst error correction
    2. hamming codes
    3. low complexity decoder
    4. multiple bit upsets
    5. sram

    Qualifiers

    • Research-article

    Funding Sources

    Conference

    GLSVLSI '18
    Sponsor:
    GLSVLSI '18: Great Lakes Symposium on VLSI 2018
    May 23 - 25, 2018
    IL, Chicago, USA

    Acceptance Rates

    GLSVLSI '18 Paper Acceptance Rate 48 of 197 submissions, 24%;
    Overall Acceptance Rate 312 of 1,156 submissions, 27%

    Upcoming Conference

    GLSVLSI '25
    Great Lakes Symposium on VLSI 2025
    June 30 - July 2, 2025
    New Orleans , LA , USA

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)130
    • Downloads (Last 6 weeks)31
    Reflects downloads up to 15 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media