0% found this document useful (0 votes)
3 views

Lesson Plan DC

The document outlines the course structure for Digital Communication (BEC503) at Sambhram Institute of Technology, Bengaluru, for the semester from September 17, 2024, to December 21, 2024. It includes the lesson plan, course outcomes, source materials, and a detailed schedule of topics to be covered, along with the teaching methods and validation methods. The course aims to equip students with the skills to analyze and design digital communication systems.

Uploaded by

chaitu.dc924
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views

Lesson Plan DC

The document outlines the course structure for Digital Communication (BEC503) at Sambhram Institute of Technology, Bengaluru, for the semester from September 17, 2024, to December 21, 2024. It includes the lesson plan, course outcomes, source materials, and a detailed schedule of topics to be covered, along with the teaching methods and validation methods. The course aims to equip students with the skills to analyze and design digital communication systems.

Uploaded by

chaitu.dc924
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Sambhram Institute Of Technology

Bengaluru

COURSE BOOK

Period of the Semester : From 17 Sep 2024 To 21 Dec 2024

Dept-Sem-Sec: EC-5-A
Subject with Code: DIGITAL COMMUNICATION (BEC503)

Time Slot
MON: TUE : 09:00 - 10:00 WED: 12:15 - 13:15
THU : 12:15 - 13:15 FRI : 11:15 - 12:15 SAT :

Name of the Teacher : Mrs Chaitanya Danamaraju

1 | Page
Lesson Plan & Execution

Name of the Faculty Mrs Chaitanya Danamaraju

Dept-Sem-Sec EC-5-A

Date of Commencement 17 Sep 2024

Last Working Day of Semester 21 Dec 2024

Source Material List

TEXT 1 Simon Haykin, “Digital Communication Systems”, John Wiley & sons, 2014, ISBN 978-81- 265-4231-4.
REF 1 B.P Lathi, Zhi Ding, “Modern Digital and Analog Communication Systems”,4th Edition, Oxford University press, ISBN: 9780198073802,
2017
REF 2 K Sam Shanmugam, “Digital and analog communication systems”, Wiley India Pvt. Ltd, 2017, ISBN:978-81-265-3680-1,.
REF 3 K.N Hari Bhat, D. Ganesh Rao, “Information Theory and Coding”, Cengage Learning India Pvt Ltd, 2017, ISBN: 93-866-5092-4,.

Course Outcome List


1 Apply the concept of signal conversion to vectors in communication transmission and receiption.
2 Perform the mathematical analysis of digital communication systems for different modulation techniques.
3 Apply the Source coding and Channel coding principles for the discrete memoryless channels.
4 Compute the codewords for the error correction and detection of a digital data using Linear Block Code, Cyclic Codes and Convolution Codes.

2 | Page
5 Design encoding and decoding circuits for Linear Block Code, Cyclic Codes and Convolution Codes.

3 | Page
Plan/ Source Learning
Course Execution
Period Execu Date Topic material to Bloom's Level Validation
Outcome Methods
tion be referred Method
Module 1
1 P 17 Sep 2024 Hilbert Transform Lecture
1 E 17 Sep 2024 Hilbert Transform TEXT 1 CO 1 UNDERSTAND Lecture Assignment
2 P 18 Sep 2024 Pre-envelopes Lecture
2 E 18 Sep 2024 Pre-envelopes TEXT 1 CO 1 UNDERSTAND Lecture Assignment
3 P 19 Sep 2024 Complex envelopes of Band-pass Lecture
Signals
3 E 19 Sep 2024 Complex envelopes of Band-pass TEXT 1 CO 1 UNDERSTAND Lecture Assignment
Signals
4 P 20 Sep 2024 Canonical Representation of Bandpass Lecture
signals
4 E 20 Sep 2024 Canonical Representation of Bandpass TEXT 1 CO 1 UNDERSTAND Lecture Assignment
signals
5 P 24 Sep 2024 Introduction, Geometric representation Lecture
of signals
5 E 24 Sep 2024 Introduction, Geometric representation TEXT 1 CO 1 UNDERSTAND Lecture Assignment
of signals
6 P 25 Sep 2024 Gram- Schmidt Orthogonalization Lecture
procedure, Conversion of the continuous
AWGN channel into a vector channel
6 E 25 Sep 2024 Gram- Schmidt Orthogonalization TEXT 1 CO 1 UNDERSTAND Lecture Assignment
procedure, Conversion of the continuous
AWGN channel into a vector channel
7 P 26 Sep 2024 Optimum receivers using coherent Lecture
detection: ML Decoding, Correlation
receiver
7 E 26 Sep 2024 Optimum receivers using coherent TEXT 1 CO 1 UNDERSTAND Lecture Assignment
detection: ML Decoding, Correlation
receiver
8 P 27 Sep 2024 matched filter receiver Lecture
8 E 27 Sep 2024 matched filter receiver TEXT 1 CO 1 UNDERSTAND Lecture Assignment
Module 2

