Re: AFT (Arithmetic Fourier Transform)
- From: emeb <ebrombaugh@xxxxxxxxx>
- Date: Wed, 16 Jan 2008 11:40:05 -0800 (PST)
On Jan 16, 9:22 am, Vladimir Vassilevsky <antispam_bo...@xxxxxxxxxxx>
wrote:
Can you please suggest a good reading about the Arithmetic Fourier
Transform?
I searched through Google and the local university library; couldn't
find much of information.
Vladimir Vassilevsky
DSP and Mixed Signal Design Consultanthttp://www.abvolt.com
Interesting - I'd never heard of that one before. This appears to be
based on some math that's been around since the early 1900's and has
been rehashed in a lot of papers. Unfortunately they're all firewalled
at sites that want $$ to give access. The only detailed description I
found was this:
http://www.ligo.caltech.edu/docs/G/G030522-00/G030522-00.ppt
The big advantage: needs O(n) operations and all coeffs/twiddles are
+/-1.0.
The disadvantage: Requires non-uniformly sampled input so you need
some sort of interpolator at the input, although there has been some
discussion of using zero-order hold instead.
If you manage to dig up anything useful on this I'd be curious to know
more.
EB
.
- References:
- AFT (Arithmetic Fourier Transform)
- From: Vladimir Vassilevsky
- AFT (Arithmetic Fourier Transform)
- Prev by Date: Re: Encounter a difficult timing recovery problem
- Next by Date: Re: SNR Question
- Previous by thread: AFT (Arithmetic Fourier Transform)
- Next by thread: Re: AFT (Arithmetic Fourier Transform)
- Index(es):
Relevant Pages
|