Shannon decomposition

Similar documents
Shannon decomposition

Shannon dekomposition

Acknowledgment. DLD Lab. This set of slides on VHDL are due to Brown and Vranesic.

Problem Set 6 Solutions

Written reexam with solutions for IE1204/5 Digital Design Monday 14/

Experiment 4 Decoder Encoder Design using VHDL

Written exam with solutions IE1204/5 Digital Design Friday 13/

Written exam for IE1204/5 Digital Design with solutions Thursday 29/

Assignment # 3 - CSI 2111(Solutions)

DO NOT COPY DO NOT COPY

RAO PAHALD SINGH GROUP OF INSTITUTIONS BALANA(MOHINDER GARH)123029

Number System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary

ECE223. R eouven Elbaz Office room: DC3576

Review for Test 1 : Ch1 5

UNIVERSITY OF CALIFORNIA, RIVERSIDE

ECE 448 Lecture 6. Finite State Machines. State Diagrams, State Tables, Algorithmic State Machine (ASM) Charts, and VHDL Code. George Mason University

COE 328 Final Exam 2008

Table of Content. Chapter 11 Dedicated Microprocessors Page 1 of 25

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Sciences

CHAPTER * 2-2.* Pearson Education Limited Problem Solutions, Global Edition Chapter 2. Verification of DeMorgan s Theorem

STEADY CODES WITH HAMMING- DISTANCES 1 AND 2 DGT D = 1 C 2 D = 2 C 1 C Digital Circuits. Hamburg. Prof. Dr. F.

LECTURE 2: Delay models, std_ulogic and. EECS 316 CAD Computer Aided Design. with-select-when. Chris Papachristou Case Western Reserve University

Luleå Tekniska Universitet Kurskod SMD098 Tentamensdatum

Written exam with solutions IE1204/5 Digital Design Monday 23/

Dr. Nicola Nicolici COE/EE2DI4 Midterm Test #2 Nov 22, 2006

ECE 2300 Digital Logic & Computer Organization

Introduction to the Xilinx Spartan-3E

Combinational Logic. Jee-Hwan Ryu. School of Mechanical Engineering Korea University of Technology and Education

211: Computer Architecture Summer 2016

XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.

control in out in out Figure 1. Binary switch: (a) opened or off; (b) closed or on.

Pin Details of Digital Logic Gates:

Written exam with solutions IE Digital Design Friday 21/

VHDL Implementation of Reversible Full Adder using PERES Gate

ECE 545 Digital System Design with VHDL Lecture 1. Digital Logic Refresher Part A Combinational Logic Building Blocks

Logic Effort Revisited

Slides for Lecture 19

Section 3: Combinational Logic Design. Department of Electrical Engineering, University of Waterloo. Combinational Logic

ECE380 Digital Logic. Synchronous sequential circuits

CprE 281: Digital Logic

Digital Logic. CS211 Computer Architecture. l Topics. l Transistors (Design & Types) l Logic Gates. l Combinational Circuits.

Projects about Quantum adder circuits Final examination June 2018 Quirk Simulator

Principles of Computer Architecture. Appendix B: Reduction of Digital Logic. Chapter Contents

Digital- or Logic Circuits. Outline Logic Circuits. Logic Voltage Levels. Binary Representation

And Inverter Graphs. and and nand. inverter or nor xor

Logic Design Combinational Circuits. Digital Computer Design

Numbers & Arithmetic. Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University. See: P&H Chapter , 3.2, C.5 C.

Hardware Design I Chap. 4 Representative combinational logic

Design of Sequential Circuits

Chapter 2. Digital Logic Basics

Chapter 3 Combinational Logic Design

Vidyalankar. S.E. Sem. III [EXTC] Digital System Design. Q.1 Solve following : [20] Q.1(a) Explain the following decimals in gray code form

Computer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Digital Logic

Floating Point Representation and Digital Logic. Lecture 11 CS301

Systems I: Computer Organization and Architecture

Additional Gates COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals

Unit 3 Session - 9 Data-Processing Circuits

CHAPTER1: Digital Logic Circuits Combination Circuits

Programmable Logic Devices

Digital Logic (2) Boolean Algebra

Homework Assignment #1 Solutions EE 477 Spring 2017 Professor Parker

EECS150 - Digital Design Lecture 17 - Combinational Logic Circuits. Limitations on Clock Rate - Review

