Follow our Telegram channel to get notified instantly whenever new books are published.
Basics Of Digital Electronics – Banani Ghosh (1)

The eight output lines are Y0 to Y7. D is the data input. Now depending on the values of the control inputs, the data D will be steered to one of the output lines. Let, A = 0, B = 0, C = 0, then according to the circuit we find only the first AND gate is enabled while all other AND gates will be disabled. Thus in this case, input D will steer to Y0, i.e. Y0 = D. If D Basics of Digital Electronics = 0, Y0 = 0, if D = 1, Y0 will be 1 while all other outputs will be zero irrespective of the value of D.
Similarly if A = 0, B = 0, C = 1, then the second AND gate whose output is Y1, will be enabled while all other AND gates will be disabled. Thus now D will be steered to Y1 or Y1 = D. If D = 0, Y1 = 0. If D = 1, Y1 = 1 while all other outputs will remain 0 irrespective of the value of D.
Similarly we can explain for all the other six AND gates. Always we will find that depending on the values of control inputs A, B and C, only one AND gate will be enabled and input D will steer to that output line. Q.9. (a) Explain the working of 1 : 16 demultiplexer. (b) Draw and explain the pin diagram of IC74154 and draw its logic diagram from the truth table.
Ans. (a) A 1 : 16 demultiplexer has one input signal and sixteen output signals. The number of control inputs required here is 16 = 2m or 24 = 2m or m = 4 (where m is the required control inputs).
4 Park Square, Milton Park, Abingdon, Oxon, OX14 4RN and by CRC Press 2385 NW Executive Center Drive, Suite 320, Boca Raton FL 33431 CRC Press is an imprint of Informa UK Limited © 2024 Manakin Press The right of Banani Ghosh to be identified as author of this work has been asserted in accordance with sections 77 and 78 of the Copyright, Designs and Patents Act 1988.
All rights reserved. No part of this book may be reprinted or reproduced or utilised in any form or by any electronic, mechanical, or other means, now known or hereafter invented, including photocopying and recording, or in any information storage or retrieval system, without permission in writing from the publishers. For permission to photocopy or use material electronically from this work, access www.copyright.com or contact the Copyright Clearance Center, Inc. (CCC), 222 Rosewood Drive, Danvers, MA 01923, 978-750-8400.
For works that are not available on CCC please contact [email protected] Trademark notice: Product or corporate names may be trademarks or registered trademarks, and are used only for identification and explanation without intent to infringe. Print edition not for sale in South Asia (India, Sri Lanka, Nepal, Bangladesh, Pakistan or Bhutan) ISBN: 9781032567556 (hbk) ISBN: 9781032567563 (pbk) ISBN: 9781003436997 (ebk) DOI: 10.4324/9781003436997 Typeset in Times New Roman by Manakin Press, Delhi Brief Contents 1.
Analog and Digital Signals 1–4 2. Number Systems 5–18 3. Logic Gates 19–34 4. Combinational Logic Circuits and Simplification 35–54 5. Binary Arithmetic 55–74 6. Codes and Parity 75–90 7. Multiplexer, Demultiplexer, Encoder, Decoder 91–120 8. Different Types of Displays 121–128 9. Digital Logic Families 129–152 10. Flip Flops 153–174 11. Shift Registers 175–190 12. Counters 191–214 13. Semiconductor Memories 215–226 14. D/A Conversion and A/D Conversion 227–250 1. Analog and Digital Signals 1–4 Definitions • Difference between analog and digital signals • Advantage of Digital signal over analog signal.
2. Number Systems 5–18 Definitions • Radix representation of numbers • Conversion of one number system to the other (Decimal, Binary, Octal and Hexadecimal) • Fixed point representation • Floating point representation. 3. Logic Gates 19–34 Definitions • Basic Gates-NOT, OR, AND • Universal gates-NOR, NAND • X-OR gate • AND-OR-Invert gates • De-Morgan’s laws • Logic circuit for Boolean Expression and vice-versa • Positive logic and negative logic. 4. Combinational Logic Circuits and Simplification 35–54 Boolean laws and theorems • Consensus theorem • Karnaugh Map • Don’t care condition • Minterm and Maxterm • Simplification using Boolean laws and theorems • Simplification using Karnaugh map for 3, 4 and 5 variables—SOP and POS • Simplification using tabular method • Simplification using Consensus theorem • Hazard and Hazard cover.
5.
This is a short excerpt from the opening of “” by Unknown, quoted for review and introduction purposes. All rights belong to the copyright holders.
Book Information
- Unique ID: 3b7c21ab1daee9e1
- File Extension: .pdf
- File Size: 13,623,931 bytes (12.993 MB)
- Title: –
- Author: Unknown
- ISBN: 9781032567556, 9781032567563, 9781003436997
- Pages: 259
- Language: English (en)
Reading & Word Statistics
- Estimated Reading Time: 364.35 minutes
- Total Words: 72,870
- Total Characters: 371,880
- Average Words per Page: 281.35
- Average Characters per Page: 1435.83
Most Frequent Words
input (500), output (446), flip-flop (401), gate (336), logic (334), digital (301), clock (298), high (297), ans (281), counter (269), fig (268), number (262), data (260), bit (257), binary (251), circuit (235), inputs (232), low (210), table (210), shown (202), time (188), state (182), voltage (170), one (168), using (166), now (164), truth (159), used (155), memory (152), since (151), register (129), decimal (125), code (125), thus (125), two (125), control (124), electronics (123), diagram (121), basics (120), gates (119), parity (118), bits (117), signal (116), analog (108), equivalent (108), first (101), shift (101), converter (101), find (99), required (93), let (93), multiplexer (92), type (92), also (91), count (91), change (90), complement (87), connected (87), conversion (86), bcd (86), carry (83), ttl (82), flip-flops (81), called (78), line (78), power (78), decoder (77), flip (77), equation (77), case (75), negative (74), transition (74), given (73), hence (72), next (72), method (70), serial (70), use (69), abc (68), reset (67), value (66), vcc (66), numbers (65), system (64), explain (64), signals (63), between (62), convert (62), outputs (62), possible (61), point (59), cmos (59), states (59), read (59), iii (58), flop (57), three (57), abcd (56), map (55), operation (55).
