Question: Repeat problem 6.25 for the DIF case. Develop a radix-3 decimation-in-time FFT algorithm for N = 3' and draw the corresponding flow graph for N

Repeat problem 6.25 for the DIF case.

Develop a radix-3 decimation-in-time FFT algorithm for N = 3' and draw the corresponding flow graph for N = 9. What is the number of required complex multiplication? Can the operation be performed in place? 

Step by Step Solution

3.35 Rating (158 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

The number of required complex multiplication is 28 The oper... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

31-E-T-E-D-S-P (798).docx

120 KBs Word File

Students Have Also Explored These Related Telecommunication Engineering Questions!