DocumentCode
2013356
Title
Shared-PPRM: A Memory-Efficient Representation for Boolean Reversible Functions
Author
Sanaee, Yasaman ; Saeedi, Mehdi ; Zamani, Morteza Saheb
Author_Institution
Comput. Eng. Dept., Amirkabir Univ. of Technol., Tehran
fYear
2008
fDate
7-9 April 2008
Firstpage
471
Lastpage
474
Abstract
A memory-efficient representation scheme, shared-PPRM (SPPRM), for Boolean reversible functions is introduced and analyzed. Compared with conventional PPRM expansion, SPPRM reduces memory usages by using one memory location for many repetitive PPRM sub-expressions. To evaluate the effects of data structure on SPPRM representation, two linked list-based data structures are also examined. The experimental results show the efficiency of the proposed SPPRM representation for both memory usage and CPU time.
Keywords
Boolean functions; data structures; storage management; Boolean reversible functions; list-based data structures; memory location; memory usage; memory-efficient representation; Computer Society; Costs; Data mining; Data structures; Design automation; Design engineering; Equations; Input variables; Quantum computing; Very large scale integration; Positive Polarity Reed-Muller Expansion; Reversible circuits; data structure;
fLanguage
English
Publisher
ieee
Conference_Titel
Symposium on VLSI, 2008. ISVLSI '08. IEEE Computer Society Annual
Conference_Location
Montpellier
Print_ISBN
978-0-7695-3291-2
Electronic_ISBN
978-0-7695-3170-0
Type
conf
DOI
10.1109/ISVLSI.2008.41
Filename
4556843
Link To Document