ECL333 - Ktu Qbank
ECL333 - Ktu Qbank
ECL333 - Ktu Qbank
Preamble:
The following experiments are designed to make the student do real time DSP
• computing.
Prerequisites:
• ECT 303 Digital Signal Processing
Assessment Pattern
Mark Distribution:
Attribute Mark
Attendance 15
Continuous assessment 30
Internal Test (Immediately before 30
the second series test)
Attribute Mark
Preliminary work 15
Implementing the work/ 10
Conducting the experiment
Performance, result and inference 25
(usage of equipments and trouble
shooting)
Viva voce 20
Record 5
CO1-Simulation of Signals
2. Write a C function to connect the analog input port to the output port and test with
a microphone.
1. Write a function to compute the linear convolution and download to the hardware
target and test with some signals.
CO5-FFT Computation
1. Write and download a function to compute N point FFT to the DSP hardware
target and test it on real time signal.
2. Write a C function to compute IFFT with FFT function and test in on DSP
hardware.
1. Design and implement an FIR low pass filter for a cut off frequency of 0.1π and
test it with an AF signal generator.
List of Experiments
(All experiments are mandatory.)
1. Write a function that returns the N point DFT matrix VN for a given
N.
2. Plot its real and imaginary parts of VN as images using matshow or
imshow commands (in Python) for N = 16, N = 64 and N = 1024
3. Compute the DFTs of 16 point, 64 point and 1024 point random
sequences using the above matrices.
4. Observe the time of computations for N = 2γ for 2 γ 18≤(You
≤ may use
the time module in Python).
5. Use some iterations to plot the times of computation against γ. Plot
and understand this curve. Plot the times of computation for the fft
function over this curve and appreciate the computational saving
with FFT.
• Circular Convolution.
1. Write a python function circcon.py that returns the circular con-
voluton of an N1 point sequence and an N2 point sequence given at
the input. The easiest way is to convert a linear convolution into
circular convolution with N = max(N1, N2).
• Parseval’s Theorem
For the complex random sequences x1[n] and x2[n],
N −1 N −1
X 1 X
x1 [n]x∗2 [n] = X1 [k]X2∗ [k]
n=0
N k=0
ELECTRONICS & COMMUNICATION ENGINEERING
1. Familiarization of the code composer studio (in the case of TI hard- ware)
or Visual DSP (in the case of Analog Devices hardware) or any equivalent
cross compiler for DSP programming.
2. Familiarization of the analog and digital input and output ports of the DSP
board.
3. Generation and cross compilation and execution of the C code to con- nect
the input digital switches to the output LEDs.
4. Generation and cross compilation and execution of the C code to con- nect
the input analog port to the output. Connect a microphone, speak into it
and observe the output electrical signal on a DSO and store it.
5. Document the work.
2. The arrays may be kept in different files and downloaded to the DSP
hardware.
3. Store the result as a file and observe the output.
3. Apply the FFT on the input signal with appropriate window size and
observe the result.
4. Connect microphone to the analog port and read in real time speech.
1. Use the FFT function in the previous experiment to compute the IFFT of
the input signal.
2. Apply IFFT on the stored FFT values from the previous experiments and
observe the reconstruction.
3. Document the work.
5. Download the filter on to the DSP target board and test with 1 mV
sinusoid from a signal generator connected to the analog port.
2. Realize the system shown below for the input speech signal x[n].
3. Segment the signal values into blocks of length N = 2000. Pad the last
ELECTRONICS & COMMUNICATION ENGINEERING
2. Realize the system shown in the previous experiment for the input speech
signal x[n].
3. Segment the signal values into blocks of length N = 2000. Pad the last
block with zeros, if necessary.
Textbooks