Preview

Computer and Adders

Powerful Essays
Open Document
Open Document
3829 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Computer and Adders
FAST VLSI BINARY ADDITION
Dept. of Electrical and Computer Engineering University of Minnesota, Minneapolis, MN 55455, USA E-mail: parhi@ee.umn.edu
Keshab K. Parhi

Abstract - This paper presents novel architectures for fast binary addition which can be implemented using multiplexers only. Binary addition is carried out using a fast redundant-to-binary converter. It is shown that appropriate encoding of the redundant digits and recasting the binary addition as a redundant-to-binary conversion reduces the latency of addition from Wtfa to Wtmux where tfa and tmux , respectively, represent binary full adder and multiplexer delays, and W is the word-length. A family of fast converter architectures is developed based on tree-type (obtained using look-ahead techniques) and carry-select approaches. The carrygeneration component is the critical component in redundant-to-binary conversion and binary addition. It is shown that, if the word-length, W , is a power of two, then all carry signals can be generated in log2 Wtmux time using W (log2 W ? 1) + 1 multiplexers using a tree-type converter. It is shown that fastest binary addition can be performed using (Wlog2 W + 1) multiplexers in time (log2 W + 1)tmux . If the speci ed converter latency is greater than log2 Wtmux, then a family of converters using fewest multiplexers can be designed based on carry-select approach. It is shown that the power consumption in carry-select adders is minimized by increasing the number of segments in the adder.
Binary addition is one of the primitive operations in computer arithmetic. The well known ripple carry adder can add two W -bit binary numbers using W binary full adders with latency Wtfa where tfa represents the binary full adder delay 1]. Fast addition can be carried out using various fast adders such as carry-select adder 2] or binary look-ahead adder 3]. These fast adders can also be implemented e ciently using multiplexers only. Another approach to designing much faster



References: 1] K. Hwang, Computer Arithmetic: Pronciples, Architecture and Design, Wiley, NY, 1979. 2] J. Uya, K. Kaneko, and J. Yasui, A CMOS oating point multiplier", IEEE Jour. of Solid-State Circuits, vol. SC-19, pp. 697{702, Oct. 1984. 3] R. P. Brent and H. T. Kung, A regular layout for parallel adders", IEEE Trans. on Computers, vol. C-31, pp. 260{264, Mar. 1982. 4] R. I. Hartley and K. K. Parhi, Digit-Serial Computation, Kluwer Academic Publishers, Norwell, MA, 1995. 5] A. Avizienis, Signed digit number representation for fast parallel arithmetic", IRE Trans. on Computers, vol. EC-10, pp. 389{400, Sept. 1961. 6] S.-M. Yen et al., An e cient redundant-binary number to binary number converter", IEEE Jour. of Solid-State Circuits, vol. 27, pp. 109{112, Jan. 1992. 7] H. R. Srinivas and K. K. Parhi, A fast VLSI adder architecture", IEEE Jour. of Solid-State Circuits, vol. 27, pp. 761{767, May 1992. 8] J. M. Dobson and G. M. Blair, Fast two 's complement VLSI adder design", Electronics Letters, vol. 31, pp. 773{783, 28th Sept. 1995. 9] H. Makino et al., An 8.8-ns 54X54-bit multiplier with high speed redundant binary architecture", IEEE Jour. of Solid-State Circuits, vol. 31, pp. 773{783, June 1996. 10] K. K. Parhi and D. G. Messerschmitt, Pipeline interleaving and parallelism in recursive digital lters, parts I and II", IEEE Trans. on Acoustics, Speech and Signal Processing, vol. 37, pp. 1099{1135, July 1989. 11] A. Vandemeulebroecke, E. Vanzieleghem, T. Denayer, and P. G. A. Jespers, A new carry-free division algorithm and its application to a singlechip 1024-b RSA processor", IEEE Jour. of Solid-State Circuits, vol. 25, pp. 748{756, June 1990. 12] J. H. Satyanarayana and K. K. Parhi, HEAT: Hierarchical energy analysis tool", in 33rd ACM/IEE Design Automation Conference, pp. 9{14, Las Vegas, NV, June 1996. 13] J. Slansky, Conditional-sum addition logic", IRE Trans. on Electronic Computers, vol. EC-9, pp. 226{231, June 1960.

