Fault tolerant memories based on expander graphs

Shashi Kiran Chilappagari, Bane V Vasic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Citations (Scopus)

Abstract

In this paper we consider memories built from components subject to transient faults. We propose a fault-tolerant memory architecture based on LDPC codes and show the existence of memories which can tolerate constant fraction of failures in all the components. Our proof relies on the expansion property of the underlying Tanner graph of the code. We illustrate our results with specific numerical examples.

Original languageEnglish (US)
Title of host publication2007 IEEE Information Theory Workshop, ITW 2007, Proceedings
Pages126-131
Number of pages6
DOIs
StatePublished - 2007
Event2007 IEEE Information Theory Workshop, ITW 2007 - Lake Tahoe, CA, United States
Duration: Sep 2 2007Sep 6 2007

Other

Other2007 IEEE Information Theory Workshop, ITW 2007
CountryUnited States
CityLake Tahoe, CA
Period9/2/079/6/07

Fingerprint

Data storage equipment
Memory architecture
Graph
Fault

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems
  • Information Systems and Management

Cite this

Chilappagari, S. K., & Vasic, B. V. (2007). Fault tolerant memories based on expander graphs. In 2007 IEEE Information Theory Workshop, ITW 2007, Proceedings (pp. 126-131). [4313061] https://doi.org/10.1109/ITW.2007.4313061

Fault tolerant memories based on expander graphs. / Chilappagari, Shashi Kiran; Vasic, Bane V.

2007 IEEE Information Theory Workshop, ITW 2007, Proceedings. 2007. p. 126-131 4313061.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chilappagari, SK & Vasic, BV 2007, Fault tolerant memories based on expander graphs. in 2007 IEEE Information Theory Workshop, ITW 2007, Proceedings., 4313061, pp. 126-131, 2007 IEEE Information Theory Workshop, ITW 2007, Lake Tahoe, CA, United States, 9/2/07. https://doi.org/10.1109/ITW.2007.4313061
Chilappagari SK, Vasic BV. Fault tolerant memories based on expander graphs. In 2007 IEEE Information Theory Workshop, ITW 2007, Proceedings. 2007. p. 126-131. 4313061 https://doi.org/10.1109/ITW.2007.4313061
Chilappagari, Shashi Kiran ; Vasic, Bane V. / Fault tolerant memories based on expander graphs. 2007 IEEE Information Theory Workshop, ITW 2007, Proceedings. 2007. pp. 126-131
@inproceedings{0fc808ea163d4060b9da431ad76b4069,
title = "Fault tolerant memories based on expander graphs",
abstract = "In this paper we consider memories built from components subject to transient faults. We propose a fault-tolerant memory architecture based on LDPC codes and show the existence of memories which can tolerate constant fraction of failures in all the components. Our proof relies on the expansion property of the underlying Tanner graph of the code. We illustrate our results with specific numerical examples.",
author = "Chilappagari, {Shashi Kiran} and Vasic, {Bane V}",
year = "2007",
doi = "10.1109/ITW.2007.4313061",
language = "English (US)",
isbn = "1424415640",
pages = "126--131",
booktitle = "2007 IEEE Information Theory Workshop, ITW 2007, Proceedings",

}

TY - GEN

T1 - Fault tolerant memories based on expander graphs

AU - Chilappagari, Shashi Kiran

AU - Vasic, Bane V

PY - 2007

Y1 - 2007

N2 - In this paper we consider memories built from components subject to transient faults. We propose a fault-tolerant memory architecture based on LDPC codes and show the existence of memories which can tolerate constant fraction of failures in all the components. Our proof relies on the expansion property of the underlying Tanner graph of the code. We illustrate our results with specific numerical examples.

AB - In this paper we consider memories built from components subject to transient faults. We propose a fault-tolerant memory architecture based on LDPC codes and show the existence of memories which can tolerate constant fraction of failures in all the components. Our proof relies on the expansion property of the underlying Tanner graph of the code. We illustrate our results with specific numerical examples.

UR - http://www.scopus.com/inward/record.url?scp=46749111147&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=46749111147&partnerID=8YFLogxK

U2 - 10.1109/ITW.2007.4313061

DO - 10.1109/ITW.2007.4313061

M3 - Conference contribution

SN - 1424415640

SN - 9781424415649

SP - 126

EP - 131

BT - 2007 IEEE Information Theory Workshop, ITW 2007, Proceedings

ER -