Scribd
Upload
7 views3 pages

Bec503 Simp

Uploaded by

chandanachandu94122
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views3 pages

Bec503 Simp

Uploaded by

chandanachandu94122
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

TAKEITEASY ENGINEERS

BEC503 SIMP questions types- TIE

Note : if problem values are not given in the SIMP, that means you need to practice
similar questions by considering values yourself based on the question

Module 1

1. Define the Hilbert transform and list its properties.

2. Determine the pre-envelope and complex envelope of the signal x(t)=

3. Explain the geometric representation of signals and demonstrate how the energy is
equivalent to the squared length of the vector representation.

4. Using the Gram-Schmidt orthogonalization procedure, find a set of orthonormal basic


functions to represent the three signals s1(t),s2(t) and s3(t) shown in figure. Also
express each of these signals in terms of the set of basis functions. Describe the
correlation receiver and matched filter receiver with neat block diagrams and
derivations.

5. Explain the canonical and polar representations of bandpass signals and their
relationship to Cartesian representations.

6. Discuss the conversion of a continuous AWGN channel into a vector channel.


7. Derive the Maximum Likelihood (ML) decoding rule for coherent detection.

Module 2

1. Define Binary Phase Shift Keying (BPSK) and derive its probability of error.

2. Explain the generation and detection of Quadrature Phase Shift Keying (QPSK) with
signal space representation.
TAKEITEASY ENGINEERS

3. Describe M-ary PSK and M-ary QAM modulation techniques, highlighting their
generation and error probabilities.

4. Compare coherent and non-coherent detection methods for BFSK, including error
probability analysis.

5. Illustrate the block diagrams for BFSK generation and detection using coherent
detection.

6. Derive the error probability for DPSK signals transmitted over a noisy channel.

7. Discuss the advantages and limitations of Differential Phase Shift Keying (DPSK).

8. Calculate carrier power requirements for a binary data transmission system with
specified error probability constraints.

Module 3

1. Define entropy, self-information, rate of information, and channel capacity.

2. Compute the entropy of a source with alphabet and probabilities

P=
3. Derive and state the Source Coding Theorem and Channel Coding Theorem.

4. Explain Huffman coding and compute the efficiency for a given source alphabet.

5. Analyze a binary symmetric channel and calculate the mutual information and
information transmission rate.

6. Discuss the information capacity law and its practical implications.

7. Construct second-order sources and verify entropy relationships.

Module 4

1. Design a linear block code with a minimum distance of 3 and message length of 4
bits.

2. Explain the properties and encoding methods for cyclic codes.

3. Derive the generator and parity-check matrices for a (6,3) linear block code and
compute possible codewords.

4. Develop a systematic encoder for a (7,4) cyclic code with a given generator
polynomial.

5. Compute the syndrome for a received vector in a cyclic code.


TAKEITEASY ENGINEERS

6. Discuss syndrome decoding and its role in error correction.

7. Illustrate the encoding and decoding process using Hamming codes.

8. Explain the minimum distance considerations in error control coding.

Module 5

1. Draw and explain the convolutional encoder diagram for a system with code rate
r=1/3 and constraint length K=3

2. Develop a state diagram and trellis graph for a given convolutional encoder.

3. Trace the path through the state diagram for a specified message sequence and
compute the output code.

4. Describe the Viterbi algorithm for decoding convolutional codes and outline the step-
by-step procedure.
5. Compute the decoded sequence using the Viterbi algorithm for a given received
sequence.
6. Compare systematic and non-systematic convolutional codes with examples.

7. Explain recursive systematic convolutional codes and their applications.

8. Illustrate maximum likelihood decoding for convolutional codes with relevant


examples.

You might also like