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

Coding Theory and Techniques - Updated

VAC

Uploaded by

naacvins23
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
42 views

Coding Theory and Techniques - Updated

VAC

Uploaded by

naacvins23
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 21

From

Mrs. P. Merlin Viji


Course Coordinator & Assistant Professor of Dept. of ECE,
Vins Christian College of Engineering,
Chunkankadai.

To
The Principal,
Vins Christian College of Engineering,
Chunkankadai,
Sub : Requesting approval to conduct the value added course –Reg

Respected Madam,
It is brought to your kind notice that, we have planned to conduct a value-added course for our M.E –
Communication Systems students of the current academic year- 2022-2023 (ODD Semester). The Value-added
course details are below.

Academic year / Year / Sem : 2022-2023: I & III Semester


Course Code/ Course Name : CTTPECE- CODING THEORY AND TECHNIQUES
Duration : 17.10.2022 TO 22.10.2022
Total Number of Hours : 33 Periods
Course Coordinators : Mrs. P. Merlin Viji (9629065) Mrs. J. V. Jincy Joy (9629406)
Assistant. Professor, Asst. Professor,
Dept. of ECE Dept. of ECE.
We enclosed the proposal of course details with course contend for your reference. We seek your kind
permission to conduct this value-added course for the betterment of students.
Thank You
Yours Truly,

COURSE COORDINATOR
Mrs. P. Merlin Viji
Assistant Professor/ ECE.

Approval / Remarks
Forwarded / NOT Recommended / NOT Approved / NOT

Head of the Department IQAC – Coordinator Principal


DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
PROPOSAL OF VALUE ADDED COURSE

1. Add-on Course Code / Title : CTTPECE- CODING THEORY AND TECHNIQUES

: The concepts, principles and applications of information


theory on Communication systems. The data compression
2. Objective of the course : techniques with text, audio, speech, image and video for real
world applications. The block codes and convolution codes for
coding and decoding of digital data.

: Basic knowledge of coding theory would be advantageous


3. Prerequisite

4. Beneficiary : I & III PG Semester M.E- CS Students


: 17.10.2022 to 22.10.2022
5. Date & Duration of the course

6 No. of hours required : 33 Hours


7 Proposed timings : 9.30 am to 12.30 pm &1.30 PM to 4.300 PM

8. Internal Resources : 1. Mrs. P. Merlin Viji, Assistant Professor / ECE


2. Mrs. J. V. Jincy Joy, Assistant Professor / ECE
9. Internal Assessment : Objective Type Test
10. Course Registration fee : NIL
11. Contents of the course : Enclosed separately
: Those who have 75% attendance and scored 50%marks will be
12. Credits / Certification eligible for certification.

13. Venue : MM Laboratory

COURSE COORDINATOR HEAD OF THE DEPARTMENT


DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

SYLLABUS

CTTECE CODING THEORY AND TECHNIQUES L T P


1 0 1
Course Objective: The course should enable the students to:
The concepts, principles and applications of information theory on communication systems.
The data compression techniques with text, audio, speech, image and video for real world applications
The block codes and convolution codes for coding and decoding of digital data.
Course Outcome: The students should be able to:
llustrate source and channel coding techniques for error-free transmission of Understand message
over a noisy communication channel.
Make use of linear and cyclic block codes for the performance analysis of error Understand detection
and correction in terms of efficiency.
Outline the various types of convolution codes for channelencoding processing data Apply streaming.
Choose the Viterbi and turbo decoder algorithms for detection of the convolution Apply code sequence
in error controlling.
Relate the various source coding techniques and algorithms fortext, audio and speech Understand
processing
Categorize the image and video formats and compression methods for data storage Analyze and
compression
Module – I INFORMATION THEORY 6 hours
Information – Entropy, information rate, classification of codes Kraft McMillan inequality, source coding theorem
mathematical model of information, a logarithmic measure of information, Shannon-Fano coding, Huffman coding,
extended Huffman coding–Joint and conditional entropies, mutual information discrete memory less channels–
BSC, BEC–Channel capacity, Shannon limit
Module – II ERROR CONTROL CODING: BLOCK CODES 6 hours

