# C-element

In digital computing, the Muller C-element (C-gate, hysteresis flip-flop, coincident flip-flop, or two-hand safety circuit) is a small binary logic circuit widely used in design of asynchronous circuits and systems. It outputs 0 when all inputs are 0, it outputs 1 when all inputs are 1, and it retains its output state otherwise. It was specified formally in 1955 by David E. Muller[3] and first used in ILLIAC II computer.[4] In terms of the theory of lattices, the C-element is a semimodular distributive circuit, whose operation in time is described by a Hasse diagram.[5][6][7][8] The C-element is closely related to the rendezvous[9] and join[10] elements, where an input is not allowed to change twice in succession. In some cases, when relations between delays are known, the C-element can be realized as a sum-of-product (SOP) circuit.[11][12] Earlier techniques for implementing the C-element[13][14] include Schmitt trigger,[15] Eccles-Jordan flip-flop and last moving point flip-flop.

## Truth table and delay assumptions

For two input signals the C-element is defined by the equation ${\displaystyle y_{n}=x_{1}x_{2}+(x_{1}+x_{2})y_{n-1}}$, which corresponds to the following truth table:

${\displaystyle x_{1}}$ ${\displaystyle x_{2}}$ ${\displaystyle y_{n}}$
0 0 0
0 1 ${\displaystyle y_{n-1}}$
1 0 ${\displaystyle y_{n-1}}$
1 1 1

This table can be turned into a circuit using the Karnaugh map. However, the obtained implementation is naive, since nothing is said about delay assumptions. To understand under what conditions the obtained circuit is workable, it is necessary to do additional analysis, which reveals that

• delay1 is a propagation delay from node 1 via environment to node 3,
• delay2 is a propagation delay from node 1 via internal feedback to node 3,
• delay1 must be greater than delay2.

Thus, the naive implementation is correct only for slow environment.[16]

## Implementations of the C-element

Depending on the requirements to the switching speed and power consumption, the C-element can be realized as a coarse- or fine-grain circuit. Also, one should distinguish between single-output and dual-rail[17] realizations of C-element. A dual-rail C-element can be realized on 2-input NANDs (NORs) only.[18] A single-output realization is workable if and only if:[19]

1. The circuit, where each input of a C-element is connected through a separate inverter to its output, is semimodular relatively to the state, where all the inverters are excited.
2. This state is live for the output gate of C-element.

### Static and semistatic implementations

In his report[3] Muller proposed to realize C-element as a majority gate with feedback. However, to avoid hazards linked with skews of internal delays, the majority gate must have as small number of transistors as possible.[27][28] Generally, C-elements with different timing assumptions[29] can be built on AND-OR-Invert (AOI)[30][31] or its dual, OR-AND-Invert (OAI) gate[32][33] and inverter. Yet another option patented by Varshavsky et al.[34] [35] is to shunt the input signals when they are not equal each other. Being very simple, these realizations dissipate more power due to the short-circuits. Connecting an additional majority gate to the inverted output of C-element, we obtain inclusive OR (EDLINCOR) function:[36][37] ${\displaystyle z_{n}=x_{1}x_{2}+(x_{1}+x_{2}){\overline {y_{n}}}}$. Some simple asynchronous circuits like pulse distributors[38] can be built solely on majority gates.

Semistatic C-element stores its previous state using two cross-coupled inverters, similar to an SRAM cell. One of the inverters is weaker than the rest of the circuit, so it can be overpowered by the pull-up and pull-down networks. If both inputs are 0, then the pull-up network changes the latch's state, and the C-element outputs a 0. If both inputs are 1, then the pull-down network changes the latch's state, making the C-element output a 1. Otherwise, the input of the latch is not connected to either ${\displaystyle V_{\text{dd}}}$ or ground, and so the weak inverter dominates and the latch outputs its previous state. There are also versions of semistatic C-element built on devices with negative differential resistance (NDR).[39][40] NDR is usually defined for small signal, so it is difficult to expect that such a C-element will operate in full range of voltages or currents.[original research?]

### Gate-level implementations

