Wei Yao weiyao@ee.ucla.edu Homework 4 Wei Yao weiyao@ee.ucla.edu.

Slides:

Advertisements

Similar presentations

EE 201A Modeling and Optimization for VLSI LayoutJeff Wong and Dan Vasquez EE 201A Noise Modeling Jeff Wong and Dan Vasquez Electrical Engineering Department.

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.

1 Specifications Functionality: AND, OR, XOR, ADD Maximum propagation delay : 2ns Power budget: 30mW Area: 200 µm ×400µm Prepared by: Christie Ma, Manjul.

CPE 626 CPU Resources: Adders & Multipliers Aleksandar Milenkovic Web:

Contemporary Logic Design Multi-Level Logic © R.H. Katz Transparency No Chapter # 3: Multi-Level Combinational Logic 3.3 and Time Response.

Copyright Agrawal, 2007 ELEC6270 Fall 07, Lecture 12 1 ELEC 5270/6270 Fall 2007 Low-Power Design of Electronic Circuits Pass Transistor Logic: A Low Power.

S. Reda EN160 SP’07 Design and Implementation of VLSI Systems (EN0160) Lecture 15: Interconnects & Wire Engineering Prof. Sherief Reda Division of Engineering,

IMPLEMENTATION OF µ - PROCESSOR DATA PATH

Spring 07, Mar 8 ELEC 7770: Advanced VLSI Design (Agrawal) 1 ELEC 7770 Advanced VLSI Design Spring 2007 Timing Verification and Optimization Vishwani D.

Viterbi Decoder: Presentation #6 M1 Overall Project Objective: Design a high speed Viterbi Decoder Stage 5: 23 rd Feb Component Simulation Design.

Arithmetic-Logic Units CPSC 321 Computer Architecture Andreas Klappenecker.

Spring 08, Feb 6 ELEC 7770: Advanced VLSI Design (Agrawal) 1 ELEC 7770 Advanced VLSI Design Spring 2008 Timing Verification and Optimization Vishwani D.

4-bit adder, multiplexer, timing diagrams, propagation delays

Chapter 5 Arithmetic Logic Functions. Page 2 This Chapter..  We will be looking at multi-valued arithmetic and logic functions  Bitwise AND, OR, EXOR,

Viterbi Decoder: Presentation #9 M1 Overall Project Objective: Design a high speed Viterbi Decoder Stage 9: 29 nd Mar Chip Level Simulation Design.

ECE 3130 – Digital Electronics and Design Lab 3 Multiplexers, Parity Generators, and Boolean functions using MUX Fall 2012 Allan Guan.

Simple One and Two Input Logic Gates Truth Tables and Function Tables Based Upon 0 – 5 V.

 Delay values control the time between the change in a right-hand-side operand and when the new value is assigned to the left- hand side.  Three ways.

Capturing Crosstalk-Induced Waveform for Accurate Static Timing Analysis Masanori Hashimoto, Yuji Yamada, Hidetoshi Onodera Kyoto University.

EE 5900 Advanced Algorithms for Robust VLSI CAD, Spring 2009 Static Timing Analysis and Gate Sizing.

False Path. Timing analysis problems We want to determine the true critical paths of a circuit in order to: –To determine the minimum cycle time that.

Module 2 : Behavioral modeling TOPIC : Modeling a Digital pulse UNIT 1: Modeling and Simulation.

The George Washington University School of Engineering and Applied Science Department of Electrical and Computer Engineering ECE122 – Lab 6 Multiplexers,

Computing Systems Designing a basic ALU.

4. Combinational Logic Networks Layout Design Methods 4. 2

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.

Arithmetic-Logic Units. Logic Gates AND gate OR gate NOT gate.

EE141 Project: 32x32 SRAM Abhinav Gupta, Glen Wong Optimization goals: Balance between area and performance Minimize area without sacrificing performance.

How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B

The George Washington University School of Engineering and Applied Science Department of Electrical and Computer Engineering ECE122 – Lab 6 Multiplexers,

Circuit Delay Performance Estimation Most digital designs have multiple signal paths and the slowest one of these paths is called the critical path Timing.

ELEC 5270/6270 Spring 2013 Low-Power Design of Electronic Circuits Pass Transistor Logic: A Low Power Logic Family Vishwani D. Agrawal James J. Danaher.