Definitions and Principles: Hamming weight, Hamming distance minimum distance decoding, single parity codes
Hamming codes, repetition codes linear block codes, cyclic codes, syndrome calculation
shortened cyclic codes, majority logic decoding for cyclic codes, encoder and decoder, CRC.
Module – III ERROR CONTROL CODING: CONVOLUTIONAL CODES 6 hours

Convolutional codes code tree, trellis, state diagram Encoding Decoding Sequential search and Viterbi algorithm.
Principle of turbo coding types of errors, error control strategies.
Module – IV SOURCE CODING: TEXT, AUDIO AND SPEECH 6 hours

Source code: Definition, techniques, Text: Adaptive Huffman coding arithmetic coding, variable-length codes LZW
algorithm Audio: Linear predictive coding (LPC), Perceptual coding, masking techniques psychoacoustic model,
MEG audio layers I,II,III, Dolby AC3 - Speech: Channel vocoder, linear predictive coding

Module – V SOURCE CODING: IMAGE AND VIDEO 6 hours

Image and Video Formats – GIF, TIFF, SIF, CIF, QCIF Image compression: READ, JPEG Video Compression:
Principles-I,B,P frames motion estimation, motion compensation H.261, MPEG standard, Standards-based and
nonstandard approaches to coding.
Course Assessment Test for 100 Marks – 3 Hours
Website / URL References
1 https://www.youtube.com/watch?v=Uk9zFrEGguM
https://lecturenotes.in/subject/540/information-theory-coding-itc
2

COURSE COORDINATOR HEAD OF THE DEPARTMENT


Cir.No.VCCE/ECE/2022-2023/VAC/100501 Date: 05-10-2022
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
CIRCULAR
The students from Department of Electronics and Communication Engineering (PG) (I & III Semester) are
hereby informed to enroll their names for Value Added course “CTTECE- CODING THEORY AND
TECHNIQUES” on or before 13.10.2022
COURSE FEATURES:
Course Duration : 33Hours
Beneficiary : I & III Semester PG Students from ECE Department
Certificate : Yes
Venue : ECE DEPT – M M Laboratory
Schedule : 17.10.2022 to 22.10.2022
Timings : 09.30 AM to 4.30 PM

HOD/ECE
Copy Submitted to The Chairman, The Secretary and IQAC Cell
Copy to:
1. The Principal for Kind Information
2. Department Notice Board
3. All ECE Staff members
4. I & III Semester ECE Students
Enclosed: Brochure
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

RESOURCE PERSON PROFILE

Name: MERLIN VIJI P

Faculty Code 9629065

Designation: Assistant Professor

Email id: [email protected]

UG/PG Name of College Year Area of Specialization

Electronics and
Vins Christian College of
UG 2009 Communication
Engineering
Educational Engineering
Qualifications

Communication
PG CSI Institute of Technology 2011
Systems

Work Working as Assistant Professor in Vins Christian College of


Experience COLLEGE Engineering from 01.06.2011 to Still now
Courses Completed NPTEL Courses in Digital Signal Processing

Attended FDP&Workshop conducted by Various Universities,