DESIGN AND IMPLEMENTATION OF ENCODERS AND DECODERS. To design and implement encoders and decoders using logic gates.

COE 202: Digital Logic Design Combinational Circuits Part 4. Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:

UNIT III Design of Combinational Logic Circuits. Department of Computer Science SRM UNIVERSITY

ECE 545 Digital System Design with VHDL Lecture 1A. Digital Logic Refresher Part A Combinational Logic Building Blocks

Digital Control of Electric Drives

MAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI

WEEK 3.1 MORE ON KARNAUGH MAPS

DIGITAL TECHNICS. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute

Combinational Logic. By : Ali Mustafa

Introduction to Digital Logic Missouri S&T University CPE 2210 PLDs

University of Guelph School of Engineering ENG 2410 Digital Design Fall There are 7 questions, answer all questions.

Module 2. Basic Digital Building Blocks. Binary Arithmetic & Arithmetic Circuits Comparators, Decoders, Encoders, Multiplexors Flip-Flops

7 Multipliers and their VHDL representation

We are here. Assembly Language. Processors Arithmetic Logic Units. Finite State Machines. Circuits Gates. Transistors

CHAPTER V MULTIPLE SCALES..? # w. 5?œ% 0 a?ß?ß%.?.? # %?œ!.>#.>

COMBINATIONAL CIRCUITS

CSE 140 Lecture 11 Standard Combinational Modules. CK Cheng and Diba Mirza CSE Dept. UC San Diego

I. INTRODUCTION. CMOS Technology: An Introduction to QCA Technology As an. T. Srinivasa Padmaja, C. M. Sri Priya

EECS150 - Digital Design Lecture 25 Shifters and Counters. Recap

CS 226: Digital Logic Design

Arithmetic Circuits Didn t I learn how to do addition in the second grade? UNC courses aren t what they used to be...

ECE/CS 250 Computer Architecture

Logic Design. Chapter 2: Introduction to Logic Circuits

Motivation. CS/EE 3700 : Fundamentals of Digital System Design

N-bit Parity Neural Networks with minimum number of threshold neurons

ECE 250 / CPS 250 Computer Architecture. Basics of Logic Design Boolean Algebra, Logic Gates

CSEE 3827: Fundamentals of Computer Systems. Combinational Circuits

EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive

CHAPTER VI COMBINATIONAL LOGIC BUILDING BLOCKS

Fig. 7-6 Single Bus versus Dedicated Multiplexers

Dept. of ECE, CIT, Gubbi Page 1

Software Engineering 2DA4. Slides 8: Multiplexors and More

Logic. Combinational. inputs. outputs. the result. system can

COMBINATIONAL LOGIC CIRCUITS. Dr. Mudathir A. Fagiri

Digital Integrated Circuits A Design Perspective. Arithmetic Circuits

Part 5: Digital Circuits

Function of Combinational Logic ENT263

WORKBOOK. Try Yourself Questions. Electrical Engineering Digital Electronics. Detailed Explanations of

Transcription:

Shannon decomposition Claude Shannon mathematician / electrical engineer 96 William Sandqvist illiam@kth.se

E 8.6 Sho ho a 4-to- multipleer can e used as a "function generator" for eample to generate the OR function. William Sandqvist illiam@kth.se

E 8.6 Sho ho a 4-to- multipleer can e used as a "function generator" for eample to generate the OR function. Multipleer as function generator William Sandqvist illiam@kth.se

E 8.6 Sho ho a 4-to- multipleer can e used as a "function generator" for eample to generate the OR function. Multipleer as function generator William Sandqvist illiam@kth.se

William Sandqvist illiam@kth.se

BV 6. Sho ho the function f,, m,,, 4, 5, 7 can e implemented using a -to-8 decoder and an OR gate. William Sandqvist illiam@kth.se

BV 6. Sho ho the function f,, m,,, 4, 5, 7 can e implemented using a -to-8 decoder and an OR gate. William Sandqvist illiam@kth.se

William Sandqvist illiam@kth.se

E 8.7 A majority gate outputs the same value as the majority of the inputs. The gate can for eample e used in fault-tolerant logic, or in image processing circuits. a Set up the gate's truth tale and minimize the function ith Karnaugh map. Realize the function ith AND-OR gates. Realize the majority gate ith an 8: MUX. c Use Shannon decomposition and realize the majority gate ith a : MUX and gates. d Realize the majority gate ith only : MUXes. William Sandqvist illiam@kth.se

