THE advantages of using the residue number system (RNS)


 Clara Houston
 1 years ago
 Views:
Transcription
1 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 54, NO. 9, SEPTEMBER RNSToBinary Converter for a New ThreeModuli Set 2 n+1 1; 2 n ; 2 n 1 Pemmaraju V. Ananda Mohan, Fellow, IEEE Abstract In this brief, the design of residue number system (RNS) to binary converters for a new powersoftwo related threemoduli set is considered. This moduli set uses moduli of uniform word length (n to +1bits). It is derived from a previously investigated fourmoduli set Three RNStobinary converters are proposed for this moduli set: one using mixed radix conversion and the other two using Chinese Remainder Theorem. Detailed architectures of the three converters as well as comparison with some earlier proposed converters for threemoduli sets with uniform word length and the fourmoduli set are presented. Index Terms Digital signal processor (DSP), residue number system (RNS), reverse converters, threemoduli sets. I. INTRODUCTION THE advantages of using the residue number system (RNS) over conventional binary number system are well documented [1], [2]. RNS using powers of tworelated moduli sets has attracted lot of attention due to the possibility of efficient realization of the various building blocks needed such as adders, multipliers, binarytorns converters and RNStobinary converters. Particularly, the moduli set M1 has been extensively investigated especially regarding the realization of RNStobinary converters [3] [6], [11]. Recently, another powers of tworelated threemoduli set M2, viz., was also proposed [7], [8], [11], [17]. In this paper, we propose a new threemoduli set M4. This moduli set can be considered as derived from the fourmoduli set M3 due to Vinod and Premkumar [9] viz., by removing the modulus. Three converters have been proposed in this paper for this new moduli set based on Chinese Remainder Theorem (CRT) and mixed radix conversion (MRC). We estimate the hardware and conversion time requirements of these three proposed designs and compare them with the converters available in literature for similar dynamic range RNS. II. BACKGROUND MATERIAL There is a need for conversion from residue form to binary form after performing the desired signal processing using moduli processors in a RNSbased signal processor. This can be achieved by using one of the two approaches: 1) based on CRT; Manuscript received January 19, 2007; revised March 27, This paper was recommended by Associate Editor S. Tsukiyama. The author is with R&D, Electronics Corporation of India Limited, Bangalore , India ( Digital Object Identifier /TCSII ) based on MRC. The binary number corresponding to given residues in the RNS can be derived using CRT as (1) where and for and are known as the multiplicative inverses of. In each step of MRC, one mixed radix digit as well as several intermediate results are determined and next, the MRC digits are weighted using (2) to obtain the final decoded number. The decoded number is in the case of MRC expressed as III. RNSTOBINARY CONVERTERS FOR THE MODULI SET The new moduli set M4 is applicable for odd or even since all the moduli are mutually prime. Evidently, the residues are of word lengths,, and bits, respectively. The dynamic range M is which is less than that of the fourmoduli set for same. We denote the residues corresponding to this moduli set as and the binary decoded number corresponding to this residue set as B. The RNStobinary conversion for this moduli set can be carried out by using CRT or MRC. Converter I: The wellknown MRC technique suggested for this reverse conversion is illustrated in Fig. 1. The various multiplicative inverses,, in this converter, denoted as Converter I, can be computed as follows: (2) (3a) (3b) (3c) It can be verified easily that (3a) (3c) are correct. The implementation of the MRC algorithm of Fig. 1 using the various multiplicative inverses given in (3a) (3c) follows the architecture given in Fig. 2. The various modulo subtractors can make use of the wellknown property of. The subtraction can be realized by one scomplementing /$ IEEE
2 776 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 54, NO. 9, SEPTEMBER 2007 where,, and are the mixed radix digits. Note, however, that since the least significant bits of are given by,we need to compute only (the MSBs of ) (5) Fig. 1. MRC for the threemoduli set f2 0 1; 2 ; 2 0 1g. From (4) and (5), we have (6) Fig. 2. Architecture of the new converter I. and adding to using a modulo adder in the block MODSUB1. The mixed radix digit is thus the already available since. The subtraction involves two numbers of different word length of bits and of bits. By appending a 1bit most significant bit (MSB) of zero, can be considered as a bit word. Thus, one s complement of this word can be added to using a bit modulo adder in the block MODSUB2. Next, can be obtained by circularly left shifting already obtained by 1 bit. The computation of can be carried out as explained before in the case of since is bit wide and is bit wide using the block MODSUB3. Next, the multiplication of with to obtain [see (3c)] is carried out by first left circular shifting by 1 bit and one s complementing the bits in the result. The last stage in the converter shall compute using (2) (4) Denoting and of word lengths bit and bit, respectively, as,, the three operands to be added to obtain can be seen as shown in the equation at the bottom of the page, together with a least significant bit (LSB) of 1. Note that the primes indicate the inverted bits. These three words can be simplified as two bit words since the first and second words together have zeroes in all the bit positions. These two words can be added using a bit CPA (CPA1 in Fig. 2). Since bits in one operand being added are one, full adders can be replaced by pairs of exclusive NOR (EXNOR) and OR gates. The modulo adders can be realized using one scomplement adders (CPA with endaround carry) or by using special designs due to Efstathiou et al. [10]. In this brief, we consider the use of one scomplement adders. The hardware requirements for this converter are thus for MODSUB1, each for MODSUB2 and MODSUB3 and for the CPA1. The total hardware requirement and conversion time are presented in Table I. Converter II: We next consider the use of CRT for deriving the converter II. Note that the various multiplicative inverses needed in the computation of (1) are as follows: can be ob Substituting these in (1), the desired binary word tained as (7)
3 MOHAN: RNSTOBINARY CONVERTER FOR A NEW THREEMODULI SET 777 TABLE I COMPARISON OF VARIOUS CONVERTERS FOR THREEMODULI SETS Subtracting from both sides of (7) and dividing by, we have (8) where can be obtained by circularly rotating by two bits to the left (to compute ) and taking one s complement (to take into account the negative sign). We can compute (8) by adding the various terms using a CSA chain followed by a modulo adder. We denote, and as,, and. We manipulate (8) by rewriting the negative terms in terms of one s complements of similar word length and adding a correction term (9) The first seven terms can be rewritten so as to reduce the number of words to be added to four as shown in (10), at the bottom of the page.the last term in (10) can be seen to be. In this term, the sign bit has not been included. Note that is negative taking into account an additional MSB of 1. These terms can be rewritten as shown in (11), at the bottom of the page. The MSBs in the word shown in italics in (10) have been combined with the fourth word whose MSBs are zero. Further, the LSB 1 of has been absorbed in the LSB position of which was zero. Note that the sum of these five words in (11) can at most be and is less than. The five words in (11) can be added using a carry save adder (CSA) comprising of three stages CSA1, CSA2, CSA3 followed by a modulo adder as shown in Fig. 3(a). This modulo adder can be of parallel type. First, using CPA2, the CARRY and SUM output vectors of CSA3 can be added. The subtraction of and can be carried out by two threeinput adders by adding the CARRY and SUM vectors of the CSA3 with two scomplement of and and selecting the correct result using a 3:1 Multiplexer based on the sign bits of the result of the adders. Note that fulladders are needed for each of CSA4 and CSA5 and fulladders are needed for the each of CPA3 and CPA4. The CSA computing SUM and CARRY vectors (CSA1, CSA2, CSA3) and the carry (10) (11)
4 778 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 54, NO. 9, SEPTEMBER 2007 Fig. 3. Implementations of converters II and III based on CRT. propagate adder CPA2 need and. The total hardware requirement and conversion time are presented in Table I. Converter III: Note that the hardware requirement of the converter II can be reduced slightly by using ROM as will be shown next. It may be noted that the sum of the five words in (11) excluding the two MSBs in case of,, and four MSBs in case of (shown in bold face) is less than. Denoting the three 2bit MSB words of,, highlighted in bold as,, and, by having a ROM containing ten locations each bit wide (since ), the term needs to be added to, where (12) The value of can be read from a bit ROM using a four bit address since and added to the five words comprising in the CSA as shown in Fig. 3(b) and then only one subtraction of is needed. Note that in (12), the term 15 is added to take into account the four MSBs of and the 16 accounts for the negative value of considering the sign bit also. The ROM size can be reduced by noting that for,,, and for, and all the other values can be obtained by adding multiples of to or by appending two bits either 00, 01, 10 or 11 as MSBs. Thus, combinational logic together with three ROM locations each of bits can achieve the conversion. The five words in (11) and thus obtained can be added using a CSA comprising of four stages CSA6, CSA7, CSA8, and CSA9 followed by a modulo adder as shown in Fig. 3(b). This modulo adder can be of parallel type. CPA5 adds the CARRY and SUM output vectors of CSA9. The subtraction of can be carried out by adding the two scomplement of in a threeinput adder with the CARRY and SUM output vectors of the CSA9 and selecting the correct result using a 2:1 Multiplexer based on the sign bit of the result of the modulo adder. Note that Full adders each are needed for CSA10 and CPA6. The CSA computing SUM and CARRY vectors (CSA6, CSA7, CSA8, and CSA9) needs and. The resulting hardware requirement and conversion time are presented in Table I. Design Example: Consider using the moduli set {127, 63, 64} i.e., and the residue set {73, 22, 27}. The decoded binary number shall be The value shall be First can be obtained by left circular shift of by 2 bits to get and taking it s one scomplement to get. Thus, the five words to be added,,,, in (11) can be written as in (13). The multiplexer selects the output of the subtractor subtracting 8001 (i.e., to yield. In converter III, the terms to the right of the (13) dotted line need to be added to. Since, and,. Thus,, the last word to be added to the five operands to the right of the dotted line is obtained from the ROM as. The various words are as follows: One subtraction of 8001 from this value gives the desired. (14)
5 MOHAN: RNSTOBINARY CONVERTER FOR A NEW THREEMODULI SET 779 TABLE II COMPARISON OF BINARYTORNS CONVERTERS AND MULTIPLIERS FOR TWO MODULI IV. EVALUATION OF PROPOSED CONVERTERS The three new converters proposed in Section III for the moduli set M4 are compared next regarding the hardware and conversion time with converters available for the two threemoduli sets M1, M2 and fourmoduli set M3. In the case of the moduli set M1, the converters in [3] and [4] use bit CPAs with EAC and in [5] use bit CPAs. The converters CI, CII, and CIII in [6] used bit or bit CLAs. The converters for the moduli set M2 [7], [8], [17] used modulo adders due to Efstathiou et al. [10] and CPAs. For the sake of fair comparison, we consider the use of one scomplement adders for all adders modulo in these as well as proposed designs. The resulting hardware and delay requirements are summarized in Table I for the various designs. Evidently, the proposed converter I needs much less hardware than the converters [5], [8], [17], CII [6]. Further, it has similar hardware requirements as the converters [3], [4], CI and CIII [6]. It, however, needs more conversion time than the converters [3] [6], [8], [17]. All the proposed converters are superior to the fourmoduli converters [9], [12], [13] in hardware as well as conversion time requirements. The new converters II and III have less conversion time than the converters [3], [4], CI [6], [8], [17] and proposed converter I, however, needing much larger hardware. It can be seen that the proposed converters are in some cases superior to other converters either in hardware requirement or conversion time. However, the proposed moduli set as well as the moduli set M2 use residues of the form whereas the moduli set M1 has one modulus of the type. The modulo multiplication [frequently needed in the finiteimpulse response (FIR) filter implementations] as well as binarytorns conversion, need less hardware and less computation time for the moduli of the type than for the moduli of the type as shown in Table II. In the evaluation of multipliers presented in Table II, it is assumed that CPAs are used in the modulo adders and that no Booth recoding is employed. V. CONCLUSION In this brief, we have considered the residue to binary conversion for a new threemoduli set derived from Vinod fourmoduli set by deleting one modulus. The Converter I is derived using the wellknown MRC technique. The converters II and III are derived using the wellknown CRT. The converter III uses ROM. All the three proposed converters have been evaluated regarding hardware and conversion time requirements and compared with other recently described converters for threemoduli sets as well as the fourmoduli set of Vinod et al. all using uniform moduli length, to bring out the tradeoffs in hardware and conversion times. REFERENCES [1] N. S. Szabo and R. I. Tanaka, Residue Arithmetic and Its Applications to Computer Technology. New York: McGraw Hill, [2] M. A. Soderstrand, W. K. Jenkins, G. A. Jullien, and F. J. Taylor, Residue Number System Arithmetic: Modern Applications in Digital Signal Processing. New York: IEEE Press, [3] S. J. Piestrak, A highspeed realization of residue to binary system converter, IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process., vol. 42, no. 10, pp , Oct [4] A. Dhurkadas, Comments on A highspeed realization of a residue to binary number system converter, IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process., vol. 45, no. 3, pp , Mar [5] M. Bharadwaj, A. B. Premkumar, and T. Srikanthan, Breaking the 2nbit carry propagation barrier in residue to binary conversion for the f2 0 1; 2 ; 2 +1gmoduli set, IEEE Trans. Circuits Syst. I, Fundam. Theory Appl., vol. 45, no. 9, pp , Sep [6] Y. Wang, X. Song, M. Aboulhamid, and H. Shen, Adderbased residue to binary number converters for f2 0 1; 2 ; 2 +1g, IEEE Trans. Signal Processing, vol. 50, no. 7, pp , Jul [7] A. A. Hiasat and H. S. AbdelAtyZohdy, Residue to binary arithmetic converter for the moduli set f2 ; 2 01; 2 01g, IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process., vol. 45, no. 2, pp , Feb [8] W. Wang, M. N. S. Swamy, M. O. Ahmad, and Y. Wang, A highspeed residuetobinary converter for threemoduli f2 ; 2 0 1; 2 0 1g RNS and a scheme for its VLSI implementation, IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process., vol. 47, no. 12, pp , Dec [9] A. P. Vinod and A. B. Premkumar, A residue to binary converter for the 4moduli superset f2 0 1; 2 ; 2 +1; 2 0 1g, J. Circuits Syst. Comput., vol. 10, pp , [10] C. Efstathiou, D. Nikolos, and J. Kalamatinos, Areatime efficient modulo adder design, IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process., vol. 41, pp , [11] W. Wang, M. N. S. Swamy, M. O. Ahmad, and Y. Wang, A study of the residuetobinary converters for the threemoduli sets, IEEE Trans. Circuits Syst. I, Fundam. Theory Appl., vol. 50, no. 2, p., Feb [12] B. Cao, T. Srikanthan, and C. H. Chang, Efficient reverse converters for the fourmoduli sets f2 0 1; 2 ; 2 +1; 2 0 1g and f2 0 1; 2 ; 2 +1; 2 0 1g, Proc. IEE Comput. Digit. Tech., vol. 152, no. 5, pp , Sep [13] B. Cao, C. H. Chang, and T. Srikanthan, New efficient residue to binary converters for 4moduli set f2 0 1; 2 ; 2 +1; 2 0 1g, in Proc. ISCAS, 2003, vol. 4, pp [14] G. Bi and E. V. Jones, Fast conversion between binary and residue numbers, Electron. Lett., vol. 24, pp , Sep [15] Z. Wang, G. A. Jullien, and W. C. Miller, An algorithm for multiplication modulo (2 0 1), in Proc. 39th Midwest Symp. Circuits Syst., 1997, pp [16] R. Zimmermann, Efficient VLSI implementation of modulo (2 6 1) addition and multiplication, in Proc. IEEE Symp. Comput. Arithm., Apr. 1999, pp [17] W. Wang, M. N. S. Swamy, M. O. Ahmad, and Y. Wang, A note on A highspeed residue to binary converter for threemoduli f2 ; 2 0 1; 2 0 1g RNS and a scheme for its VLSI implementation, IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process., vol. 49, no. 3, p. 230, Mar
A NEW EFFICIENT FPGA DESIGN OF RESIDUETOBINARY CONVERTER
A NEW EFFICIENT FPGA DESIGN OF RESIDUETOBINARY CONVERTER Edem Kwedzo Bankas and Kazeem Alagbe Gbolagade Department of Computer Science, Faculty of Mathematical Science, University for Development Studies,
More informationAn Efficient RNS to Binary Converter Using the Moduli Set {2n + 1, 2n, 2n 1}
An Efficient RNS to Binary Converter Using the oduli Set {n + 1, n, n 1} Kazeem Alagbe Gbolagade 1,, ember, IEEE and Sorin Dan Cotofana 1, Senior ember IEEE, 1. Computer Engineering Laboratory, Delft University
More informationHigh Speed RNSToBinary Converter Design Using Parallel Prefix Adders
High Speed RNSToBinary Converter Design Using Parallel Prefix Adders Augusta Angel. M 1, Vijay M.M 2 Second Year M.E (Applied Electronics) Dept. of ECE, VV College of Engineering, Tisayanvillai, TN,
More informationDesign and Implementation of Efficient Binary to Residue Converter Using Moduli Method
(An ISO 3297: 2007 Certified Organization) Vol2, Special Issue 1, March 2014 Design and Implementation of Efficient Binary to Residue Converter Using Moduli Method VidhyalakshmiM 1, ProfSatyabama 2 PG
More informationImplementation of Modified Booth Algorithm (Radix 4) and its Comparison with Booth Algorithm (Radix2)
Advance in Electronic and Electric Engineering. ISSN 22311297, Volume 3, Number 6 (2013), pp. 683690 Research India Publications http://www.ripublication.com/aeee.htm Implementation of Modified Booth
More informationLogic and Computer Design Fundamentals Adders and Multiplication
Logic and Computer Design Fundamentals Adders and Multiplication 24 Pearson Education, Inc. Overview Iterative combinational circuits Binary adders Half and full adders Ripple carry and carry lookahead
More informationDESIGN CARRY SELECT ADDER WITH DLATCH
Int. J. Engg. Res. & Sci. & Tech. 205 Satish Kumar Patnayak et al., 205 Research Paper ISSN 239599 www.ijerst.com Vol. 4, No. 2, May 205 205 IJERST. All Rights Reserved DESIGN CARRY SELECT ADDER WITH
More informationD r = d p1 d p2.. d 1 d 0.d 1 d 2. D n. EECC341  Shaaban
Positional Number Systems A number system consists of an order set of symbols (digits) with relations defined for +,,*, / The radix (or base) of the number system is the total number of digits allowed
More informationA New NonRestoring Square Root Algorithm and Its VLSI Implementations
International Conference on Computer Design (ICCD 96), October 7 9, 996, Austin, Texas, USA A New NonRestoring Square Root Algorithm and Its VLSI Implementations Yamin Li and Wanming Chu Computer Architecture
More informationChapter 4 Register Transfer and Microoperations. Section 4.1 Register Transfer Language
Chapter 4 Register Transfer and Microoperations Section 4.1 Register Transfer Language Digital systems are composed of modules that are constructed from digital components, such as registers, decoders,
More informationHere 4 is the least significant digit (LSD) and 2 is the most significant digit (MSD).
Number System Introduction Number systems provide the basis for all operations in information processing systems. In a number system the information is divided into a group of symbols; for example, 26
More informationVARIABLE fractional delay (VFD) digital filter design has
86 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 54, NO. 1, JANUARY 2007 Design of 1D Stable Variable Fractional Delay IIR Filters Hui Zhao Hon Keung Kwan Abstract In this brief,
More informationHigh Speed FIR Filter Based on Truncated Multiplier and Parallel Adder
High Speed FIR Filter Based on Truncated Multiplier and Parallel Adder Deepshikha Bharti #1, K. Anusudha *2 #1 Student,M.Tech, Department of Electronics Engineering, Pondicherry University, puducherry,
More information2. DADDA MULTIPLIERS Dadda multipliers are a refinement of the parallel multipliers first presented by Wallace in 1964 [1]. Thus both multiplier metho
A comparison of Dadda and Wallace multiplier delays Whitney J. Townsend, * Earl E. Swartzlander, Jr., ** and Jacob A. Abraham * * Computer Engineering Research Center, The University of Texas at Austin
More informationChapter 4 Combinational Logic
Chapter 4 Combinational Logic ChihTsun Huang ( 黃稚存 ) Department of Computer Science National Tsing Hua University Outline Introduction Combinational Circuits Analysis Procedure Design Procedure Binary
More informationComputation of Forward and Inverse MDCT Using Clenshaw s Recurrence Formula
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 51, NO. 5, MAY 2003 1439 Computation of Forward Inverse MDCT Using Clenshaw s Recurrence Formula Vladimir Nikolajevic, Student Member, IEEE, Gerhard Fettweis,
More informationLogic Design. Dr. Yosry A. Azzam
Logic Design Dr. Yosry A. Azzam Binary systems Chapter 1 Agenda Binary Systems : Binary Numbers, Binary Codes, Binary Logic ASCII Code (American Standard Code for Information Interchange) Boolean Algebra
More informationMultiplierbased BinarytoRNS Converter Modulo {2n +  k}
Multiplierbased BinarytoRNS Converter Modulo {2n +  k} Pedro Miguens Matutino ISEL/INESCID/IST Lisbon, Portugal pmiguens@deetc.isel.pt Hector Pettenghi, Ricardo Chaves and Leonel Sousa IST/INESCID
More informationExclusive OR/Exclusive NOR (XOR/XNOR)
Exclusive OR/Exclusive NOR (XOR/XNOR) XOR and XNOR are useful logic functions. Both have two or more inputs. The truth table for two inputs is shown at right. a XOR b = 1 if and only if (iff) a b. a XNOR
More informationChapter 4. Computer Arithmetic
Chapter 4 Computer Arithmetic 4.1 Number Systems A number system uses a specific radix (base). Radices that are power of 2 are widely used in digital systems. These radices include binary (base 2), quaternary
More informationComputer Organization and Architecture
Computer Organization and Architecture Chapter 9 Computer Arithmetic Arithmetic & Logic Unit Performs arithmetic and logic operations on data everything that we think of as computing. Everything else in
More informationIJCSIET International Journal of Computer Science information and Engg., Technologies ISSN 22774408 01092015061
Implementation of Power Optimized CSLA Architecture using DLatch Approach 1 A.Prasanthi, 2 R.Sumalatha 1 Student, 2 Associate professor 1,2 G. Pullaiah College of Engineering & Technology, Kurnool, Andhra
More informationIMPLEMENTATION OF HIGH SPEED ENHANCED CSLA BASED ON GATED DLATCH
IMPLEMENTATION OF HIGH SPEED ENHANCED BASED ON GATED DLATCH 1 MEDA NAGAPAVANI, 2 T. JYOTHI 1 P.G Student, VLSI Design, Dept of ECE, 2 Assistant Professor, Dept of ECE. Sri Venkatesa Perumal College of
More informationRNCodings: New Insights and Some Applications
RNCodings: New Insights and Some Applications Abstract During any composite computation there is a constant need for rounding intermediate results before they can participate in further processing. Recently
More informationIMPLEMENTATION OF HIGH SPEED ENHANCED CSLA BASED ON GATED DLATCH:
IMPLEMENTATION OF HIGH SPEED ENHANCED BASED ON GATED DLATCH 1 MEDA NAGAPAVANI, 2 T. JYOTHI 1 P.G Student, VLSI Design, Dept of ECE, 2 Assistant Professor, Dept of ECE. Sri Venkatesa Perumal College of
More informationNUMBERING SYSTEMS C HAPTER 1.0 INTRODUCTION 1.1 A REVIEW OF THE DECIMAL SYSTEM 1.2 BINARY NUMBERING SYSTEM
12 Digital Principles Switching Theory C HAPTER 1 NUMBERING SYSTEMS 1.0 INTRODUCTION Inside today s computers, data is represented as 1 s and 0 s. These 1 s and 0 s might be stored magnetically on a disk,
More informationFloating Point Fused AddSubtract and Fused DotProduct Units
Floating Point Fused AddSubtract and Fused DotProduct Units S. Kishor [1], S. P. Prakash [2] PG Scholar (VLSI DESIGN), Department of ECE Bannari Amman Institute of Technology, Sathyamangalam, Tamil Nadu,
More informationOct: 50 8 = 6 (r = 2) 6 8 = 0 (r = 6) Writing the remainders in reverse order we get: (50) 10 = (62) 8
ECE Department Summer LECTURE #5: Number Systems EEL : Digital Logic and Computer Systems Based on lecture notes by Dr. Eric M. Schwartz Decimal Number System: Our standard number system is base, also
More informationBinary Adders: Half Adders and Full Adders
Binary Adders: Half Adders and Full Adders In this set of slides, we present the two basic types of adders: 1. Half adders, and 2. Full adders. Each type of adder functions to add two binary bits. In order
More information3.1 Combinational Circuits
EED2003 Digital Design Presentation 3: Combinational Logic Design Asst. Prof.Dr. Ahmet ÖZKURT Asst. Prof.Dr Hakkı T. YALAZAN Based on the Notes byjaeyoung Choi Fall 2000 3.1 Combinational Circuits logic
More informationMT1 Number Systems. In general, the number a 3 a 2 a 1 a 0 in a base b number system represents the following number:
MT1 Number Systems MT1.1 Introduction A number system is a well defined structured way of representing or expressing numbers as a combination of the elements of a finite set of mathematical symbols (i.e.,
More informationData Representation Binary Numbers
Data Representation Binary Numbers Integer Conversion Between Decimal and Binary Bases Task accomplished by Repeated division of decimal number by 2 (integer part of decimal number) Repeated multiplication
More informationCHAPTER 1 BINARY SYSTEM
STUDENT COPY DIGITAL & MICROPROCESSORS 3 CHAPTER 1 BINARY SYSTEM Base Conversion: A number a n, a n 1 a 2, a 1 a 0 a 1 a 2 a 3 expressed in a base r system has coefficient multiplied by powers of r. n
More informationChapter 4. Combinational Logic. Outline. ! Combinational Circuits. ! Analysis and Design Procedures. ! Binary Adders. ! Other Arithmetic Circuits
Chapter 4 Combinational Logic 4 Outline! Combinational Circuits! Analysis and Design Procedures! Binary Adders! Other Arithmetic Circuits! Decoders and Encoders! Multiplexers 42 Combinational v.s Sequential
More informationRipple Carry and Carry Lookahead Adders
Ripple Carry and Carry Lookahead Adders 1 Objectives Design ripple carry and carry lookahead (CLA) adders. Use VHDL CAD tools. Use hierarchical design techniques. Model and simulate combinational logic
More informationCHAPTER 5 LOGIC IMPLEMENTATION
47 CHAPTER 5 LOGIC IMPLEMENTATION 5.1 INTRODUCTION Logic circuits are used to build computer hardware as well as other products which use any kind of digital hardware. Late 1960 s and early 1970 s saw
More informationCOMBINATIONAL CIRCUITS
COMBINATIONAL CIRCUITS http://www.tutorialspoint.com/computer_logical_organization/combinational_circuits.htm Copyright tutorialspoint.com Combinational circuit is a circuit in which we combine the different
More informationCOMPUTER ARCHITECTURE. ALU (2)  Integer Arithmetic
HUMBOLDTUNIVERSITÄT ZU BERLIN INSTITUT FÜR INFORMATIK COMPUTER ARCHITECTURE Lecture 11 ALU (2)  Integer Arithmetic Sommersemester 21 Leitung: Prof. Dr. Miroslaw Malek www.informatik.huberlin.de/rok/ca
More informationInteger multiplication
Integer multiplication Suppose we have two unsigned integers, A and B, and we wish to compute their product. Let A be the multiplicand and B the multiplier: A n 1... A 1 A 0 multiplicand B n 1... B 1 B
More informationالدكتور المھندس عادل مانع داخل
الدكتور المھندس عادل مانع داخل / میسان جامعة / كلیة الھندسة قسم الھندسة الكھرباي یة Chapter 1: Digital Systems Discrete Data Examples: 26 letters of the alphabet (A, B etc) 10 decimal digits (0, 1, 2 etc)
More informationLecture 7: Signed Numbers & Arithmetic Circuits. BCD (Binary Coded Decimal) Points Addressed in this Lecture
Points ddressed in this Lecture Lecture 7: Signed Numbers rithmetic Circuits Professor Peter Cheung Department of EEE, Imperial College London (Floyd 2.52.7, 6.16.7) (Tocci 6.16.11, 9.19.2, 9.4) Representing
More informationNumeral System and Its Importance ROOM: B405
Numeral System and Its Importance HONG@IS.NAIST.JP ROOM: B405 Contents Number System Introduction Number systems used by human Number systems used by computer Number System Conversion Signed Number Representation
More informationSAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 5. Combinational & Sequential Circuits
SAMPLE OF THE STUD MATERIAL PART OF CHAPTER 5 5. Introduction Digital circuits can be classified into two types: Combinational digital circuits and Sequential digital circuits. 5.2 Combinational Digital
More informationCOMPUTER ARCHITECTURE IMPORTANT QUESTIONS FOR PRACTICE
COMPUTER ARCHITECTURE IMPORTANT QUESTIONS FOR PRACTICE 1. How many bits wide memory address have to be if the computer had 16 MB of memory? (use the smallest value possible) 2. A digital computer has a
More informationDigital Fundamentals
Digital Fundamentals with PLD Programming Floyd Chapter 2 29 Pearson Education Decimal Numbers The position of each digit in a weighted number system is assigned a weight based on the base or radix of
More informationLOW POWER AREA EFFICIENT CARRY SELECT ADDER USING TSPC DFLIP FLOP
LOW POWER AREA EFFICIENT CARRY SELECT ADDER USING TSPC DFLIP FLOP Manjunath.R 1, Nagabhushan.M 2, Shruthi Gatade 3 1,2,3 ECE, MSRIT, (India) ABSTRACT In the emerging field of electronics, consumers demand
More informationP A R T DIGITAL TECHNOLOGY
P A R T A DIGITAL TECHNOLOGY 1 CHAPTER NUMBERING SYSTEMS 1.0 INTRODUCTION This chapter discusses several important concepts including the binary, octal and hexadecimal numbering systems, binary data organization
More informationVLSI Architecture for DCT Based On High Quality DA
International Journal of Engineering and Technical Research (IJETR) ISSN: 23210869, Volume2, Issue6, June 2014 VLSI Architecture for DCT Based On High Quality DA Urbi Sharma, Tarun Verma, Rita Jain
More informationTutorial 5 Special Combinational Logic Circuit
Tutorial 5 Special Combinational Logic Circuit Question 1 a) What is the function of an adder circuit? b) A halfadder adds two binary bits, true or false? c) A halfadder has a sum output only, true or
More informationCOMBINATIONAL LOGIC CIRCUITS
COMBINATIONAL LOGIC CIRCUITS 4.1 INTRODUCTION The digital system consists of two types of circuits, namely: (i) Combinational circuits and (ii) Sequential circuits A combinational circuit consists of logic
More informationLinköping University Post Print. Fast and VLSI efficient binarytocsd encoder using bypass signal
Linköping University Post Print Fast and VLSI efficient binarytocsd encoder using bypass signal M Faust, Oscar Gustafsson and CH Chang N.B.: When citing this work, cite the original article. Original
More informationArithmetic Operations
Arithmetic Operations Dongbing Gu School of Computer Science and Electronic Engineering University of Essex UK Spring 2013 D. Gu (Univ. of Essex) Arithmetic Operations Spring 2013 1 / 34 Outline 1 Introduction
More informationSistemas Digitais I LESI  2º ano
Sistemas Digitais I LESI  2º ano Lesson 6  Combinational Design Practices Prof. João Miguel Fernandes (miguel@di.uminho.pt) Dept. Informática UNIVERSIDADE DO MINHO ESCOLA DE ENGENHARIA  PLDs (1)  The
More informationUnit 2: Number Systems, Codes and Logic Functions
Unit 2: Number Systems, Codes and Logic Functions Introduction A digital computer manipulates discrete elements of data and that these elements are represented in the binary forms. Operands used for calculations
More informationA Little Perspective Combinational Logic Circuits
A Little Perspective Combinational Logic Circuits COMP 251 Computer Organization and Architecture Fall 2009 Motivating Example Recall our machine s architecture: A Simple ALU Consider an ALU that can perform
More information4 Combinational Components
Chapter 4 Combinational Components Page of 8 4 Combinational Components In constructing large digital circuits, instead of starting with the basic gates as building blocks, we often start with larger building
More informationMultipliers. Introduction
Multipliers Introduction Multipliers play an important role in today s digital signal processing and various other applications. With advances in technology, many researchers have tried and are trying
More informationA New Euclidean Division Algorithm for Residue Number Systems
A New Euclidean Division Algorithm for Residue Number Systems JeanClaude Bajard and Laurent Stéphane Didier Laboratoire d Informatique de Marseille CMI, Université de Provence, 39 rue JoliotCurie, 3453
More informationDesign and Implementation of Delay Efficient Carry Select Adder Using DLatch
Design and Implementation of Delay Efficient Carry Select Adder Using DLatch.Y.Raghu Ramprasad M.Tech, Associate Professor,2. Jyogi Leelavathi, M.Tech (embedded systems),.2.ece Department, Shri Sai Institute
More informationConversion between number systems:
Conversion between number systems: Radixr to decimal. Decimal to binary. Decimal to Radixr Binary to Octal Binary to Hex Binary arithmetic operations. Negative number representations. Switching Algebra
More informationDigital Circuits. Frequently Asked Questions
Digital Circuits Frequently Asked Questions Module 1: Digital & Analog Signals 1. What is a signal? Signals carry information and are defined as any physical quantity that varies with time, space, or any
More informationArithmetic Computations of GALOIS Field In MultiValued Logic
Arithmetic Computations of GALOIS Field In MultiValued Logic Ankita. N. Sakhare & M. L. Keote Dept of Electronics and Telecommunication, Y.C.C.E, Wanadongri, Nagpur, India Email : sakhare.ankita@gmail.com,
More informationFast Adder Design using Redundant Binary Numbers with Reduced Chip Complexity
Fast Adder Design using Redundant Binary Numbers with Reduced Chip Complexity Rakesh Kumar Saxena, Member IACSIT, Neelam Sharma and A. K. Wadhwani Abstract Redundant Binary Signed Digit Adder and Multiplier
More informationSineCosine Computation Using CORDIC Algorithm
SineCosine Computation Using CORDIC Algorithm Ranjita Naik 1, Riyazahammad Nadaf 2 UG Student, Dept of Computer Science, BVB College of Engineering & Technology, Hubli, India 1 PG Student, Dept of Electronics
More informationChapter 6 Digital Arithmetic: Operations & Circuits
Chapter 6 Digital Arithmetic: Operations & Circuits Chapter 6 Objectives Selected areas covered in this chapter: Binary addition, subtraction, multiplication, division. Differences between binary addition
More informationEfficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding
646 IEEE TRANSACTIONS ON COPUTERS, VOL. c34, NO. 7, JULY 1985 Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding THU VAN VU Abstract Two conversion techniques
More informationChapter 1 Binary Systems 11. Digital Systems
Chapter 1 Binary Systems 11. Digital Systems The Generalpurpose digital computer is the bestknown example of a digital system. The major parts of a computer are a memory unit, a central processing unit,
More informationHigh Speed and Efficient 4Tap FIR Filter Design Using Modified ETA and Multipliers
High Speed and Efficient 4Tap FIR Filter Design Using Modified ETA and Multipliers Mehta Shantanu Sheetal #1, Vigneswaran T. #2 # School of Electronics Engineering, VIT University Chennai, Tamil Nadu,
More informationTheory of Logic Circuits. Laboratory manual. Exercise 6
Zakład Mikroinformatyki i Teorii Automatów Cyfrowych Theory of Logic Circuits Laboratory manual Exercise 6 Selected arithmetic switching circuits 2008 Tomasz Podeszwa, Piotr Czekalski (edt.) 1. Number
More information1 Number System (Lecture 1 and 2 supplement)
1 Number System (Lecture 1 and 2 supplement) By Dr. Taek Kwon Many different number systems perhaps from the prehistoric era have been developed and evolved. Among them, binary number system is one of
More informationChapter 12. Algorithmic State Machine
Chapter 12 Algorithmic State Machine 12.0 Introduction In Chapter 10, we introduced two models of synchronous sequential network, which are Mealy and Moore machines. In this chapter, we would like to introduce
More informationExamples of Solved Problems for Chapter3,5,6,7,and8
Chapter 3 Examples of Solved Problems for Chapter3,5,6,7,and8 This document presents some typical problems that the student may encounter, and shows how such problems can be solved. Note that the numbering
More informationIntroduction Number Systems and Conversion
UNIT 1 Introduction Number Systems and Conversion Objectives 1. Introduction The first part of this unit introduces the material to be studied later. In addition to getting an overview of the material
More informationLow Power Multiplier Design Using Latches and FlipFlops
Journal of Computer Science 6 (10): 11171122, 2010 ISSN 15493636 2010 Science Publications Low Power Multiplier Design Using Latches and FlipFlops 1 C.N. Marimuthu and 2 P. Thangaraj 1 Department of
More informationHighThroughput Digital IIR Filter Design
HighThroughput Digital IIR Filter Design Zhao Wang *1, ChiuWei Pan, Yuanchen Song 3, Carl Sechen *4 The University of Texas at Dallas, TX, 75080, U.S.A *1 wangzhao1984@hotmail.com; *4 carl.sechen@utdallas.edu
More informationRNcoding of Numbers: New Insights and Some Applications
RNcoding of Numbers: New Insights and Some Applications Peter Kornerup Dept. of Mathematics and Computer Science SDU, Odense, Denmark & JeanMichel Muller LIP/Arénaire (CRNSENS LyonINRIAUCBL) Lyon,
More informationCPEN 214  Digital Logic Design Binary Systems
CPEN 4  Digital Logic Design Binary Systems C. Gerousis Digital Design 3 rd Ed., Mano Prentice Hall Digital vs. Analog An analog system has continuous range of values A mercury thermometer Vinyl records
More informationSwitching Circuits & Logic Design
Switching Circuits & Logic Design JieHong Roland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Fall 2013 1 1 Number Systems and Conversion Babylonian number system (3100 B.C.)
More informationChapter 4. Arithmetic for Computers
Chapter 4 Arithmetic for Computers Arithmetic Where we've been: Performance (seconds, cycles, instructions) What's up ahead: Implementing the Architecture operation a b 32 32 ALU 32 result 2 Constructing
More informationBy the end of the lecture, you should be able to:
Extra Lecture: Number Systems Objectives  To understand: Base of number systems: decimal, binary, octal and hexadecimal Textual information stored as ASCII Binary addition/subtraction, multiplication
More informationRedundant Radix4 Representation With High Speed Arithmetic Coprocessor Using Carry Save And Redundant Signed Digit Technique
Redundant Radix4 Representation With High Speed Arithmetic Coprocessor Using Carry Save And Redundant Signed Digit Technique Ashish Manoharrao Ingale Abstract: Division is the inverse of multiplication
More informationDesign of the ALU Adder, Logic, and the Control Unit
Design of the ALU Adder, Logic, and the Control Unit This lecture will finish our look at the CPU and ALU of the computer. Remember: 1. The ALU performs the arithmetic and logic operations. 2. The control
More informationChapter 4 Combinational Logic
EEA051  Digital Logic 數位邏輯 Chapter 4 Combinational Logic 吳俊興國立高雄大學資訊工程學系 November 2005 Chapter 4 Combinational Logic 41 Combinational Circuits 42 Analysis Procedure 43 Design Procedure 44 Binary AdderSubtractor
More informationCHAPTER 3 Number System and Codes
CHAPTER 3 Number System and Codes 3.1 Introduction On hearing the word number, we immediately think of familiar decimal number system with its 10 digits; 0,1, 2,3,4,5,6, 7, 8 and 9. these numbers are called
More informationObjectives: 1. Half Adder. 2. Full Adder. 3. Binary Adder. 4. Binary Subtractor. 5. Binary AdderSubtractor. 1. Half Adder
Objectives:. Half Adder. 2. Full Adder. 3. Bary Adder. 4. Bary ubtractor. 5. Bary Adderubtractor.. Half Adder Half Adder: is a combational circuit that performs the addition of two bits, this circuit
More informationVLSI Architecture for Efficient LiftingBased Forward and Inverse DWT
VLSI Architecture for Efficient LiftingBased Forward and Inverse DWT A. Kishore kumar 1, Dr. M. Satyanarayana 2 Electronics and Communication Engineering Dept., M.V.G.R College of Engineering, Vizianagaram,
More informationNUMBER SYSTEMS. 1.1 Introduction
NUMBER SYSTEMS 1.1 Introduction There are several number systems which we normally use, such as decimal, binary, octal, hexadecimal, etc. Amongst them we are most familiar with the decimal number system.
More informationDecimaltoBinary Conversion. Computer & Microprocessor Architecture HCA103. Repeated Divisionby2 Method. Repeated Multiplicationby2 Method
DecimaltoBinary Conversion Computer & Microprocessor Architecture HCA103 Computer Arithmetic Algorithm 1 Step 1: Break the number in two parts: Whole number and fraction part. Step 2: Repeated Divisionby2
More informationDesign and Analysis of Parallel AES Encryption and Decryption Algorithm for Multi Processor Arrays
IOSR Journal of VLSI and Signal Processing (IOSRJVSP) Volume 5, Issue, Ver. III (Jan  Feb. 205), PP 0 eissn: 239 4200, pissn No. : 239 497 www.iosrjournals.org Design and Analysis of Parallel AES
More informationCHAPTER V NUMBER SYSTEMS AND ARITHMETIC
CHAPTER V1 CHAPTER V CHAPTER V NUMBER SYSTEMS AND ARITHMETIC CHAPTER V2 NUMBER SYSTEMS RADIXR REPRESENTATION Decimal number expansion 73625 10 = ( 7 10 4 ) + ( 3 10 3 ) + ( 6 10 2 ) + ( 2 10 1 ) +(
More informationBinary Numbering Systems
Binary Numbering Systems April 1997, ver. 1 Application Note 83 Introduction Binary numbering systems are used in virtually all digital systems, including digital signal processing (DSP), networking, and
More informationCombinational logic design case studies
Combinational logic design case studies General design procedure Case studies CD to 7segment display controller logical function unit process line controller calendar subsystem rithmetic circuits integer
More informationBinary Representation and Computer Arithmetic
Binary Representation and Computer Arithmetic The decimal system of counting and keeping track of items was first created by Hindu mathematicians in India in A.D. 4. Since it involved the use of fingers
More informationPower Efficient Carry Select Adder using DLatch
Power Efficient Carry Select Adder using DLatch 1 S.A.Mashankar, Mtech. B.D.C.E Sevagram, 2 R.D.Kadam, B.D.C.E Sevagram, 3 P.R.Indurkar, B.D.C.E. Sevagram, ***
More informationCOMPUTER ARCHITECTURE IT0205
COMPUTER ARCHITECTURE IT0205 M.Thenmozhi/Kayalvizhi Jayavel/M.B.Panbu Asst.Prof.(Sr.G)/Asst.Prof.(Sr.G)/Asst.Prof.(O.G) Department of IT SRM University, Kattankulathur 1 Disclaimer The contents of the
More informationLet s put together a Manual Processor
Lecture 14 Let s put together a Manual Processor Hardware Lecture 14 Slide 1 The processor Inside every computer there is at least one processor which can take an instruction, some operands and produce
More informationLow PowerDelayProduct CMOS Full Adder
Low PowerDelayProduct CMOS Full Adder Ankita Bhati, Prof. Vinod Kr. Pathak, Dr. Rita Jain Department of Electronics and Communication, LNCT, Bhopal, India, aankita.bhati @gmail.com Abstract This paper
More informationDEPARTMENT OF INFORMATION TECHNLOGY
DRONACHARYA GROUP OF INSTITUTIONS, GREATER NOIDA Affiliated to Mahamaya Technical University, Noida Approved by AICTE DEPARTMENT OF INFORMATION TECHNLOGY Lab Manual for Computer Organization Lab ECS453
More informationThe string of digits 101101 in the binary number system represents the quantity
Data Representation Section 3.1 Data Types Registers contain either data or control information Control information is a bit or group of bits used to specify the sequence of command signals needed for
More informationNonRestoring Divider Circuit Using a MCIT Based Adder Cell having Low Energy and High Speed Array
International Journal of Scientific & Engineering Research Volume 3, Issue 4, April2012 1 NonRestoring Divider Circuit Using a MCIT Based Adder Cell having Low Energy and High Speed Array Owk Prasanth
More information