Training programs
AICTE etc.
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
COURSE PLAN
Name of the CTTECE- CODING Name of the 1.Mrs. P. Merlin Viji,
Value Added THEORY AND handling Assistant Professor/ ECE
Course TECHNIQUES Faculty 2.Mrs. J V. Jincy Joy,
Assistant Professor / ECE
Course Objective
The concepts, principles and applications of information theory on communication systems.
The data compression techniques with text, audio, speech, image and video for real world applications
The block codes and convolution codes for coding and decoding of digital data.
Course Outcome
llustrate source and channel coding techniques for error-free transmission of Understand
message over a noisy communication channel.
Make use of linear and cyclic block codes for the performance analysis of error Understand
detection and correction in terms of efficiency.
Outline the various types of convolution codes for channelencoding processing data Apply
streaming.
Choose the Viterbi and turbo decoder algorithms for detection of the convolution Apply code
sequence in error controlling.
Relate the various source coding techniques and algorithms fortext, audio and speech Understand
processing
Lesson Plan for VAC
T / R* Periods Mode of
Sl.No. Date Session Topic
Book Nos Teaching
Information – Entropy, information rate,
1 1 1 PPT/BB
classification of codes
FN Kraft McMillan inequality, source coding
2 1 2 PPT/BB
theorem
mathematical model of information, a
3 logarithmic measure of information, 1 3 PPT/BB
4 17.10.2022 Shannon-Fano coding, Huffman coding, 1 4 PPT/BB
extended Huffman coding–Joint and
5 1 5 PPT/BB
conditional entropies, mutual information
AN
discrete memory less channels–BSC,
6 BEC–Channel capacity, Shannon limit 1 6 PPT/BB
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
COURSE PLAN
Definitions and Principles: Hamming
7 1 7 PPT/BB
weight, Hamming distance
FN minimum distance decoding, single parity
8 1 8 PPT/BB
codes
9 Hamming codes, repetition codes 1 9 PPT/BB
18.10.2022
linear block codes, cyclic codes,
10 1 10 PPT/BB
syndrome calculation
11 AN shortened cyclic codes, 1 11 PPT/BB
majority logic decoding for cyclic codes,
12 1 12 PPT/BB
encoder and decoder, CRC.
13 Convolutional codes 1 13 PPT/BB
14 FN code tree, trellis, state diagram 1 14 PPT/BB
15 Encoding Decoding 1 15 PPT/BB
19.10.2022
16 Encoding Decoding 1 16 PPT/BB
17 AN Sequential search and Viterbi algorithm. 1 17 PPT/BB
18 Principle of turbo coding 1 18 PPT/BB
19 types of errors, error control strategies. 1 19 PPT/BB
Source code: Definition, techniques,
FN Text: Adaptive Huffman coding
20 arithmetic coding, variable-length codes 1 20 PPT/BB
21 LZW algorithm 1 21 PPT/BB
20.10.2022 Audio: Linear predictive coding (LPC),
22 1 22 PPT/BB
Perceptual coding, masking techniques
psychoacoustic model, MEG audio
23 AN 1 23 PPT/BB
layers I,II,III,
Dolby AC3 - Speech: Channel vocoder,
24 1 24 PPT/BB
linear predictive coding
Image and Video Formats – GIF, TIFF,
25 1 25 PPT/BB
SIF, CIF, QCIF
Image compression: READ,
26 21.10.2022 FN 1 26 PPT/BB
JPEG
Video Compression: Principles-I,B,P
27 1 27 PPT/BB
frames

28 21.10.2022 AN motion estimation, motion compensation 1 28 PPT/BB


29 H.261, MPEG standard, 1 29 PPT/BB
Standards-based and nonstandard PPT/BB
30 1 30
approaches to coding.
22.10.2022 FN Assessment for 100 Marks 33
Text / Reference Books

1. R Bose, “Information Theory, Coding and Cryptography”, TMH 2007.


2.Fred Halsall, “Multidedia Communications: Applications, Networks, Protocols and Standards”,
Perason Education Asia, 2002.
Website / URL References
1 https://www.youtube.com/watch?v=Uk9zFrEGguM
2 https://lecturenotes.in/subject/540/information-theory-coding-itc

Name & Sign of Faculty In-charge:

Mrs. P. Merlin Viji Mrs. J. V. Jincy Joy


Assistant Professor / ECE Assistant Professor / ECE

COURSE COORDINATOR HEAD OF THE DEPARTMENT

DEPARTMENT ELECTRONICS AND COMMUNICATION ENGINEERING


STUDENTS REGISTRATION LIST
Course Code &Title: CTTECE - CODING THEORY AND TECHNIQUES
Academic Year: 2022- 2023 Duration: 17th Oct ’22 – 22nd Oct ’22 Year/Sem: I / 01 & II / 03
S.No. Name of the Student Register Number Signature

