Re: About FIR filters
- From: "Randy Yates" <yates@xxxxxxxx>
- Date: 5 Oct 2005 06:40:26 -0700
> Thanks Randy. I am sorry that I sent this message to your private address by
> mistake, by clicking on a wrong button.
> I am going through your paper. In fact I have just to write one or two
> sentences about it in a report and I will be thankful if you could help me.
> Let's call the range (or ratio??) between smallest and largest number as R.
> Is there some technical term to refer to it?
Dynamic range (of the coefficients)? Other than that, I'm not familiar
with a term for this. Note that it is implied in this context that
the zero coefficients (if any) are excluded.
> From first few paragraphs of your paper I got an idea that hardware
> implementations of FIR filters use fixed point arithmetics, and therefore
> filters will smaller R can be implemented more accurately. Is this correct?
> Is there any other non-fixed point hardware implementation? What is it
> called in technical literature?
Floating-point. There is a standard floating point format from the IEEE
as IEEE 754.
> If it exists, then my understanding is that
> it would be with higher computational and memory requirements. Is this true?
At least higher computational requirements, yes.
> Are there some comparitive studies about implementations with different
> word-lengths? For example how does computational cost increase increase if
> we increase the word length from 8 to 16.
Can't help you there - not a big hardware guy. Although I could see
that in a bit-serial implementation (I think Ray Andraka has some
material on his web sight about that, http://www.andraka.com) the
hardware complexity would remain relatively constant but speed of
execution would slow for a longer wordlength.
- Prev by Date: Re: Patent on a novel DSP Algorithm?
- Next by Date: Re: OT: Some thoughts abouth thinking
- Previous by thread: Re: About FIR filters
- Next by thread: Re: About FIR filters