DOCSLIB.ORG

School of Electrical & Computer Engineering Purdue University

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
School of Electrical & Computer Engineering Purdue University School of Electrical & Computer Engineering ECE 270 Lecture Module 2 Purdue University, College of Engineering Spring 2019 Edition Purdue IM:PACT* Spring 2019 Edition *Instruction Matters: Purdue Academic Glossary of Common Terms Course Transformation DISCRETE LOGIC – a circuit constructed using small-scale integrated (SSI) and medium-scale integrated (MSI) logic devices (NAND gates, decoders, Introduction to Digital System Design multiplexers, etc.) PROGRAMMABLE LOGIC DEVICE (PLD) – an integrated circuit onto which a generic logic circuit can be programmed (and subsequently erased and re-programmed) GENERIC ARRAY LOGIC (GAL) –a (legacy) flash memory based PLD, which is typically erased and re-programmed out- Module 2 of-circuit Combinational Logic Circuits COMPLEX PLD (CPLD) – large flash memory based PLD that is programmable in-circuit 2 Glossary of Common Terms Module 2 isp (IN-SYSTEM PROGRAMMING) –prefix Learning Outcome: “An ability to analyze and design used on CPLDs that can be erased and re- combinational logic circuits” programmed in-circuit A. Combinational Circuit Analysis and Synthesis FIELD PROGRAMMABLE GATE ARRAY B. Mapping and Minimization (FPGA) – an SRAM-based PLD that can be C. Timing Hazards programmed in-circuit (no need to “erase” D. XOR/XNOR Functions since SRAM-based) E. Programmable Logic Devices ADVANCED BOOLEAN EXPRESSION F. Hardware Description Languages LANGUAGE (ABEL) – a “classic” hardware G. Combinational Building Blocks: Decoders description language (HDL) for specifying the behavior of PLDs H. Combinational Building Blocks: Encoders and Tri-State Outputs I. Combinational Building Blocks: Multiplexers VHDL and VERILOG – advanced hardware J. Top Level Modules simulation and description languages 3 4 Purdue IM:PACT* Spring 2019 Edition Reading Assignment: *Instruction Matters: Purdue Academic th th Course Transformation DDPP 4 Ed. pp. 196-210, 5 Ed, pp. 100-117 Learning Objectives: Identify minterms (product terms) and maxterms (sum terms) Introduction to Digital System Design List the standard forms for expressing a logic function and give an example of each: sum-of-products (SoP), product-of-sums (PoS), ON set, OFF set Analyze the functional behavior of a logic circuit by constructing a truth table that lists the relationship between input variable combinations and the output variable Module 2-A Transform a logic circuit from one set of symbols to another through graphical application of DeMorgan’s Law Combinational Circuit Analysis and Synthesis Realize a combinational function directly using basic gates (NOT, AND, OR, NAND, NOR) 6 © 2019 by D. G. Meyer 1 School of Electrical & Computer Engineering ECE 270 Lecture Module 2 Purdue University, College of Engineering Spring 2019 Edition Outline Overview We analyze a combinational logic circuit by obtaining a Overview formal description of its logic function Definitions Once we have a description of the logic function, we can: – determine the behavior of the circuit for various input Minterm identification combinations Maxterm identification – manipulate an algebraic description to suggest different circuit structures ON Sets and OFF sets – transform an algebraic description into a standard form Combinational circuit analysis (e.g., sum-of-products for PLD implementation) – use an algebraic description of the circuit’s functional Equivalent symbols behavior in the analysis of a larger system that includes the circuit Combinational circuit synthesis 7 8 Definitions Definitions Definition: A combinational logic circuit is one whose Definition: A literal is a variable or the complement of output depend only on its current combination of input a variable values (or “input combination”) Definition: A product term is a single literal or a logical Definition: A logic function is the assignment of “0” or product of two or more literals “1” to each possible combination of its input variables Definition: A sum-of-products expression is a logical X1 sum of product terms X2 Definition: A sum term is a single literal or a logical . sum of two or more literals . f f (X1,X2, … , Xn) . Definition: A product-of-sums expression is a logical Xn No Feedback product of sum terms 9 10 Examples Definitions Definition: A normal term is a product or sum term in which W, X, Y Literals no variable appears more than once Definition: An n-variable minterm is a normal product term W X Z Product Term with n literals Definition: An n-variable maxterm is a normal sum term X Y + W Z Sum of Products Expression with n literals Definition: The canonical sum of a logic function is a sum X + Y + Z Sum Term of minterms corresponding to input combinations for which the function produces a “1” output (X + Y) (W + Z ) Product of Sums Expression Definition: The canonical product of a logic function is a product of maxterms corresponding to input combinations for which the function produces a “0” output 11 12 © 2019 by D. G. Meyer 2 School of Electrical & Computer Engineering ECE 270 Lecture Module 2 Purdue University, College of Engineering Spring 2019 Edition Minterm Identification Maxterm Identification 0 → complemented 0 → true 1 → true 1 → complemented 13 14 X Y Z F(X,Y,Z) ON Sets and OFF Sets Example 000 1 Definition: The minterm list that “turns on” an output 001 0 function is called the on set Based on the truth table, 010 0 determine the following 011 1 Example: X,Y,Z(0,1,2,3) 100 0 Indicates “sum” (of products) 101 0 Rows of truth table that are “1” F(X,Y,Z) expressed as: 110 1 an on-set: ____________________ Definition: The maxterm list that “turns off” an output 111 1 function is called the off set an off-set: ____________________ Example: X,Y,Z(4,5,6,7) a sum of minterms: _____________________________ Indicates “product” (of sums) a product of maxterms: __________________________ Rows of truth table that are “0” _______________________________________________ 15 16 X Y Z F(X,Y,Z) X Y Z F(X,Y,Z) Example 000 1 Example 000 1 001 0 001 0 Based on the truth table, 010 0 Based on the truth table, 010 0 determine the following 011 1 determine the following 011 1 100 0 100 0 101 0 101 0 F(X,Y,Z) expressed as: 110 1 F(X,Y,Z) expressed as: 110 1 an on-set: ____________________X,Y,Z(0,3,6,7) 111 1 an on-set: ____________________X,Y,Z(0,3,6,7) 111 1 an off-set: ____________________ an off-set: ____________________X,Y,Z(1,2,4,5) a sum of minterms: _____________________________ a sum of minterms: _____________________________ a product of maxterms: __________________________ a product of maxterms: __________________________ _______________________________________________ _______________________________________________ 17 18 © 2019 by D. G. Meyer 3 School of Electrical & Computer Engineering ECE 270 Lecture Module 2 Purdue University, College of Engineering Spring 2019 Edition X Y Z F(X,Y,Z) X Y Z F(X,Y,Z) Example 000 1 Example 000 1 001 0 001 0 Based on the truth table, 010 0 Based on the truth table, 010 0 determine the following 011 1 determine the following 011 1 100 0 100 0 101 0 101 0 F(X,Y,Z) expressed as: 110 1 F(X,Y,Z) expressed as: 110 1 an on-set: ____________________X,Y,Z(0,3,6,7) 111 1 an on-set: ____________________X,Y,Z(0,3,6,7) 111 1 an off-set: ____________________X,Y,Z(1,2,4,5) an off-set: ____________________X,Y,Z(1,2,4,5) a sum of minterms: X’•Y’•Z’_____________________________ + X’•Y•Z + X•Y•Z’ + X•Y•Z a sum of minterms: X’•Y’•Z’_____________________________ + X’•Y•Z + X•Y•Z’ + X•Y•Z a product of maxterms: __________________________ a product of maxterms: __________________________ (X+Y+Z’)•(X+Y’+Z)• (X’+Y+Z)•(X’+Y+Z’) _______________________________________________ _______________________________________________ 19 20 1. The ON set for a 3-input NAND gate XYZF (X,Y,Z) (with inputs X, Y, and Z) is: NAND 000 1 A. (7) X,Y,Z 001 1 B. X,Y,Z(0) 010 1 C. X,Y,Z(0,1,2,3,4,5,6) 011 1 D. X,Y,Z(1,2,3,4,5,6,7) 100 1 Clicker Quiz E. none of the above 101 1 110 1 111 0 21 22 2. The OFF set for a 3-input NOR gate XYZ F (X,Y,Z) 3. If the function F(X,Y,Z) is represented by the (with inputs X, Y, and Z) is: NOR 000 1 ON SET X,Y,Z(0,3,5,6), then the complement A. X,Y,Z(7) 001 0 of this function F(X,Y,Z) is represented by the B. (0) ON SET: X,Y,Z 010 0 XYZ F(X,Y,Z) XYZ F (X,Y,Z) A. (0,3,5,6) C. X,Y,Z(0,1,2,3,4,5,6) 011 0 X,Y,Z 000 1 000 0 B. (1,2,4,7) D. X,Y,Z(1,2,3,4,5,6,7) 100 0 X,Y,Z 001 0 001 1 E. none of the above 101 0 C. X,Y,Z(1,2,4,6) 010 0 010 1 110 0 D. X,Y,Z(1,3,5,7) 011 1 011 0 111 0 E. none of the above 100 0 100 1 101 1 101 0 110 1 110 0 111 0 111 1 23 24 © 2019 by D. G. Meyer 4 School of Electrical & Computer Engineering ECE 270 Lecture Module 2 Purdue University, College of Engineering Spring 2019 Edition 4. If the function F(X,Y,Z) is represented by the Example - Combinational Analysis ON SET X,Y,Z(0,3,5,6), then the dual of this function FD(X,Y,Z) is represented by the ON SET: A.
Load more