1. ASHMI C 962922403001

2. FEMILA K 962922403002

3. JEVELIN MASIHA MALAR K 962922403003

4. KASTHURI S 962922403004

5. NAJMA A 962922403005

6. SABA M 962922403006

7. AMISHA ROJA V 962921403001

8. ARATHI P 962921403002

9. ASHMILA NAVIN Y 962921403003

10. GOLDEN HARSHIYA T T 962921403004

11. MERFEENA C V 962921403006

12. NIBISHAA N 962921403007

13. PRIYA DHARSINI M V 962921403008

14. SHAMINI S 962921403009

15. SHANUBHA MARI JERO A 962921403010

16. VAISHNAVI R 962921403011

COURSE COORDINATOR HEAD OF THE DEPARTMENT


DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
ATTENDANCE SHEET
Course Code &Title: CTTECE - CODING THEORY AND TECHNIQUES
Academic Year: 2022- 2023 Duration: 17th Oct ’22 – 22nd Oct ’22 Year/Sem: I / 01 & II / 03
ATTENDANCE SHEET (FN Session – 3 Hours & AN Session– 3 Hours)
17-10-22 18-10-22 19-10-22 20-10-22 21-10-22 22-10-22
Sl.No. Name of the Register
Student Number FN AN FN AN FN AN FN AN FN AN FN
P
1. ASHMI C 962922403001 P P P P P P P P P P

2. FEMILA K 962922403002 P P P P P P P P P A P
JEVELIN MASIHA
3. MALAR K
962922403003 P P P P P P A A P P P

4. KASTHURI S 962922403004 P P P P P A P A P P P

5. NAJMA A 962922403005 P P P P P P P P P P P

6. SABA M 962922403006 P P P P P P P P P P P

7. AMISHA ROJA V 962921403001 P P P P P P P P P A P

8. ARATHI P 962921403002 P P P P P P A A P P P

9. ASHMILA NAVIN Y 962921403003 P P P P P A P A P P P


GOLDEN HARSHIYA T
10. T
962921403004 P P P P P P P P P P P

11. MERFEENA C V 962921403006 P P P P P P P P P P P

12. NIBISHAA N 962921403007 P P P P P P P P P P P

13. PRIYA DHARSINI M V 962921403008 P P P P P P A A P P P

14. SHAMINI S 962921403009 P P P P P A P A P P P


SHANUBHA MARI
15. JERO A
962921403010 P P P P P P P P P P P

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING


ATTENDANCE SHEET
Course Code &Title: CTTECE - CODING THEORY AND TECHNIQUES
Academic Year: 2022- 2023 Duration: 17th Oct ’22 – 22nd Oct ’22 Year/Sem: I / 01 & II / 03
ATTENDANCE SHEET (FN Session – 3 Hours & AN Session– 3 Hours)
Sl.No. Name of the Register
Student Number 17-10-22 18-10-22 19-10-22 20-10-22 21-10-22 22-10-22
FN AN FN AN FN AN FN AN FN AN FN
16. VAISHNAVI R 962921403011 P P P P P P P P P P P

COURSE COORDINATOR HEAD OF THE DEPARTMENT

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING


Course Code &Title: CTTECE - CODING THEORY AND TECHNIQUES
Academic Year: 2022- 2023 Duration: 17th Oct ’22 – 22nd Oct ’22 Year/Sem: I / 01 & II / 03
ASSESSMENT TEST
1. A parity check code can
a) a.detect a single bit error
b) b.correct a single bit error
c) c.detect two-bit error
d) d.correct two-bit error

2. The coding efficiency is given by


a) 1 + Redundancy
b) 1- Redundancy
c) 1/Redundancy
d) none

3. The efficiency of the Huffman code is linearly proportional to


a) average length of code
b) maximum length of code
c) average entropy
A. none

4. The Hamming distance between the words 100101101 and 0110110010 is


a) 4
b) 5
c) 6
d) 7

