Scet
Download as PPTX, PDF
0 likes607 views
This document outlines a one-day workshop on revising the syllabus for the subject "Signal Coding and Estimation Theory". It includes an introduction by the instructor Anandakumar M, followed by the contents of the syllabus organized into 7 units. Each unit lists topics with allocated time periods. It also provides the paper pattern and marks distribution. The document discusses the teaching methodology, emphasizing a balance of theory and problems. Finally, it lists the recommended textbooks and reference books.
Convert to study materialsBETA
Transform any presentation into ready-made study materialselect from outputs like summaries, definitions, and practice questions.
![Contents..
Measure of information [1]
Entropy and properties [1]
Conditional and joint entropies [1]
Mutual information and properties[2]
Information rate [1/2]
Extension of memory less source[1/2]
Average information content of symbols in long dependent
sequences[1/2]
Mark-off model[1/2]](https://image.slidesharecdn.com/scet-140126225550-phpapp02/85/Scet-8-320.jpg)
![Contents..
Channel capacity[1/2]
Symmetric channel[1/2]
Binary symmetric channel[1]
Binary erasure channel[1]
Cascaded channel[1/4]
Lossless channel[1/4]
Channel coding theorem[1]
Channel capacity theorem[1]
The Shannon's limit[1/2]](https://image.slidesharecdn.com/scet-140126225550-phpapp02/85/Scet-10-320.jpg)
![Contents..
Encoding methods[1/4]
Krafts inequality[1/2]
Coding efficiency and redundancy[1/4]
Source coding theorem[1/2]
Huffman coding[2]
Shannon's fano algorithm[2]
Arithmetic coding[1/2]
LZW algorithm[1/2]
Run length coding[1/2]](https://image.slidesharecdn.com/scet-140126225550-phpapp02/85/Scet-12-320.jpg)
![Contents..
Matrix description[1/2]
Generator and parity check matrix[1/2]
Syndrome and error correction[1]
Hamming weight and Hamming distance[1/2]
Error correction and error detection capabilities[1]
Perfect codes[1/2]
Hamming codes[1/2]
Optimal linear code[1/2]
Equivalent codes[1/2]
Maximum distance separable codes[1/2]](https://image.slidesharecdn.com/scet-140126225550-phpapp02/85/Scet-14-320.jpg)
![Contents..
Generation polynomial[1/2]
Matrix description[1/2]
Encoding of cyclic codes[1]
Syndrome calculation circuit[1]
Fire codes[1/4]
Goley codes[1/2]
BCH codes[1/2]
CRC codes[1]
RS codes[1/2]
Nested codes[1/4]](https://image.slidesharecdn.com/scet-140126225550-phpapp02/85/Scet-16-320.jpg)
![Contents..
Time domain approach [1/2]
Transform domain approach[1/2]
State diagram and Tree diagram[1]
Trellis diagram[1]
Matrix description of convolution codes[1/2]
Polynomial description of convolution codes[1/2]
Viterbi algorithm[1]
Turbo coding and decoding[1/2]
Mapping by set partitioning[1/4]
Performance evaluation of AWGN channel[1/4]
TCM for fading channel[1/4]](https://image.slidesharecdn.com/scet-140126225550-phpapp02/85/Scet-18-320.jpg)
![Contents..
Maximum likely hood estimation[1]
Maximum a prior estimation[1/2]
Least square estimation[1/2]](https://image.slidesharecdn.com/scet-140126225550-phpapp02/85/Scet-20-320.jpg)
![PAPER PATTERN WITH MARKS DISTRIBUTION
UNIT
2MARK
5MARK
7MARK
8MARK
TOTAL
MARKS
1
2 OR 3
2
1
1
14
2
2 OR 3
1
1
1
12
3
2 OR 3
2
1
1
14
4
2 OR 3
1 OR 2
1
1
10
5
2 OR 3
1 OR 2
1
1
10
6
2 OR 3
2
1
1
12
7
1[NC]
1[NC]
1
1
8](https://image.slidesharecdn.com/scet-140126225550-phpapp02/85/Scet-21-320.jpg)
Scet
- 1. A SEMINAR ON ONE DAY WORKSHOP FOR TE REVISED SYLLABUS OF SUBJECT "SIGNAL CODING AND ESTIMATION THEORY ANANDAKUMAR.M ASSISTANT PROFESSOR IN COLLEGE OF ENGINEERING, AMBAJOGAI E.MAIL:anand.dm8@gmail.com
- 2. CONTENTS.. SYLLABUS CONSTRUCTION SYLLABUS AND CONTENTS MARKS DISTRIBUTION TEACHING METHODOLOGY TEXT BOOKS REFERENCE BOOKS
- 3. SYLLABUS CONSTRUCTION A syllabus is a tool It exists to serve a purpose You have to define that purpose I suggest that there are two large purposes The syllabus should make a PROMISE The syllabus should provide a PLAN
- 4. SYLLABUS CONSTRUCTION The syllabus should present this information in a way that is Simple Clear Unambiguous Straightforward, and Easily found
- 5. SYLLABUS CONSTRUCTION Reasons to make this promise First, it is the kind and humane thing to Second, it implies an attitude. It says, I have planned this carefully and I expect that you will plan your participation in this course carefully, too.
- 7. UNIT-1 INFORMATION THEORY TIME : 7 HOURS
- 8. Contents.. Measure of information [1] Entropy and properties [1] Conditional and joint entropies [1] Mutual information and properties[2] Information rate [1/2] Extension of memory less source[1/2] Average information content of symbols in long dependent sequences[1/2] Mark-off model[1/2]
- 9. UNIT-2 CHANNEL CAPACITY TIME : 6 HOURS
- 10. Contents.. Channel capacity[1/2] Symmetric channel[1/2] Binary symmetric channel[1] Binary erasure channel[1] Cascaded channel[1/4] Lossless channel[1/4] Channel coding theorem[1] Channel capacity theorem[1] The Shannon's limit[1/2]
- 11. UNIT-3 SOURCE CODING TIME : 7 HOURS
- 12. Contents.. Encoding methods[1/4] Krafts inequality[1/2] Coding efficiency and redundancy[1/4] Source coding theorem[1/2] Huffman coding[2] Shannon's fano algorithm[2] Arithmetic coding[1/2] LZW algorithm[1/2] Run length coding[1/2]
- 13. UNIT-4 LINEAR BLOCK CODES TIME : 6 HOURS
- 14. Contents.. Matrix description[1/2] Generator and parity check matrix[1/2] Syndrome and error correction[1] Hamming weight and Hamming distance[1/2] Error correction and error detection capabilities[1] Perfect codes[1/2] Hamming codes[1/2] Optimal linear code[1/2] Equivalent codes[1/2] Maximum distance separable codes[1/2]
- 15. UNIT-5 CYCLIC CODES TIME : 6 HOURS
- 16. Contents.. Generation polynomial[1/2] Matrix description[1/2] Encoding of cyclic codes[1] Syndrome calculation circuit[1] Fire codes[1/4] Goley codes[1/2] BCH codes[1/2] CRC codes[1] RS codes[1/2] Nested codes[1/4]
- 17. UNIT-6 CONVOLUTION CODES TIME : 6 HOURS
- 18. Contents.. Time domain approach [1/2] Transform domain approach[1/2] State diagram and Tree diagram[1] Trellis diagram[1] Matrix description of convolution codes[1/2] Polynomial description of convolution codes[1/2] Viterbi algorithm[1] Turbo coding and decoding[1/2] Mapping by set partitioning[1/4] Performance evaluation of AWGN channel[1/4] TCM for fading channel[1/4]
- 19. UNIT-7 ESTIMATION THEORY TIME : 2 HOURS
- 20. Contents.. Maximum likely hood estimation[1] Maximum a prior estimation[1/2] Least square estimation[1/2]
- 21. PAPER PATTERN WITH MARKS DISTRIBUTION UNIT 2MARK 5MARK 7MARK 8MARK TOTAL MARKS 1 2 OR 3 2 1 1 14 2 2 OR 3 1 1 1 12 3 2 OR 3 2 1 1 14 4 2 OR 3 1 OR 2 1 1 10 5 2 OR 3 1 OR 2 1 1 10 6 2 OR 3 2 1 1 12 7 1[NC] 1[NC] 1 1 8
- 22. IF A STUDENT CANNOT UNDERSTAND IN the WAY WE TEACH THEN WE HAVE TO TEACH IN A WAY SO THAT THE STUDENT CAN UNDERSTAND IT
- 23. TEACHING METHODOLOGY Importance or weightage 50% theory and 50% problems Bit explanation and problem 4 Theory class 1 Tutorial class(work out more problems) Assignment Unit test Class test Main exam EXPLAIN AND EXTRACT
- 24. TEXT BOOKS 1.Information theory coding and cryptography by Ranjan Boss 2.Multimedia communication by Fred Halsall 3.Digital communication by Simon Haykin 4.Digital and analog communication system by Sam Shanmugam 5.Random process-filtering ,estimation and detection by Lonnie Ludeman
- 25. REFERENCE BOOKS 1.Information and coding by N.Abramsan 2.Introduction to information theory by M.Mansor 3.Digital communications by Glover and Grant 4.Digital communication by A. Bhattacharya
- 26. Open house ?
- 27. THANK YOU