Garbageless reversible implementation of integer linear transformations
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Standard
Garbageless reversible implementation of integer linear transformations. / Burignat, Stéphane; Vermeirsch, Kenneth; De Vos, Alexis; Thomsen, Michael Kirkedal.
Reversible Computation: 4th International Workshop, RC 2012, Copenhagen, Denmark, July 2-3, 2012. Revised Papers. ed. / Robert Glück; Tetsuo Yokoyama. Springer, 2013. p. 160-170 (Lecture notes in computer science, Vol. 7581).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - GEN
T1 - Garbageless reversible implementation of integer linear transformations
AU - Burignat, Stéphane
AU - Vermeirsch, Kenneth
AU - De Vos, Alexis
AU - Thomsen, Michael Kirkedal
N1 - Conference code: 4
PY - 2013
Y1 - 2013
N2 - Discrete linear transformations are important tools in information processing. Many such transforms are injective and therefore prime candidates for a physically reversible implementation into hardware. We present here reversible digital implementations of different integer transformations on four inputs. The resulting reversible circuit is able to perform both the forward transform and the inverse transform. Which of the two computations that actually is performed, simply depends on the orientation of the circuit when it is inserted in a computer board (if one takes care to provide the encapsulation of symmetrical power supplies). Our analysis indicates that the detailed structure of such a reversible design strongly depends on the prime factors of the determinant of the transform: a determinant equal to a power of 2 leads to an efficient garbage-free design.
AB - Discrete linear transformations are important tools in information processing. Many such transforms are injective and therefore prime candidates for a physically reversible implementation into hardware. We present here reversible digital implementations of different integer transformations on four inputs. The resulting reversible circuit is able to perform both the forward transform and the inverse transform. Which of the two computations that actually is performed, simply depends on the orientation of the circuit when it is inserted in a computer board (if one takes care to provide the encapsulation of symmetrical power supplies). Our analysis indicates that the detailed structure of such a reversible design strongly depends on the prime factors of the determinant of the transform: a determinant equal to a power of 2 leads to an efficient garbage-free design.
U2 - 10.1007/978-3-642-36315-3_13
DO - 10.1007/978-3-642-36315-3_13
M3 - Article in proceedings
AN - SCOPUS:84872868006
SN - 978-3-642-36314-6
T3 - Lecture notes in computer science
SP - 160
EP - 170
BT - Reversible Computation
A2 - Glück, Robert
A2 - Yokoyama, Tetsuo
PB - Springer
T2 - 4th International Workshop on Reversible Computation
Y2 - 2 July 2012 through 3 July 2012
ER -
ID: 169435627