There is a number of different single-output circuits of C-element built on logic gates.[42][43] In particular, the so-called Maevsky's implementation [44][45][46] is a semimodular, but non-distributive (OR-causal) circuit loosely based on.[47] The NAND3 gate in this circuit can be replaced by two NAND2 gates. Note that Maevsky's C-element is actually a Join element, whose input signals cannot switch twice.[44] Yet another circuit with OR-causality, which operates as a Join element.[48] A realization of C-element on two-input gates only has been proposed by Tsirlin [49] and then synthesized by Starodoubtsev et al. using Taxogram language[50] This circuit coincides with that attributed to Bartky ,[1][44] and can operate without the input latch. Note that both the Maevsky and Tsirlin circuits are based actually on so-called David cell.[51] Its fast transistor-level implementation is used in the semistatic C-element proposed.[52] Yet another semistatic circuit using pass transistors (actually MUX 2:1) has been proposed.[53] Yet another version of the C-element built on two SR-latches has been synthesized by Murphy[54] using Petrify tool. However, this circuit includes inverter connected to one of the inputs. This inverter should have small delay. However, there are realizations of RS latches that already have one inverted input, for example.[55] Some speed-independent approaches[56][57] assume that zero-delay input inverters are available on all gates, which is a violation of true speed-independence but is fairly safe in practice. Other examples of using this assumption also exist.[58]

### Non-transistor implementations

Other technologies suitable for realizing asynchronous primitives including C-element, are: carbon nanotubes,[citation needed] single-electron tunneling devices,[59] quantum dots,[60] and molecular nanotechnology.[61]

### Generalization for multiple-valued logic

The definition of C-element can be generalized for multiple-valued logic,[7][62][63] or even for continuous signals:

${\displaystyle {\text{ if }}x_{1}=x_{2}=...=x_{m},{\text{ then }}y_{n}={\text{any}}(x_{1},x_{2},...,x_{m}),{\text{ else }}y_{n}=y_{n-1}.}$

For example, the truth table for a balanced ternary C-element with two inputs is

${\displaystyle x_{1}}$ ${\displaystyle x_{2}}$ ${\displaystyle y_{n}}$
−1 −1 −1
−1 0 ${\displaystyle y_{n-1}}$
−1 1 ${\displaystyle y_{n-1}}$
0 −1 ${\displaystyle y_{n-1}}$
0 0 0
0 1 ${\displaystyle y_{n-1}}$
1 −1 ${\displaystyle y_{n-1}}$
1 0 ${\displaystyle y_{n-1}}$
1 1 1

Since the majority gate is a particular case of threshold gate, any of known realizations of threshold gate[64] can in principle be used for building a C-element. In the multiple-valued case, however, connecting the output of majority gate to one or several inputs may have no desirable effect. For example, using the ternary majority function defined as[65]

${\displaystyle y={\begin{cases}+1&{\text{if}}\ x_{1}+x_{2}+x_{3}\geqslant +1,\\0&{\text{if}}\ x_{1}+x_{2}+x_{3}=0,\\-1&{\text{if}}\ x_{1}+x_{2}+x_{3}\leqslant -1\end{cases}}}$

does not lead to the ternary C-element specified by the truth table, if the sum ${\displaystyle x_{1}+x_{2}+x_{3}}$ is not split into pairs. However, even without such a splitting two ternary majority functions are suitable for building a ternary inclusive OR gate.

## References

