Shared-PPRM: A Memory-Efficient Representation for Boolean Reversible Functions

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.