<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:contributor>Pozzi, Laura</dc:contributor>
  <dc:creator>Scarabottolo, Ilaria</dc:creator>
  <dc:date>2020-10-15</dc:date>
  <dc:description xmlns:ns0="xml" ns0:lang="en">As energy efficiency becomes a crucial concern in almost every kind of digital application,  Approximate Computing gains popularity as a potential answer to this ever-growing  energy quest. Approximate Computing is a design paradigm particularly suited for error- resilient applications, where small losses in accuracy do not represent a significant  reduction in the quality of the result. In these scenarios, energy consumption and  resources employment (such as electric power, or circuit area) can be significantly  improved at the expense of a slight reduction in output accuracy. While Approximate  Computing can be applied at different levels, my research focuses on the design of  approximate hardware. In particular, my work explores Approximate Logic Synthesis,  where the hardware functionality is automatically tuned to obtain more efficient  counterparts, while always controlling the entailed error. Functional modifications include,  among others, removal or substitution of gates and signals. A fundamental prerequisite  for the application of these modifications is an \emph{accurate error model} of the circuit  under exam. My Ph.D. research work has deeply concentrated on the derivation of  accurate error models of a circuit. These can, in turn, guide Approximate Logic Synthesis  algorithms to optimal solutions and avoid expensive, time-consuming simulations. A  precise error model allows to fully explore the design space and, potentially, adjust the  desired level of accuracy even at runtime. I have also contributed to the state of the art in  ALS techniques by devising a circuit pruning algorithm that produces efficient  approximate circuits for given error constraints. The innovative aspect of my work is that it  exploits circuit topology and graph partitioning to identify circuit portions that impact to a  smaller extent on the final output. With this information, ALS algorithms can improve their  efficiency by acting first on those less-influent portions. Indeed, this error characterisation  proves to be very effective in guiding and modeling approximate synthesis.</dc:description>
  <dc:format>application/pdf</dc:format>
  <dc:identifier>https://susi.usi.ch/global/documents/319361</dc:identifier>
  <dc:identifier>https://n2t.net/ark:/12658/srd1319361</dc:identifier>
  <dc:identifier>https://susi.usi.ch/documents/319361/files/2020INFO023.pdf</dc:identifier>
  <dc:language>eng</dc:language>
  <dc:relation>info:eu-repo/semantics/altIdentifier/urn/urn:nbn:ch:rero-006-119180</dc:relation>
  <dc:relation>info:eu-repo/semantics/altIdentifier/ark/12658/srd1319361</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>License undefined</dc:rights>
  <dc:subject xmlns:ns1="xml" ns1:lang="en">Approximate computing</dc:subject>
  <dc:subject xmlns:ns2="xml" ns2:lang="en">Hardware</dc:subject>
  <dc:subject xmlns:ns3="xml" ns3:lang="en">Systems-on-chips</dc:subject>
  <dc:subject xmlns:ns4="xml" ns4:lang="en">Error modeling</dc:subject>
  <dc:subject xmlns:ns5="xml" ns5:lang="en">Logic synthesis</dc:subject>
  <dc:subject>info:eu-repo/classification/udc/004</dc:subject>
  <dc:title xmlns:ns6="xml" ns6:lang="en">Less is more : efficient hardware design through Approximate Logic Synthesis</dc:title>
  <dc:type>http://purl.org/coar/resource_type/c_db06</dc:type>
</oai_dc:dc>
