A Transform Approach to Logic Design
- 1 July 1970
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-19 (7) , 627-640
- https://doi.org/10.1109/T-C.1970.222995
Abstract
This paper describes a new approach to the design of combinational logic using large-scale integrated (LSI) circuit technology. A simple "prototype" logic function of n binary variables is imbedded within an array of at most (n+1) rows and columns. The cells of this array contain two-input EXCLUSIVE-OR gates, and its rows are fed by the input variables and logical "1." Its column outputs are first-degree polynomial functions of the input variables. These functions supply inputs to, and modify the output of, the prototype in order to realize the desired function. These transformations form a group; specifically, the largest subgroup of the (n+1)-dimensional affine group such that input variable encodings are not affected by feedback from the function's output.Keywords
This publication has 12 references indexed in Scilit:
- A Correspondence Between Equivalence Classes of Switching Functions and Group CodesIEEE Transactions on Electronic Computers, 1967
- Graphs of affine transformations, with applications to sequential circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1966
- On the Classification of Boolean Functions by the General Linear and Affine GroupsJournal of the Society for Industrial and Applied Mathematics, 1964
- On the number of classes of (n,k) switching networksJournal of the Franklin Institute, 1963
- Transformations Among Switching Function Canonical FormsIEEE Transactions on Electronic Computers, 1963
- Some Further Theory of Group CodesBell System Technical Journal, 1960
- On the classification of Boolean functionsIRE Transactions on Information Theory, 1959
- On The Number of Symmetry Types of Boolean Functions of n VariablesCanadian Journal of Mathematics, 1953
- The theory of counting techniquesPublished by Association for Computing Machinery (ACM) ,1952
- Sur les types des propositions composéesThe Journal of Symbolic Logic, 1940