combinational circuit

(redirected from combinational circuits)

combinational circuit

[‚käm·bə′nā·shən·əl ′sər·kət]
(electronics)
A switching circuit whose outputs are determined only by the concurrent inputs.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
References in periodicals archive ?
After completing the state transition table, the combinational circuits for each DFF data input is derived and an implementation with off-the-shelf components is obtained (0).
We just explain how this design avoids the glitches which may occur at the input node from the preceding combinational circuits.
Sensitive transistors are protected in [7] based on duplicating and sizing a subset of transistors necessary for soft error tolerance in combinational circuits. In [8], Ruano et al.
To achieve additional acceleration in generally slower reconfigurable logic: a) high-level parallelism has to be used enabling hundreds of operations needed in software programs to be executed at the same time; b) the depth of combinational circuits implemented in the PL cannot be large because deep circuits involve extensive combinational path delays.
As shown in Figure 17, on average, the HT detection rate on sequential circuit is higher than that in combinational circuits. The HT detection of s1488 and sl196 is close to 1.
All-optical combinational circuits are required for managing of the contentions and the switch control in a node of an optical packed switched network.
Lombardi, "Modeling QCA defects at molecular-level in combinational circuits," in Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (DFT '05), pp.
Miller, "Evolutionary Approach to Design Multiple-Valued Combinational Circuits," Proc.
A similar pattern-related fault modelling approach, called functional fault model, was proposed earlier in [15] for the module-level fault diagnosis in combinational circuits based on solving systems of Boolean differential equations.
The text has been designed to be used in a two semester sequence, with chapters on number systems and codes; switching algebra and its applications; minimization of switching functions; logic design; multi-level logic synthesis; threshold logic for nanotechnologies; testing of combinational circuits; synchronous sequential circuits and iterative networks; capabilities, minimization, and transformation of sequential machines; memory, definiteness, and information losslessness of finite automata; linear sequence machines; and finite-state recognizers serving a second semester on finite automata theory.
In this work is presented new multilevel multi-resource partitioning algorithm for partitioning large combinational circuits in order to efficiently use existing and commercially available FPGAs packages.