An Efficient Bcd Adder Design Utilizing Reversible Logic Techniques

Abstract

Reversible Logic Gates Are Pivotal Components Digital Circuit Design, Embodying The Principle Of Reversibility That Ensures Each Input State Maps Uniquely To A Distinct Output State Without Loss Of Information. Leveraging These Principles, This Paper Presents A Novel Design And Validation Of A Binary-Coded Decimal (BCD) Adder Utilizing Reversible Logic Gates, Specifically ASK Gates And New Gate (NG). Through The Seamless Integration Of ASK And NG Gates, The Proposed Design Achieves Significant Improvements In Efficiency And Performance Metrics. The Design And Validation Processes Are Carried Out Using Xilinx Software. Notably, It Demonstrates A Substantial Reduction In Gate Count And Ancilla Inputs While Effectively Managing Garbage Outputs. The Design Features A Gate Count Of 11, Employs13 Ancilla Inputs, And Generates 22 Garbage Outputs, Show Casing A Remarkable 63.33% Reduction In Gate Count Compared To Existing Architectures. These Findings Highlight The Efficiency, Scalability, And Potential Applications Of The Proposed Design In Various Domains Including Quantum Computing, Low-power Systems, Error-correction Mechanisms, Cryptography.

Keywords