0% found this document useful (0 votes)
5 views2 pages

CSC311 Tutorial Questions

The document outlines various topics related to Digital Signal Processing (DSP), including signal classification, Fourier transforms, convolution, signal multiplication, and properties of signals. It also discusses the relationship between input and output in linear shift-invariant systems, the Nyquist-Shannon sampling theorem, and issues related to Analog-to-Digital Conversion (ADC). Additionally, it covers signal representation in time and frequency domains, bandwidth, and amplitude modulation.

Uploaded by

darakayowa
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
0% found this document useful (0 votes)
5 views2 pages

CSC311 Tutorial Questions

The document outlines various topics related to Digital Signal Processing (DSP), including signal classification, Fourier transforms, convolution, signal multiplication, and properties of signals. It also discusses the relationship between input and output in linear shift-invariant systems, the Nyquist-Shannon sampling theorem, and issues related to Analog-to-Digital Conversion (ADC). Additionally, it covers signal representation in time and frequency domains, bandwidth, and amplitude modulation.

Uploaded by

darakayowa
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

1. Present a labelled chart to show classification of signals.

2. “There is no version of the Fourier transform that uses finite length signals. Sine and cosine waves
are defined as extending from -∞ to +∞. However, one cannot use a group of infinitely long signals
to synthesize something finite in length”. Present one way to get around this dilemma in Digital
Signal Processing

3. Given a periodic signal f(x) such that for any integer n, n = 1, 2, 3,...Show that f (x + np) = f (x).
4. What is convolution in Digital Signal Processing?

5. What is Signal Multiplication in Digital Signal Processing?

6. Give relevant expressions to support your points where necessary, discuss the most common
signal processing operations and explain some of the elementary operations performed in Digital
Signal Processing.

7. If z-transform is the DTFT of an exponentially weighted sequence, then, give a z-transform


expression to show this relationship.

8. What are signals? Describe 4 types of signals.

9. Show that for the signal ,

10. Give the first 4 partial sums of the Fourier series of f(x)

11. In a tabular form show the different Categories of Fourier Transforms along with their signal
examples.

12. In simple mathematical notations, denote the unit sample, the unit step, and the exponential signal
sequences.

13. Explain the following:


Signal representation in the time domain;
Signal representation in the frequency domain.

Page 1 of 2
14. Reproduce Figure 1.0 and give appropriate values for Label1-5.

Figure 1.0. Discreet Signal Domains

15. Give an expression to show the relationship between the input to a linear shift-invariant system,
x(n), and the output, y(n).

16. List and explain two properties of signal convolution.


17. Given that the Discrete-Time Fourier Transform (DTFT) of a sequence x(n) is equal to:

18. State the Nyquist-Shannon sampling theorem .

19. What is Frequency response?

20. How much resolution can you obtain in the frequency response?

21. What will you do if given an input signal and impulse response, and need to find the resulting output
signal?

22. Discuss two of the properties of Fourier Transform

23. Describe the T, F and Z domains of signals

24. Describe 2 problems associated with ADC

25. Draw the block diagram of this signal: y[n]=a1y[n−1]+a2y[n−2]+b0x[n] + c0x[n].

26. Describe amplitude modulation of signals

27. Present your understanding of Bandwidth.

Page 2 of 2

You might also like