A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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 listbased data structures are also examined. The experimental results show the efficiency of the proposed SPPRM representation for both memory usage anddoi:10.1109/isvlsi.2008.41 dblp:conf/isvlsi/SanaeeSZ08 fatcat:eidmnv25i5gavmbcg76znnb2uu