8.7a With AND OR gates William Sandqvist illiam@kth.se

8.7a With AND OR gates William Sandqvist illiam@kth.se

8.7a With AND OR gates M ac a c William Sandqvist illiam@kth.se

8.7a With AND OR gates M ac a c William Sandqvist illiam@kth.se

8.7 With 8-to- mu William Sandqvist illiam@kth.se

8.7 With 8-to- mu William Sandqvist illiam@kth.se

8.7c Shannon decomposition. -to- mu and gates. William Sandqvist illiam@kth.se

8.7c Shannon decomposition. -to- mu and gates. M a c ac ac ac a c a c c c William Sandqvist illiam@kth.se

8.7c Shannon decomposition. -to- mu and gates. M a c ac ac ac a c a c c c William Sandqvist illiam@kth.se

8.7c Shannon decomposition. -to- mu and gates. M a c ac ac ac a c a c c c OR William Sandqvist illiam@kth.se

8.7c Shannon decomposition. -to- mu and gates. M a c ac ac ac a c a c c c a c a c OR William Sandqvist illiam@kth.se

8.7c Shannon decomposition. -to- mu and gates. M a c ac ac ac a c a c c c a c a c OR William Sandqvist illiam@kth.se

8.7d Shannon decomposition. Only -to- mues. William Sandqvist illiam@kth.se

William Sandqvist illiam@kth.se 8.7d c c c c c c c h c c g c h c g c a c a M Shannon decomposition. Only -to- mues.

William Sandqvist illiam@kth.se 8.7d c c c c c c c h c c g c h c g c a c a M Shannon decomposition. Only -to- mues.

William Sandqvist illiam@kth.se 8.7d c c c c c c c h c c g c h c g c a c a M Shannon decomposition. Only -to- mues.

William Sandqvist illiam@kth.se

BV 6.5 For the function f,, m,,, 6 use Shannon s epansion to derive an implementation using a -to- multipleer and any necessary gates. William Sandqvist illiam@kth.se

BV 6.5 William Sandqvist illiam@kth.se For the function use Shannon s epansion to derive an implementation using a -to- multipleer and any necessary gates. 6,,,,, m f,,,,, m f

BV 6.5 William Sandqvist illiam@kth.se For the function use Shannon s epansion to derive an implementation using a -to- multipleer and any necessary gates. 6,,,,, m f,,,,, m f

BV 6.5 William Sandqvist illiam@kth.se For the function use Shannon s epansion to derive an implementation using a -to- multipleer and any necessary gates. 6,,,,, m f,,,,, m f

William Sandqvist illiam@kth.se

E 8.9 Sho ho one four-input eorgate XOR, odd parity function is realized in an FPGA circuit. Sho the contents of the SRAM cells LUT, Lookup Tale William Sandqvist illiam@kth.se

8.9 William Sandqvist illiam@kth.se

8.9 William Sandqvist illiam@kth.se

8.9 William Sandqvist illiam@kth.se

E 8.8 Set up full adder truth tale. Sho ho a full adder is implemented in an FPGA chip. Logic elements of an FPGA is ale to cascade COUT and CIN eteen "neighors." Sho the contents of the SRAM cells LUT, Lookup Tale. William Sandqvist illiam@kth.se

8.8 William Sandqvist illiam@kth.se

8.8 William Sandqvist illiam@kth.se

8.8 William Sandqvist illiam@kth.se

8.8 William Sandqvist illiam@kth.se

BV e 6. In digital systems it is often necessary to have circuits that can shift the its of a vector one or more it positions to the left or right. Design a circuit that can shift a four-it vector W one it position to the right hen a control signal Shift is equal to. Let the outputs of the circuit e a four-it vector Y y y y y and a signal k, such that if Shift then y, y, y, y, and k. If Shift then Y W and k. William Sandqvist illiam@kth.se

William Sandqvist illiam@kth.se

BV e 6. We uses MUXes: William Sandqvist illiam@kth.se

BV e 6. We uses MUXes: William Sandqvist illiam@kth.se

William Sandqvist illiam@kth.se

