World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

Logic Design Using Modules and Nonlinear Integer Programming by:1 (Source: Crossref)

    Using logic gates is the traditional way of designing logic circuits. However, in many cases, the use of modules is advantageous as the module is considered a uniform structure composed of multiple gates. In this paper, a nonlinear approach is proposed for designing logic circuits for use as modules multiplexers (MUXs) or Reed–Muller universal blocks (RMs). The experimental results show that the method gives better results compared to other methods available in the literature. The main advantages of the method are that it guarantees minimality and it can also handle Boolean functions for incompletely specified functions. The method is general enough and can be used for any kind of modules.

    This paper was recommended by Regional Editor Emre Salman.


    • 1. T. Sasao , Switching Theory for Logic Synthesis (Springer Science & Business Media, 2012). Google Scholar
    • 2. L. Xu, A. Almaini, J. Miller and L. McKenzie , Reed-muller universal logic module networks, IEE Proc. E (Comput. Dig. Tech.) 140 (1993) 105–108. CrossrefGoogle Scholar
    • 3. R. K. James, T. Shahana, K. P. Jacob and S. Sasi , Delay-reduced combinational logic synthesis using multiplexers, European Symp. Algorithm (ESA), ( Citeseer, 2006), pp. 105–110. Google Scholar
    • 4. M. Yanagiya , Efficient genetic programming based on binary decision diagrams, IEEE Int. Conf. Evolutionary Computation, Vol. 1 (IEEE, 1995), pp. 234–239. CrossrefGoogle Scholar
    • 5. A. H. Aguirre and C. A. Coello Coello , Using genetic programing and multiplexers for the synthesis of logic circuits, Eng. Optim. 36 (2004) 491–511. Crossref, ISIGoogle Scholar
    • 6. C. Vijayakumari, P. Mythili and R. K. James , A simplified efficient technique for the design of combinational logic circuits, Int. J. Intell. Syst. Appl. 7 (2015) 42–48. Google Scholar
    • 7. C. Vijayakumari, R. K. James and P. Mythili , A GA based simple and efficient technique to design combinational logic circuits using universal logic modules, J. Circuits, Syst. Comput. 25 (2016) 1650074. Link, ISIGoogle Scholar
    • 8. A. Almaini, J. Miller and L. Xu , Automated synthesis of digital multiplexer networks, IEE Proc. E (Comput. Digit. Tech.) 139 (1992) 329–334. CrossrefGoogle Scholar
    • 9. NEOS server: State-of-the-art solvers for numerical optimization, Google Scholar
    • 10. J. Czyzyk, M. P. Mesnier and J. J. Moré , The NEOS server, IEEE Comput. Sci. Eng. 5 (1998) 68–75. CrossrefGoogle Scholar
    • 11. E. D. Dolan, Neos server 4.0 administrative guide, Technical Memorandum ANL/MCS-TM-250 (2001). Google Scholar
    • 12. W. Gropp and J. Moré , Optimization environments and the neos server, International Workshop on Short Term Experiments Under Strongly Reduced Gravity Conditions (Bremen, Germany, 8–11 July 1996), pp. 167–182. Google Scholar
    • 13. M. Tawarmalani and N. V. Sahinidis , A polyhedral branch-and-cut approach to global optimization, Math. Programming 103 (2005) 225–249. Crossref, ISIGoogle Scholar
    • 14. D. Voudouris, M. Sampson and G. Papakonstantinou , Exact ESCT minimization for functions of up to six input variables, INTEGRATION, the VLSI Journal 41 (2008) 87–105. Crossref, ISIGoogle Scholar