Recommended publications
  • MACABEL ABEL for the APPLE MACINTOSH Nor IIX WORKSTATION A/UX VERSION
    SPECIFICATIONS MACABEL ABEL FOR THE APPLE MACINTOSH nOR IIX WORKSTATION A/UX VERSION GENERAL DESCRIPTION ABEL.'" the industry standard PLD design software, is now available on the Apple Macintosh® II or IIx workstation. MacABEL allows you to take advantage of the personal productivity features of the Macintosh to easily describe and implement logic designs in programmable logic devices (PLDs) and PROMs. Like ABEL Version 3.0 for other popular workstations, MacABEL combines a natural high-level design language with a language processor that converts logic descriptions to programmer load files. These files contain the required information to program and test PLDs. MacABEL allows you to describe your design in any combi­ nation of Boolean equations, truth tables or state diagrams­ whichever best suits the logic you are describing or your comfort level. Meaningful names can be assigned to signals; signals grouped into sets; and macros used to simplify logic descriptions - making your logic design easy to read and • Boolean equations understand. • State machine diagram entry, using IF-THEN-ELSE, CASE, In addition, the software's language processor provides GOTQ and WITH-ENDWITH statements powerful logic reduction, extensive syntax and logic error • Truth tables to specify input to output relationships for both checking - before your device is programmed. MacABEL combinatorial and registered outputs supports the most powerful and innovative complex PLDs just • High-level equation entry, incorporating the boolean introduced on the market, as well as many still in development. operators used in most logic designs < 1 1 & 1 # 1 $ 1 1 $ ) , MacABEL runs under the Apple A/UX'" operating system arithmetic operators <- I + I * I I I %I < < I > > ) , relational utilizing the Macintosh user interface.
    [Show full text]
  • Design of 8-Bit Arithmetic Processor Unit Based on Reversible Logic by A
    Global Journal of Researches in Engineering Electrical and Electronics Engineering Volume 13 Issue 10 Version 1.0 Year 2013 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals Inc. (USA) Online ISSN: 2249-4596 & Print ISSN: 0975-5861 Design of 8-Bit Arithmetic Processor Unit based on Reversible Logic By A. Kamaraj, C. Kalyana Sundaram & J. Senthil Kumar Mepco Schlenk Engineering College, India Abstract - Reversible logic is emerging as an important research area in the recent years due to its ability to reduce the power dissipation, which is the main requirement in low power digital design. Energy dissipation is proportional to the number of bits lost during computation. The reversible circuits do not lose information and can generate unique outputs from specified inputs and vice versa. It has application in diverse fields such as low power CMOS design, optical information processing, cryptography, quantum computation and nanotechnology. This paper proposes a reversible design of an 8 -bit arithmetic processor. The architecture of the processor has been proposed, in which, each block is realized using reversible logic gates. The important blocks of the processor are control unit, arithmetic and logical unit and register file. Each module has been coded using Verilog then simulated using Modelsim and prototyped in Xilinx- Spartan 3E. Keywords : reversible logic, reversible gate, FPGA, xilinx. GJRE-F Classification : FOR Code: 290901 Design of 8-Bit ArithmeticProcessor Unit based on ReversibleLogic Strictly as per the compliance and regulations of : © 2013. A. Kamaraj, C. Kalyana Sundaram & J. Senthil Kumar. This is a research/review paper, distributed under the terms of the Creative Commons Attribution-Noncommercial 3.0 Unported License http://creativecommons.org/licenses/by-nc/3.0/), permitting all non commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.
    [Show full text]
  • Computer Architecture (BCA Part-I)
    Biyani's Think Tank Concept based notes Computer Architecture (BCA Part-I) Micky Haldya Revised By: Jyoti Sharma Deptt. of Information Technology Biyani Girls College, Jaipur 2 Published by : Think Tanks Biyani Group of Colleges Concept & Copyright : Biyani Shikshan Samiti Sector-3, Vidhyadhar Nagar, Jaipur-302 023 (Rajasthan) Ph : 0141-2338371, 2338591-95 Fax : 0141-2338007 E-mail : [email protected] Website :www.gurukpo.com; www.biyanicolleges.org ISBN: 978-93-81254-38-0 Edition : 2011 Price : While every effort is taken to avoid errors or omissions in this Publication, any mistake or omission that may have crept in is not intentional. It may be taken note of that neither the publisher nor the author will be responsible for any damage or loss of any kind arising to anyone in any manner on account of such errors and omissions. Leaser Type Setted by : Biyani College Printing Department For More Details: - www.gurukpo.com Computer Architecture 3 Preface am glad to present this book, especially designed to serve the needs of the I students. The book has been written keeping in mind the general weakness in understanding the fundamental concepts of the topics. The book is self-explanatory and adopts the “Teach Yourself” style. It is based on question-answer pattern. The language of book is quite easy and understandable based on scientific approach. Any further improvement in the contents of the book by making corrections, omission and inclusion is keen to be achieved based on suggestions from the readers for which the author shall be obliged. I acknowledge special thanks to Mr.
    [Show full text]
  • Review of FPD's Languages, Compilers, Interpreters and Tools
    ISSN 2394-7314 International Journal of Novel Research in Computer Science and Software Engineering Vol. 3, Issue 1, pp: (140-158), Month: January-April 2016, Available at: www.noveltyjournals.com Review of FPD'S Languages, Compilers, Interpreters and Tools 1Amr Rashed, 2Bedir Yousif, 3Ahmed Shaban Samra 1Higher studies Deanship, Taif university, Taif, Saudi Arabia 2Communication and Electronics Department, Faculty of engineering, Kafrelsheikh University, Egypt 3Communication and Electronics Department, Faculty of engineering, Mansoura University, Egypt Abstract: FPGAs have achieved quick acceptance, spread and growth over the past years because they can be applied to a variety of applications. Some of these applications includes: random logic, bioinformatics, video and image processing, device controllers, communication encoding, modulation, and filtering, limited size systems with RAM blocks, and many more. For example, for video and image processing application it is very difficult and time consuming to use traditional HDL languages, so it’s obligatory to search for other efficient, synthesis tools to implement your design. The question is what is the best comparable language or tool to implement desired application. Also this research is very helpful for language developers to know strength points, weakness points, ease of use and efficiency of each tool or language. This research faced many challenges one of them is that there is no complete reference of all FPGA languages and tools, also available references and guides are few and almost not good. Searching for a simple example to learn some of these tools or languages would be a time consuming. This paper represents a review study or guide of almost all PLD's languages, interpreters and tools that can be used for programming, simulating and synthesizing PLD's for analog, digital & mixed signals and systems supported with simple examples.
    [Show full text]
  • Dissertation Applications of Field Programmable Gate
    DISSERTATION APPLICATIONS OF FIELD PROGRAMMABLE GATE ARRAYS FOR ENGINE CONTROL Submitted by Matthew Viele Department of Mechanical Engineering In partial fulfillment of the requirements For the Degree of Doctor of Philosophy Colorado State University Fort Collins, Colorado Summer 2012 Doctoral Committee: Advisor: Bryan D. Willson Anthony J. Marchese Robert N. Meroney Wade O. Troxell ABSTRACT APPLICATIONS OF FIELD PROGRAMMABLE GATE ARRAYS FOR ENGINE CONTROL Automotive engine control is becoming increasingly complex due to the drivers of emissions, fuel economy, and fault detection. Research in to new engine concepts is often limited by the ability to control combustion. Traditional engine-targeted micro controllers have proven difficult for the typical engine researchers to use and inflexible for advanced concept engines. With the advent of Field Programmable Gate Array (FPGA) based engine control system, many of these impediments to research have been lowered. This dissertation will talk about three stages of FPGA engine controller appli- cation. The most basic and widely distributed is the FPGA as an I/O coprocessor, tracking engine position and performing other timing critical low-level tasks. A later application of FPGAs is the use of microsecond loop rates to introduce feedback con- trol on the crank angle degree level. Lastly, the development of custom real-time computing machines to tackle complex engine control problems is presented. This document is a collection of papers and patents that pertain to the use of FPGAs for the above tasks. Each task is prefixed with a prologue section to give the history of the topic and context of the paper in the larger scope of FPGA based engine control.
    [Show full text]
  • MACHXL Software User's Guide
    MACHXL Software User's Guide © 1993 Advanced Micro Devices, Inc. TEL: 408-732-2400 P.O. Box 3453 TWX: 910339-9280 Sunnyvale, CA 94088 TELEX: 34-6306 TOLL FREE: 800-538-8450 APPLICATIONS HOTLINE: 800-222-9323 (US) 44-(0)-256-811101 (UK) 0590-8621 (France) 0130-813875 (Germany) 1678-77224 (Italy) Advanced Micro Devices reserves the right to make changes in specifications at any time and without notice. The information furnished by Advanced Micro Devices is believed to be accurate and reliable. However, no responsibility is assumed by Advanced Micro Devices for its use, nor for any infringements of patents or other rights of third parties resulting from its use. No license is granted under any patents or patent rights of Advanced Micro Devices. Epson® is a registered trademark of Epson America, Inc. Hewlett-Packard®, HP®, and LaserJet® are registered trademarks of Hewlett-Packard Company. IBM® is a registered trademark and IBM PCä is a trademark of International Business Machines Corporation. Microsoft® and MS-DOS® are registered trademarks of Microsoft Corporation. PAL® and PALASM® are registered trademarks and MACHä and MACHXL ä are trademarks of Advanced Micro Devices, Inc. Pentiumä is a trademark of Intel Corporation. Wordstar® is a registered trademark of MicroPro International Corporation. Document revision 1.2 Published October, 1994. Printed inU.S.A. ii Contents Chapter 1. Installation Hardware Requirements 2 Software Requirements 3 Installation Procedure 4 Updating System Files 6 AUTOEXEC.BAT 7 CONFIG.SYS 7 Creating a Windows Icon
    [Show full text]
  • Address Decoding Large-Size Binary Decoder: 28-To-268435456 Binary Decoder for 256Mb Memory
    Embedded System 2010 SpringSemester Seoul NationalUniversity Application [email protected] Dept. ofEECS/CSE ower Naehyuck Chang P 4190.303C ow- L Introduction to microprocessor interface mbedded aboratory E L L 1 P L E Harvard Architecture Microprocessor Instruction memory Input: address from PC ARM Cortex M3 architecture Output: instruction (read only) Data memory Input: memory address Addressing mode Input/output: read/write data Read or write operand Embedded Low-Power 2 ELPL Laboratory Memory Interface Interface Address bus Data bus Control signals (synchronous and asynchronous) Fully static read operation Input Memory Output Access control Embedded Low-Power 3 ELPL Laboratory Memory Interface Memory device Collection of memory cells: 1M cells, 1G cells, etc. Memory cells preserve stored data Volatile and non-volatile Dynamic and static How access memory? Addressing Input Normally address of the cell (cf. content addressable memory) Memory Random, sequential, page, etc. Output Exclusive cell access One by one (cf. multi-port memory) Operations Read, write, refresh, etc. RD, WR, CS, OE, etc. Access control Embedded Low-Power 4 ELPL Laboratory Memory inside SRAM structure Embedded Low-Power 5 ELPL Laboratory Memory inside Ports Recall D-FF 1 input port and one output port for one cell Ports of memory devices Large number of cells One write port for consistency More than one output ports allow simultaneous accesses of multiple cells for read Register file usually has multiple read ports such as 1W 3R Memory devices usually has one read
    [Show full text]
  • Legal Notice
    Altera Digital Library September 1996 P-CD-ADL-01 Legal Notice This CD contains documentation and other information related to products and services of Altera Corporation (“Altera”) which is provided as a courtesy to Altera’s customers and potential customers. By copying or using any information contained on this CD, you agree to be bound by the terms and conditions described in this Legal Notice. The documentation, software, and other materials contained on this CD are owned and copyrighted by Altera and its licensors. Copyright © 1994, 1995, 1996 Altera Corporation, 2610 Orchard Parkway, San Jose, California 95134, USA and its licensors. All rights reserved. You are licensed to download and copy documentation and other information from this CD provided you agree to the following terms and conditions: (1) You may use the materials for informational purposes only. (2) You may not alter or modify the materials in any way. (3) You may not use any graphics separate from any accompanying text. (4) You may distribute copies of the documentation available on this CD only to customers and potential customers of Altera products. However, you may not charge them for such use. Any other distribution to third parties is prohibited unless you obtain the prior written consent of Altera. (5) You may not use the materials in any way that may be adverse to Altera’s interests. (6) All copies of materials that you copy from this CD must include a copy of this Legal Notice. Altera, MAX, MAX+PLUS, FLEX, FLEX 10K, FLEX 8000, FLEX 8000A, MAX 9000, MAX 7000,
    [Show full text]
  • HDL and Programming Languages ■ 6 Languages ■ 6.1 Analogue Circuit Design ■ 6.2 Digital Circuit Design ■ 6.3 Printed Circuit Board Design ■ 7 See Also
    Hardware description language - Wikipedia, the free encyclopedia 페이지 1 / 11 Hardware description language From Wikipedia, the free encyclopedia In electronics, a hardware description language or HDL is any language from a class of computer languages, specification languages, or modeling languages for formal description and design of electronic circuits, and most-commonly, digital logic. It can describe the circuit's operation, its design and organization, and tests to verify its operation by means of simulation.[citation needed] HDLs are standard text-based expressions of the spatial and temporal structure and behaviour of electronic systems. Like concurrent programming languages, HDL syntax and semantics includes explicit notations for expressing concurrency. However, in contrast to most software programming languages, HDLs also include an explicit notion of time, which is a primary attribute of hardware. Languages whose only characteristic is to express circuit connectivity between a hierarchy of blocks are properly classified as netlist languages used on electric computer-aided design (CAD). HDLs are used to write executable specifications of some piece of hardware. A simulation program, designed to implement the underlying semantics of the language statements, coupled with simulating the progress of time, provides the hardware designer with the ability to model a piece of hardware before it is created physically. It is this executability that gives HDLs the illusion of being programming languages, when they are more-precisely classed as specification languages or modeling languages. Simulators capable of supporting discrete-event (digital) and continuous-time (analog) modeling exist, and HDLs targeted for each are available. It is certainly possible to represent hardware semantics using traditional programming languages such as C++, although to function such programs must be augmented with extensive and unwieldy class libraries.
    [Show full text]
  • Modeling and Implementation of a 6-Bit, 50Mhz Pipelined ADC in CMOS
    Qazi Omar Farooq Omar Qazi Modeling and Implementation of A 6- Bit, 50MHz Pipelined ADC in CMOS Master’s Thesis Modeling and Implementation of A 6-Bit, 50MHz Pipelined ADC in CMOS Qazi Omar Farooq Series of Master’s theses Department of Electrical and Information Technology LU/LTH-EIT 2016-549 http://www.eit.lth.se Department of Electrical and Information Technology, Faculty of Engineering, LTH, Lund University, 2016. Master’s Thesis Modeling and Implementation of A 6- Bit, 50MHz Pipelined ADC in CMOS By QAZI OMAR FAROOQ Department of Electrical and Information Technology Faculty of Engineering, LTH, Lund University SE-221 00 Lund, Sweden Abstract The pipelined ADC is a popular Nyquist-rate data converter due to its attractive feature of maintaining high accuracy at high conversion rate with low complexity and power consumption. The rapid growth of its application such as mobile system, digital video and high speed data acquisition is driving the pipelined ADC design towards higher speed, higher precision with lower supply voltage and power consumption. This thesis project aims at modeling and implementation of a pipelined ADC with high speed and low power consumption. 2 Acknowledgements First of all, I would like to thank Almighty ALLAH for giving me the strength to complete this work. My supervisor Mr. Xiaodong Liu needs a big appreciation here because he helped me at every stage of my work. Whenever I found myself stuck in a problem he helped me and gave me some very useful suggestion which proved very helpful to me. Without his constant support and guidance this work wouldn’t be completed.
    [Show full text]
  • VHDL Language Guide (Accolade)
    Accolade VHDL Reference Guide Home Product Information Resources Contacts Welcome to the VHDL Language Guide The sections below provide detailed information about the VHDL language. If you are new to VHDL, we suggest you begin with the Language Overview and A First Look at VHDL sections. The main sections of this guide are listed below: Language Overview A First Look at VHDL Objects, Data Types and Operators Using Standard Logic Concurrent Statements Sequential Statements Modularity Features Partitioning Features Test Benches Keyword Reference Examples Gallery Copyright (c) 2000-2001, Altium Limited. All rights reserved. PeakVHDL is a trademark of Altium Limited. For more information visit www.altium.com http://www.acc-eda.com/vhdlref/ [12/19/2004 12:08:34 PM] Language Overview Language Overview What is VHDL? VHDL is a programming language that has been designed and optimized for describing the behavior of digital systems. VHDL has many features appropriate for describing the behavior of electronic components ranging from simple logic gates to complete microprocessors and custom chips. Features of VHDL allow electrical aspects of circuit behavior (such as rise and fall times of signals, delays through gates, and functional operation) to be precisely described. The resulting VHDL simulation models can then be used as building blocks in larger circuits (using schematics, block diagrams or system-level VHDL descriptions) for the purpose of simulation. VHDL is also a general-purpose programming language: just as high-level programming languages allow complex design concepts to be expressed as computer programs, VHDL allows the behavior of complex electronic circuits to be captured into a design system for automatic circuit synthesis or for system simulation.
    [Show full text]
  • Unit-4 Combinational Logic Design
    UNIT-4 COMBINATIONAL LOGIC DESIGN DECODERS: A decoder is a multiple-input, multiple-output logic circuit that converts coded inputs into coded outputs, where the input and output codes are different. The input code generally has fewer bits than the output code, and there is a one-to one mapping from input code words into output code words. In a one-to-one mapping, each input code word produces a different output code word. The general structure of a decoder circuit is shown in Figure 1. The enable inputs, if present, must be asserted for the decoder to perform its normal mapping function. Otherwise, the decoder maps all input code words into a single, ―disabled,‖ output code word. The most commonly used output code is a 1-out-of-m code, which contains m bits, where one bit is asserted at any time. Thus, in a 1-out-of-4 code with active-high outputs, the code words are 0001, 0010, 0100, and 1000. With active-low outputs, the code words are 1110, 1101, 1011, and 0111. BINARY DECODERS The most common decoder circuit is an n-to-2n decoder or binary decoder. Such a decoder has an n-bit binary input code and a 1-out-of-2n output code. A binary decoder is used when you need to activate exactly one of 2n outputs based on an n- bit input value. Table 1 is the truth table of a 2-to-4 decoder. The input code word I1,I0 represents an integer in the range 0–3. The output code word Y3,Y2,Y1,Y0 has Yi equal to 1 if and only if the input code word is the binary representation of i and the enable input EN is 1.
    [Show full text]