Design and Evaluation of Multipliers Using Simulated Annealing and Partitioning Approach

References

• K. Tsoumanis, et al., “An optimized modified booth recoder for efficient design of the add-multiply operator,” IEEE Trans. Circuits Syst. I, Reg. Papers, Vol. 61, no. 4, pp. 1133–43, 2014.
   Web of Science ®Google Scholar
• E. Antelo, P. Montuscuchi, A., and Nannarelli, “Improved 64-bit radix-16 booth multiplier based on partial product array height reduction,” IEEE Trans. Circuits Syst. I, Reg. Papers, Vol. 64, no. 2, pp. 409–18, 2016.
   Web of Science ®Google Scholar
• A. Cilardo, et al., “High speed speculative multipliers based on speculative carry-save tree,” IEEE Trans. Circuits Syst. I, Reg. Papers, Vol. 61, no. 12, pp. 3426–35, 2014.
   Web of Science ®Google Scholar
• M. Amini-Valashani, M. Ayat, and S. Mirzakuchaki, “Design and analysis of a novel low-power and energy-efficient 18 T hybrid full adder,” Microelectron. J., Vol. 74, pp. 49–59, 2018.
   Web of Science ®Google Scholar
• V. Savani and N. Devashrayee, “Design and analysis of low-power high-speed shared charge reset technique based dynamic latch comparator,” Microelectron. J., Vol. 74, pp. 116–26, 2018.
   Web of Science ®Google Scholar
• M. Sakthimohan and J. Deny, “An optimistic design of 16-tap FIR filter with Radix-4 Booth multiplier using improved booth recoding algorithm,” Microprocess. Microsyst. J., In press, pp. 1–14, 2020. https://www.sciencedirect.com/science/article/pii/S0141933120306074?via%3Dihub.
   Google Scholar
• Z. Babic, A. Avramovic, and P. Bulic, “An iterative logarithmic multiplier,” Microprocess. Microsyst. J., Vol. 35, pp. 23–33, 2011.
   Web of Science ®Google Scholar
• S. Tabei and H. Nikmehr, “An unsigned truncated sequential multiplier with variable error compensation,” Microprocess. Microsyst. J., Vol. 49, pp. 9–17, 2017.
   Web of Science ®Google Scholar
• V. Muralidahran and N. Sathish Kumar, “Design and implementation of low power and high speed multiplier using quaternary carry look-ahead adder,” Microprocess. Microsyst. J., Vol. 75, pp. 1–16, 2020.
   Web of Science ®Google Scholar
• V. Bianchi and I. Munari, “A modular vedic multiplier architecture for model-based design and deployment onFPGA platforms,” Microprocess. Microsyst. J., Vol. 76, pp. 1–9, 2020.
   Web of Science ®Google Scholar
• L. A, M. de Souza, et al., “A benchmark suite for designing combinational logic circuits via metaheuristics,” Appl. Soft Comput. J., Vol. 91, pp. 1–12, 2020.
   Web of Science ®Google Scholar
• F. Busetti. “Simulated annealing overview,” Book Chapter, pp. 1–10, 2001. https://www.researchgate.net/publication/238690391_Simulated_annealing_overview.
   Google Scholar
• J. F. Miller, “Cartesian genetic programming: its status and future,” Genet. Program. Evol. Mach., Vol. 21, pp. 129–68, 2020.
   Web of Science ®Google Scholar
• J. E. Orosz and S. H. Jacobson, “Analysis of static simulated annealing algorithms,” J. Optim. Theory. Appl., Vol. 115, no. 1, pp. 165–82, 2002.
   Web of Science ®Google Scholar
• P. C. Haddow and A. M. Tyrrell. “Evolvable hardware challenges: Past, present and the path to a promising future,” Inspired by Nature, Springer, pp. 3–37, 2018.
   Google Scholar
• J. F. Miller. “Cartesian genetic programming,” Cartesian Genetic Programming, pp.17–34, 2011.
   Google Scholar
• A. J. Turner, J. F. Miller, “Neutral genetic drift: An investigation using Cartesian genetic programming,” Genet. Program. Evolvable Mach., Vol. 16, no. 4, pp. 532–58, 2015.
   Web of Science ®Google Scholar
• J. E. H. da Silva, L. M. de Souza and H. S. Bernardino. “Cartesian genetic programming with guided and single active mutations for designing combinational logic circuits,” Proc. of the 5th Conference on Machine learning, Optimization and Data Science (LOD), pp. 1–12, 2019.
   Google Scholar
• S. J. Louis. “Genetic algorithms as a computational tool for design,” Ph.D. thesis, Indiana University Bloomington, IN, 1993.
   Google Scholar
• Z. Vasicek and L. Sekanina, “Evolutionary approach to approximate digital circuits design,” IEEE Trans. Evolvable Comput., Vol. 19, No. 3, pp. 432–44, 2015.
   Web of Science ®Google Scholar
• V. Mrazek, Z., Vasicek, R., and Hrbacek, “Role of circuit representation in evolutionary design of energy-efficient approximate circuits,” IET Comput. Digital Tech, Vol. 12, no. 4, pp. 139–49, 2018.
   Web of Science ®Google Scholar
