Detail publikačního výsledku

Cartesian Genetic Programming with a Modified Selection Operator for Combinational Circuit Design: Arithmetic Multipliers and Adders

HŮLKA, T.; MATOUŠEK, R.; DOBROVSKÝ, L.; KŮDELA, J.; HOJNY, O.

Originální název

Cartesian Genetic Programming with a Modified Selection Operator for Combinational Circuit Design: Arithmetic Multipliers and Adders

Anglický název

Cartesian Genetic Programming with a Modified Selection Operator for Combinational Circuit Design: Arithmetic Multipliers and Adders

Druh

Stať ve sborníku v databázi WoS či Scopus

Originální abstrakt

The evolutionary design of combinational logic circuits offers an innovative approach that often surpasses traditional methods, such as the Quine-McCluskey algorithm, in both efficiency and effectiveness. Cartesian Genetic Programming (CGP) emerges as a potent technique in this domain, enabling versatile circuit designs tailored to diverse requirements such as cost, gate count, and circuit speed. In this paper, we introduce an advanced modification of CGP, termed CGP-SA, which integrates the Simulated Annealing mechanism into the selection operator. This novel approach enhances the algorithm's ability to escape local optima, thereby fostering the discovery of more optimal solutions. We demonstrate the efficacy of CGP-SA through the design of three types of multipliers and two types of adders, utilizing diverse logic gate sets. This exploration not only reveals the flexibility of CGP-SA in handling various circuit design challenges but also highlights its adaptability to different optimization criteria.

Anglický abstrakt

The evolutionary design of combinational logic circuits offers an innovative approach that often surpasses traditional methods, such as the Quine-McCluskey algorithm, in both efficiency and effectiveness. Cartesian Genetic Programming (CGP) emerges as a potent technique in this domain, enabling versatile circuit designs tailored to diverse requirements such as cost, gate count, and circuit speed. In this paper, we introduce an advanced modification of CGP, termed CGP-SA, which integrates the Simulated Annealing mechanism into the selection operator. This novel approach enhances the algorithm's ability to escape local optima, thereby fostering the discovery of more optimal solutions. We demonstrate the efficacy of CGP-SA through the design of three types of multipliers and two types of adders, utilizing diverse logic gate sets. This exploration not only reveals the flexibility of CGP-SA in handling various circuit design challenges but also highlights its adaptability to different optimization criteria.

Klíčová slova

Cartesian Genetic Programming, Simulated Annealing, Digital Circuit, Circuit Design

Klíčová slova v angličtině

Cartesian Genetic Programming, Simulated Annealing, Digital Circuit, Circuit Design

Autoři

HŮLKA, T.; MATOUŠEK, R.; DOBROVSKÝ, L.; KŮDELA, J.; HOJNY, O.

Rok RIV

2026

Vydáno

17.02.2025

Nakladatel

Springer Nature

Místo

CHAM

ISBN

978-3-031-84355-6

Kniha

Lecture Notes in Artificial Intelligence

Periodikum

Lecture Notes in Computer Science

Svazek

15165

Stát

Švýcarská konfederace

Strany od

53

Strany do

65

Strany počet

13

BibTex

@inproceedings{BUT201220,
  author="Tomáš {Hůlka} and Radomil {Matoušek} and Ladislav {Dobrovský} and Jakub {Kůdela} and Ondřej {Hojný}",
  title="Cartesian Genetic Programming with a Modified Selection Operator for Combinational Circuit Design: Arithmetic Multipliers and Adders",
  booktitle="Lecture Notes in Artificial Intelligence",
  year="2025",
  journal="Lecture Notes in Computer Science",
  volume="15165",
  pages="53--65",
  publisher="Springer Nature",
  address="CHAM",
  doi="10.1007/978-3-031-84356-3\{_}5",
  isbn="978-3-031-84355-6"
}