Reliable Memories Built from Unreliable Components Based on Expander Graphs
| dc.creator | Chilappagari, Shashi Kiran | |
| dc.creator | Vasic, Bane | |
| dc.date | 2007-05-01 | |
| dc.date.accessioned | 2026-07-07T08:16:01Z | |
| dc.date.available | 2026-07-07T08:16:01Z | |
| dc.description | In this paper, memories built from components subject to transient faults are considered. A fault-tolerant memory architecture based on low-density parity-check codes is proposed and the existence of reliable memories for the adversarial failure model is proved. The proof relies on the expansion property of the underlying Tanner graph of the code. An equivalence between the Taylor-Kuznetsov (TK) scheme and Gallager B algorithm is established and the results are extended to the independent failure model. It is also shown that the proposed memory architecture has lower redundancy compared to the TK scheme. The results are illustrated with specific numerical examples. | |
| dc.description | Submitted to IEEE Transactions on Information Theory | |
| dc.identifier | https://arxiv.org/abs/0705.0044 | |
| dc.identifier | http://arxiv.org/abs/0705.0044 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133638 | |
| dc.subject | Information Theory | |
| dc.title | Reliable Memories Built from Unreliable Components Based on Expander Graphs | |
| dc.type | text |