Vincent Gripon's Homepage

Research and Teaching Blog

Fault-Tolerant Associative Memories Based on c-Partite Graphs

F. Leduc-Primeau, V. Gripon, M. Rabbat and W. J. Gross, "Fault-Tolerant Associative Memories Based on c-Partite Graphs," in IEEE Transactions on Signal Processing, Volume 64, Number 4, pp. 829--841, 2015.

Associative memories allow the retrieval of previously stored messages given a part of their content. In this paper, we are interested in associative memories based on-partite graphs that were recently introduced. These memories are almost optimal in terms of the amount of storage they require (efficiency) and allow retrieving messages with low complexity. We propose a generic im- plementation model for the retrieval algorithm that can be readily mapped to an integrated circuit and study the retrieval performance when hardware components are affected by faults. We show using analytical and simulation results that these associative memories can be made resilient to circuit faults with a minor modification of the retrieval algorithm. In one example, the memory retains 88% of its efficiency when 1% of the storage cells are faulty, or 98% when 0.1% of the binary outputs of the retrieval algorithm are faulty. When considering storage faults, the fault tolerance exhibited by the proposed associative memory can be comparable tousing a capacity-achieving error correction code for protecting the stored information.

Download manuscript.

  author = {François Leduc-Primeau and Vincent Gripon
and Michael Rabbat and Warren J. Gross},
  title = {Fault-Tolerant Associative Memories Based
on c-Partite Graphs},
  journal = {IEEE Transactions on Signal Processing},
  year = {2015},
  volume = {64},
  number = {4},
  pages = {829--841},

You are the 531261th visitor

Vincent Gripon's Homepage