What I don't understand about this algorithm-:
What is the diffeence between w and w cap?
What is the meaning of extremals?
What does it means to reject p-r superfluous potential...
$\begingroup$
$\endgroup$
3
-
$\begingroup$ hm, that involves solving systems of equations with many unknowns, which is why it's a numerical algorithm and not something you do by hand. What kind of example do you hope for, and how would it differ from the text that you just posted? $\endgroup$– Marcus MüllerCommented Aug 3, 2021 at 15:17
-
$\begingroup$ Ah sorry, I don't need an example. I edited the post. I just need the explanation of few questions I had above. My teacher has also told me to memorize this algorithm and write in exam. $\endgroup$– achhainsanCommented Aug 3, 2021 at 15:20
-
$\begingroup$ OK; so re: 2. "extremals" are.. extremals, there's a wikipedia article of "Extremal". Re: 3. Probably defined just half a page before. Re 1.: well, $\omega$ is a variable, and $\overset\frown\omega$ are specific values for $\omega$ as defined in the text you pasted. $\endgroup$– Marcus MüllerCommented Aug 3, 2021 at 15:22
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
Not sure if this helps or not: it's another explanation of the Remez algorithm specifically for the Parks-McClellan algorithm.
Answers to your explicit questions:
$\hat{\omega}_k$ are specific frequencies and $\omega$ is a variable.
The extremals are the peaks of the error function (called norm-points below).
For an optimal filter, you only need $r+1$ extremals. The algorithm you state will give more. It's saying to ignore the ones you don't need to find the answer.