5. The minimum distance of a code dictionary is 10. The code is capable of


a) four-error correction
b) four-error correction plus five-error detection
c) three-error correction plus four-error detection
d) five-error correction plus six-error detection

6. The total number of words in a single error-correction code dictionary of word length 15 is
a) 1023
b) 1024
c) 2047
d) 2048

7. Which of the following cannot be a member of the matrix P?


a) 011
b) 101
c) 010
d) 111

8. The generator polynomial of a (7, 4) cyclic code is g(x)= 1 + x + x3. The code word for the message 1010 will
be
a) 1110010
b) 1100010
c) 1011001
d) 0111001

Q.9. In a convolutional code encoder with a six-stage shift register, the number of modulo-2 adders is 4. For an
input data stream of 5 bits, the code-word size will be
a) 120
b) 54
c) 50
d) 44

10. Let there be 11 messages to be transmitted. Huffman coding procedure is applied for M = 5. The number of
terms to be combined in the first reduction is
a) 2
b) 3
c) 4
d) 5
11. In a single error-correcting Hamming code, the number of message bits in a block is 26. The number of check
bits in the block would be
a) 3
b) 4
c) 5
d) 7

12. Consider a binary digital communication system with equally likely 0’s and 1 ‘s. When a binary 0 is
transmitted, the detector input can lie between the levels – 0.25 V and + 0.25 V with equal probability. When
binary 1 is transmitted, the voltage at the detector can have any value between 0 and 1 V with equal probability. If
the detector has a threshold of 0.2 V (i.e., if the received signal is greater than 0.2 V, the bit is taken as 1), the
average bit error probability is
a) 0.15
b) 0.2
c) 0.05
d) 0.5

13. Which one of the following statements is correct? Shannon’s channel capacity formula indicates that in theory
a) by using proper channel codes, we can get an error-free transmission on a noisy channel
b) it is not possible to get an error-free transmission on a noisy channel, since there will always be
some error in the detected signal for finite noise on any channel
c) it is true only for some wired channels and not wireless channels
d) it works only for analog signals and not for digital signals on any channel

14. Which one of the following is correct?


a) Coding reduces the noise in the signal
b) Coding deliberately introduces redundancy into messages
c) Coding increases the information rate
d) Coding increases the channel bandwidth

15. For fixed symbol rate, increase in bits/symbol ultimately improves rb/B bits/s/Hz & hence, regarded as
_____.
a) Power efficiency
b) Spectral efficiency
c) Transmission efficiency
d) Modulation eficiency

16) For designing a communication system, which among the following parameters should be maximum?
1. Transmission rate
2. Received signal-to-noise ratio
3. Error probability
4. Bandwidth requirement
a) A & B
b) C & D
c) A & C
d) B & D

17) For designing trellis code, the emphasis must be on maximizing __________
a) Euclidean distance between code vectors
b) Hamming distance of error correcting codes
c) Both a and b
d) None of the above

18) The distance between each symbol in given sequence and reference sequence is known as _______.
a) Euclidean Distance
b) Distance between sequences
c) Manmattan Distance
d) Hamming Distance

19) To obtain the transfer function of a convolutional code, the splitting of all-zero state takes place
into ___
A. starting state
B. first return to all-zero state
C. in-between state
a) A & B
b) B & C
c) A & C
d) None of the above

20) Which decoding method involves the evaluation by means of Fano Algorithm?
a) Maximum Likelihood Decoding
b) Sequential Decoding
c) Both a and b
d) None of the above

21. For the 4 states of an encoder on vertical axis of Trellis diagram, what do/does the solid line indicate/s?
a) '0' input
b) '1' input
c) Both a and b
d) None of the above

22) In Trellis diagram, what do/does the horizontal axis represent/s?


a) Continuous time
b) Discrete time
c) Sampled time
d) All of the above

23) In Minimum Distance Separable (MDS) codes, the minimum distance is one more than the number of
_________.
a) Information bits
b) Symbol bits
c) Parity check bits
d) None of the above