You May Also Find These Documents Helpful

  • Powerful Essays

    En1320 Unit 1 Research Paper 1

    • 27742 Words
    • 111 Pages

    The code in Figure 2-8 shows that even a simple operation, such as the addition of two…

    • 27742 Words
    • 111 Pages
    Powerful Essays
  • Better Essays

    Nt1310 Unit 1 Assignment

    • 1994 Words
    • 8 Pages

    3. Add 48 decimal to 51 decimal using the binary arithmetic; Give the answer in decimal.…

    • 1994 Words
    • 8 Pages
    Better Essays
  • Satisfactory Essays

    Labs 1.1-1.4

    • 586 Words
    • 9 Pages

    Explain why values 10 base 2 and 0010 base 2 are equivalent- Two digits start over, and next digit to convert from a base 10 integer numeral to its base 2 equivalent.…

    • 586 Words
    • 9 Pages
    Satisfactory Essays
  • Good Essays

    ECET230 Lab1 Procedures

    • 2138 Words
    • 8 Pages

    The circuit design for this Lab is entered using Computer Aided Engineering (CAE) design tools for Altera’s programmable logic family. These tools allow the complete design, compilation, simulation, verification, and programming of a programmable logic IC to be done in one simple, user-friendly design environment.…

    • 2138 Words
    • 8 Pages
    Good Essays
  • Powerful Essays

    CTR 212 Assignment 2

    • 818 Words
    • 5 Pages

    Digital circuits can easily distinguish between two voltage levels, which can be related to the binary digits 1 and 0. Therefore, the binary system can easily be applied to PLCs and computer systems.…

    • 818 Words
    • 5 Pages
    Powerful Essays
  • Powerful Essays

    Microcomputer

    • 532 Words
    • 3 Pages

    From 2-var mux we design 4-bit expandable by use 4 components of 2-var mux. We base on tables follow to design them:…

    • 532 Words
    • 3 Pages
    Powerful Essays
  • Satisfactory Essays

    Unit 4 Study guide

    • 344 Words
    • 2 Pages

    6. State the steps that the SUBB instruction will go through for each of the following:…

    • 344 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    We all know that digital electronics use the binary number system. However, with new computers containing 32, 64, and even 128 bit data busses, displaying numbers in binary is quite cumbersome. For example, a single piece of data on a 64-bit data bus would look like this:…

    • 412 Words
    • 4 Pages
    Good Essays
  • Best Essays

    International Conference on Computing and Control Engineering (ICCCE 2012), 12 & 13 April, 2012 VLSI Implementation of Serial-Serial Multiplier based on Asynchronous Counter Accumulation Y. Arun Benjamin Francis Abstract—Multipliers are the fundamental and essential building blocks of VLSI systems. The design and implementation approaches of multipliers contribute substantially to the area, speed and power consumption of computation intensive VLSI system. The objective of the project is to design for applications with high data sampling rate. In the multiplier the partial product are effective ly formed by the dependency graph so that for an nxn multiplication the number of sampling cycles reduced from 2n to n. The full adder in the conventional multiplier is replaced by asynchronous counters so that the critical path is limited to only one AND gate.…

    • 1686 Words
    • 7 Pages
    Best Essays
  • Powerful Essays

    Spintronics

    • 4714 Words
    • 19 Pages

    From the earliest transistor to the remarkably powerful microprocessers, most electronic devices have employed circuits that express data as binary digits, or bits: ones and zeroes represented by the existence or absence of electric charge. Furthermore, the communication between microelectronic devices occursby the binary flow of electric charges.The technologies that emerged from this simple logic have created a multitrillion…

    • 4714 Words
    • 19 Pages
    Powerful Essays
  • Powerful Essays

    Mobile Phone Repair

    • 1555 Words
    • 7 Pages

    – Simple digital logic gates can be made by combining transistors, diodes and resistors. – Example of a Diode-Resistor Logic (DRL) AND gate and a Diode Transistor Logic (DTL) NAND gate.…

    • 1555 Words
    • 7 Pages
    Powerful Essays
  • Good Essays

    • The result is a number that is n + m - 1 bits long…

    • 1292 Words
    • 31 Pages
    Good Essays
  • Satisfactory Essays

    The Fast Fourier transform (FFT) is one of the most important algorithms in the field of digital signal processing. It is used to calculate the discrete Fourier transform (DFT) efficiently. In order to meet the high performance and real-time requirements of modern applications, hardware designers have always tried to implement efficient architectures for the computation of the FFT. In this context, pipelined hardware architectures are widely used, because they provide high throughputs and low latencies suitable for real time, as well as a reasonably low area and power consumption.…

    • 331 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    Half Adder

    • 2129 Words
    • 9 Pages

    Step 2. Apply the input combinations given table 1 and observe the output. Which LED represents the SUM and which LED represents the CARRY?…

    • 2129 Words
    • 9 Pages
    Good Essays
  • Powerful Essays

    74193

    • 1290 Words
    • 6 Pages

    The DM74LS193 circuit is a synchronous up/down 4-bit binary counter. Synchronous operation is provided by having all flip-flops clocked simultaneously, so that the outputs change together when so instructed by the steering logic. This mode of operation eliminates the output counting spikes normally associated with asynchronous (rippleclock) counters. The outputs of the four master-slave flip-flops are triggered by a LOW-to-HIGH level transition of either count (clock) input. The direction of counting is determined by which count input is pulsed while the other count input is held HIGH. The counter is fully programmable; that is, each output may be preset to either level by entering the desired data at the inputs while the load input is LOW. The output will change independently of the count pulses. This feature allows the counters to be used as modulo-N dividers by simply modifying the count length with the preset inputs. A clear input has been provided which, when taken to a high level, forces all outputs to the low level; independent of the count and load inputs. The clear, count, and load inputs are buffered to lower the drive requirements of clock drivers, etc., required for long words. These counters were designed to be cascaded without the need for external circuitry. Both borrow and carry outputs are available to cascade both the up and down counting functions. The borrow output produces a pulse equal in width to the count down input when the counter underflows. Similarly, the carry output produces a pulse equal in width to the count down input when an overflow condition exists. The counters can then be easily cascaded by feeding the borrow and carry outputs to the count down and count up inputs respectively of the succeeding counter.…

    • 1290 Words
    • 6 Pages
    Powerful Essays