Designs of Flash and Associative Memories

Flash is the leading technology for non-volatile memory today. However, flash suffers from an asymmetry between cell programming and cell erasing; while it is easy to increase a cell charge, reducing its charge requires erasing a large block of cells. Block erasures are not only time-consuming, but also degrade the lifetime of the memory. Rewriting algorithms are one of the efficient approaches to mitigate the lifetime constraint and improve endurance. I will present recent advances in rewriting algorithms as well as generalizations of the work of Rivest and Shamir on Write Once Memories.
The second part of this talk considers associative memories, were the focus is on efficient management and retrieval of information. Our approach is inspired by our understanding of the information processing in the brain. The human brain stores information by associations and this organization leads to efficient data retrieval. I will present results related to the concept of uncertainty in associative memories and show its connection to Levenshtein's sequences reconstruction problem.

30/01/2013 - 14:00
Eitan Yaakoby
דוא"ל להרשמה: 
California Institute of Technology
building 1103, Room 329