Principles of Communication Systems: Part - II

Principles of Communication Systems: Part - II

@VTU COE

0.0
(0) 0 Students
Download Brochure

What you will learn

  • None

This course is a sequel to Principles of Communication-Part I and covers fundamental concepts of communication systems, especially focusing on various aspects of modern digital communication systems. However, all the modules in this course will be independent of the previous course and hence students who could not participate in Principles of Communication-Part I will also be able to follow the course. Beginning with the basic theory of digital communication systems pertaining to pulse shaping, modulation and optimal detection, the course will also cover several important digital modulation techniques such as Binary Phase Shift Keying (BPSK), Frequency Shift Keying (FSK), Quadrature Amplitude Modulation (QAM), M-ary Phase Shift Keying (M-PSK) etc. Other fundamental concepts such as Information Theory, Channel Capacity, Entropy Coding and Error Control Coding will be dealt with in the later parts of the course. This course is suitable for all UG/PG students and practicing engineers/ managers who are looking to enhance their knowledge of the fundamental principles underlying various communication systems as well as students preparing for their college/ university/ competitive exams.

play
Digital Communication Receiver, Optimal SNR and Matched Filter
Preview 27:04
play
Probability of Error in Digital Communication and Probability Density Functions of Output
Preview 29:42
play
Probability of Error in Digital Communication, Optimal Decison Rule and Gaussian Q function
Preview 25:40
play
Introduction to Binary Phase Shift Keying (BPSK) Modulation, Optimal Decision Rule and Probability of Bit-Error or Bit-Error Rate (BER)
Preview 32:47
play
Introduction to Amplitude Shift Keying (ASK) Modulation
Preview 27:25
play
Optimal Decision Rule for Amplitude Shift Keying (ASK), Bit Error Rate (BER) and Comparison with Binary Phase Shift Keying (BPSK) Modulation
Preview 24:50
play
Introduction to Signal Space Concept and Orthonormal Basis Signals
Preview 24:10

play
Introduction to Frequency Shift Keying (FSK)
Preview 25:44
play
Optimal Decision Rule for FSK, Bit Error Rate (BER) and Comparison with BPSK, ASK
Preview 27:55
play
Introduction to Quadrature Phase Shift Keying (QPSK)
Preview 22:08
play
Waveforms of Quadrature Phase Shift Keying (QPSK)
Preview 20:05
play
Matched Filtering, Bit Error Rate and Symbol Error Rate for Quadrature Phase Shift Keying (QPSK)
Preview 36:20
play
Introduction to M-ary PAM (Pulse Amplitude Modulation), Average Symbol Power and Decision rules
Preview 30:31
play
M-ary PAM (Pulse Amplitude Modulation) -Part-II, Optimal Decision Rule and Probability of Error
Preview 39:18

play
M-ary QAM (Quadrature Amplitude Modulation) Part-I, Introduction, Transmitted Waveform and Average Symbol Energy
Preview 22:38
play
M-ary QAM (Quadrature Amplitude Modulation) - Part-II, Optimal Decision Rule, Probability of Error and Contellation Diagram
Preview 40:44
play
M-ary PSK (Phase Shift Keying) Part-I, Introduction , Transmitted Waveform and Constellation Diagram
Preview 25:42
play
M-ary PSK (Phase Shift Keying) - Part- II, Optimal Decision Rule, Nearest Neighbor Criterion and Approximate Probability of Error
Preview 27:27
play
Introduction to Information Theory, Relevance of Information Theory and Characterization of Information
Preview 33:23
play
Definition of Entropy, Average of Information / Uncertainity of source and Properties of Entropy
Preview 22:43
play
Entropy Example- Binary Source Maximum and Minimum Entropy of Binary Source
Preview 27:17

play
Maximum Entropy of Source with M-ary Alphabet, Concave/Convex Functions and Jensens Inequality
Preview 28:49
play
Joint Entropy , Definition of Joint Entropy of Two Sources and Simple Examples for Joint Entropy Computation
Preview 29:03
play
Properties of Joint Entropy and Relation between Joint Entropy and Marginal Entropies
Preview 27:16
play
Conditional Entropy, Example of Conditional Entropy and Properties of Conditional Entropy
Preview 30:01
play
Mutual Information, Diagrammatic Representation and Properties of Mutual Information
Preview 24:25
play
Simple Example of Mutual Information and Practical Example of Mutual Information-Binary Symmetric Channel
Preview 26:01
play
Channel Capacity, Implications of Channel Capacity, Claude E. Shannon- Father of Information Theory and Example of Capacity of Binary Symmetric Channel
Preview 34:33

play
Differential Entropy and Example for Uniform Probability Density function
Preview 19:11
play
Differential Entropy of Gaussian Source and Insights
Preview 18:50
play
Joint Conditional/ Differential Entropies and Mutual Information
Preview 16:29
play
Capacity of Gaussian channel- Part I
Preview 24:08
play
Capacity of Gaussian Channel Part-II, Practical Implications and Maximum rate in bits\sec
Preview 40:11
play
Introduction to Source Coding and Data Compression, Variable Length codes and Unique Decodability
Preview 29:03
play
Uniquely Decodable Codes, Prefix-free code, Instantaneous Code and Average Code length
Preview 24:21

play
Binary Tree Representation of Code, Example and Kraft Inequality
Preview 30:22
play
Lower Bound on Average Code Length and Kullback-Leibler Divergence
Preview 24:43
play
Optimal Code length, Constrained Optimization and Morse Code Example
Preview 23:04
play
Approaching Lower Bound on Average code length and Block Coding
Preview 28:18
play
Huffman Code, Algorithm, Example and Average Code Length
Preview 33:48
play
Introduction to channel coding, Rate of Code, Repetition Code and Hamming Distance
Preview 31:20
play
Introduction to Convolutional Codes, Binary Field Arithmetic and Linear Codes
Preview 17:19

play
Example of Convolutional Code Output and Convolution Operation for Code generation
Preview 18:10
play
Matrix Representation of Convolutional Codes, Generator Matrix, Transform Domain Representation and Shift Register Architecture
Preview 27:45
play
State Diagram Representation of Convolutional Code, State transitions and Example of Code Generation using State transitions
Preview 37:35
play
Trellis Representation of Convolutional Code and Valid Code Words
Preview 34:10
play
Decoding of the Convolutional Code, Minimum Hamming distance and Maximum Likelihood Codeword Estimate
Preview 21:28
play
Principle of Decoding of Convolutional code
Preview 32:25
play
Viterbi Decoder for Maximum Likelihood Decoding of Convolutional Code Using Trellis Representation, Branch Metric Calculation, State Metric Calculation and Example
Preview 43:15

play
Live Session 09-11-2019
Preview 55:22
img
No Discussion Found

0.0

0 Reviews

5
0
4
0
3
0
2
0
1
0
Meet Your Instructor
@VTU COE
img

Instructor
3.3 Rating
8558 Students
802 Courses
About Instructor

VTU is one of the largest Technological Universities in India with 24 years of Tradition of excellence in Engineering & Technical Education, Research and Innovations. It came into existence in the year 1998 to cater the needs of Indian industries for trained technical manpower with practical experience and sound theoretical knowledge.

video

Free

  • Course Duration
    26 h 55 m 58 s
  • Course Level
    Intermediate
  • Student Enrolled
    0
  • Language
    English
This Course Includes
  • 26 h 55 m 58 s Video Lectures
  • 0 Quizzes
  • 0 Assignments
  • 0 Downloadable Resources
  • Full Lifetime Access
  • Certificate of Completion