24) If the errors are corrected at _______end/s, it is known as 'Forward Error Correction' (FEC).
a) Transmitter
b) Receiver
c) Both a and b
d) None of the above

25) In register contents at decoder, the syndrome register consists of syndrome after all bits of received vector
are clocked into the decoder ________.
a) Input
b) Output
c) Both a and b
d) None of the above

26) For designing of (4,1) cyclic repetition code, what would be the order of the generator polynomial g(x)?
a) 1
b) 3
c) 4
d) 5

27) In decoding of cyclic code, which among the following is also regarded as 'Syndrome Polynomial'?
a) Generator Polynomial
b) Received code word Polynomial
c) Quotient Polynomial
d) Remainder Polynomial

28) While decoding the cyclic code, if the received code word is similar as transmitted code word, then r(x) mod
g(x) is equal to _________
a) Zero
b) Unity
c) Infinity
d) None of the above

29) What is the value of leading coefficient of a monic polynomial?


a) 0.5
b) 1
c) 4
d) 16

30) According to linearity property, the ________ of two code words in a cyclic code is also a valid code word.
a) sum
b) difference
c) product
d) division

31) The minimum distance of linear block code (dmin) is equal to minimum number of rows or columns of HT,
whose _____ is equal to zero vector.
a) sum
b) difference
c) product
d) divison

32) Basically, Galois field consists of ______ number of elements.


a) Finite
b) Infinite
c) Both a and b
d) None of the above

33) In a linear code, the minimum Hamming distance between any two code words is ______minimum weight of
any non-zero code word.
a) Less than
b) Greater than
c) Equal to
d) None of the above

34) Which among the following represents the code in which codewords consists of message bits and parity bits
separately?
a) Block Codes
b) Systematic Codes
c) Code Rate
d) Hamming Distance

35) Which among the following is/are the essential condition/s for a good error control coding technique?
a) Faster coding & decoding methods
b) Better error correcting capability
c) Maximum transfer of information in bits/sec
d) All of the above

36) According to Shannon's second theorem, it is not feasible to transmit information over the channel with
______error probability, although by using any coding technique.
a) small
b) large
c) stable
d) unpredictable

37) If the channel is bandlimited to 6 kHz & signal to noise ratio is 16, what would be the capacity of channel?
a) 15.15 kbps
b) 24.74 kbps
c) 30.12 kbps
d) 52.18 kbps

38) In channel coding theorem, channel capacity decides the _________permissible rate at which error free
transmission is possible.
a) Maximum
b) Minimum
c) Constant
d) None of the above

39) In digital communication system, smaller the code rate, _________are the redundant bits.
a) less
b) more
c) equal
d) unpredictable

40) Which type of channel does not represent any correlation between input and output symbols?
a) Noiseless Channel
b) Lossless Channel
c) Useless Channel
d) Deterministic Channel

41) In dictionary techniques for data compaction, which approach of building dictionary is used for the prior
knowledge of probability of the frequently occurring patterns?
a) Static Dictionary
b) Adaptive Dictionary
c) Both a and b
d) None of the above

42) Which bitmap file format/s support/s the Run Length Encoding (RLE)?
a) TIFF
b) BMP
c) PCX
d) All of the above

43) Huffman coding technique is adopted for constructing the source code with ________ redundancy.
a) Maximum
b) Constant
c) Minimum
d) Unpredictable
44) Which coding terminology deals with the inverse operation of assigned words of second language
corresponding to the words in the first language?
a) Enciphering
b) Deciphering
c) Codeword
d) Codebook

45) In discrete memoryless source, the current letter produced by a source is statistically independent of _____
a) Past output
b) Future output
c) Both a and b
d) None of the above

46) In Viterbi's algorithm, the selected paths are regarded as __________


a) survivors
b) defenders
c) destroyers
d) carriers

47) In Viterbi's algorithm, which metric is adopted for decision making?


a. Hamming distance
b. Galois Field
c. Hamming bound
d. Parity-check

