Method and apparatus for random and sequential accessing in dynamic memories
US4161036A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Nov 8, 1977 |
| Grant date | Jul 10, 1979 |
| Priority date | — |
| Expiry date | Nov 8, 1997 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F12/02
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A dynamic memory is disclosed, in which data is rearranged among its internal memory locations in accordance with either of two different shuffle operations. The shuffle operations, an In Shuffle and an Out Shuffle, rearrange the data in a manner similar to the manner in which cards of a deck are rearranged when shuffled. Using only the two shuffle operations, a method of random accessing data in the theoretical minimum time is disclosed, for all odd-sized memories and all memories of size 2.sup.r. Once a desired datum has been accessed, successive data can be sequentially accessed in unit time. Processes for sequential accessing of data are shown to be related to the existence of sequences of In and Out Shuffles which move each datum through the read/write window of the memory, which sequences are defined as tours. A method for determining the existence of and for constructing tours for certain sized memories is also disclosed. An address register that keeps track of the current address of the datum appearing in the index window of the memory, which is sufficient to define the entire memory configuration, operates in conjunction with control means to calculate I-O sequences for ra…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.