Digital Electronics 1

Combinational Logic Circuits

Inbunden, Engelska, 2016

Av Tertulien Ndjountche, Germany) Ndjountche, Tertulien (Erlangen-Nuremberg University

2 799 kr

Beställningsvara. Skickas inom 7-10 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

The omnipresence of electronic devices in our everyday lives has been accompanied by the downscaling of chip feature sizes and the ever increasing complexity of digital circuits.This book is devoted to the analysis and design of digital circuits, where the signal can assume only two possible logic levels. It deals with the basic principles and concepts of digital electronics. It addresses all aspects of combinational logic and provides a detailed understanding of logic gates that are the basic components in the implementation of circuits used to perform functions and operations of Boolean algebra. Combinational logic circuits are characterized by outputs that depend only on the actual input values.Efficient techniques to derive logic equations are proposed together with methods of analysis and synthesis of combinational logic circuits. Each chapter is well structured and is supplemented by a selection of solved exercises covering logic design practices.

Produktinformation

Utgivningsdatum2016-06-10
Mått163 x 236 x 20 mm
Vikt590 g
FormatInbunden
SpråkEngelska
Antal sidor276
FörlagISTE Ltd and John Wiley & Sons Inc
ISBN9781848219847

Tillhör följande kategorier

Elektronik och kommunikationer inom Naturvetenskap och teknik

Preface ixChapter 1. Number Systems 11.1. Introduction 11.2. Decimal numbers 11.3. Binary numbers 21.4. Octal numbers 41.5. Hexadecimal numeration 51.6. Representation in a radix B 61.7. Binary-coded decimal numbers 71.8. Representations of signed integers 81.8.1. Sign-magnitude representation 91.8.2. Two’s complement representation 101.8.3. Excess-E representation 121.9. Representation of the fractional part of a number 131.10. Arithmetic operations on binary numbers 161.10.1. Addition 161.10.2. Subtraction 171.10.3. Multiplication 181.10.4. Division 191.11. Representation of real numbers 201.11.1. Fixed-point representation 201.11.2. Floating-point representation 221.12. Data representation 281.12.1. Gray code 281.12.2. p-out-of-n code 291.12.3. ASCII code 311.12.4. Other codes 311.13. Codes to protect against errors 311.13.1. Parity bit 311.13.2. Error correcting codes 331.14. Exercises 361.15. Solutions 38Chapter 2. Logic Gates 492.1. Introduction 492.2. Logic gates 502.2.1. NOT gate 512.2.2. AND gate 512.2.3. OR gate 522.2.4. XOR gate 522.2.5. Complementary logic gates 532.3. Three-state buffer 542.4. Logic function 542.5. The correspondence between a truth table and a logic function 552.6. Boolean algebra 572.6.1. Boolean algebra theorems 592.6.2. Karnaugh maps 652.6.3. Simplification of logic functions with multiple outputs 732.6.4. Factorization of logic functions 742.7. Multi-level logic circuit implementation 762.7.1. Examples 772.7.2. NAND gate logic circuit 782.7.3. NOR gate based logic circuit 802.7.4. Representation based on XOR and AND operators 822.8. Practical considerations 892.8.1. Timing diagram for a logic circuit 902.8.2. Static hazard 902.8.3. Dynamic hazard 922.9. Demonstration of some Boolean algebra identities 932.10. Exercises 972.11. Solutions 101Chapter 3. Function Blocks of Combinational Logic 1153.1. Introduction 1153.2. Multiplexer 1153.3. Demultiplexer and decoder 1213.4. Implementation of logic functions using multiplexers or decoders 1273.4.1. Multiplexer 1273.4.2. Decoder 1293.5. Encoders 1303.5.1. 4:2 encoder 1313.5.2. 8:3 encoder 1343.5.3. Priority encoder 1363.6. Transcoders 1433.6.1. Binary code and Gray code 1433.6.2. BCD and excess-3 code 1493.7. Parity check generator 1553.8. Barrel shifter 1603.9. Exercises 1653.10. Solutions 173Chapter 4. Systematic Methods for the Simplification of Logic Functions 2034.1. Introduction 2034.2. Definitions and reminders 2034.2.1. Definitions 2044.2.2. Minimization principle of a logic function 2044.3. Karnaugh maps 2054.3.1. Function of five variables 2054.3.2. Function of six variables 2074.3.3. Karnaugh map with entered variable 2084.3.4. Applications 2154.3.5. Representation based on the XOR and AND operators 2204.4. Systematic methods for simplification 2204.4.1. Determination of prime implicants 2214.4.2. Finding the constitutive terms of a minimal expression 2244.4.3. Quine–McCluskey technique: simplification of incompletely defined functions 2354.4.4. Simplification of functions with multiple outputs 2354.5. Exercises 2414.6. Solutions 243Bibliography 257Index 259