Enrol to start learning
Reading is open to everyone. Enrolling is free, and it is what unlocks the audio lessons, practice tests and progress tracking.
13.13. Example 4: Discrete-Time Convolution
This section
Practice test
10 questions on this section. Wrong answers show you what to read again.
Sign up to take itWhole chapter
Revision test
Mixed questions from across the chapter. Your answers get marked.
Sign up to take itQuick
Flashcard drill
2 cards from this lesson. Good the night before a test.
Try these first
- 1.
Calculate (f ∗ g)[0] if f[n] = {2, 0} and g[n] = {1, 1}.
Hint
Look at the first elements of both sequences.
- 2.
What is the value of (f ∗ g)[1] if f[n] = {1, 2} and g[n] = {1, 1}?
Hint
Sum the products of overlapping indices.
- 3.
What is the convolution of f[n] = {1, 2, 1} and g[n] = {1, 1} at n=0?
- 2
- 1
- 3
- 0
Hint
Check the first elements of both sequences.
- 4.
True or False: The result of (f ∗ g)[0] will always equal f[0]*g[0] in discrete convolution.
- True
- False
Hint
Remember the basic definition of convolution at the start.
- 5.
Given f[n] = {2, 1} and g[n] = {1, 3}, find (f ∗ g)[n] for all indices.
Hint
Add contributions for each n index.
- 6.
In a digital system, how does the outcome of (f ∗ g)[2] change if g[n] has a delay? Provide a scenario.
Hint
Think about how delays affect signal timing.
Exercises
Total Questions
2
Estimated Time
4 min
Passing Score
70%
Instructions
- Read each question carefully
- You can use hints if you need help
- Complete all questions before submitting
4 more questions available
Enrol freeQuiz
Total Questions
2
Estimated Time
4 min
Passing Score
70%
Instructions
- Read each question carefully
- You can use hints if you need help
- Complete all questions before submitting
Get your answers marked and your progress tracked
Enrol freeChallenge Problems
Total Questions
2
Estimated Time
4 min
Passing Score
70%
Instructions
- Read each question carefully
- You can use hints if you need help
- Complete all questions before submitting