4 | Page
Plan/ Source Learning
Course Execution
Period Execu Date Topic material to Bloom's Level Validation
Outcome Methods
tion be referred Method
9 P 1 Oct 2024 Phase shift Keying techniques using Lecture
coherent detection: generation
9 E 1 Oct 2024 Phase shift Keying techniques using TEXT 1 CO 2 UNDERSTAND Lecture Assignment
coherent detection: generation
10 P 3 Oct 2024 detection and error probabilities of Lecture
BPSK and QPSK
10 E 3 Oct 2024 detection and error probabilities of TEXT 1 CO 2 UNDERSTAND Lecture Assignment
BPSK and QPSK
11 P 4 Oct 2024 M–ary PSK Lecture
11 E 4 Oct 2024 M–ary PSK TEXT 1 CO 2 UNDERSTAND Lecture Assignment
12 P 8 Oct 2024 M–ary QAM Lecture
12 E 8 Oct 2024 M–ary QAM TEXT 1 CO 2 UNDERSTAND Lecture Assignment
13 P 9 Oct 2024 Frequency shift keying techniques using Lecture
Coherent detection: BFSK generation
13 E 9 Oct 2024 Frequency shift keying techniques using TEXT 1 CO 2 UNDERSTAND Lecture Assignment
Coherent detection: BFSK generation
14 P 10 Oct 2024 detection and error probability Lecture
14 E 10 Oct 2024 detection and error probability TEXT 1 CO 2 UNDERSTAND Lecture Assignment
15 P 15 Oct 2024 BFSK using Noncoherent Detection Lecture
15 E 15 Oct 2024 BFSK using Noncoherent Detection TEXT 1 CO 2 UNDERSTAND Lecture Assignment
16 P 16 Oct 2024 Differential Phase Shift Keying Lecture
16 E 16 Oct 2024 Differential Phase Shift Keying TEXT 1 CO 2 UNDERSTAND Lecture Assignment
Module 3
17 P 18 Oct 2024 Introduction, Entropy Lecture
17 E 18 Oct 2024 Introduction, Entropy TEXT 1 CO 3 UNDERSTAND Lecture Assignment
18 P 22 Oct 2024 Source Coding Theorem Lecture
18 E 22 Oct 2024 Source Coding Theorem TEXT 1 CO 3 UNDERSTAND Lecture Assignment
19 P 23 Oct 2024 Lossless Data Compression Algorithms Lecture

5 | Page
Plan/ Source Learning
Course Execution
Period Execu Date Topic material to Bloom's Level Validation
Outcome Methods
tion be referred Method
19 E 23 Oct 2024 Lossless Data Compression Algorithms TEXT 1 CO 3 UNDERSTAND Lecture Assignment
20 P 24 Oct 2024 Discrete Memoryless Channels Lecture
20 E 24 Oct 2024 Discrete Memoryless Channels TEXT 1 CO 3 UNDERSTAND Lecture Assignment
21 P 25 Oct 2024 Mutual Information Lecture
21 E 25 Oct 2024 Mutual Information TEXT 1 CO 3 UNDERSTAND Lecture Assignment
22 P 5 Nov 2024 Channel capacity Lecture
22 E 5 Nov 2024 Channel capacity TEXT 1 CO 3 UNDERSTAND Lecture Assignment
23 P 6 Nov 2024 Channel Coding Theorem Lecture
23 E 6 Nov 2024 Channel Coding Theorem TEXT 1 CO 3 UNDERSTAND Lecture Assignment
24 P 7 Nov 2024 Information Capacity Law (Statement) Lecture
24 E 7 Nov 2024 Information Capacity Law (Statement) TEXT 1 CO 3 UNDERSTAND Lecture Assignment
Module 4
25 P 8 Nov 2024 Error Control Using Forward error Lecture
Correction
25 E 8 Nov 2024 Error Control Using Forward error TEXT 1 CO 4 UNDERSTAND Lecture Assignment
Correction
26 P 12 Nov 2024 Error Control Using Forward error Lecture
Correction
26 E 12 Nov 2024 Error Control Using Forward error TEXT 1 CO 4 UNDERSTAND Lecture Assignment
Correction
27 P 13 Nov 2024 Error Control Using Forward error Lecture
Correction
27 E 13 Nov 2024 Error Control Using Forward error TEXT 1 CO 4 UNDERSTAND Lecture Assignment
Correction
28 P 14 Nov 2024 Error Control Using Forward error Lecture
Correction
28 E 14 Nov 2024 Error Control Using Forward error TEXT 1 CO 4 UNDERSTAND Lecture Assignment
Correction

