Cleaning up: garbage-free reversible circuits by design languages

Michael Kirkedal Thomsen; Holger Bock Axelsen; Robert Glück

doi:10.1109/ISED.2012.20

Cleaning up: garbage-free reversible circuits by design languages

Michael Kirkedal Thomsen, Holger Bock Axelsen, Robert Glück

1 Citationer (Scopus)

Abstract

Reversible logic is a computational model that ensure that no values are discarded or duplicated. This gives the connection to Landauer’s principle if and only if the underlying circuits are garbage-free.
This paper shows how to describe and implement garbage-free reversible logic circuits in an easy and concise way. We use two domain-specific languages that are designed to describe reversible logic at different levels and garbage-free methods to translate between these. This approach relies heavily on programming language technology that is known and used for conventional functional languages. Though the languages ensure reversibility of the logic descriptions, they are not guaranteed to be garbage- free. It is still an important task for the designer to find the correct embeddings.

Originalsprog	Engelsk
Titel	2012 International Symposium on Electronic System Design (ISED)
Antal sider	5
Forlag	IEEE
Publikationsdato	1 jan. 2012
Sider	6-10
ISBN (Trykt)	978-1-4673-4704-4
DOI	https://doi.org/10.1109/ISED.2012.20
Status	Udgivet - 1 jan. 2012
Begivenhed	International Symposium on Electronic System Design (ISED), 2012 - Varighed: 19 dec. 2012 → 22 dec. 2012

Konference

Konference	International Symposium on Electronic System Design (ISED), 2012
Periode	19/12/2012 → 22/12/2012

Adgang til dokumentet

10.1109/ISED.2012.20

Citationsformater

@inproceedings{351e8aa166134b53b3f03f5bd65347a9,

title = "Cleaning up: garbage-free reversible circuits by design languages",

abstract = "Reversible logic is a computational model that ensure that no values are discarded or duplicated. This gives the connection to Landauer{\textquoteright}s principle if and only if the underlying circuits are garbage-free.This paper shows how to describe and implement garbage-free reversible logic circuits in an easy and concise way. We use two domain-specific languages that are designed to describe reversible logic at different levels and garbage-free methods to translate between these. This approach relies heavily on programming language technology that is known and used for conventional functional languages. Though the languages ensure reversibility of the logic descriptions, they are not guaranteed to be garbage- free. It is still an important task for the designer to find the correct embeddings.",

author = "Thomsen, {Michael Kirkedal} and Axelsen, {Holger Bock} and Robert Gl{\"u}ck",

note = "Position paper.; International Symposium on Electronic System Design (ISED), 2012 ; Conference date: 19-12-2012 Through 22-12-2012",

year = "2012",

month = jan,

day = "1",

doi = "10.1109/ISED.2012.20",

language = "English",

isbn = "978-1-4673-4704-4",

pages = "6--10",

booktitle = "2012 International Symposium on Electronic System Design (ISED)",

publisher = "IEEE",

}

TY - GEN

T1 - Cleaning up

T2 - International Symposium on Electronic System Design (ISED), 2012

AU - Thomsen, Michael Kirkedal

AU - Axelsen, Holger Bock

AU - Glück, Robert

N1 - Position paper.

PY - 2012/1/1

Y1 - 2012/1/1

N2 - Reversible logic is a computational model that ensure that no values are discarded or duplicated. This gives the connection to Landauer’s principle if and only if the underlying circuits are garbage-free.This paper shows how to describe and implement garbage-free reversible logic circuits in an easy and concise way. We use two domain-specific languages that are designed to describe reversible logic at different levels and garbage-free methods to translate between these. This approach relies heavily on programming language technology that is known and used for conventional functional languages. Though the languages ensure reversibility of the logic descriptions, they are not guaranteed to be garbage- free. It is still an important task for the designer to find the correct embeddings.

AB - Reversible logic is a computational model that ensure that no values are discarded or duplicated. This gives the connection to Landauer’s principle if and only if the underlying circuits are garbage-free.This paper shows how to describe and implement garbage-free reversible logic circuits in an easy and concise way. We use two domain-specific languages that are designed to describe reversible logic at different levels and garbage-free methods to translate between these. This approach relies heavily on programming language technology that is known and used for conventional functional languages. Though the languages ensure reversibility of the logic descriptions, they are not guaranteed to be garbage- free. It is still an important task for the designer to find the correct embeddings.

U2 - 10.1109/ISED.2012.20

DO - 10.1109/ISED.2012.20

M3 - Article in proceedings

SN - 978-1-4673-4704-4

SP - 6

EP - 10

BT - 2012 International Symposium on Electronic System Design (ISED)

PB - IEEE

Y2 - 19 December 2012 through 22 December 2012

ER -

Cleaning up: garbage-free reversible circuits by design languages

Abstract

Konference

Adgang til dokumentet

Fingeraftryk

Citationsformater