Reversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits

Similar documents
CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

EE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )

Elementary Educational Computer

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Behavioral Modeling in Verilog

BOOLEAN MATHEMATICS: GENERAL THEORY

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Chapter 3 Classification of FFT Processor Algorithms

Automatic Generation of Polynomial-Basis Multipliers in GF (2 n ) using Recursive VHDL

EE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control

Counting the Number of Minimum Roman Dominating Functions of a Graph

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1

Lecture 1: Introduction and Strassen s Algorithm

BASED ON ITERATIVE ERROR-CORRECTION

Appendix D. Controller Implementation

EE123 Digital Signal Processing

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Python Programming: An Introduction to Computer Science

Ones Assignment Method for Solving Traveling Salesman Problem

top() Applications of Stacks

EVALUATION OF TRIGONOMETRIC FUNCTIONS

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs

Lecture 2. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram

CS Polygon Scan Conversion. Slide 1

Chapter 4 The Datapath

How do we evaluate algorithms?

Solutions to Final COMS W4115 Programming Languages and Translators Monday, May 4, :10-5:25pm, 309 Havemeyer

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

The following algorithms have been tested as a method of converting an I.F. from 16 to 512 MHz to 31 real 16 MHz USB channels:

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

Module Instantiation. Finite State Machines. Two Types of FSMs. Finite State Machines. Given submodule mux32two: Instantiation of mux32two

The Simeck Family of Lightweight Block Ciphers

Cubic Polynomial Curves with a Shape Parameter

CMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago

A Note on Least-norm Solution of Global WireWarping

Math Section 2.2 Polynomial Functions

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations

Fast Fourier Transform (FFT) Algorithms

Lecture 3. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Data Structures and Algorithms. Analysis of Algorithms

Matrix representation of a solution of a combinatorial problem of the group theory

Analysis of Algorithms

Computational Geometry

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments

n Some thoughts on software development n The idea of a calculator n Using a grammar n Expression evaluation n Program organization n Analysis

A Very Simple Approach for 3-D to 2-D Mapping

Neural Networks A Model of Boolean Functions

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Analysis of Algorithms

State-space feedback 6 challenges of pole placement

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

1. SWITCHING FUNDAMENTALS

New Results on Energy of Graphs of Small Order

Thompson s Group F (p + 1) is not Minimally Almost Convex

ELEG 5173L Digital Signal Processing Introduction to TMS320C6713 DSK

COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design

Lower Bounds for Sorting

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract

EE University of Minnesota. Midterm Exam #1. Prof. Matthew O'Keefe TA: Eric Seppanen. Department of Electrical and Computer Engineering

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Towards Compressing Web Graphs

Outline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis

1.2 Binomial Coefficients and Subsets

On Spectral Theory Of K-n- Arithmetic Mean Idempotent Matrices On Posets

CS 11 C track: lecture 1

Image Segmentation EEE 508

Algorithm Design Techniques. Divide and conquer Problem

An Efficient Algorithm for Graph Bisection of Triangularizations

Fast Fourier Transform (FFT)

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

Abstract. Chapter 4 Computation. Overview 8/13/18. Bjarne Stroustrup Note:

Pattern Recognition Systems Lab 1 Least Mean Squares

Algorithm. Counting Sort Analysis of Algorithms

The golden search method: Question 1

Design of Efficient Pipelined Radix-2 2 Single Path Delay Feedback FFT

A Polynomial Interval Shortest-Route Algorithm for Acyclic Network

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS

The isoperimetric problem on the hypercube

Lecture 5. Counting Sort / Radix Sort

CIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13

Designing a learning system

ANN WHICH COVERS MLP AND RBF

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)

The Magma Database file formats

Computer Systems - HS

Digital System Design

COP4020 Programming Languages. Functional Programming Prof. Robert van Engelen

A graphical view of big-o notation. c*g(n) f(n) f(n) = O(g(n))

GPUMP: a Multiple-Precision Integer Library for GPUs

1 Enterprise Modeler

Probability of collisions in Soft Input Decryption

Outline. Applications of FFT in Communications. Fundamental FFT Algorithms. FFT Circuit Design Architectures. Conclusions

Linearising Calibration Methods for a Generic Embedded Sensor Interface (GESI)

