Dynamic Memories with Enhanced Data Access.
Abstract
Dynamic memories are commonly constructed as circulating shift registers, and thus have access times that are proportional to the size of memory. When each word in a dynamic memory is connected to r words, r > or = 2, access time can be proportional to the base r logarithm of the size of memory. This paper describes a memory that achieves minimum access time for r = 2. The memory can also be operated in an efficient binary search mode. Slight variations of the interconnection patterns lead to a memory that is well suited for FFT and certain matrix computations. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 01, 1971
- Accession Number
- AD0727116
Entities
People
- Harold S. Stone
Organizations
- Stanford University