BV e. 6. Barrel shifter The shifter in Eample 6. shifts the its of an input vector y one it position to the right. It fills the vacated it on the left side ith. If the its that are shifted out are placed into the vacated position on the left, then the circuit effectively rotates the its of the input vector y a specified numer of it positions. Such a circuit is called a arrel shifter. Design a four-it arrel shifter that rotates the its y,,, or it positions as determined y the valuation of to control signals s and s. A arrelshifter is used to speed up floating point operations. William Sandqvist illiam@kth.se

Barrel shifter William Sandqvist illiam@kth.se

BV e. 6. Truth tale: William Sandqvist illiam@kth.se

BV e. 6. Truth tale: William Sandqvist illiam@kth.se

BV e. 6. Truth tale: William Sandqvist illiam@kth.se

BV e. 6. Truth tale: William Sandqvist illiam@kth.se

BV e. 6. Truth tale: William Sandqvist illiam@kth.se

BV e. 6. Truth tale: And so on... William Sandqvist illiam@kth.se

William Sandqvist illiam@kth.se

Locost FPGA Key Benefits Loest FPGA unit cost starting at $.49 Ultra-lo poer in Flash*Freeze mode, as lo as µw Nonvolatile FPGA eliminates unnecessary parts from BOM Single-chip and ultra-lo-poer products simplify oard design Variety of cost-optimized packages reduce assemly costs Lo-poer FPGAs reduce thermal management and cooling needs William Sandqvist illiam@kth.se

BV 6.6 Actel Corporation manufactures an FPGA family called Act, hich uses multipleer ased logic locks. Sho ho the function f can e implemented using only ACT logic locks. William Sandqvist illiam@kth.se

BV 6.6 f William Sandqvist illiam@kth.se

William Sandqvist illiam@kth.se BV 6.6 f f f

William Sandqvist illiam@kth.se BV 6.6 f f f

William Sandqvist illiam@kth.se BV 6.6 f f f

William Sandqvist illiam@kth.se

William Sandqvist illiam@kth.se VHDL BV.5a Write VHDL code to descrie the folloing functions 4 4 4 4 f f VHDL code is ritten ith a tet editor and saved in a file ith the etension.vhd. The code alays consists of to sections ENTITY and ARCHITECTURE. Entity is a description of ho the circuit "looks from the outside" the interface, and Architecture ho it "looks like inside."

VHDL BV.5a f f 4 4 4 Program code is ritten ith a tet editor. So e can only do tet comments to the code. A fied-idth font is used eg. Courier Ne. 4 Comments egin ith - If you ish, you can "dra" clarification ASCII graphics in the comment lines.. One usually indent tet locks that elong together for greater clarity. -- -- -- Functions -- ->- -- ->- f ->- -- ->- f ->- -- ->- 4 -- -- William Sandqvist illiam@kth.se

VHDL BV.5a f f 4 4 4 ENTITY Functions IS PORT,,, 4 :IN STD_LOGIC; f, f, :OUT STD_LOGIC END Functions ARCHITECTURE LogicFunc OF Functions IS BEGIN f < AND NOT OR AND NOT OR NOT AND NOT 4OR AND OR AND NOT 4; f < OR NOT AND OR OR NOT 4AND OR NOT OR NOT 4; END LogicFunc ; 4 William Sandqvist illiam@kth.se

VHDL BV 6. Using a selected signal assignement, rite VHDL code for a 4-to- inary encoder. Only one of is at a time. LIBRARY ieee; USE IEEE.std_logic_64.all; ENTITY ENCODER IS PORT :IN STD_LOGIC_VECTOR DOWNTO ; y :OUT STD_LOGIC_VECTOR DOWNTO ; END ENCODER ARCHITECTURE Behavior OF ENCODER IS BEGIN WITH SELECT y < WHEN, WHEN, WHEN, WHEN OTHERS; END Behavior ; William Sandqvist illiam@kth.se

William Sandqvist illiam@kth.se

Additional if time permits Y - - - - William Sandqvist illiam@kth.se

Y - - - - Y Y William Sandqvist illiam@kth.se

Y - - - -,, Y,, William Sandqvist illiam@kth.se

Y - - - - - -,, Y - -,, William Sandqvist illiam@kth.se

Y - - - - Y Y - -, Y, Y - -, Y, Y William Sandqvist illiam@kth.se

Y Or - - - - Y Y - -, Y, Y, Y - -, Y Or if you don t have acess to the variale inverted William Sandqvist illiam@kth.se

William Sandqvist illiam@kth.se