ECE 3130 Digital Electronics and Design

Prof. An-Yeu Wu Undergraduate VLSI Course Updated: May 24, 2002

Subtitle: How to design the data path of a processor.

SUMMING AMPLIFIER INTEGRATOR DIFFERENTIATOR COMPARATOR

Lecture Adders Half adder.

Static Timing Analysis and Gate Sizing Optimization

ECE 3130 Digital Electronics and Design

My customer has used TLE2142-Q1 as like below circuits and then they find that the output surge happens when the following conditions. The 5V is supplied.

Swamynathan.S.M AP/ECE/SNSCT

Addition and multiplication

Space vs. Speed: Binary Adders

Jason Cong, David Zhigang Pan & Prasanna V. Srinivas

Chapter 2 Interconnect Analysis Delay Modeling

Static Timing Analysis and Gate Sizing Optimization

CSE Winter 2001 – Arithmetic Unit - 1

COMBINATIONAL LOGIC.

VLSI Arithmetic Adders & Multipliers

Arithmetic Circuits (Part I) Randy H

Chapter 3b Static Noise Analysis

Chapter 2 Interconnect Analysis Delay Modeling

Vishwani D. Agrawal James J. Danaher Professor

Chapter 3b Static Noise Analysis

Lecture 15 Logistics Last lecture Today HW4 is due today

ELEC 5270/6270 Spring 2011 Low-Power Design of Electronic Circuits Pass Transistor Logic: A Low Power Logic Family Vishwani D. Agrawal James J. Danaher.

CSE 140L Discussion 3 CK Cheng and Thomas Weng

Homework 2 [due Jan. 31] [1] Given the circuit as shown below and a unit step voltage source at the input node s, use SPICE to simulate the circuit and.

EE 201C Homework 2 Fang Gong

Wire Indctance Consequences of on-chip inductance include:

EE115C – Winter 2009 Digital Electronic Circuits

Addition and multiplication

EE 201C Homework 1 Fang Gong

Addition and multiplication

74LS283 4-Bit Binary Adder with Fast Carry

Prof. An-Yeu Wu Undergraduate VLSI Course Updated: May 24, 2002

Prof. An-Yeu Wu Undergraduate VLSI Course Updated: May 24, 2002

EE216A – Fall 2010 Design of VLSI Circuits and Systems

A 200MHz <insert E #>pJ 6-bit Absolute-Value Detector

Jason Cong, David Zhigang Pan & Prasanna V. Srinivas

Presentation transcript:

Wei Yao weiyao@ee.ucla.edu Homework 4 Wei Yao weiyao@ee.ucla.edu

False Path False Path: those paths which signals never propagate from PI to PO. (Carry Bypass Adder) To sensitize red path we need: ai XOR bi && ai+1 XOR bi+1 But: red path is false When above condition is true, MUX selects “1” input, i.e. directly from ci-1 Instead shorter green paths are sensitized Hence, red path is not the critical path of the circuit!

Problem 1 [1] With the same circuit, the red critical path has been proved to be false path. Try to find the true critical path for this circuit. Assume unit gate delay in this circuit.

Problem 2 Crosstalk Noise Calculation 1v Cx Vagg C5 R3 Vdd=1V R2 Rd R1 R4 C1 C2 C3 C4 [2] Given the layout of a victim net and an aggressor net above it. Try to calculate noise voltage output & waveform considering crosstalk using the noise model from [aspdac’01] . Vdd = 1V Tr: step input with rising time is 500ps Rd = 300 Ω, R1=100 Ω, R2=150 Ω, R3= 250Ω, R4=300Ω C1=2e-14F, C2=5e-14F, C3=1.5e-14F C4=3.5e-14F, C5=2.3e-14F, Cx=5e-14F. Vout [aspdac’01] Jason Cong, David Zhigang Pan, and Prasanna V. Srinivas. 2001. “Improved crosstalk modeling for noise constrained interconnect optimization”. In Proceedings of the 2001 Asia and South Pacific Design Automation Conference (ASP-DAC '01). Pages: 373-378.

Problem 2 Crosstalk Noise Calculation (cont.) Compare your calculation with Spice Simulation results