Digital Circuits

Digital Circuits

Constructive analysis of a subject refers to the analysis through application of mathematical constructive principles while description of a subject brings out the distinct features the subject. Therefore, constructive analysis of digital circuits will similarly involve constructive mathematic principles while describing the creativity and innovation applied in their development. Digital circuits are of two types depending on their ability to store memory. Combinational circuits lack the potential to hold memory and therefore their outputs generally depend on only the recent values availed to the inputs (Neiroukh, 2008). A sequential circuit on the other hand is able to store items of details and therefore its output entirely depends on the recent and previous input values. It is therefore important to note that in most cases combinational circuits are not cyclic and the input information (values) only transmit forward to establish the output values while sequential circuits are cyclic and it is possible for the input values to propagate back and forth and affect the out values differently (Madigan, 2001). This research paper paints out the uses of a digital circuit that has surfaced because of recent creativity, the innovations behind its development, how the innovations have turned out, and a description of the circuits while in action.

The output values of a combinational circuit are therefore constant despite of the previous values in the wires and thus, traditionally, combinational circuits were present in asynchronous modes (Madigan, 2001). This is especially because regardless of the preliminary values of the wires, the moment input values are in place then the signal only disseminates towards the outputs. Through creative manipulation however, an acyclic circuit (combinational circuit) can function as a cyclic circuit (sequential circuit) since the only difference in the two circuits is the arrangement and the number of wire loops present. Sequential circuits (cyclic circuits) can as well, through manipulation function as combinational circuits (acyclic circuits) by reducing the loops and rearranging wire positions (Huang, 2007).

Since sequential circuits are able to store information their performance is also relatively dependent to other external factors such as time especially because its electrical behavior is of high energy than the acyclic circuit (Huang, 2007). It is therefore due to the feature of time dependent that makes the circuit unstable than an acyclic circuit as in case of an oscillator. The instability in cyclic circuits is especially because the state of current to depend on the previous cycle of the inputs. Although theoretically some researchers state that combinational circuits must have acyclic designs (lack loops), that has been proved negative by resent innovations. These innovations satisfy that a combinational circuit with cyclic wire arrangements can register constant output values regardless of preceding values on the wires or any discontinuity in the cycle (Mischenko, 2004).

In conclusion, it is evident that there are two distinctive types of digital circuits with the classification mainly depending on the ability to store information (Mischenko, 2004). This grouping has developed two divergent types of circuits, sequential circuits (cyclical circuits) and combinational circuits (acyclical circuits). Combinational circuits do not store information and thus the output values are entirely dependent on the resent input values while a sequential circuit has output values that depend on the recent and the previous input values. Through innovation and creativity however, it is possible for a combinational circuit to function as a sequential circuit and a sequential circuit to function as a combinational circuit (Malay, 2002).

References.

Malay, K. (2002). Combining strengths of circuit-based and CNF-based algorithms

For a high-performance SAT solver. California: Cengage learning.

Mischenko, A. (2004). On breakable cyclic definitions. In International Conference on Computer-Aided Design. New Jersey: John Wiley and Sons publishers.

Huang, Y. (2007). Scalable exploration of functional dependency by interpolation and incremental SAT solutions. Amazon: Academic Learners.

Madigan, Y. (2001) Chaff: Engineering an efficient SAT solver. In Design Automation

Conference. California: Cengage Learning.

Neiroukh, S. (2008). Transforming cyclic circuits into acyclic equivalents. California: University of California.