EE 141 Project 2May 8, 20031 Outstanding Features of Design Maximize speed of one 8-bit Division by: i. Observing loop-holes in 8-bit division ii. Taking.

Slides:



Advertisements
Similar presentations
Programmable FIR Filter Design
Advertisements

Introduction So far, we have studied the basic skills of designing combinational and sequential logic using schematic and Verilog-HDL Now, we are going.
EE141 © Digital Integrated Circuits 2nd Arithmetic Circuits 1 Digital Integrated Circuits A Design Perspective Arithmetic Circuits Jan M. Rabaey Anantha.
Datorteknik ArithmeticCircuits bild 1 Computer arithmetic Somet things you should know about digital arithmetic: Principles Architecture Design.
Henry Hexmoor1 Chapter 5 Arithmetic Functions Arithmetic functions –Operate on binary vectors –Use the same subfunction in each bit position Can design.
UNIVERSITY OF MASSACHUSETTS Dept
IMPLEMENTATION OF µ - PROCESSOR DATA PATH
UNIVERSITY OF MASSACHUSETTS Dept
Introduction to CMOS VLSI Design Lecture 11: Adders
Digital Design – Optimizations and Tradeoffs
1 EECS Components and Design Techniques for Digital Systems Lec 21 – RTL Design Optimization 11/16/2004 David Culler Electrical Engineering and Computer.
Digital Integrated Circuits© Prentice Hall 1995 Arithmetic Arithmetic Building Blocks.
Lecture 17: Adders.
Chapter 5 Arithmetic Logic Functions. Page 2 This Chapter..  We will be looking at multi-valued arithmetic and logic functions  Bitwise AND, OR, EXOR,
Introduction to CMOS VLSI Design Lecture 11: Adders David Harris Harvey Mudd College Spring 2004.
 Arithmetic circuit  Addition  Subtraction  Division  Multiplication.
TEAM ADD Cary Converse Mark Galligan Belinda Stuart Chenqian Gan Portable Instruments Company (PICo) Contract Proposal.
ECE 4110– Sequential Logic Design
Team MUX Adam BurtonMark Colombo David MooreDaniel Toler.
Using building blocks to make bigger circuits
Abdullah Aldahami ( ) Feb26, Introduction 2. Feedback Switch Logic 3. Arithmetic Logic Unit Architecture a.Ripple-Carry Adder b.Kogge-Stone.
Chapter 6-1 ALU, Adder and Subtractor
Arithmetic Building Blocks
EE141 © Digital Integrated Circuits 2nd Arithmetic Circuits 1 Digital Integrated Circuits A Design Perspective Arithmetic Circuits Reference: Digital Integrated.
Arithmetic Building Blocks
1/8/ L3 Data Path DesignCopyright Joanne DeGroat, ECE, OSU1 ALUs and Data Paths Subtitle: How to design the data path of a processor.
1 CPSC3850 Adders and Simple ALUs Simple Adders Figures 10.1/10.2 Binary half-adder (HA) and full-adder (FA). Digit-set interpretation: {0, 1}
Important Components, Blocks and Methodologies. To remember 1.EXORS 2.Counters and Generalized Counters 3.State Machines (Moore, Mealy, Rabin-Scott) 4.Controllers.
July 2005Computer Architecture, The Arithmetic/Logic UnitSlide 1 Part III The Arithmetic/Logic Unit.
Computer Architecture, The Arithmetic/Logic UnitSlide 1 Part III The Arithmetic/Logic Unit.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 26: October 31, 2014 Synchronous Circuits.
UNIVERSITY OF ROSTOCK Institute of Applied Microelectronics and Computer Science Single-Rail Self-timed Logic Circuits in Synchronous Designs Frank Grassert,
EE 466/586 VLSI Design Partha Pande School of EECS Washington State University
1 CS 151: Digital Design Chapter 4: Arithmetic Functions and Circuits 4-1,2: Iterative Combinational Circuits and Binary Adders.
EE141 © Digital Integrated Circuits 2nd Arithmetic Circuits 1 Digital Integrated Circuits A Design Perspective Arithmetic Circuits Jan M. Rabaey Anantha.
Cost/Performance Tradeoffs: a case study
Divide Calculation Latency
Digital Integrated Circuits© Prentice Hall 1995 Arithmetic Arithmetic Building Blocks.
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 10 Multiplexers MUX: –Selects binary information from one of many input lines and.
EE466: VLSI Design Lecture 13: Adders
1 Carry Lookahead Logic Carry Generate Gi = Ai Bi must generate carry when A = B = 1 Carry Propagate Pi = Ai xor Bi carry in will equal carry out here.
EE141 Project: 32x32 SRAM Abhinav Gupta, Glen Wong Optimization goals: Balance between area and performance Minimize area without sacrificing performance.
1. 2 Figure 10.1 Truth table and schematic diagram for a binary half-adder Simple Adders Half-adder.
EE3A1 Computer Hardware and Digital Design Lecture 9 Pipelining.
How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B
EEL 5722 FPGA Design Fall 2003 Digit-Serial DSP Functions Part I.
EE141 Arithmetic Circuits 1 Chapter 14 Arithmetic Circuits Rev /12/2003 Rev /05/2003.
CS151 Introduction to Digital Design Chapter 4: Arithmetic Functions and HDLs 4-1: Iterative Combinational Circuits 4-2: Binary Adders 1Created by: Ms.Amany.
Reconfigurable Computing - Options in Circuit Design John Morris Chung-Ang University The University of Auckland ‘Iolanthe’ at 13 knots on Cockburn Sound,
Topic: N-Bit parallel and Serial adder
EE141 Arithmetic Circuits 1 Chapter 14 Arithmetic Circuits Rev /12/2003.
Combinational Circuits
Somet things you should know about digital arithmetic:
Subtitle: How to design the data path of a processor.
UNIVERSITY OF MASSACHUSETTS Dept
Swamynathan.S.M AP/ECE/SNSCT
King Fahd University of Petroleum and Minerals
Digital Integrated Circuits A Design Perspective
ARM implementation the design is divided into a data path section that is described in register transfer level (RTL) notation control section that is viewed.
Overview Part 1 – Design Procedure Part 2 – Combinational Logic
Part III The Arithmetic/Logic Unit
EE115C – Winter 2009 Digital Electronic Circuits
UNIVERSITY OF MASSACHUSETTS Dept
Combinational Circuits
A 200MHz <insert E #>pJ 6-bit Absolute-Value Detector
Arithmetic Building Blocks
Adder and Subtractors Discussion D4.1. Adder and Subtractor Circuits Objective: (i) To construct half and full adder circuit and verify its working (ii)
Arithmetic Circuits.
Computer Architecture
UNIVERSITY OF MASSACHUSETTS Dept
Presentation transcript:

