On Transformation of a Logical Circuit to a Circuit with NAND and NOR Gates Only
Abstract
In the paper we consider fast transformation of a
multilevel and multioutput circuit with AND, OR and NOT gates
into a functionally equivalent circuit with NAND and NOR gates.
The task can be solved by replacing AND and OR gates by
NAND or NOR gates, which in some cases requires introducing
the additional inverters or splitting the gates. In the paper the
quick approximation algorithms of the circuit transformation are
proposed, minimizing number of the inverters. The presented
algorithms allow transformation of any multilevel circuit into a
circuit being a combination of NOR gates, NAND gates or both
types of universal gates.
References
D. A. Pinelli, Fundamentals of Digital Logic Design With VLSI Circuit Applications, Prentice Hall, 1990.
M. M. Mano and Ch. R. Kime, Logic and Computer Design Fundamentals, 3rd ed. Prentice Hall, 2004.
S. Baranov, Logic and System Design of Digital Systems, Tallinn: TUT Press, 2008.
G. De Micheli, Synthesis and Optimization of Digital Circuits, McGraw-Hill, 1994.
A. Zakrevskij, Yu. Pottosin and L. Cheremisinova, Optimization in Boolean Space, Tallinn: TUT Press, 2009.
T. Luba, Synteza układow logicznych, Warszawa: WSISiZ, 2000.
M. Rawski, T. Luba, Z. Jachna, and P. Tomaszewicz, ”The influence of functional decomposition on modern digital design process.” in Design
of Embedded Control Systems. Springer-Verlag, 2005, pp. 193-204.
P. N. Bibilo, Decomposition of Boolean Functions by Means of Solving Logical Equations, Minsk: Belaruskaya Navuka, 2009.
G. Borowik, G. Labiak, and A. Bukowiec, ”FSM-based logic controller synthesis in programmable devices with embedded memory blocks.” in Innovative technologies in management and science. Cham Heidelberg :
Springer International Publishing Switzerland, 2015 - (Topics in Intelligent
Engineering and Informatics ; Vol. 10) - s. 123–151.
R. Diestel, Graph Theory, Springer-Verlag, 2000.
J. Guo, J. Gramm, F. H¨uffner, R. Niedermeier, and S. Wernicke, ”Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization”, Journal of Computer and System Sciences, vol. 72, 2006.
A. Avidor and M. Landberg, ”The multi-multiway cut problem”, Proceedings of 9th SWAT, LNCS, vol. 3111, Springer-Verlag, 2004, pp. 273-284.
F. T. Nobibon, C. A. J. Hurkens, R. Leus, and F. C. R. Spieksma, ”Coloring Graphs Using Two Colors while Avoiding Monochromatic Cycles”, Informs Journal on Computing, 6124(3), January 2010, pp. 229-
F. T. Nobibon, C. A. J. Hurkens, R. Leus, and F. C. R. Spieksma, ”Exact algorithms for coloring graphs while avoiding monochromatic cycles”, Proc. of 6th International Conference on Algorithmic Aspects in Information and Management, Weihai, China, July 2010, pp. 229-242.
P. Heggernes, P. Van ’T Hof, D. Lokshtanov, and Ch. Paul, ”Obtaining a Bipartite Graph by Contracting Few Edges”, SIAM Journal on Discrete Mathematics, vol. 27, issue 4, 2013, pp. 2143-2156.
Th. H. Cormen, Ch. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 3rd ed. MIT Press and McGraw-Hill, 2009.
M. Kubale (editor), Graph Colorings, Contemporary Mathematics, vol. 352, 2004.
Downloads
Published
Issue
Section
License
Copyright (c) 2018 International Journal of Electronics and Telecommunications
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
1. License
The non-commercial use of the article will be governed by the Creative Commons Attribution license as currently displayed on https://creativecommons.org/licenses/by/4.0/.
2. Author’s Warranties
The author warrants that the article is original, written by stated author/s, has not been published before, contains no unlawful statements, does not infringe the rights of others, is subject to copyright that is vested exclusively in the author and free of any third party rights, and that any necessary written permissions to quote from other sources have been obtained by the author/s. The undersigned also warrants that the manuscript (or its essential substance) has not been published other than as an abstract or doctorate thesis and has not been submitted for consideration elsewhere, for print, electronic or digital publication.
3. User Rights
Under the Creative Commons Attribution license, the author(s) and users are free to share (copy, distribute and transmit the contribution) under the following conditions: 1. they must attribute the contribution in the manner specified by the author or licensor, 2. they may alter, transform, or build upon this work, 3. they may use this contribution for commercial purposes.
4. Rights of Authors
Authors retain the following rights:
- copyright, and other proprietary rights relating to the article, such as patent rights,
- the right to use the substance of the article in own future works, including lectures and books,
- the right to reproduce the article for own purposes, provided the copies are not offered for sale,
- the right to self-archive the article
- the right to supervision over the integrity of the content of the work and its fair use.
5. Co-Authorship
If the article was prepared jointly with other authors, the signatory of this form warrants that he/she has been authorized by all co-authors to sign this agreement on their behalf, and agrees to inform his/her co-authors of the terms of this agreement.
6. Termination
This agreement can be terminated by the author or the Journal Owner upon two months’ notice where the other party has materially breached this agreement and failed to remedy such breach within a month of being given the terminating party’s notice requesting such breach to be remedied. No breach or violation of this agreement will cause this agreement or any license granted in it to terminate automatically or affect the definition of the Journal Owner. The author and the Journal Owner may agree to terminate this agreement at any time. This agreement or any license granted in it cannot be terminated otherwise than in accordance with this section 6. This License shall remain in effect throughout the term of copyright in the Work and may not be revoked without the express written consent of both parties.
7. Royalties
This agreement entitles the author to no royalties or other fees. To such extent as legally permissible, the author waives his or her right to collect royalties relative to the article in respect of any use of the article by the Journal Owner or its sublicensee.
8. Miscellaneous
The Journal Owner will publish the article (or have it published) in the Journal if the article’s editorial process is successfully completed and the Journal Owner or its sublicensee has become obligated to have the article published. Where such obligation depends on the payment of a fee, it shall not be deemed to exist until such time as that fee is paid. The Journal Owner may conform the article to a style of punctuation, spelling, capitalization and usage that it deems appropriate. The Journal Owner will be allowed to sublicense the rights that are licensed to it under this agreement. This agreement will be governed by the laws of Poland.
By signing this License, Author(s) warrant(s) that they have the full power to enter into this agreement. This License shall remain in effect throughout the term of copyright in the Work and may not be revoked without the express written consent of both parties.
