A Transform Approach to Logic Design

  title={A Transform Approach to Logic Design},
  author={Robert J. Lechner},
  journal={IEEE Transactions on Computers},
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… 
Spectral Transforms for Large Boolean Functions with Applications to Technology Mapping
This paper shows how to compute concise representations of the Walsh transform for functions with several hundred variables and obtains a speed up of as much as 50% for the matching phase.
On Two-Level Exclusive-or Majority Networks
By using the restricted-affine-group (RAG) equivalence of Boolean functions, it is shown that if two functions are in the same RAG class, then they are realized by the same minimal weight vector to within permutations and/or sign changes.
Performance Comparison and Overview of Different Approaches for VLSI Optoelectronic Interconnects
  • Y. Lee, Yulei Zhang
  • Engineering
    IEEE/OSA Journal of Optical Communications and Networking
  • 2010
Although a great deal of research has been carried out over the last decade in which many different approaches for devising optoelectronic interconnects have been proposed, more detailed analysis of
Hybrid spectral transform diagrams
  • E. Clarke, M. Fujita, W. Heinle
  • Computer Science
    Proceedings of ICICS, 1997 International Conference on Information, Communications and Signal Processing. Theme: Trends in Information Systems Engineering and Wireless Multimedia Communications (Cat.
  • 1997
A uniform algebraic framework for computing hybrid spectral transforms in an efficient manner is given, based on properties of the Kronecker product, which leads naturally to an algorithm for computing such transforms efficiently.
Universal Affine Classification of Boolean Functions
In this paper we advance a practical solution of the classification problem of Boolean functions by the affine group – the largest group of linear transformations of variables. We show that the
Spectral techniques in binary and multiple-valued switching theory. A review of results in the decade 1991-2000
This paper presents a tutorial review of spectral methods in switching and multiple-valued logic theory and the design of digital system in the last decade. The paper continues review work in this
Analysis of Decision Diagram based Methods for the Calculation of the Dyadic Autocorrelation
Methods for calculation of the logic autocorrelation of switching functions with an emphasis on their time complexity are discussed in a tutorial way and an experimental analysis of performances is performed.


The Theory of Autonomous Linear Sequential Networks
The relation of the theory developed in this paper to Huffman's description of linear sequence transducers in terms of the D operator is discussed, as well as unsolved problems and directions for further generalization.
The theory of counting techniques
It is natural to call two switching functions equivalent if one is the transform of the other under a transformation of rearrangement and inversion of the variables, whether the transformations are rearrangements of the input variables, inversions of them, or involve both.
On The Number of Symmetry Types of Boolean Functions of n Variables
  • D. Slepian
  • Mathematics
    Canadian Journal of Mathematics
  • 1953
In recent years Boolean Algebra has come to play a prominent role in the analysis and synthesis of switching circuits [1; 4]. One general synthesis problem in which this algebra has proved useful is
Digital Real-Time Spectral Analysis
Two digital machine organizations are suggested which use the fast Fourier transform algorithm for the cases of N (the number of samples analyzed) being a power of 2 and the case of N being the product of two integers.
A Correspondence Between Equivalence Classes of Switching Functions and Group Codes
The correspondence defined below was used to convert Slepian's tabulation of the number of equivalence classes of (m, r) group codes[1] into hitherto unpublished data of relevance to switching
On the number of classes of (n,k) switching networks
On the classification of Boolean functions
  • S. Golomb
  • Mathematics, Computer Science
    IRE Trans. Inf. Theory
  • 1959
Methods are described for determining the number of symmetry classes for functions of n variables, and for ascertaining whether or not two functions belong to the same class.
The application of counting techniques
The transformation is basic in the application of counting techniques, and so is worth investigating in some detail, and may be written xyz--~z,xy,.
Finite Automata and Their Decision Problems
Finite automata are considered as instruments for classifying finite tapes as well as generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.
The Interaction Algorithm and Practical Fourier Analysis: An Addendum
SUMMARY In the original paper it was misleadingly stated that the Yates algorithm is effectively self-inverse. This statement is here elucidated, and a numerical example is given. Attention is drawn