Digital Switching I. Instructor: Prof. Yatindra N Singh, Department of Electrical Engineering, IIT Kanpur.
35
This course provides the fundamental concepts of digital switching systems with an emphasis on how the telephone exchange and packet switching systems operate. Topics covered in the lectures include: Introduction to telephony and networks, Strowger automatic telephone exchange, Crossbar switching, Logic circuit for crosspoint operation, Multistage interconnection networks, Call blocking probability of crossbar switches, Call congestion and time congestion, Clos network, Strictly non-blocking network, Rearrangeably non-blocking network, Cantor network, wide-sense non-blocking network, Packet switching, Input queued switch, Output queued switch, Banyan network, Delta network, and Buffered delta Network. (from nptel.ac.in)
Course Currilcum
- Lecture 01 – Introduction to Telephony and Networks Unlimited
- Lecture 02 – Basic Operation of Strowger Automatic Telephone Exchange Unlimited
- Lecture 03 – Fundamentals of Crossbar Switching Unlimited
- Lecture 04 – Logic Circuit for Crosspoint Operation Unlimited
- Lecture 05 – Introduction to Multistage Interconnection Networks Unlimited
- Lecture 06 – Estimation of Call Blocking Probability of Crossbar Switches Unlimited
- Lecture 07 – Call Congestion and Time Congestion Unlimited
- Lecture 08 – Clos Network Unlimited
- Lecture 09 – Lee’s Approximation – Estimation of Call Blocking Probability Unlimited
- Lecture 10 – Karnaugh’s Approximation – Estimation of Call Congestion Probability Unlimited
- Lecture 11 – Time Switch and its Working Unlimited
- Lecture 12 – Time Switch and Clos Network Unlimited
- Lecture 13 – TST Switch, Strictly Non-blocking Network, Rearrangeably Non-blocking Network Unlimited
- Lecture 14 – Paull’s Matrix and Clos Theorem Unlimited
- Lecture 15 – F-way Multicasting Clos Network Unlimited
- Lecture 16 – Strictly Sense Non-blocking Multicast Switching Network Unlimited
- Lecture 17 – Benes Network, Examples of Rearrangeably Non-blocking Networks Unlimited
- Lecture 18 – Slepian Duguid Theorem, Paull’s Theorem Unlimited
- Lecture 19 – Paull’s Matrix for Rearrangeably Non-blocking Networks Unlimited
- Lecture 20 – Recursive Construction of a Clos Network with Benes Network Unlimited
- Lecture 21 – Cantor Network Unlimited
- Lecture 22 – Wide-sense Non-blocking Network Unlimited
- Lecture 23 – Example of Wide-sense Non-blocking Switch Unlimited
- Lecture 24 – Packet Switching Unlimited
- Lecture 25 – Buffering Strategies Unlimited
- Lecture 26 – Output Queued Switch Unlimited
- Lecture 27 – Input Queued Switch Unlimited
- Lecture 28 – Banyan Network and Delta Network Unlimited
- Lecture 29 – Shufflenet as Delta Network Unlimited
- Lecture 30 – Performance Analysis of Crossbar and Delta Network Unlimited
- Lecture 31 – Properties of Delta Network Unlimited
- Lecture 32 – Buffered and Unbuffered Delta Network Unlimited
- Lecture 33 – Analysis of Buffered Delta Network Unlimited
- Lecture 34 – Analysis of Buffered Delta Network (cont.) Unlimited
- Lecture 35 – Analysis of Buffered Delta Network (cont.) Unlimited
⭐ Instructor rating
Followers
Following
Groups
Friends
