Uneingeschränkter Zugang

Stability of the 4-2 Binary Addition Circuit Cells. Part I

   | 20. März 2009

Zitieren

[1] Grzegorz Bancerek. König's theorem. Formalized Mathematics, 1(3):589-593, 1990.Search in Google Scholar

[2] Grzegorz Bancerek and Yatsuka Nakamura. Full adder circuit. Part I. Formalized Mathematics, 5(3):367-380, 1996.Search in Google Scholar

[3] Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.Search in Google Scholar

[4] Yatsuka Nakamura and Grzegorz Bancerek. Combining of circuits. Formalized Mathematics, 5(2):283-295, 1996.Search in Google Scholar

[5] Yatsuka Nakamura, Piotr Rudnicki, Andrzej Trybulec, and Pauline N. Kawamoto. Introduction to circuits, II. Formalized Mathematics, 5(2):273-278, 1996.Search in Google Scholar

[6] Yatsuka Nakamura, Piotr Rudnicki, Andrzej Trybulec, and Pauline N. Kawamoto. Preliminaries to circuits, II. Formalized Mathematics, 5(2):215-220, 1996.Search in Google Scholar

[7] Takaya Nishiyama and Yasuho Mizuhara. Binary arithmetics. Formalized Mathematics, 4(1):83-86, 1993.Search in Google Scholar

[8] Andrzej Trybulec. Enumerated sets. Formalized Mathematics, 1(1):25-34, 1990.Search in Google Scholar

[9] Andrzej Trybulec. Many sorted algebras. Formalized Mathematics, 5(1):37-42, 1996.Search in Google Scholar

[10] Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.Search in Google Scholar

[11] E. Jean Vuillemin. A very fast multiplication algorithm for VLSI implementation, integration. The VLSI Journal, 1(1):39-52, 1983.10.1016/0167-9260(83)90005-6Search in Google Scholar

[12] Katsumi Wasaki and Pauline N. Kawamoto. 2's complement circuit. Formalized Mathematics, 6(2):189-197, 1997.Search in Google Scholar

[13] Edmund Woronowicz. Many-argument relations. Formalized Mathematics, 1(4):733-737, 1990.Search in Google Scholar

[14] Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73-83, 1990.Search in Google Scholar

[15] Shin'nosuke Yamaguchi, Katsumi Wasaki, and Nobuhiro Shimoi. Generalized full adder circuits (GFAs). Part I. Formalized Mathematics, 13(4):549-571, 2005.Search in Google Scholar

eISSN:
1898-9934
ISSN:
1426-2630
Sprache:
Englisch
Zeitrahmen der Veröffentlichung:
4 Hefte pro Jahr
Fachgebiete der Zeitschrift:
Informatik, andere, Mathematik, Allgemeines