Browse Prior Art Database

High Capacity Memory System

IP.com Disclosure Number: IPCOM000097237D
Original Publication Date: 1962-Jul-01
Included in the Prior Art Database: 2005-Mar-07
Document File: 2 page(s) / 42K

Publishing Venue

IBM

Related People

Anderson, JL: AUTHOR

Abstract

The drawing shows a drive system for a very large two-dimensional memory. The system employs tree-type decoding networks for selecting one of many word drive lines for reading and writing. It employs a combination of a diode matrix and a tree-type decoder for applying bit drives to the selected word.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 82% of the total text.

Page 1 of 2

High Capacity Memory System

The drawing shows a drive system for a very large two-dimensional memory. The system employs tree-type decoding networks for selecting one of many word drive lines for reading and writing. It employs a combination of a diode matrix and a tree-type decoder for applying bit drives to the selected word.

Assume that it is desired to write information in word register 4. A half-select word drive is applied to this register by energizing the write driver at the top of the write drive tree and the one shaded gate from each level of the tree. The drive tree is shown separately from the core array. The circled numbers at the final level of the tree indicate the word lines of the matrix that are connected to the several tree outputs.

Half-select bit current supplied by the bit drivers is applied to the proper word by activating the shaded gates in the diode matrix-tree arrangement shown connected to the core array. The gates at the right of the diode matrix select the level in the array containing the selected word. The gates at the bottom of the array select the proper group of words in that level.

Reading is accomplished by applying full-select read current to the selected word register via a word read drive tree (not shown) which is identical to the write drive tree.

While the system is shown with only eight word registers, a very large number of words are accommodated with relatively few gates and drivers. For example, if each level of the w...