6 | Page
Plan/ Source Learning
Course Execution
Period Execu Date Topic material to Bloom's Level Validation
Outcome Methods
tion be referred Method
29 P 15 Nov 2024 Definitions, Matrix Descriptions, Lecture
Syndrome and its properties
29 E 15 Nov 2024 Definitions, Matrix Descriptions, TEXT 1 CO 4 UNDERSTAND Lecture Assignment
Syndrome and its properties
30 P 19 Nov 2024 Minimum distance Considerations, Lecture
Syndrome Decoding, Hamming Codes
30 E 19 Nov 2024 Minimum distance Considerations, TEXT 1 CO 4 UNDERSTAND Lecture Assignment
Syndrome Decoding, Hamming Codes
31 P 20 Nov 2024 Properties, Generator and Parity Check Lecture
Polynomial and matrices, Encoding
31 E 20 Nov 2024 Properties, Generator and Parity Check TEXT 1 CO 4 UNDERSTAND Lecture Assignment
Polynomial and matrices, Encoding
32 P 21 Nov 2024 Syndrome computation, Examples Lecture
32 E 21 Nov 2024 Syndrome computation, Examples TEXT 1 CO 4 UNDERSTAND Lecture Assignment
Module 5
33 P 22 Nov 2024 Convolutional Encoder Lecture
33 E 22 Nov 2024 Convolutional Encoder TEXT 1 CO 5 UNDERSTAND Lecture Assignment
34 P 26 Nov 2024 Convolutional Encoder Lecture
34 E 26 Nov 2024 Convolutional Encoder TEXT 1 CO 5 UNDERSTAND Lecture Assignment
35 P 27 Nov 2024 Code tree Lecture
35 E 27 Nov 2024 Code tree TEXT 1 CO 5 UNDERSTAND Lecture Assignment
36 P 28 Nov 2024 Trellis Graph and State graph Lecture
36 E 28 Nov 2024 Trellis Graph and State graph TEXT 1 CO 5 UNDERSTAND Lecture Assignment
37 P 29 Nov 2024 Recursive systematic Convolutional Lecture
codes
37 E 29 Nov 2024 Recursive systematic Convolutional TEXT 1 CO 5 UNDERSTAND Lecture Assignment
codes
38 P 3 Dec 2024 Optimum decoding of Convolutional Lecture
codes

7 | Page
Plan/ Source Learning
Course Execution
Period Execu Date Topic material to Bloom's Level Validation
Outcome Methods
tion be referred Method
38 E 3 Dec 2024 Optimum decoding of Convolutional TEXT 1 CO 5 UNDERSTAND Lecture Assignment
codes
39 P 4 Dec 2024 Maximum Likelihood Decoding of Lecture
Convolutional codes: The Viterbi
Algorithm
39 E 4 Dec 2024 Maximum Likelihood Decoding of TEXT 1 CO 5 UNDERSTAND Lecture Assignment
Convolutional codes: The Viterbi
Algorithm
40 P 5 Dec 2024 Examples Lecture
40 E 5 Dec 2024 Examples TEXT 1 CO 5 UNDERSTAND Lecture Assignment

8 | Page
Module # of Classes # of Classes
Planned Effort(till date) Actual Effort (till date) % Coverage
No. Planned(till date) Executed(till date)
1 8 8hrs 0min 8 8hrs 0min 100.0
2 8 8hrs 0min 8 8hrs 0min 100.0
3 8 8hrs 0min 8 8hrs 0min 100.0
4 8 8hrs 0min 8 8hrs 0min 100.0
5 8 8hrs 0min 8 8hrs 0min 100.0

Faculty in charge HOD's Signature

Signature of Principal (remark if any)

You might also like