EE 141 Project 2May 8, Outstanding Features of Design Maximize speed of one 8-bit Division by: i. Observing loop-holes in 8-bit division ii. Taking advantage of given specs iii. Realizing that we are just maximizing raw SPEED iv. Optimizing the Critical Path of Design Summary of Main Results: Critical Path DelayDivide Calculation LatencyClock Period Overall Delay 6.8 ns2(6.8) + 2(.05) = 13.7 ns~7 ns~15 ns NAMES …

EE 141 Project 2May 8, Design Methodology 105/26… …

EE 141 Project 2May 8, Design Methodology  Constraints to take advantage of:  4 total adders available – each iteration requires one add  Optimize for JUST speed - not throughput, power or size  Shifts are very organized – can just perform needed shifts into circuit  Using fancy logic, wiring and all adders can reduce the number of clock cycles per divide

EE 141 Project 2May 8, Architecture - SUE

EE 141 Project 2May 8, Architecture – Output Waveforms

EE 141 Project 2May 8, Proposed Critical Path Important circuits along Critical Path: The critical path is defined entirely by the cascaded 8-bit adder cells. It should be noted that the path is cascading, not Delay = 6.8 ns for adder block

EE 141 Project 2May 8, Critical Path Sizing Methodology STEPS FOR OPTIMIZATION The simplest step is to properly buffer the adder outputs, divisor inputs, and XOR outputs to match the B adder inputs, XOR inputs, and A adder inputs respectively. We used buffer chains of 3-4 inverters and incremental sizing to keep the input/output waveforms consistent between stages. A simple way to make our mirror adder faster was to implement even and odd adder cells, inverting the carry bit back and forth between adjacent cells to remove the inverters necessary to produce correct output carry signals. This also allowed us to remove an inverter from the sum output of the odd adder bit cells taking advantage of the full-adder’s inverting property A final small optimization was made by reversing the A and B inputs on the kill/generate stage of the mirror adder to bring the B inputs closer to the output node. Our design essentially wires the divisor (A) inputs directly to the adders, so divisor data is available before dividend/remainder data in at least 3 of the 4 8-bit adders.

EE 141 Project 2May 8, Output Waveforms of Critical Path

EE 141 Project 2May 8, Trade-Offs of our Design Advantages:  Simplicity of design – trivial control logic  Skip delay of intervening register blocks – only 2 clock cycles Disadvantages:  Bad throughput  Long clock cycle Alternative Designs:  We could speed up the design using pipelining while keeping the same simple control logic and shifting through wiring