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 ≥ 2, access time can be proportional to the base r logarithm of the size of memory. A memory that achieves minimum access time for r = 2 is described. 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.
No takes yet. Share an insight, caveat, or question.
Harold S. Stone (1972) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: