Stability of the 7-3 Compressor Circuit for Wallace Tree. Part I

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

[2] Grzegorz Bancerek, Czesław Byliński, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, Karol Pąk, and Josef Urban. Mizar: State-of-the-art and beyond. In Manfred Kerber, Jacques Carette, Cezary Kaliszyk, Florian Rabe, and Volker Sorge, editors, Intelligent Computer Mathematics, volume 9150 of Lecture Notes in Computer Science, pages 261–279. Springer International Publishing, 2015. ISBN 978-3-319-20614-1. doi:10.1007/978-3-319-20615-8_17.10.1007/978-3-319-20615-8_17Search in Google Scholar

[3] Grzegorz Bancerek, Czesław Byliński, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, and Karol Pąk. The role of the Mizar Mathematical Library for interactive proof development in Mizar. Journal of Automated Reasoning, 61(1):9–32, 2018. doi:10.1007/s10817-017-9440-6.10.1007/s10817-017-9440-6Search in Google Scholar

[4] Adam Grabowski, Artur Korniłowicz, and Adam Naumowicz. Four decades of Mizar. Journal of Automated Reasoning, 55(3):191–198, 2015. doi:10.1007/s10817-015-9345-1.10.1007/s10817-015-9345-1Search in Google Scholar

[5] Naoki Iwasaki and Katsumi Wasaki. A meta hardware description language melasy for model-checking systems. In Proceedings 5th International Conference on Information Technology: New Generations (ITNG 2008), pages 273–278, 2008. doi:10.1109/ITNG.2008.135.10.1109/ITNG.2008.135Search in Google Scholar

[6] Mayur Mehta, Vijay Parmar, and Earl Swartzlander. High-speed multiplier design using multi-input counter and compressor circuits. In Proceedings 10th IEEE Symposium on Computer Arithmetic, pages 43–50, June 1991. doi:10.1109/ARITH.1991.145532.10.1109/ARITH.1991.145532Search in Google Scholar

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

[8] Yatsuka Nakamura, Piotr Rudnicki, Andrzej Trybulec, and Pauline N. Kawamoto. Introduction to circuits, I. Formalized Mathematics, 5(2):227–232, 1996.Search in Google Scholar

[9] 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

[10] Jean Vuillemin. A very fast multiplication algorithm for VLSI implementation. Integration, 1(1):39–52, 1983. doi:10.1016/0167-9260(83)90005-6.10.1016/0167-9260(83)90005-6Search in Google Scholar

[11] Christopher Stewart Wallace. A suggestion for a fast multiplier. IEEE Transactions on Electronic Computers, EC-13(1):14–17, 1964. doi:10.1109/PGEC.1964.263830.10.1109/PGEC.1964.263830Search in Google Scholar

[12] Katsumi Wasaki. Stability of the 4-2 binary addition circuit cells. Part I. Formalized Mathematics, 16(4):377–387, 2008. doi:10.2478/v10037-008-0046-7.10.2478/v10037-008-0046-7Search in Google Scholar

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

[14] 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