Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Functionally Arranged Storage

IP.com Disclosure Number: IPCOM000093683D
Original Publication Date: 1966-Jan-01
Included in the Prior Art Database: 2005-Mar-06
Document File: 2 page(s) / 44K

Publishing Venue

IBM

Related People

Fleisher, H: AUTHOR

Abstract

Functional relations of a pair of numbers, contained in a Boolean universe of n binary-valued variables, can each be characterized by a string of 2/n/ bits. The bit identities can be determined by utilizing the numbers as addresses for accessing a read-only storage containing functionally arranged data. Since a Boolean universe of n binary-valued variables includes either 2/n/ min-terms, i.e., the And combinations of the variables, or 2/n/ max-terms, i.e., the Or combinations of the variables, relationships between a pair of numbers may be established by providing for the min-terms and max-terms in the functionally-related arrangement of a read-only storage.

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 70% of the total text.

Page 1 of 2

Functionally Arranged Storage

Functional relations of a pair of numbers, contained in a Boolean universe of n binary-valued variables, can each be characterized by a string of 2/n/ bits. The bit identities can be determined by utilizing the numbers as addresses for accessing a read-only storage containing functionally arranged data. Since a Boolean universe of n binary-valued variables includes either 2/n/ min-terms, i.e., the And combinations of the variables, or 2/n/ max-terms, i.e., the Or combinations of the variables, relationships between a pair of numbers may be established by providing for the min-terms and max-terms in the functionally- related arrangement of a read-only storage.

This arrangement for a broad range of Boolean number handling includes the elimination of redundancies in the addressing of a functionally-related storage by a pair of numbers, the relationships of which are to be determined. For instance, if addresses are considered to be values of X and Y, which values determine, by coordinate selection, a particular function to be derived from storage, a function achieved by accessing X, Y might normally be the same as the function achieved by accessing Y, X. For example, a binary value such as 011 Anded with the binary value 101 gives the same result 001 as does the binary value 101 Anded with the binary value 011.

A similar situation exists with respect to other Boolean and arithmetic relationships between numbers. Therefore, a storage arra...