IMPLEMENTATION OF µ - PROCESSOR DATA PATH

Slides:



Advertisements
Similar presentations
ALU Organization Michael Vong Louis Young Rongli Zhu Dan.
Advertisements

1 ECE 4436ECE 5367 Computer Arithmetic I-II. 2 ECE 4436ECE 5367 Addition concepts 1 bit adder –2 inputs for the operands. –Third input – carry in from.
ECE2030 Introduction to Computer Engineering Lecture 13: Building Blocks for Combinational Logic (4) Shifters, Multipliers Prof. Hsien-Hsin Sean Lee School.
1 Specifications Functionality: AND, OR, XOR, ADD Maximum propagation delay : 2ns Power budget: 30mW Area: 200 µm ×400µm Prepared by: Christie Ma, Manjul.
Introduction So far, we have studied the basic skills of designing combinational and sequential logic using schematic and Verilog-HDL Now, we are going.
Chapter 9 Computer Design Basics. 9-2 Datapaths Reminding A digital system (or a simple computer) contains datapath unit and control unit. Datapath: A.
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.
1 CS 140 Lecture 14 Standard Combinational Modules Professor CK Cheng CSE Dept. UC San Diego Some slides from Harris and Harris.
ECE C03 Lecture 61 Lecture 6 Arithmetic Logic Circuits Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
Chapter # 5: Arithmetic Circuits Contemporary Logic Design Randy H
Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Topics n Shifters. n Adders and ALUs.
Lecture 8 Arithmetic Logic Circuits
Digital Integrated Circuits© Prentice Hall 1995 Arithmetic Arithmetic Building Blocks.
Chapter 5 Arithmetic Logic Functions. Page 2 This Chapter..  We will be looking at multi-valued arithmetic and logic functions  Bitwise AND, OR, EXOR,
Comparison of Two RCA Implementations Abstract Two implementations of RCA (Ripple Carry Adder) static circuit are introduced—CMOS and TG logic circuit.
Team MUX Adam BurtonMark Colombo David MooreDaniel Toler.
Abdullah Aldahami ( ) Feb26, Introduction 2. Feedback Switch Logic 3. Arithmetic Logic Unit Architecture a.Ripple-Carry Adder b.Kogge-Stone.
Chapter # 5: Arithmetic Circuits
Chapter 6-1 ALU, Adder and Subtractor
Arithmetic Building Blocks
5-1 Programmable and Steering Logic Chapter # 5: Arithmetic Circuits.
EE141 © Digital Integrated Circuits 2nd Arithmetic Circuits 1 Digital Integrated Circuits A Design Perspective Arithmetic Circuits Reference: Digital Integrated.
Arithmetic Building Blocks
Advanced VLSI Design Unit 05: Datapath Units. Slide 2 Outline  Adders  Comparators  Shifters  Multi-input Adders  Multipliers.
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}
Basic Addition Review Basic Adders and the Carry Problem
Modern VLSI Design 4e: Chapter 6 Copyright  2008 Wayne Wolf Topics n Shifters. n Adders and ALUs.
درس مدارهای منطقی دانشگاه قم مدارهای منطقی محاسباتی تهیه شده توسط حسین امیرخانی مبتنی بر اسلایدهای درس مدارهای منطقی دانشگاه.
FPGA-Based System Design: Chapter 4 Copyright  2003 Prentice Hall PTR Topics n Number representation. n Shifters. n Adders and ALUs.
1 Lecture 12 Time/space trade offs Adders. 2 Time vs. speed: Linear chain 8-input OR function with 2-input gates Gates: 7 Max delay: 7.
EE 466/586 VLSI Design Partha Pande School of EECS Washington State University
EE141 © Digital Integrated Circuits 2nd Arithmetic Circuits 1 Digital Integrated Circuits A Design Perspective Arithmetic Circuits Jan M. Rabaey Anantha.
Divide Calculation Latency
Digital Integrated Circuits© Prentice Hall 1995 Arithmetic Arithmetic Building Blocks.
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.
B1000 ALU ENGR xD52 Eric VanWyk Fall Today Review Timing with Adders Construct Adder/Subtractor Construct ALU.
EE141 Project: 32x32 SRAM Abhinav Gupta, Glen Wong Optimization goals: Balance between area and performance Minimize area without sacrificing performance.
Lecture #23: Arithmetic Circuits-1 Arithmetic Circuits (Part I) Randy H. Katz University of California, Berkeley Fall 2005.
EE141 Arithmetic Circuits 1 Chapter 14 Arithmetic Circuits Rev /12/2003 Rev /05/2003.
Basic Addition Review Basic Adders and the Carry Problem Carry Propagation Speedup Speed/Cost Tradeoffs Two-operand Versus Multi-operand Adders.
1 The ALU l ALU includes combinational logic. –Combinational logic  a change in inputs directly causes a change in output, after a characteristic delay.
B0111 ALU ENGR xD52 Eric VanWyk Fall Today Review Timing with Adders Construct Adder/Subtractor Compare Growth Characteristics Construct ALU.
B0110 ALU ENGR xD52 Eric VanWyk Fall Today Back to Gates! Review Timing with Adders Compare Growth Characteristics Construct Adder/Subtractor Construct.
PICo Arithmetic and Logic Unit The Need for Speed (with minimal area and power)
VLSI 1 382M/460R Lab 2 DESIGN OF AN ARITHMETIC LOGIC UNIT (ALU)
Combinational Circuits
16 Bit Barrel Shifter Using D3L Logic
Somet things you should know about digital arithmetic:
Subtitle: How to design the data path of a processor.
Digital Electronics Multiplexer
Computer Design Basics
Swamynathan.S.M AP/ECE/SNSCT
Homework Reading Machine Projects Labs
Digital Electronics Multiplexer
Topics Number representation. Shifters. Adders and ALUs.
CSE Winter 2001 – Arithmetic Unit - 1
Design of an Arithmetic Logic Unit (ALU)
Arithmetic Circuits (Part I) Randy H
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.
CS 140 Lecture 14 Standard Combinational Modules
By: A. H. Abdul Hafez CAO, by Dr. A.H. Abdul Hafez, CE Dept. HKU
Homework Reading Machine Projects Labs
CSE 140 Lecture 14 Standard Combinational Modules
Instructor: Mozafar Bag-Mohammadi University of Ilam
Computer Design Basics
Combinational Circuits
Lecture 9 Digital VLSI System Design Laboratory
Arithmetic Building Blocks
Presentation transcript:

