Recurrence Relation for Alpha beta filter

Click For Summary
The alpha beta filter equation is expressed as Xni = AXn + BXn-1, where Xn-1 is the subscript. The discussion centers on whether this equation qualifies as a recurrence relation, with the conclusion that it does not. It is noted that the alpha beta filter grows polynomially, while there is uncertainty about the growth rate of exponential smoothing filters. The participants clarify that the alpha beta filter is classified as a first-order equation. Overall, the conversation emphasizes the distinction between the growth behaviors of alpha beta filters and exponential smoothing filters.
SpartanG345
Messages
69
Reaction score
1
The alpha beta filter equation is given by this

Xni = AXn + BXn-1

Xn-1 is subscript

i want to figure the solution to this recurrence relation, but is it a recurrence relation?

i am wondering weather alpha beta filters grow faster than exponential smoothing filters.- i said it is a 1st order equation

where Xn = C1 (B/1-A)^n so alpha beta filtering grow polynomial
But i am not quite sure to find the grow rate of the exponential filtering equation
 
Last edited:
Physics news on Phys.org
sorry this is wrong, the alpha beta filter equation is not a recurrence relation..
 

Similar threads

  • · Replies 30 ·
2
Replies
30
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
Replies
3
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
1
Views
2K
Replies
18
Views
4K
  • · Replies 7 ·
Replies
7
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 12 ·
Replies
12
Views
4K