| Document Type
|
:
|
BL
|
| Record Number
|
:
|
951301
|
| Doc. No
|
:
|
b705671
|
| Main Entry
|
:
|
Singh, A. K.
|
| Title & Author
|
:
|
Foundation of switching theory and logic design /\ A.K. Singh.
|
| Publication Statement
|
:
|
New Delhi :: New Age International (P) Ltd.,, ©2008.
|
| Page. NO
|
:
|
1 online resource (viii, 391 pages)
|
| ISBN
|
:
|
8122428797
|
|
|
:
|
: 9788122428797
|
|
|
:
|
9788122422139
|
| Bibliographies/Indexes
|
:
|
Includes bibliographical references (page 384) and index.
|
| Contents
|
:
|
Cover -- Preface -- Acknowledgement -- Contents -- Chapter 1. Number Systems and Codes -- 1.0 Introduction -- 1.1 A Review of The Decimal System -- 1.2 Binary Numbering System -- 1.2.1 Binary to Decimal Conversion -- 1.2.2 Decimal to Binary Conversion -- 1.2.3 Binary Formats -- 1.2.4 Data Organization -- 1.3 Octal Numbering System -- 1.3.1 Octal to Decimal, Decimal to Octal Conversion -- 1.3.2 Octal to Binary, Binary to Octal Conversion -- 1.4 Hexadecimal Numbering System -- 1.4.1 Hex to Decimal and Decimal to Hex Conversion
|
|
|
:
|
1.4.2 Hex to Binary and Binary to Hex Conversion1.4.3 Hex to Octal and Octal to Hex Conversion -- 1.5 Range to Number Representation -- 1.6 Binary Arithmetic -- 1.7 Negative Numbers and Their Arithmetic -- 1.7.1 1's and 2's Complement -- 1.7.2 Subtraction Using 1's and 2's Complement -- 1.7.3 Signed Binary Representation -- 1.7.4 Arithmetic Overflow -- 1.7.5 9's and 10's Complement -- 1.7.6 r's Complement and (r-1)'s Complement -- 1.7.7 Rules for Subtraction using (r-1)'s Complement -- 1.7.8 Rules for Subtraction using r's Complement
|
|
|
:
|
1.8 Binary Coded Decimal (BCD) and Its Arithmetic1.9 Codes -- 1.9.1 Weighted Binary Codes -- 1.9.2 Non-Weighted Codes -- 1.9.3 Error Detecting Codes -- 1.9.4 Error Correcting Codes -- 1.9.5 Hamming Code -- 1.9.6 Cyclic Codes -- 1.9.7 Alphanumeric Codes -- 1.10 Solved Examples -- 1.11 Exercises -- Chapter 2. Digital Design Fundamentals Boolean Algebra and Logic Gates -- 2.0 Introductory Concepts of Digital Design -- 2.1 Truth Table -- 2.2 Axiomatic Systems and Boolean Algebra -- 2.2.1 Huntington's Postulates
|
|
|
:
|
2.2.2 Basic Theorems and Properties of Boolean Algebra2.3 Boolean Functions -- 2.3.1 Transformation of Boolean Function into Logic Diagram -- 2.3.2 Complement of a Function -- 2.4 Representation of Boolean Functions -- 2.4.1 Minterm and Maxterm Realization -- 2.4.2 Standard Forms -- 2.4.3 Conversion between Standard Forms -- 2.5 Logic Gates -- 2.5.1 Positive and Negative Logic Designation -- 2.5.2 Gate Definition -- 2.5.3 The AND Gate -- 2.5.4 The OR Gate -- 2.5.5 The Inverter and Buffer -- 2.5.6 Other Gates and Their Functions -- 2.5.7 Universal Gates
|
|
|
:
|
2.5.8 The Exclusive OR Gate2.5.9 The Exclusive NOR gate -- 2.5.10 Extension to Multiple Inputs in Logic Gates -- 2.6 NAND and NOR Implementation -- 2.6.1 Implementation of a Multistage (or Multistage (or Multilevel) Digial Circuit using NAND Gates Only -- 2.6.2 Implementation of a Multilevel Digital Circuit using NOR Gates only -- 2.7 Exercise -- Chapter 3. Boolean Function Minimization Techniques -- 3.0 Introduction -- 3.1 Minimization Using Postulates and Theorem of Boolean Algebra -- 3.2 Minimization Using Karnaugh Map (K-Map) Method
|
| Subject
|
:
|
Logic design.
|
| Subject
|
:
|
Switching theory.
|
| Subject
|
:
|
Logic design.
|
| Subject
|
:
|
Switching theory.
|
| Subject
|
:
|
TECHNOLOGY ENGINEERING-- Electronics-- Circuits-- General.
|
| Subject
|
:
|
TECHNOLOGY ENGINEERING-- Electronics-- Circuits-- Integrated.
|
| Dewey Classification
|
:
|
621.3815/372
|
| LC Classification
|
:
|
TK7868.S9S56 2008eb
|