<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Evolutionary synthesis of failure-resilient analog circuits</dc:title><dc:creator>Rojec,	Žiga	(Avtor)
	</dc:creator><dc:creator>Fajfar,	Iztok	(Avtor)
	</dc:creator><dc:creator>Bürmen,	Arpad	(Avtor)
	</dc:creator><dc:subject>evolutionary algorithms</dc:subject><dc:subject>analog circuit synthesis</dc:subject><dc:subject>failure-resilient circuits</dc:subject><dc:subject>NSGA-II algorithm</dc:subject><dc:description>Analog circuit design requires large amounts of human knowledge. A special case of circuit design is the synthesis of robust and failure-resilient electronics. Evolutionary algorithms can aid designers in exploring topologies with new properties. Here, we show how to encode a circuit topology with an upper-triangular incident matrix and use the NSGA-II algorithm to find computational circuits that are robust to component failure. Techniques for robustness evaluation and evolutionary algorithm guidances are described. As a result, we evolve square root and natural logarithm computational circuits that are robust to high-impedance or short-circuit malfunction of an arbitrary rectifying diode. We confirm the simulation results by hardware circuit implementation and measurements. We think that our research will inspire further searches for failure-resilient topologies.</dc:description><dc:date>2022</dc:date><dc:date>2022-05-19 10:08:45</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>136747</dc:identifier><dc:identifier>UDK: 004</dc:identifier><dc:identifier>ISSN pri članku: 2227-7390</dc:identifier><dc:identifier>DOI: 10.3390/math10010156</dc:identifier><dc:identifier>COBISS_ID: 92450563</dc:identifier><dc:language>sl</dc:language></metadata>
