Design automation tools for efficient implementation of logic functions by decomposition
Authors:
- D. VarmaDVD. Varma
- E.A. TrachtenbergETE.A. Trachtenberg
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 8 (8) , 901-916
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- A new efficient algorithm to compute the two-dimensional discrete Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1988
- Logic Minimization Algorithms for VLSI Synthesis1984
- An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic CircuitsIEEE Transactions on Computers, 1981
- Comments on a method of KarpovskyInformation and Control, 1978
- The computation of complete and reduced sets of orthogonal spectral coefficients for logic design and pattern recognition purposesComputers and Electrical Engineering, 1978
- Harmonic analysis over finite commutative groups in linearization problems for systems of logical functionsInformation and Control, 1977
- Multiple-Fault Detection and Location in Fan-Out Free Combinational CircuitsIEEE Transactions on Computers, 1974
- Easily Testable Realizations ror Logic FunctionsIEEE Transactions on Computers, 1972
- HARMONIC ANALYSIS OF SWITCHING FUNCTIONS1971
- An Algorithm for the Disjunctive Decomposition of Switching FunctionsIEEE Transactions on Computers, 1970