48) During the shifting of bits in an encoder, how are the transitions in the states represented?
a. By lines
b. By circles
c. By summers
d. By squares

49) While representing the convolutional code by (n,k,m), what does 'm' signify or represent in it?
a. Coded bits
b. Message bits
c. Memory order
d. All of the above

50) At any given time, the output of an encoder depends on ______


a. Past input
b. Present input
c. Both a and b
d. None of the above

COURSE COORDINATOR HEAD OF THE DEPARTMENT


DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
ASSESMENT MARK STATEMENT
Course Code &Title: CTTECE - CODING THEORY AND TECHNIQUES
Academic Year: 2022- 2023 Duration: 17th Oct ’22 – 22nd Oct ’22 Year/Sem: I / 01 & II / 03
S.No. Name of the Student REGISTER NO MARKS OUT ATTENDANCE IN
OF 100 PERCENTAGE
1. ASHMI C 962922403001 90 97

2. FEMILA K 962922403002 90 94

3. JEVELIN MASIHA MALAR K 962922403003 90 94

4. KASTHURI S 962922403004 92 100

5. NAJMA A 962922403005 92 100

6. SABA M 962922403006 90 97

7. AMISHA ROJA V 962921403001 86 94

8. ARATHI P 962921403002 90 97

9. ASHMILA NAVIN Y 962921403003 92 100

10. GOLDEN HARSHIYA T T 962921403004 92 100

11. MERFEENA C V 962921403006 90 97

12. NIBISHAA N 962921403007 86 97

13. PRIYA DHARSINI M V 962921403008 90 94

14. SHAMINI S 962921403009 92 100

15. SHANUBHA MARI JERO A 962921403010 92 100

16. VAISHNAVI R 962921403011 90 94


COURSE COORDINATOR HEAD OF DEPARTMENT

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING


FEEDBACK FORM
Course Code &Title: CTTECE - CODING THEORY AND TECHNIQUES
Academic Year: 2022- 2023 Duration: 17th Oct ’22 – 22nd Oct ’22 Year/Sem: I / 01 & II / 03
Please complete the following evaluation for the Add on Course you attended. Your feedback will help us
evaluate the effectiveness of this program and allow us to make improvements in the future program. Your
feedback is important for planning future programming and services we offer.
Thank you.

1=Strongly Agree 2=Agree 3=Disagree 4=Strongly Disagree

Circle your response


1. The course met my expectations. 4 3 2 1
2. The content was helpful. 4 3 2 1
3. The level of the course was appropriate. 4 3 2 1
4. The speaker had a good understanding of the topics. 4 3 2 1
5. The handouts were helpful. 4 3 2 1
6. The course was worth my time. 4 3 2 1
7. The length of the course was appropriate. 4 3 2 1
8. I recommend that the course be repeated for other 4 3 2 1
Students.
What were the most useful aspects of the course?
What changes should be made to enhance / improve the game?
Additional comments:

Name of the participant: Signature:


DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
SUMMARY REPORT WITH COURSE OUTCOME
Course Code &Title: CTTECE - CODING THEORY AND TECHNIQUES
Academic Year: 2022- 2023 Duration: 17th Oct ’22 – 22nd Oct ’22 Year/Sem: I / 01 & II / 03
Name of Activity organized : Value Added Course
Title of the activity : CTTECE - CODING THEORY AND
TECHNIQUES
Coordinators : 1. Mrs. P. Merlin Viji,
Assistant Professor / EEE
2. Mrs. J V. Jincy Joy,
Assistant Professor / EEE

Place of the activity : VCCE - Chunkankadai

No. of participants : 16

No of participants completed : 16

No. of participants qualified : 16

Name of the sponsored organization : NIL


: llustrated source and channel coding
Outcome of the activity techniques for error-free transmission
of Understood message over a noisy
communication channel.
Make use of linear and cyclic block
codes for the performance analysis of
error Understand detection and correction
in terms of efficiency.

COURSE COORDINATOR HEAD OF DEPARTMENT

You might also like