Reduced-complexity binary-weight-coded associative memories - Archive ouverte HAL
Communication Dans Un Congrès Année : 2013

Reduced-complexity binary-weight-coded associative memories

Résumé

Associative memories retrieve stored information given partial or erroneous input patterns. Recently, a new family of associative memories based on Clustered-Neural-Networks (CNNs) was introduced that can store many more messages than classical Hopfield-Neural Networks (HNNs). In this paper, we propose hardware architectures of such memories for partial or erroneous inputs. The proposed architectures eliminate winner-take-all modules and thus reduce the hardware complexity by consuming 65% fewer FPGA lookup tables and increase the operating frequency by approximately 1.9 times compared to that of previous work.
Fichier non déposé

Dates et versions

hal-00857216 , version 1 (03-09-2013)

Identifiants

  • HAL Id : hal-00857216 , version 1

Citer

Hooman Jarollahi, Naoya Onizawa, Vincent Gripon, Warren J. Gross. Reduced-complexity binary-weight-coded associative memories. ICASSP 2013 : the 38th IEEE International Conference on Acoustics, Speech, and Signal Processing, May 2013, Vancouver, Canada. ⟨hal-00857216⟩
273 Consultations
0 Téléchargements

Partager

More