Transcription:

Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig biary reversible circuit i terms of umber of iput/output lies required. Decoder, multiplexer, ad demultiplexer are very importat buildig blocks of digital systems. this paper, we show reversible realizatio of these circuits usig quaterary shift gates (QSG), quaterary cotrolled shift gates (QCSG), ad quaterary Toffoli gates (QTG). We also show the realizatio of multi-digit QCSG ad QTG usig QSGs ad QCSG. dex Terms Decoder, demultiplexer, multiple-valued logic, multiplexer, quaterary logic, reversible logic Toffoli gates (QTG) eeded for sythesis of QGFSP expressio. Experiece shows that CD based geeral sythesis methods are sometimes ot very cost effective for sythesis of some medium-scale buildig blocks. this case, problem specific maual sythesis of such medium-scale buildig blocks is relatively cost effective. Decoder, multiplexer, ad demultiplexer are very importat buildig blocks of digital systems. this paper, we show a problem specific maual approach of reversible realizatio of these circuits usig quaterary shift gates (QSG), quaterary cotrolled shift gates (QCSG), ad quaterary Toffoli gates (QTG). We also show the realizatio of multi-digit QCSG ad QTG usig QSGs ad QCSG.. NTRDUCTN Reversible logic [] is a very prospective approach of logic sythesis for power reductio i future computig techologies. a reversible circuit, the umber of iputs ad outputs are same ad there is a oe-to-oe mappig betwee iput values ad output values. Reversible circuits are costructed usig reversible gates. Quaterary logic is very suitable for ecoded realizatio of biary logic fuctios by groupig -bits together ito quaterary digits. This sort of quaterary ecoded reversible realizatio of biary logic fuctio requires half times iput/output lies tha the origial biary reversible realizatio. s the umber of iput/output lies is reduced, this quaterary ecoded realizatio of biary logic fuctio makes the circuit more compact ad maageable, especially for the quatum techology, where the cost of qudit (quatum digit) realizatio ad qubit (quatum bit) realizatio are almost same. However, quaterary ecoded realizatio of biary logic fuctio requires ecodig of biary iputs ito quaterary values ad decodig of quaterary outputs ito biary values. Reversible realizatio of such biary-to-quaterary ecoder ad quaterary-to-biary decoder are discussed i [] i the cotext of quaterary quatum logic. Similar realizatio ca also be doe i other quaterary reversible techologies. Quaterary reversible logic sythesis is a very ew research area [-]. Paper [] preseted a quaterary reversible logic sythesis method usig quaterary Galois field sum of products (QGFSP) expressio ad paper [] preseted determiatio of QGFSP expressio for a give fuctio usig quaterary Galois field decisio diagram (QGFDD). Papers [, ] preseted realizatio of quaterary Mauscript received September,. Mozammel H.. Kha is with the Departmet of Computer Sciece ad Egieerig, East West Uiversity, Mohakhali, Dhaka, Bagladesh, phoe: +--; fax: +--; e-mail: mhakha@ ewubd.edu.. BCKGRUND N GF() PERTNS Galois field (), abbreviated as GF(), is a fiite field F = {,,, } with two biary operatios additio (deoted by +) ad multiplicatio (deoted by or absece of ay operator) as defied i Table. dditio ad multiplicatio operatios are both commutative ad associative. Multiplicatio operatio is distributive over additio operatio. For more details about GF() operatios, see []. Table. GF() operatios +. QUTERNRY SHFT GTES There are! = possible permutatios of,,, ad. Therefore, there are possible truth tables for -digit reversible gates. mog these -digit reversible gates, we will use oly four gates of the form y = x + z [GF()] for z {,,,}. The GF() expressios ad correspodig truth tables of these gates are show i Table. We will refer the -digit gates of Table as quaterary shift gates (QSG). The gate for y = x + ca be regarded as a buffer gate or a wire. The QSGs ca be realized usig liquid io-trap quatum techology [] ad other reversible techologies. We will graphically represet the QSGs usig the symbol of Figure. Two QSGs i cascade behave like aother QSG. Equivalet QSG correspodig to all cascade pairs are give i Table, which ca be easily verified usig GF() expressios or truth tables of QSGs from Table. f a (dvace olie publicatio: November )

