Optimizing Reversible Simulation of Injective Functions.

Saved in:

Bibliographic Details
Title:	Optimizing Reversible Simulation of Injective Functions.
Authors:	YOKOYAMA, TETSUO¹ tyokoyama@acm.org, AXELSEN, HOLGER BOCK² funkstar@diku.dk, GLÜCK, ROBERT² glueck@acm.org
Source:	Journal of Multiple-Valued Logic & Soft Computing. 2012, p5-24. 20p.
Subjects:	Mathematical optimization, Injective modules (Algebra), Simulation methods & models, Data encryption, Information retrieval, Electronic data processing
Abstract:	Bennett showed that a clean reversible simulation of injective programs is possible without returning the input of a program as additional output. His method involves two computation and two uncomputation phases. This paper proposes an optimization of Bennett's simulation that requires only half of the computation and uncomputation steps for a class of injective programs. A practical consequence is that the reversible simulation runs twice as fast as Bennett's simulation. The proposedmethod is demonstrated by developing lossless encoders and decoders for run-length encoding and range coding. The range-coding program is further optimized by conserving the model over the text-generation phase. This paper may thus provide a newviewon developing efficient reversible simulations for a certain class of injective functions. [ABSTRACT FROM AUTHOR]
	Copyright of Journal of Multiple-Valued Logic & Soft Computing is the property of Old City Publishing, Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	Bennett showed that a clean reversible simulation of injective programs is possible without returning the input of a program as additional output. His method involves two computation and two uncomputation phases. This paper proposes an optimization of Bennett's simulation that requires only half of the computation and uncomputation steps for a class of injective programs. A practical consequence is that the reversible simulation runs twice as fast as Bennett's simulation. The proposedmethod is demonstrated by developing lossless encoders and decoders for run-length encoding and range coding. The range-coding program is further optimized by conserving the model over the text-generation phase. This paper may thus provide a newviewon developing efficient reversible simulations for a certain class of injective functions. [ABSTRACT FROM AUTHOR]
ISSN:	15423980