Cycle in a Conventional Combinational Circuit: A Comprehensive Survey

A Boolean Combinational circuit can be made of some wires and logic gates whose outputs at any time are determined directly from the present combination of inputs without any regard to previous input. Reduction of number of gates (area) and the length of the signal path (delay) to optimize a Boolean circuit is always an overriding concern in the design of digital integrated circuit. The accepted phenomena that combinational circuit is based only on acyclic (loop-free or feed-forward) topology no longer exist. Introducing cycles in combinational circuit we may have same acyclic operation with reduced area and delay of the circuit. Cyclic circuits that do not hold state or oscillate are often the most convenient representation for certain functions, such as arbiters. The main aim of cyclic circuit is to introduce structural feedback & to avoid the logical feedback in order to get combinational primary output. In this survey, we advocate the technological depth of cyclic circuit and their design methodologies with certain merits and demerits. It includes functional analysis i.e. to determine what values will appear and the timing analysis which determine when these values will appear.

[1]  Andreas Jakoby,et al.  On the Complexity of Worst Case and Expected Time in a Circuit , 1996, STACS.

[2]  D. Huffman COMBINATIONAL CIRCUITS WITH FEEDBACK , 1971 .

[3]  A. Mishchenko An Introduction to Zero-Suppressed Binary Decision Diagrams , 2001 .

[4]  Aaron D. Wyner,et al.  Reliable Circuits Using Less Reliable Relays , 1993 .

[5]  Michael Mendler,et al.  Ternary simulation: refinement of binary functions or abstraction of real-time behaviour? , 1996 .

[6]  R. Rao,et al.  An efficient combinationality check technique for the synthesis of cyclic combinational circuits , 2005, Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005..

[7]  Robert K. Brayton,et al.  MIS: A Multiple-Level Logic Optimization System , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  M. Morris Mano,et al.  Digital Logic and Computer Design , 1979 .

[9]  Aaron D. Wyner,et al.  Realization of All 16 Switching Functions of Two Variables Requires 18 ContactsBell Laboratories Memorandum, Nov. 17, 1953. , 1993 .

[10]  Ronald L. Rivest The Necessity of Feedback in Minimal Monotone Combinational Circuits , 1977, IEEE Transactions on Computers.

[11]  Leon Stok,et al.  False loops through resource sharing , 1992, ICCAD '92.

[12]  Peter L. Hammer,et al.  Discrete Applied Mathematics , 1993 .

[13]  C. Y. Lee Representation of switching circuits by binary-decision programs , 1959 .

[14]  Marc D. Riedel,et al.  Cyclic combinational circuits , 2004 .

[15]  Dieter Rautenbach,et al.  Delay optimization of linear depth boolean circuits with prescribed input arrival times , 2006, J. Discrete Algorithms.

[16]  Claude E. Shannon,et al.  The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..

[17]  John D. Backes,et al.  The analysis of cyclic circuits with Boolean satisfiability , 2008, 2008 IEEE/ACM International Conference on Computer-Aided Design.

[18]  Sharad Malik,et al.  Analysis of cyclic combinational circuits , 1993, ICCAD '93.

[19]  Sharad Malik,et al.  Test generation for cyclic combinational circuits , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[20]  William H. Kautz,et al.  The Necessity of Closed Circuit Loops in Minimal Combinational Circuits , 1970, IEEE Transactions on Computers.

[21]  Biswarup Mukherjee,et al.  Design of Combinational Circuits by Cyclic Combinational Method for Low Power VLSI , 2010, 2010 International Symposium on Electronic System Design.

[22]  Jehoshua Bruck,et al.  The synthesis of cyclic combinational circuits , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[23]  Jeffrey D. Smith,et al.  Design and Analysis of Algorithms , 2009, Lecture Notes in Computer Science.

[24]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[25]  Shin-ichi Minato,et al.  Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems , 1993, 30th ACM/IEEE Design Automation Conference.

[26]  Claude E. Shannon,et al.  A symbolic analysis of relay and switching circuits , 1938, Transactions of the American Institute of Electrical Engineers.

[27]  Jehoshua Bruck,et al.  Timing Analysis of Cyclic Combinational Circuits * , 2022 .

[28]  Thomas R. Shiple,et al.  Constructive analysis of cyclic circuits , 1996, Proceedings ED&TC European Design and Test Conference.

[29]  Stephen A. Edwards,et al.  Making cyclic circuits acyclic , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[30]  Robert K. Brayton,et al.  On breakable cyclic definitions , 2004, IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004..