How Do You Solve a Discrete Convolution Sum with Step Functions?

Click For Summary

Discussion Overview

The discussion revolves around solving a discrete convolution sum involving step functions, specifically finding the convolution of two sequences defined by the unit step function. Participants explore the limits of summation and the implications of different values of the variable n.

Discussion Character

  • Homework-related
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant expresses confusion over the limits of the convolution sum and attempts to simplify the expression using a change of variables.
  • Another participant suggests that both step functions must be simultaneously equal to 1, leading to a consideration of different cases based on the value of n.
  • There is a discussion about whether n is a natural number or another integer, with one participant asserting that n must be smaller than -2 based on their calculations.
  • Participants explore the implications of different lower limits for the summation, particularly focusing on the maximum of -4 and n-2.
  • There is uncertainty regarding the assumption about n and its impact on the calculation of the convolution sum.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the assumptions regarding the value of n and its implications for the convolution sum. Multiple competing views remain regarding the limits of summation and the nature of n.

Contextual Notes

Limitations include unresolved assumptions about the nature of n, the dependence on definitions of the unit step function, and the implications of different cases for the limits of summation.

Xyius
Messages
501
Reaction score
4

Homework Statement


Find ##x[n] \ast h[n]## when ##x[n] = 3 u[2-n]## and ##h[n] = 4\left( \frac{1}{2} \right)^{n+2}u[n+4]## where ##u[n-k]## is the unit step function.

Homework Equations


None really

The Attempt at a Solution



So I know this is probably simple but I am confused.

So the convolution is written as,

\sum_{k=-\infty}^{\infty} 4\left( \frac{1}{2} \right)^{k+2}u[k+4](3)u[2-n+k]

This simplifies to,

3\sum_{k=-\infty}^{\infty} \left( \frac{1}{2} \right)^{k}u[k+4]u[2-n+k]

The first step function of ##u[k+4]## means that the terms in the sum corresponding to ## k < -4 ## are zero, therefore this becomes the bottom limit.

3\sum_{k=-4}^{\infty} \left( \frac{1}{2} \right)^{k}u[2-n+k]

This form is confusing to me. I don't see an obvious limit on k except for that its LOWER limit is ##n-2##. What I tried to do is do some change of variables, such as ##k'=2-n+k##, this changes the lower limit to -2-n and the upper limit to infinity. So I have...

3\sum_{k&#039;=-2-n}^{\infty} \left( \frac{1}{2} \right)^{k&#039;-2+n}u[k&#039;]

So this means that ##k'## must be larger than zero, which means ## n < -2##. So in this regime, the step function is 1 and I get..

3\sum_{k&#039;=0}^{\infty} \left( \frac{1}{2} \right)^{k&#039;-2+n}=3\left( \frac{1}{2} \right)^{n-1}

Am I doing this correctly? I am just not sure. Thank you in advance for anyone that takes the time to read this!
 
Physics news on Phys.org
Xyius said:

Homework Statement


Find ##x[n] \ast h[n]## when ##x[n] = 3 u[2-n]## and ##h[n] = 4\left( \frac{1}{2} \right)^{n+2}u[n+4]## where ##u[n-k]## is the unit step function.

Homework Equations


None really

The Attempt at a Solution



So I know this is probably simple but I am confused.

So the convolution is written as,

\sum_{k=-\infty}^{\infty} 4\left( \frac{1}{2} \right)^{k+2}u[k+4](3)u[2-n+k]

This simplifies to,

3\sum_{k=-\infty}^{\infty} \left( \frac{1}{2} \right)^{k}u[k+4]u[2-n+k]

The first step function of ##u[k+4]## means that the terms in the sum corresponding to ## k < -4 ## are zero, therefore this becomes the bottom limit.

3\sum_{k=-4}^{\infty} \left( \frac{1}{2} \right)^{k}u[2-n+k]

This form is confusing to me. I don't see an obvious limit on k except for that its LOWER limit is ##n-2##. What I tried to do is do some change of variables, such as ##k'=2-n+k##, this changes the lower limit to -2-n and the upper limit to infinity. So I have...

3\sum_{k&#039;=-2-n}^{\infty} \left( \frac{1}{2} \right)^{k&#039;-2+n}u[k&#039;]

So this means that ##k'## must be larger than zero, which means ## n < -2##. So in this regime, the step function is 1 and I get..

3\sum_{k&#039;=0}^{\infty} \left( \frac{1}{2} \right)^{k&#039;-2+n}=3\left( \frac{1}{2} \right)^{n-1}

Am I doing this correctly? I am just not sure. Thank you in advance for anyone that takes the time to read this!

I don't see how the substitution is any improvement. Since both step functions have to be simultaneously ##1## I get:
3\sum_{k=max\{-4, n-2\}}^{\infty} \left( \frac{1}{2} \right)^{k}
which leaves you two cases. Is ##n## a natural number or another integer?
 
fresh_42 said:
I don't see how the substitution is any improvement. Since both step functions have to be simultaneously ##1## I get:
3\sum_{k=max\{-4, n-2\}}^{\infty} \left( \frac{1}{2} \right)^{k}
which leaves you two cases. Is ##n## a natural number or another integer?

##n## is an integer. And I believe must be smaller than -2 from what I showed here. So that would mean the max value in the lower limit should be -4? Then I could just expand out until k=0 and use a geometric sum.
 
Xyius said:
##n## is an integer. And I believe must be smaller than -2 from what I showed here. So that would mean the max value in the lower limit should be -4? Then I could just expand out until k=0 and use a geometric sum.
Yes. Except that I'm not certain about your assumption on ##n##. But that will only give you a factor depending on ##n##. If you can calculate it for ##k = -4## you should as well be able to calculate it for ##k=n-2## regardless what ##n## is.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 21 ·
Replies
21
Views
2K
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K