Egieerig Letters, :, EL cascade pair of two QSGs is equivalet to + gate, the the secod QSG is said to be the iverse of the first QSG. verse gates are used to restore the iput sigal for reuse i the circuit. Table. GF() expressios ad truth tables for quaterary shift gates put = x + y = x + y = x + y = x + x y Figure. Symbol of quaterary shift gates (QSG) Table. Equivalet QSGs correspodig to cascade pairs of two QSGs d gate + + + + + + + st gate + + + + + + + + The realizatio of -digit QCSG usig -digit QCSGs is show i Figure. From Figure, we see that if ad oly if x = x =, the a = ad + z shift is applied o x. For all other combiatios of x ad x, a will ever be ad + z shift will ot be applied o x. The right most two -digit QCSGs are iverse gates of the left most two QCSGs ad are used to restore the iput costat for reuse i the circuit. auxiliary costat iput used i the desig of a reversible circuit is called acilla digit. This realizatio eeds elemetary gates ad acilla digit. The realizatio of -digit QCSG usig -digit QCSGs is show i Figure. Figure, if ad oly if x = x =, the a =. gai, if ad oly if a = x =, the b =. This implies that, b = if ad oly if x = x = x = ad + z shift is applied o x cotrolled iput. This realizatio eeds elemetary gates ad acilla digits. this way, we ca realize a -digit QCSG. We ca easily show that for a -digit QCSG, the umber of acilla digits is ( ) ad the umber of elemetary gates is ( ) +. a + + + + x y Figure. Realizatio of -digit quaterary cotrolled shift gate (QCSG) V. QUTERNRY CNTRLLED SHFT GTES The symbol of the -digit quaterary cotrolled shift gate (QCSG) is show i Figure. The gate applies a shift operatio (Table ) o the cotrolled iput x whe the cotrollig iput x is. The outputs of the gate are y = x ad y = x + z if ad oly if x = ; y = x otherwise. The QCSG ca be realized usig liquid io-trap quatum techology [] ad other reversible techologies. We propose a -digit QCSG usig the symbol of Figure. Figure, x L x are cotrollig iputs ad x is the cotrolled iput. The cotrolled output is y = x + z if ad oly if x = x = L x = ; y = x otherwise. x x y Figure. Symbol of -digit quaterary cotrolled shift gate (QCSG) x y y x y x y a + + + + + + b x y Figure. Realizatio of -digit quaterary cotrolled shift gate (QCSG) V. QUTERNRY TFFL GTE The -digit quaterary Toffoli gate (QTG) is show i Figure, where x L x are the iputs, y i = x (for i i =,, L, ) are the pass through outputs ad y = xx L x + x [GF()] is the cotrolled output. Realizatio of QTG usig QCSGs ad -digit QCSGs is discussed i []. x + x y y + x x Figure. Symbol of -digit quaterary cotrolled shift gate (QCSG) y y x Figure. Quaterary Toffoli gate (QTG) y (dvace olie publicatio: November )

Egieerig Letters, :, EL V. REVERSBLE RELZTN F QUTERNRY DECDER The truth table of quaterary decoder with active- output is show i Table. For a give iput combiatio, oly the ed output will be ad the remaiig outputs will be. Reversible realizatio of quaterary decoder with active- output is show i Figure. The outputs are geerated alog costat iputs. For a give iput combiatio, the iput values are made by applyig QSGs alog lies ad the a QCSG is used to chage the correspodig iput to output, the other outputs remai. For example, for iput combiatio =, two + QSGs are placed alog lies to make the iput values ad the a QCSG is used to chage the correspodig iput to output =. utputs through are realized usig the same techique. However, the iput values correspodig to the QCSGs are made by cascaded QSGs. Therefore, the effective shift at all cotrollig poits are explicitly show i the figure to make the circuit easily uderstadable. t ca be see that for a give combiatio of, oly oe QCSG will be active ad will apply a + shift o the correspodig costat iput to produce the output ad other outputs will remai. Quaterary decoder of ay size ca be realized usig the same techique. Moreover, the outputs may be made active- or active- by simply replacig + shifts of the QCSGs by appropriate shifts. V. REVERSBLE RELZTN F QUTERNRY MULTPLEXER The truth table of quaterary multiplexer is show i Table, where the output is equal to the ed multiplexer iput. Reversible realizatio of the multiplexer is show i Figure. Depedig o the iput combiatio, oe of the decoder outputs becomes ad the other decoder outputs remai s. The decoder outputs multiplied with their correspodig multiplexer iputs become s ad these s are added to the costat iput alog the output lie. The oly decoder output multiplied with the correspodig multiplexer iput becomes exactly equal to the multiplexer iput ad is added with the costat iput alog the output lie to produce the multiplexer output. For example, if =, the the decoder output becomes ad the other decoder outputs become. this case, is multiplied by ad the other multiplexer iputs are multiplied by. Therefore, oly is added with the costat iput to produce the output, which is exactly equal to. Table. Truth table of quaterary decoder with active- output + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + outputs (dvace olie publicatio: November )

