DSPRelated.com
Forums

why we want to do folding while performing convolution

Started by sk July 18, 2006

Jerry Avins wrote:
> > Andor wrote: > > jim wrote: > >> Andor wrote: > >> > >>> That's true. But choosing the center of the kernel as zero-index can > >>> only be done for kernels of an odd size ... > >> Well, not really. If you limit your indexing capability to whole > >> integers then you are saddled with that limitation (in other words, if > >> you require your reference zero to land on a sample point only odd sized > >> kernels will be allowed). But there is no mathematical reason preventing > >> you from setting zero to half way between two samples. > > > > Interesting. Let's say you have a first order difference filter (two > > coefficients). How does a symmetric indexing scheme work with this > > filter? > > Not so hard if you allow me to ignore the distinction between an index > and an argument. (t - 1) and (t) become (t - 1/2) and (t + 1/2).
That's a distinction without a difference once you have plugged the index into a fornula. -jim ----== Posted via Newsfeeds.Com - Unlimited-Unrestricted-Secure Usenet News==---- http://www.newsfeeds.com The #1 Newsgroup Service in the World! 120,000+ Newsgroups ----= East and West-Coast Server Farms - Total Privacy via Encryption =----
jim wrote:
> > Jerry Avins wrote:
...
>> Not so hard if you allow me to ignore the distinction between an index >> and an argument. (t - 1) and (t) become (t - 1/2) and (t + 1/2). > > That's a distinction without a difference once you have plugged the > index into a fornula.
You mean if it quacks like a duck and all that? An index specifies a particular member of a sequence or array. An argument is something that can be plugged into a formula to compute a specific result. That's a distinction with a difference that is overlooked only with peril. Jerry -- Engineering is the art of making what you want from things you can get. �����������������������������������������������������������������������
Jerry Avins skrev:
> Andor wrote: > > jim wrote: > >> Andor wrote: > >> > >>> That's true. But choosing the center of the kernel as zero-index can > >>> only be done for kernels of an odd size ... > >> Well, not really. If you limit your indexing capability to whole > >> integers then you are saddled with that limitation (in other words, if > >> you require your reference zero to land on a sample point only odd sized > >> kernels will be allowed). But there is no mathematical reason preventing > >> you from setting zero to half way between two samples. > > > > Interesting. Let's say you have a first order difference filter (two > > coefficients). How does a symmetric indexing scheme work with this > > filter? > > Not so hard if you allow me to ignore the distinction between an index > and an argument. (t - 1) and (t) become (t - 1/2) and (t + 1/2).
A different way of saying this could be to say that the reference time t has to be on the form (2n-1)/2, for some integer n. Somehow I am more comfortable with fractional-sample-period delays, than fractional-sample indexes in the time series... Rune
Rune Allnor wrote:
> Jerry Avins skrev: >> Andor wrote: >>> jim wrote: >>>> Andor wrote: >>>> >>>>> That's true. But choosing the center of the kernel as zero-index can >>>>> only be done for kernels of an odd size ... >>>> Well, not really. If you limit your indexing capability to whole >>>> integers then you are saddled with that limitation (in other words, if >>>> you require your reference zero to land on a sample point only odd sized >>>> kernels will be allowed). But there is no mathematical reason preventing >>>> you from setting zero to half way between two samples. >>> Interesting. Let's say you have a first order difference filter (two >>> coefficients). How does a symmetric indexing scheme work with this >>> filter? >> Not so hard if you allow me to ignore the distinction between an index >> and an argument. (t - 1) and (t) become (t - 1/2) and (t + 1/2). > > A different way of saying this could be to say that the reference time > t > has to be on the form (2n-1)/2, for some integer n. Somehow I am more > comfortable with fractional-sample-period delays, than > fractional-sample > indexes in the time series...
An index is conceptually an integer, although the concept is a bit fictile. It may still be true that the average American family has 2.3 children, but it would be hard to interview the 1.5th. Fundamentally, one counts with indices and calculates with arguments. Jerry -- Engineering is the art of making what you want from things you can get. �����������������������������������������������������������������������

Jerry Avins wrote:

> > An index is conceptually an integer, although the concept is a bit > fictile. It may still be true that the average American family has 2.3 > children, but it would be hard to interview the 1.5th. Fundamentally, > one counts with indices and calculates with arguments.
Yes, but that is not really the problem. One can easily get around a restriction on how counting is done by proper scaling and shifting of the arguments contained in formulae that use indexing. Thus you could if you want even impose a restriction that all counting start with some arbitrary number (e.g. zero) and progress in a positive direction with integer intervals. But that isn't the problem here. The problem is I gave a real frequency response for a filter and Andor gave a complex one. To convert from one to the other requires multiplying by a linear phase term, but in this case the particular linear phase term is verboten. The linear phase term contains a fractional argument which is not allowed and thus you can not get to here from there. -jim ----== Posted via Newsfeeds.Com - Unlimited-Unrestricted-Secure Usenet News==---- http://www.newsfeeds.com The #1 Newsgroup Service in the World! 120,000+ Newsgroups ----= East and West-Coast Server Farms - Total Privacy via Encryption =----