1. ^ a b I. Kimura, "Extensions of asynchronous circuits and the delay problem. Part II: Spike-free extensions and the delay problem of the second kind," Journal of Computer and System Sciences, vol. 5, no. 2, pp. 129-162, 1971.
2. ^ A. Kushnerov and S. Bystrov, "Signal transition graphs for asynchronous data path circuits," Modeling and Analysis of Information Systems, vol. 30, no. 2, pp. 170-186, 2023.
3. ^ a b D. E. Muller, Theory of asynchronous circuits. Report no. 66, Digital Computer Laboratory, University of Illinois at Urbana-Champaign, 1955.
4. ^ H. C. Breadley, "ILLIAC II — A short description and annotated bibliography", IEEE Transactions on Electronic Computers, vol. EC-14, no. 3, pp. 399–403, 1965.
5. ^ D. E. Muller and W. S. Bartky, "A theory of asynchronous circuits", Int. Symposium on the Switching Theory in Harvard University, pp. 204–243, 1959.
6. ^ W. J. Poppelbaum, Introduction to the Theory of Digital Machines. Math., E.E. 294 Lecture Notes, University of Illinois at Urbana-Champaign.
7. ^ a b I. Kimura, "A comparison between two mathematical models of asynchronous circuits," Science Reports of the Tokyo Kyoiku Daigaku, Section A 10, no. 232/248, 1969, pp. 109-123.
8. ^ J. Gunawardena, "A generalized event structure for the Muller unfolding of a safe net", Int. Conference on Concurrency Theory (CONCUR) 1993, pp. 278–292.
9. ^ M. J. Stucki, S. M. Ornstein, W. A. Clark, "Logical design of macromodules", in Proceedings of AFIPS 1967, pp. 357–364.
10. ^ J. C. Ebergen, J. Segers, I. Benko, "Parallel Program and Asynchronous Circuit Design", Workshops in Computing, pp. 50–103, 1995.
11. ^ P.A. Beerel, J.R. Burch and T.H. Meng,"Checking combinational equivalence of speed-independent circuits," Formal Methods in System Design, vol. 13, no. 1, pp. 37-85, 1998.
12. ^ H. Park, A. He, M. Roncken and X. Song, "Semi-modular delay model revisited in context of relative timing", IET Electronics Letters, vol. 51, no. 4, pp. 332–334, 2015.
13. ^ Technical Progress Report, Jan. 1959, University of Illinois at Urbana-Champaign.
14. ^ W . J. Poppellbaum, N. E. Wiseman, "Circuit design for the new Illinois computer", Report no. 90, University of Illinois at Urbana-Champaign, 1959.
15. ^ N. P. Singh, A design methodology for self-timed systems. MSc thesis, MIT, 1981, 98 p.
16. ^ J. Cortadella, M. Kishinevsky, Tutorial: Synthesis of control circuits from STG specifications. Summer school, Lyngby, 1997.
17. ^ A. Mokhov, V. Khomenko, D. Sokolov and A. Yakovlev, "On dual-rail control logic for enhanced circuit robustness", IEEE Int. Conference on Application of Concurrency to System Design (ACSD) 2012, pp. 112–121.
18. ^ a b V. Varshavskiy, M. Kishinevskiy, V. Marakhovskiy, L. Rozenblyum, "Functional completeness in the class of semimodular circuits," Soviet Journal of Computer and Systems Sciences, vol. 23, no. 6, pp. 70-80, 1985.
19. ^ B. S. Tsirlin, "A Survey of Equivalent Problems of Realizing Circuits in the AND-NOT Basis that are Speed-Independent", Soviet Journal of Computer and Systems Sciences, vol. 24, 1986, pp. 58–69 (Б. С. Цирлин, "Обзор эквивалентных проблем реализации схем в базисе И-НЕ, не зависящих от скорости", Изв. АН СССР, Техническая кибернетика, №2, 1986, с. 159–171).
20. ^ I. E. Sutherland, "Micropipelines", Communications of the ACM, vol. 32, no. 6, pp. 720–738, 1989.
21. ^ C. H. van Berkel, "Beware the isochronic fork", Report UR 003/91, Philips Research Laboratories, 1991.
22. ^ V. B. Marakhovsky, Logic design of asynchronous circuits. Slides on the course. CS&SE Department, SPbPU.
23. ^ V. I. Varshavsky, N. M. Kravchenko, V. B. Marakhovsky, B. S. Tsirlin, "H flip-flop", USSR author's certificate SU1562964, Jul. 5, 1990.
24. ^ V. I. Varshavsky, "β-driven threshold elements", IEEE Great Lakes Symposium on VLSI 1998, pp. 52–58.
25. ^ V. I. Varshavsky, "Threshold element and method of designing the same," Patent US6338157, Jan. 8, 2002.
26. ^ Y. A. Stepchenkov, Y. G. Dyachenko, A. N. Denisov, Y. P. Fomin, "H flip-flop", Patent RU2371842, Oct. 27, 2009.
27. ^ D. Hampel, K. Prost, and N. Scheingberg, "Threshold logic using complementary MOS device", Patent US3900742, Aug. 19, 1975.
28. ^ D. Doman, Engineering the CMOS Library: Enhancing Digital Design Kits for Competitive Silicon Archived 2015-10-08 at the Wayback Machine. Wiley, 2012, 327 p.
29. ^ K. S. Stevens, R. Ginosar and S. Rotem, "Relative timing [asynchronous design]", IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 11, no. 1, pp. 129–140, 2003.
30. ^ H. Zemanek, "Sequentielle asynchrone Logik", Elektronische Rechenanlagen, vol. 4, no. 6, pp. 248–253, 1962. Also available in Russian as Г. Цеманек, "Последовательная асинхронная логика", Mеждународный симпозиум ИФАК Теория конечных и вероятностных автоматов 1962, с. 232—245.
31. ^ W. Fleischhammer, "Improvements in or relating to asynchronous bistable trigger circuits", UK patent specification GB1199698, Jul. 22, 1970.
32. ^ T.-Y. Wuu and S. B. K. Vrudhula, "A design of a fast and area efficient multi-input Muller C-element", IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 1, no. 2, pp. 215–219, 1993.
33. ^ H. K. O. Berge, A. Hasanbegovic, S. Aunet, "Muller C-elements based on minority-3 functions for ultra low voltage supplies", IEEE Int. Symposium on Design and Diagnostics of Electronic Circuits & Systems (DDECS) 2011, pp. 195–200.
34. ^ V. I. Varshavsky, A. Y. Kondratyev, N. M. Kravchenko, and B. S. Tsirlin, "H flip-flop", USSR Author's certificate SU1411934 Jul. 23, 1988.
35. ^ V. I. Varshavsky, N. M. Kravchenko, V. B. Marakhovsky and B. S. Tsirlin, "H flip-flop", USSR Author's certificate SU1443137, Dec. 7, 1988.
36. ^ D. A. Pucknell, "Event-driven logic (EDL) approach to digital systems representation and related design processes", IEE Proceedings E, Computers and Digital Techniques, vol. 140, no. 2, pp. 119—126, 1993.
37. ^ A. Yakovlev, M. Kishinevsky, A. Kondratyev, L. Lavagno, M. Pietkiewicz-Koutny, "On the models for asynchronous circuit behaviour with OR causality", Formal Methods in System Design, vol. 9, no. 3, pp. 189—233. 1996.
38. ^ J. C. Nelson, Speed-independent counting circuits. Report no. 71, Digital Computer Laboratory, University of Illinois at Urbana-Champaign, 1956.
39. ^ C.-H. Lin, K. Yang, A. F. Gonzalez, J. R. East, P. Mazumder, G. I. Haddad, "InP-based high speed digital logic gates using an RTD/HBT heterostructure", Int. Conference on Indium Phosphide and Related Materials (IPRM) 1999, pp. 419–422.
40. ^ P. Glosekotter, C. Pacha, K. F. Goser, W. Prost, S. Kim, H. van Husen, et al., "Asynchronous circuit design based on the RTBT monostable-bistable logic transition element (MOBILE)", Symposium Integrated Circuits and Systems Design 2002, pp. 365–370.
41. ^ A. Bystrov, A. Yakovlev, Asynchronous circuit synthesis by direct mapping: Interfacing to environment. Technical Report, CS Department, University of Newcastle upon Tyne, October 2001.
42. ^ B. S. Tsirlin, "H flip-flop", USSR author's certificate SU1096759, Jun. 7, 1984.
43. ^ B. S. Tsirlin, "Multiple input H flip-flop", USSR author's certificate SU1162019, Jun. 15, 1985.
44. ^ a b c M. Kuwako, T. Nanya, "Timing-reliability evaluation of asynchronous circuits based on different delay models", IEEE Int. Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC) 1994, pp. 22–31.
45. ^ J. A. Brzozowski, K. Raahemifar, "Testing C-elements is not elementary", Working Conference on Asynchronous Design Methodologies (ASYNC) 1995, pp. 150–159.
46. ^ P. A. Beerel, J. R. Burch, T. H. Meng, "Checking combinational equivalence of speed-independent circuits", Formal Methods in System Design, vol. 13, no. 1, 1998, pp. 37–85.
47. ^ V. I. Varshavsky, O. V. Maevsky, Yu. V. Mamrukov, B. S. Tsirlin, "H flip-flop", USSR author's certificate SU1081801, Mar. 23, 1984
48. ^ G. S. Brailovsky, L. Ya. Rozenblyum, B. S. Tsirlin, "H-flip-flop", USSR author's certificate SU1432733, Oct. 23, 1988.
49. ^ B. S. Tsirlin, "H-flip-flop", USSR author's certificate SU1324106, Jul. 15, 1987.
50. ^ N. A. Starodoubtsev, S. A. Bystrov, "Monotonic behavior refinement for synthesis of two-input-gate asynchronous circuits", IEEE Int. Midwest Symposium on Circuits and Systems (MWSCAS) 2004, vol. I, pp. I-521–524.
51. ^ M. Courvoisier and P. Azema, "Asynchronous sequential machines with request/acknowledge operating mode," IEE Electronics Letters, Vol. 10, no. 1, pp.8-10, 1974.
52. ^ S. M. Fairbanks, "Two-stage Muller C-element", United States Patent US6281707, Aug. 28, 2001.
53. ^ A. Morgenshtein, M. Moreinis, R. Ginosar, "Asynchronous gate-diffusion-input (GDI) circuits", IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 12, no. 8, pp. 847–856, 2004.
54. ^ J. P. Murphy, "Design of latch-based C-element", Electronics Letters, vol. 48, no. 19, 2012, pp. 1190–1191.
55. ^ V. A. Maksimov and Ya. Ya. Petrichkovich "RS flip-flop," USSR author's certificate SU1164867, Jun. 30, 1985.
56. ^ P. Beerel and T. H.-Y. Meng. "Automatic gate-level synthesis of speed-independent circuits", IEEE/ACM Int. Conference on Computer-Aided Design (ICCAD) 1992, pp. 581–587.
57. ^ A. Kondratyev, M. Kishinevsky, B. Lin, P. Vanbekbergen, and A. Yakovlev, "Basic gate implementation of speed-independent circuits", ACM Design Automation Conference (DAC) 1994, pp. 56–62.
58. ^ A. V. Yakovlev, A. M. Koelmans, A. Semenov, D. J. Kinniment, "Modelling, analysis and synthesis of asynchronous control circuits using Petri nets", Integration, the VLSI Journal, vol. 21, no. 3, pp. 143—170, 1996.
59. ^ S. Safiruddin, S. D. Cotofana, "Building blocks for delay-insensitive circuits using single electron tunneling devices", IEEE Conference on Nanotechnology 2007, pp. 704–708.
60. ^ V. I. Varshavsky, "Logic design and quantum challenge", Int. Workshop on Physics and Computer Modeling of Devices Based on Low-Dimensional Structures 1995, pp. 134–146.
61. ^ A. J. Martin, P. Prakash, "Asynchronous nano-electronics: Preliminary investigation" Archived 2016-03-04 at the Wayback Machine, IEEE Int. Symposium on Asynchronous Circuits and Systems (ASYNC) 2008, pp. 58–68.
62. ^ J. M. Johnson, Theory and Application of Self-Timed Integrated Systems Using Ternary Logic Elements. PhD thesis. University of California, Santa Barbara. 1989.
63. ^ H. Sato, Completeness on Multiple-Valued Logical Functions Realized by Asynchronous Sequential Circuits. PhD thesis, Gakushuin University, 1996.
64. ^ V. Beiu, J. M. Quintana, M. J. Avedillo, "VLSI implementations of threshold logic – A comprehensive survey", IEEE Transactions on Neural Networks, vol. 14, no. 5, pp. 1217–1243, 2003.
65. ^ V. Varshavsky, B. Ovsievich, "Networks composed of ternary majority elements", IEEE Transactions on Electronic Computers, vol. EC-14, no. 5, pp. 730–733, 1965.