Synthesis of reversible PLA using products sharing
Reversible logic is a computing design, where the ideal implementation would produce zero entropy gain. This unique feature causes prominent use of reversible computing. At the same time, more integration capability and regular structure for synthesizing large number of logic functions made programm...
Saved in:
| Published in | Journal of computational electronics Vol. 15; no. 2; pp. 420 - 428 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
New York
Springer US
01.06.2016
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1569-8025 1572-8137 |
| DOI | 10.1007/s10825-015-0762-5 |
Cover
| Summary: | Reversible logic is a computing design, where the ideal implementation would produce zero entropy gain. This unique feature causes prominent use of reversible computing. At the same time, more integration capability and regular structure for synthesizing large number of logic functions made programmable devices enthusiastic to use. In this paper, we propose design algorithm of one of the programmable logic devices, Programmable Logic Array (PLA) with a newly designed low cost 3
×
3 reversible Tara Babu (TB) gate, which can realize multi-output Exclusive-OR Sum of Product (ESOP) functions. In addition, we present a heuristic algorithm to sort and realize the product terms of ESOP functions in order to share the internal sub-products to reduce the number of gates in the proposed circuit. Proposed algorithms make the design more efficient with improvement 9.83 % in number of gates, 21.3 % in garbage outputs count and 14.75 % quantum cost parameters than the existing techniques averagely. Moreover, the area and power consumption of the proposed PLA are shown. Performance is also analyzed by using MCNC benchmark functions. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| ISSN: | 1569-8025 1572-8137 |
| DOI: | 10.1007/s10825-015-0762-5 |