Abstract

In this paper we proposed a reversible cache memory for the first time. Four formulas for computing quantum cost, number of garbage outputs, number of constant inputs and number of gates of the proposed reversible circuit are suggested. These formulas can be used for any type of cache memory with any number of address bits and cache lines or cache blocks. Moreover we proposed a fault tolerant reversible cache memory and then formulas for computing the parameters of this circuit are also suggested. Key words: Reversible logic, cache memory, quantum cost, faults tolerant.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.