• Z. Gajda and L. Sekanina, “On evolutionary synthesis of compact polymorphic combinational circuits,” Multiple Valued Log. Soft Comput. J., Vol. 17, No. 5-6, pp. 607–31, 2011.
   Web of Science ®Google Scholar
• S. Asha and R. R. Hemamalini, “Implementation of evolved hybrid multipliers using bio-inspired algorithm,” Int. J. Appl. Engg. Res., Vol. 9, no. 23, pp. 20475–84, 2014.
   Google Scholar
• Evolvable systems: From Biology to Hardware, Proc. of 7th Int. Conf., ICES 2007, Wuhan, China, Sep. 2007
   Google Scholar
• J. F. Miller and S. L. Smith, “Redundancy and computational efficiency in cartesian genetic programming,” IEEE Trans. Evol. Comput., Vol. 10, no. 2, pp. 167–74, 2006.
   Web of Science ®Google Scholar
• V. K. Vassilev and J. F. Miller. “Embedding landscape neutrality to build a bridge from the conventional to a more efficient three-bit multiplier circuit,” in Proc. Genetic and Evolutionary Computation, 2000.
   Google Scholar
• P. Kaufmann and R. Kalkreuth, “Parametrizing cartesian genetic programming: An empirical study,” Adv. Artif. Intell., LNCS, Vol. 10505, pp. 316–22, 2017.
   Google Scholar
• J. F. Miller, “Cartesian genetic programming: Its status and future,” Genet. Prog. Evol. Mach, Vol. 21, pp. 129–68, 2019.
   Web of Science ®Google Scholar
• J. E. H. da Silva and H. S. Bernardino. “Cartesian genetic programming with crossover for designing combinational logic circuits,” 7th Brazilian Conf. Intelligent Systems (BRACIS), Oct. 22–25, pp. 1–6, 2018.
   Google Scholar
• Z. Gajda and L. Sekanina, “An efficient selection strategy for digital circuit evolution,” Evolvable Syst.: From Biol. Hardware, LNCS, Vol. 6274, pp. 13–24, 2010.
   Google Scholar
• V. K. Vassilev, D. Job and J. F. Miller. “Towards the automatic design of more efficient digital circuits,” Proc. of the NASA/DoD Workshop on Evolvable Hardware, pp.151–60, 2000.
   Google Scholar
• Z. Vasicek. “Bridging the gap between evolvable hardware and industry using cartesian genetic programming,” in Inspired by Nature, Springer, pp.39–55, 2018.
   Google Scholar
• S. Stepney, A. Adamatzky. Inspired by Nature: Essays presented to Julian F. Miller on the occasion of his 60th birthday, vol. 28, Springer, 2017.
   Google Scholar
• C. Vijayakumari, et al. “Genetic algorithm based design of combinational logic circuits using universal logic modules,” Int. Conf. Information and Communication Tech., Kochi, pp. 1246–53, Dec 2014.
   Google Scholar
• K. Faraj. “Combinational logic synthesis based on the dual form of Reed-Muller representation,” Ph.D. thesis, Napier University, 2005.
   Google Scholar
• Z. Guan. “A study of arithmetic circuits and the effect of utilizing Reed-Muller techniques,” Ph.D. thesis, Napier University, 1995.
   Google Scholar
• C. Vijayakumari, P. Mythili, and K. Rekha. “Genetic algorithm based design of combinational logic circuits using Reed Muller blocks,” Proc. World Congress on Engg., London, pp. 1–6, Jul 2015.
   Google Scholar
• C. Vijayakumari, et al. “Optimal design of combinational logic circuits using genetic algorithm and Reed Muller universal logic modules,” Int. Conf. Embedded Systems, Coimbatore, pp. 1–6, 2014.
   Google Scholar
• D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon, “Optimization by simulated annealing:An experimental evaluation;part 1, graph partitioning,” Oper. Res., Vol. 37 ED-6, pp. 865–92, Dec.1989.
   Web of Science ®Google Scholar
• A. Prugel-Bennett, “Benefits of a population: five mechanisms that advantage population-based algorithms,” IEEE Trans. Evol. Comput., Vol. 14 ED-4, pp. 500–17, Aug.2010.
   Web of Science ®Google Scholar
• Y. J. Pavitra, S. Jamuna, J. Manikandan, and E. Arun. “Design of combinational logic circuits using simulated annealing,” International Conference for Advancement in Technology, Goa, India, pp.1–6, 2022.
   Google Scholar
• R. K. Brayton, et al., Logic Minimization Algorithms for VLSI synthesis. Boston, MA: Kluwer Academic Publishers.
   Google Scholar
• Berkley Logic Synthesis and Verification Group. ABC: a system for sequential synthesis and verification, 2009.
   Google Scholar
• R. Drechsler and B. Becker, Binary decision diagrams: theory and implementation. Boston, MA,: Springer Science+Business Media LLC, 1998.
   Google Scholar
• S. Vemuri, S. Chen, Split manufacturing of integrated circuits for hardware security and trust. Switzerland: Benchmark, Springer Nature, AG2021.
   Google Scholar