IMPLEMENTATION OF µ - PROCESSOR DATA PATH Project By: Daniel Brauch Elad Shabtai Barak Schlosser

Project Goals Designing and implementing the schematic and layout design of an 8 bit µProcessor data path , which will include an ALU Manchester carry look ahead and a barrel shifter. Testing the design for accuracy and performance.

Data Path overall design

Applications: The data path is the core element of every micro processor and thus included in every application that performs arithmetic calculations ,logic evaluation and data movement.

Implementation Notes : The ALU will be built from a Manchester carry look ahead adder and eight 1 bit ALU. The output of the ALU will be inserted into the shift register for shifting operations. The barrel shifter can perform up to 3 bit shifts in a single combinational function. The inputs for the ALU are valid on the rise of the clock.

Design Specifications: ALU: Inputs: two 8-bit words (A,B) 3-bit ALU controls. 3-bit shift controls. 1-bit clock. * Cin bit will be generated from the ALU control bits Output: 8-bit word (F), 1 carry out. Functions: A or B, A and B, A xor B, A + B, A – B , B – A , Pass A, Pass B

Design Specifications: Barrel Shifter: Can multiply by 1, 2 , 4 or 8 by shifting left 0, 1 ,2 or 3 bits. General: Power supply: Vdd is set to 5 volts referenced to ground. Size specifications: Final physical size must be optimized. Time specifications: All data and control bits are set on the rise of the clock. The maximum propagation delay for all functions must be less than 100ns.

Manchester Carry

Manchester Carry Chain

Manchester Carry explanation For each bit 2 values are calculated: Pi = Ai XOR Bi Gi = Ai AND Bi On the rise of the clock the upper PMOS gates are closed and the bottom NMOS are open enabling the pull down of the carry out bar. The Pi controls enables the propagation of the Cout signals. The max propagation delay is caused by the pulling down of all the carry out bar signals.

Manchester Carry cont. The main advantage of the Manchester chain is its small physical size. In terms of propagation delay the Manchester chain is situated in the middle of the scale.

Comparison between different Full Adders

1 bit ALU implementation S2 S1 Cin B A’ A MUX 4:1 FULL ADDER Out LOGIC S1 S0 A’ B’ MUX 4:1 XOR AND OR

ALU control bits B - A 1 OR AND A + B XOR PASS B PASS A A - B S2 S1 S0 OPERATION B - A 1 OR AND A + B XOR PASS B PASS A A - B 001 : OR 010 : AND 100 : XOR CHAIN XOR - 111 000 : B - A 111 : A - B Equivalence F.A 011 : A + B 110 : PASS A 101 : PASS B

MUX 4:1 implementation A B C D

1 bit FULL ADDER implementation SUM = A xor B xor C C B A ** no need to compute carry out – calculated by Manchester carry look ahead

modules implementation Tanner S-Edit modules implementation

Manchester – module :

Simulation results : Carry all: Carry last – worst case propagation ~10ns:

Barrel shifter – module :

Simulation results - shifting 01001011:

1 bit ALU :

Data Path – modules : Calculate Cin : Define Cin : Shifter : Alu1bit * 8 - 8 bit output : Choose output from Alu / Manchester :

8 bit ALU - module : Including : Cin logic Manchester chain Alu Cout logic

8 bit ALU - design :

8 bit ALU simulation - pass A (00000001) :

8 bit ALU simulation - AND A (10001001) B (10000001) :

DataPath –module :

DataPath simulation : (A + B) * 4 A=00001010 B=00000011

DataPath simulation : (A + B) * 4 A=00001010 B=00000011

VHDL Simulation

VHDL – simulation resaults : Start – opCode 000 : End – opCode 111 :

Advantages of design : Parallel implementation of calculations. Minimal number of transistors in current implementation ~ 600 transistors - Trivial implementation using mux 8*1 with scmos implementation ~ 1300 transistors - Less transistors thus low on power consumption and faster in propagation ~ 40 ns

Milestones Studying design options for the ALU, Manchester carry look ahead and shifter - Due 01/06/04 Implementing all 3 units in gate level and testing them for correctness and performance - Due 08/06/04 Combining units and testing overall design - Due 15/06/04 Creating VHDL test bench and comparing designs - Due 22/06/04 Grade : ?