Thumbnail
Access Restriction
Subscribed

Author De Vos, Alexis ♦ Burignat, Stphane ♦ Glck, Robert ♦ Mogensen, Torben gidius ♦ Axelsen, Holger Bock ♦ Thomsen, Michael Kirkedal ♦ Rotenberg, Eva ♦ Yokoyama, Tetsuo
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2014
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Reversible computation ♦ Garbage-free multiplication ♦ Integer cosine transform
Abstract 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 integer cosine transformations on $\textit{n}$ input integers. The resulting reversible circuit is able to perform both the forward transform and the inverse transform. The detailed structure of such a reversible design strongly depends on the odd prime factors of the determinant of the transform: whether those are of the form $2^{k}$ ± 1 or of the form $2^{k}$ ± $2^{l}$ ± 1 or neither of these forms.
ISSN 15504832
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2014-11-01
Publisher Place New York
e-ISSN 15504840
Journal ACM Journal on Emerging Technologies in Computing Systems (JETC)
Volume Number 11
Issue Number 2
Page Count 15
Starting Page 1
Ending Page 15


Open content in new tab

   Open content in new tab
Source: ACM Digital Library