Develop a radix-3 decimation-in-time FFT algorithm for N = 3v and draw the corresponding flow graph for

Question:

Develop a radix-3 decimation-in-time FFT algorithm for N = 3v and draw the corresponding flow graph for N = 9. What is the number of required complex multiplications? Can the operations be performed in place?
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Digital Signal Processing

ISBN: ?978-0133737622

3rd Edition

Authors: Jonh G. Proakis, Dimitris G.Manolakis

Question Posted: