TAILIEUCHUNG - Lecture Digital logic design - Lecture 7: Minimization with karnaugh maps

The main contents of the chapter consist of the following: K-maps: an alternate approach to representing Boolean functions; K-map representation can be used to minimize boolean functions; easy conversion from truth table to K-map to minimized SOP representation; simple rules (steps) used to perform minimization; leads to minimized SOP representation. | Lecture 7 Minimization with Karnaugh Maps Give qualifications of instructors: DAP teaching computer architecture at Berkeley since 1977 Co-athor of textbook used in class Best known for being one of pioneers of RISC currently author of article on future of microprocessors in SciAm Sept 1995 RY took 152 as student, TAed 152,instructor in 152 undergrad and grad work at Berkeley joined NextGen to design fact 80x86 microprocessors one of architects of UltraSPARC fastest SPARC mper shipping this Fall Overview K-maps: an alternate approach to representing Boolean functions K-map representation can be used to minimize Boolean functions Easy conversion from truth table to K-map to minimized SOP representation. Simple rules (steps) used to perform minimization Leads to minimized SOP representation. Much faster and more more efficient than previous minimization techniques with Boolean algebra. credential: bring a computer die photo wafer : This can be an hidden slide. I just want to use this to do my own planning. I have rearranged Culler’s lecture slides slightly and add more slides. This covers everything he covers in his first lecture (and more) but may We will save the fun part, “ Levels of Organization,” at the end (so student can stay awake): I will show the internal stricture of the SS10/20. Notes to Patterson: You may want to edit the slides in your section or add extra slides to taylor your needs. x y F 0 0 1 0 1 1 1 0 0 1 1 0 Karnaugh maps Alternate way of representing Boolean function All rows of truth table represented with a square Each square represents a minterm Easy to convert between truth table, K-map, and SOP Unoptimized form: number of 1’s in K-map equals number of minterms (products) in SOP Optimized form: reduced number of minterms 0 1 y x 0 1 1 0 0 1 0 1 y x 0 1 x’y’ xy’ xy x’y x y F = Σ(m0,m1) = x’y + x’y’ Boolean Cubes and Boolean Functions Boolean Cubes and Boolean Functions A Boolean n-cube uniquely represents a Boolean function of n variables if

• Điện - Điện tử
• Number systems
• Digital logic design
• Lecture Digital logic design
• Digital design
• Digital logic
• Digital system
• Queueing system
• nite number
• shop assistants
• a forming of queues
• Queueing systems
• without queues
• Some general types
• stochastic processes Download free ebooks at bookboon
• com 2
• Probability Examples c 9 – Stochastic Processes 2 © 2009 Leif Mejlbro & Ventus Publishing ApS ISBN 978 87 7681 525 7 Download free ebooks at bookboon
• com 3
• Stochastic Processes 2 Contents Contents Introduction 1 1
• 1 1
• 2 1
• 3 1
• 4 1
• 5 1
• 6 1
• 7 2 3 4 5 Theoretical background The Poisson process Birth and death processes Queueing theory in general Queueing system of innitely many shop assistants Queueing system of a nite number of shop assistants
• and with forming of queues Queueing systems with a nite number of shop assistants and without queues Some general types of stochastic processes The Poisson process Birth and death processes Queueing theory Other types of stochastic processes Index 5 6 6 8 11 11 12 15 17 19 37 52 117 126 The next step for top performing gradua
• Nhập môn Tin học
• Bài giảng Nhập môn Tin học
• Hệ thống số
• Hệ thập phân
• Lesson Instructor materials
• Instructor materials
• Hexadecimal numbering system
• Classroom presentation
• Lecture EEE130 Digital electronics I
• EEE130 Digital electronics
• Operations and codes
• Binary coded numbers
• Complements of binary numbers
• Foundations of Number Theory
• Divisibility
• Division Algorithm
• Modular Arithmetics
• Numerical Systems
• Floor Function
• Complement of numbers
• Binary coded decimal
• Genome Biology
• Cancer genomics
• Computational systems biology
• Network biology
• Network inference
• Network propagation
• Gene copy number mutations
• Lecture Digital Logic & Design
• Bài giảng Thiết kế logic số
• Analogue quantities
• Continuous signal
• Binary number system
• Hexadecimal number system
• Binary Hexadecimal conversion
• Digital systems
• Introductory concepts
• Number systems and codes
• Describing logic circuits
• Digital arithmetic
• VLSI Digital signal processing systems
• Digital signal
• Digital signal processing
• DSP systems
• Redundant arithmetic
• Redundant number representations
• Binary number
• metallic elements
• considerable number
• physiological systems
• environmental influences
• enzyme systems
• trace amounts
• Parallel Processing & Distributed Systems
• Processor Organization
• Processor Organizations
• Bisection width
• Number of edges per node
• Maximum edge length
• Introduction to Computers
• Computer systems
• Computer science
• Transforming data
• Computers represent data
• Fundamentals of digital logic
• Microcomputer design
• Introduction to digital systems
• Boolean algebra and digital logic gates
• Combinational logic design