On the public citation graph

Design automation tools for efficient implementation of logic functions by decomposition

0 signed · 97 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4613-2821-6openalex-snapshot
Logic Minimization Algorithms for VLSI Synthesis
inferredcites →https://doi.org/10.1016/0001-8708(77)90018-4openalex-snapshot
Finite orthogonal series in the design of digital devices
inferredcites →https://doi.org/10.1016/0045-7906(78)90036-8openalex-snapshot
The computation of complete and reduced sets of orthogonal spectral coefficients for logic design and pattern recognition purposes
inferredcites →https://doi.org/10.1016/0165-1684(85)90052-0openalex-snapshot
Spectral techniques in digital logic
inferredcites →https://doi.org/10.1016/b978-0-12-400060-5.x5001-0openalex-snapshot
Spectral Techniques and Fault Detection
inferredcites →https://doi.org/10.1016/b978-0-12-509850-2.50010-5openalex-snapshot
HARMONIC ANALYSIS OF SWITCHING FUNCTIONS
inferredcites →https://doi.org/10.1016/s0019-9958(77)90546-0openalex-snapshot
Harmonic analysis over finite commutative groups in linearization problems for systems of logical functions
inferredcites →https://doi.org/10.1016/s0019-9958(78)90599-5openalex-snapshot
Comments on a method of Karpovsky
inferredcites →https://doi.org/10.1109/29.103058openalex-snapshot
Fast Fourier transforms over finite groups by multiprocessor systems
inferredcites →https://doi.org/10.1109/29.1627openalex-snapshot
A new efficient algorithm to compute the two-dimensional discrete Fourier transform
inferredcites →https://doi.org/10.1109/iccad.1988.122483openalex-snapshot
A fast algorithm for the optimal state assignment of large finite state machines
inferredcites →https://doi.org/10.1109/t-c.1970.222903openalex-snapshot
An Algorithm for the Disjunctive Decomposition of Switching Functions
inferredcites →https://doi.org/10.1109/t-c.1971.223235openalex-snapshot
A Fast Algorithm for the Disjunctive Decomposition of Switching Functions
inferredcites →https://doi.org/10.1109/t-c.1972.223475openalex-snapshot
Easily Testable Realizations ror Logic Functions
inferredcites →https://doi.org/10.1109/t-c.1974.223776openalex-snapshot
Multiple-Fault Detection and Location in Fan-Out Free Combinational Circuits
inferredcites →https://doi.org/10.1109/tc.1981.1675757openalex-snapshot
An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits
inferredcites →https://doi.org/10.1109/tcad.1987.1270347openalex-snapshot
MIS: A Multiple-Level Logic Optimization System
inferredcites →https://doi.org/10.1145/321186.321202openalex-snapshot
Generalized Tree Circuit—The Basic Building Block of an Extended Decomposition Theory
inferredcites →https://doi.org/10.1515/freq.1985.39.5.131openalex-snapshot
Funktionale Komplexität und konkrete Information

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-0-387-89558-1_2openalex-snapshot
Use of Gray Decoding for Implementation of Symmetric Functions
inferred← citeshttps://doi.org/10.1007/978-1-4615-3154-8_10openalex-snapshot
Efficient Spectral Techniques for Logic Synthesis
inferred← citeshttps://doi.org/10.1007/978-1-4615-3154-8_12openalex-snapshot
Logic Synthesis with Exor Gates
inferred← citeshttps://doi.org/10.1007/978-3-7908-1840-6_8openalex-snapshot
Rough Set Methods for the Synthesis and Analysis of Concurrent Processes
inferred← citeshttps://doi.org/10.1007/978-94-015-7975-9_13openalex-snapshot
Rough Sets and Some Aspects of Logic Synthesis
inferred← citeshttps://doi.org/10.1007/s12095-019-0351-8openalex-snapshot
An iterative method for linear decomposition of index generating functions
inferred← citeshttps://doi.org/10.1016/0141-9331(94)90090-6openalex-snapshot
Multi-level logic synthesis based on decomposition
inferred← citeshttps://doi.org/10.1049/ip-cdt:19960466openalex-snapshot
Three-valued quasi-linear transformation for logic synthesis
inferred← citeshttps://doi.org/10.1049/ip-cdt:19971366openalex-snapshot
Predicting the complexity of large combinational circuits through symbolic spectral analysis of their functional specifications
inferred← citeshttps://doi.org/10.1049/ip-cdt:20020379openalex-snapshot
Functional complexity estimation for large combinational circuits
inferred← citeshttps://doi.org/10.1049/ip-e.1991.0011openalex-snapshot
Computation of Reed-Muller expansions of incompletely specified boolean functions from reduced representations
inferred← citeshttps://doi.org/10.1049/ip-vis:19982461openalex-snapshot
Family of generalised multi-polarity complex Hadamard transforms
inferred← citeshttps://doi.org/10.1080/00207219308907097openalex-snapshot
An efficient computer algorithm for the calculation of the Walsh transform for incompletely specified multiple-valued binary functions†
inferred← citeshttps://doi.org/10.1080/00207219308925860openalex-snapshot
Generalized Walsh transform and its interpretation for digital circuits
inferred← citeshttps://doi.org/10.1093/comjnl/47.2.245openalex-snapshot
On Generating Set Index Functions for Randomized Caches
inferred← citeshttps://doi.org/10.1109/12.403717openalex-snapshot
A multiple-valued Reed-Muller transform for incompletely specified functions
inferred← citeshttps://doi.org/10.1109/43.170986openalex-snapshot
Effective computer methods for the calculation of Rademacher-Walsh spectrum for completely and incompletely specified Boolean functions
inferred← citeshttps://doi.org/10.1109/43.248076openalex-snapshot
Synthesis of multilevel multiplexer circuits for incompletely specified multioutput Boolean functions with mapping to multiplexer based FPGA's
inferred← citeshttps://doi.org/10.1109/43.298033openalex-snapshot
EVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition
inferred← citeshttps://doi.org/10.1109/43.469660openalex-snapshot
Efficient calculation of spectral coefficients and their applications
inferred← citeshttps://doi.org/10.1109/43.845077openalex-snapshot
Linear sifting of decision diagrams and its application in synthesis
inferred← citeshttps://doi.org/10.1109/5.52213openalex-snapshot
Multilevel logic synthesis
inferred← citeshttps://doi.org/10.1109/aspdac.1998.669404openalex-snapshot
A heuristic algorithm to design AND-OR-EXOR three-level networks
inferred← citeshttps://doi.org/10.1109/aspdac.1998.669410openalex-snapshot
Function decomposition and synthesis using linear sifting
inferred← citeshttps://doi.org/10.1109/aspdac.2012.6165060openalex-snapshot
Linear decomposition of index generation functions
inferred← citeshttps://doi.org/10.1109/date.2001.915106openalex-snapshot
Spectral decision diagrams using graph transformations
inferred← citeshttps://doi.org/10.1109/ddecs.2007.4295284openalex-snapshot
Decomposition of Logic Functions in Reed-Muller Spectral Domain
inferred← citeshttps://doi.org/10.1109/dsd.2002.1115375openalex-snapshot
Use of the autocorrelation function in the classification of switching functions
inferred← citeshttps://doi.org/10.1109/dsd.2004.1333269openalex-snapshot
Efficient method of input variable partitioning in functional decomposition based on evolutionary algorithms
inferred← citeshttps://doi.org/10.1109/dsd.2004.43openalex-snapshot
Efficient method of input variable partitioning in functional decomposition based on evolutionary algorithms
inferred← citeshttps://doi.org/10.1109/eurdac.1992.246245openalex-snapshot
Calculation of the Rademacher-Walsh spectrum from a reduced representation of Boolean functions
inferred← citeshttps://doi.org/10.1109/eurdac.1995.527420openalex-snapshot
Predicting the functional complexity of combinational circuits by symbolic spectral analysis of Boolean functions
inferred← citeshttps://doi.org/10.1109/glsv.1995.516035openalex-snapshot
Using symbolic Rademacher-Walsh spectral transforms to evaluate the correlation between Boolean functions
inferred← citeshttps://doi.org/10.1109/iccd.1990.130256openalex-snapshot
On the estimation of logic complexity for design automation applications
inferred← citeshttps://doi.org/10.1109/iccd.1991.139928openalex-snapshot
An adaptive hardware machine architecture and compiler for dynamic processor reconfiguration
inferred← citeshttps://doi.org/10.1109/iscas.1992.229995openalex-snapshot
Generalized Walsh transforms of Boolean functions
inferred← citeshttps://doi.org/10.1109/iscas.1993.394068openalex-snapshot
An algorithm for the calculation of generalized Walsh transform of Boolean functions
inferred← citeshttps://doi.org/10.1109/iscas.1993.394069openalex-snapshot
Calculation of Rademacher-Walsh spectral coefficients for systems of completely and incompletely specified Boolean functions
inferred← citeshttps://doi.org/10.1109/iscas.1993.692993openalex-snapshot
An algorithm for the calculation of generalized walsh transform of Boolean functions
inferred← citeshttps://doi.org/10.1109/iscas.1993.692994openalex-snapshot
Calculation of rademacher-walsh spectral coefficients for systems of completely and incompletely specified boolean functions
inferred← citeshttps://doi.org/10.1109/ismvl.1990.122598openalex-snapshot
Walsh type transforms for completely and incompletely specified multiple-valued input binary functions
inferred← citeshttps://doi.org/10.1109/ismvl.1992.186818openalex-snapshot
Some remarks on Fourier transform and differential operators for digital functions
inferred← citeshttps://doi.org/10.1109/ismvl.1993.289571openalex-snapshot
A fast algorithm for the disjunctive decomposition of m-valued functions. I. The decomposition algorithm
inferred← citeshttps://doi.org/10.1109/ismvl.2005.19openalex-snapshot
Hardware to Compute Walsh Coefficients
inferred← citeshttps://doi.org/10.1109/ismvl.2011.17openalex-snapshot
Index Generation Functions: Recent Developments
inferred← citeshttps://doi.org/10.1109/ismvl.2013.12openalex-snapshot
An Application of Autocorrelation Functions to Find Linear Decompositions for Incompletely Specified Index Generation Functions
inferred← citeshttps://doi.org/10.1109/ismvl.2016.18openalex-snapshot
An Algebraic Approach to Reducing the Number of Variables of Incompletely Defined Discrete Functions
inferred← citeshttps://doi.org/10.1109/ismvl.2016.52openalex-snapshot
An Efficient Heuristic for Linear Decomposition of Index Generation Functions
inferred← citeshttps://doi.org/10.1109/ismvl.2017.22openalex-snapshot
Index Generation Functions: Minimization Methods
inferred← citeshttps://doi.org/10.1109/ismvl.2017.23openalex-snapshot
Algebraic and Combinatorial Methods for Reducing the Number of Variables of Partially Defined Discrete Functions
inferred← citeshttps://doi.org/10.1109/mwscas.1991.251939openalex-snapshot
An efficient computer algorithm for the calculation of Walsh transform for completely and incompletely specified multiple-valued input binary functions
inferred← citeshttps://doi.org/10.1109/tc.2007.70811openalex-snapshot
Reduction of Average Path Length in Binary Decision Diagrams by Spectral Methods
inferred← citeshttps://doi.org/10.1109/tcad.2003.816216openalex-snapshot
A fast algorithm for or-and-or synthesis
inferred← citeshttps://doi.org/10.1109/tcad.2003.818121openalex-snapshot
Synthesis of spp three-level logic networks using affine spaces
inferred← citeshttps://doi.org/10.1109/tcad.2008.923072openalex-snapshot
Logic Minimization and Testability of 2-SPP Networks
inferred← citeshttps://doi.org/10.1109/tcad.2010.2069290openalex-snapshot
Determining the Number of Paths in Decision Diagrams by Using Autocorrelation Coefficients
inferred← citeshttps://doi.org/10.1109/vlsisoc.2007.4402467openalex-snapshot
Use of gray decoding for implementation of symmetric functions
inferred← citeshttps://doi.org/10.1117/12.130993openalex-snapshot
Logic decomposition aimed at programmable cell arrays
inferred← citeshttps://doi.org/10.1134/s0005117911030118openalex-snapshot
Linearization of logical functions defined by a set of orthogonal terms. I. Theoretical aspects
inferred← citeshttps://doi.org/10.1134/s0005117911040126openalex-snapshot
Linearization of logical functions defined by a set of orthogonal terms. II. Algorithmic aspects
inferred← citeshttps://doi.org/10.1145/240518.240564openalex-snapshot
Synthesis by spectral translation using Boolean decision diagrams
inferred← citeshttps://doi.org/10.1145/505306.505344openalex-snapshot
Computing walsh, arithmetic, and reed-muller spectral decision diagrams using graph transformations
inferred← citeshttps://doi.org/10.1155/2000/95282openalex-snapshot
Spectral Interpretation and Applications of Decision Diagrams
inferred← citeshttps://doi.org/10.15598/aeee.v13i2.1117openalex-snapshot
Walsh Spectral Techniques for Logic Synthesis FPGA
inferred← citeshttps://doi.org/10.15760/etd.1151openalex-snapshot
Spectral Methods for Boolean and Multiple-Valued Input Logic Functions
inferred← citeshttps://doi.org/10.15760/etd.1338openalex-snapshot
Orthogonal and Nonorthogonal Expansions for Multi-Level Logic Synthesis for Nearly Linear Functions and their Application to Field Programmable Gate Array Mapping
inferred← citeshttps://doi.org/10.15760/etd.6031openalex-snapshot
An effective cube comparison method for discrete spectral transformations of logic functions
inferred← citeshttps://doi.org/10.15760/etd.6470openalex-snapshot
Investigation of Solution Space of Trees and DAGs for Realization of Combinational Logic in AT 6000 series FPGAs
inferred← citeshttps://doi.org/10.15760/etd.6582openalex-snapshot
A New Approach to the Decomposition of Incompletely Specified Functions Based on Graph Coloring and Local Transformation and Its Application to FPGA Mapping
inferred← citeshttps://doi.org/10.15760/etd.6638openalex-snapshot
Logic Synthesis with High Testability for Cellular Arrays
inferred← citeshttps://doi.org/10.2200/s00953ed1v01y201909dcs057openalex-snapshot
Index Generation Functions
inferred← citeshttps://doi.org/10.2298/fuee0703479kopenalex-snapshot
Linearization of multi-output logic functions by ordering of the autocorrelation values
inferred← citeshttps://doi.org/10.3103/s0146411608050064openalex-snapshot
Joint decomposition of Boolean functions on the basis of a solution of logic equations
inferred← citeshttps://doi.org/10.3233/fi-1996-283411openalex-snapshot
Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach
inferred← citeshttps://doi.org/10.3233/fi-2013-908openalex-snapshot
A Rough Set Approach to Information Systems Decomposition
inferred← citeshttps://doi.org/10.32657/10356/4188openalex-snapshot
Transforms and algorithms for spectral techniques in binary and multiple-valued logic
inferred← citeshttps://doi.org/10.5555/159754.161750openalex-snapshot
Calculation of the Rademacher-Walsh spectrum from a reduced representation of Boolean functions
inferred← citeshttps://doi.org/10.5555/367072.367860openalex-snapshot
Spectral decision diagrams using graph transformations
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.