Egieerig Letters, :, EL Figure. Reversible realizatio of quaterary decoder with active- outputs Table. Truth table of quaterary multiplexer Therefore, oly the demultiplexer output will be equal to the demultiplexer iput ad the other demultiplexer outputs will be s. V. REVERSBLE RELZTN F QUTERNRY DEMULTPLEXER The truth table of quaterary demultiplexer is show i Table, where oly the ed output is equal to the demultiplexer iput ad the remaiig outputs are s. Reversible realizatio of the demultiplexer is show i Figure. Depedig o the iput combiatio, oe of the decoder outputs becomes ad the other decoder outputs remai s. The decoder outputs are multiplied with the demultiplexer iput ad become s. These s are the added with the costat iput s to produce outputs. The oly decoder output is multiplied with the demultiplexer iput to produce. This is the added with the costat iput to produce o the ed output lie. For example, if =, the the decoder output becomes ad the remaiig decoder outputs become s. this case, is added oly with the costat iput alog the demultiplexer output lie ad s are added with the other costat iput s. decoder outputs multiplexer iputs output Figure. Reversible realizatio of quaterary multiplexer Table. Truth table of quaterary demultiplexer (dvace olie publicatio: November )

Egieerig Letters, :, EL decoder outputs iput demultiplexer outputs Figure. Reversible realizatio of quaterary demultiplexer REFERENCES [] T. Toffoli., Reversible Computig, i utomata, Laguages ad Programmig, J. W. Bakker ad J. va Leeuwe, ED. Spriger Verlag,, pp. -. [] M. H.. Kha ad M.. Perkowski, GF() based sythesis of quaterary reversible/quatum logic circuits, Joural of Multiple-Valued Logic ad Soft Computig, vol.,. [] M. H.. Kha, N. K. Siddika, ad M.. Perkowski, Miimizatio of quaterary Galois field sum of products expressio for multi-output quaterary logic fuctio usig quaterary Galois field decisio diagram, th EEE t. Symp. Multiple-Valued Logic (SMVL ), Dallas, Texas, US, - May (submitted). [] M. H.. Kha, Quatum realizatio of quaterary Feyma ad Toffoli gates, teratioal Coferece o Electrical ad Computer Egieerig (CECE ), Dhaka, Bagladesh, - December,, pp. -. []. Muthukrisha ad C. R. Stroud Jr., Multivalued logic gates for quatum computatio, Physical Review. vol.,, /-. X. CNCLUSN Multiple-valued reversible circuits are a promisig choice for future computig techology. Quaterary logic has the advatage that classical biary logic fuctios ca be expressed as quaterary logic fuctios by groupig -bits together ito quaterary digits. Quaterary ecoded reversible realizatio of biary logic fuctio will be half-times compact tha the reversible realizatio of origial biary logic fuctio i terms of the umber of iput/output lies required. There is oly a few works o CD based geeral sythesis method of quaterary logic fuctios [, ]. Experiece shows that CD based geeral sythesis methods are sometimes ot very cost effective for sythesis of some medium-scale buildig blocks. this case, problem specific maual sythesis of such medium-scale buildig blocks is relatively cost effective. Here, we preset problem specific maual sythesis of quaterary decoder, multiplexer, ad demultiplexer circuits usig reversible gates. These circuits are practically importat medium-scale buildig blocks for sythesis of large digital systems. These problem specific maual sythesis results will also help us to compare the complexity of CD based geeral sythesis methods. To aid the sythesis, we have used two macro-level quaterary gates multi-digit quaterary cotrolled shift gate (QCSG) ad quaterary Toffoli gates ad show their realizatio usig basic quaterary gates. (dvace olie publicatio: November )