Dynamic Memories with Rapid Random and Sequential Access

We propose a new architecture for dynamic memories in which the contents of any cell in memory can be accessed by applying a sequence of two primitive memory operations. The advantage of our memory over previous designs is its fast sequential access. Any word in an n cell memory can be accessed in 0(log n) steps. However, once two consecutive words have been accessed, following words can be accessed in one step per word.

[1]  G. Hardy,et al.  An Introduction to the Theory of Numbers , 1938 .

[2]  Harold S. Stone,et al.  Dynamic Memories with Enhanced Data Access , 1972, IEEE Transactions on Computers.

[3]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.