Page 1 of 1
2. Let x[n] e C be a length N = 27 sequence. (a) How many complex floating point multiplies are required to com- pute th
Posted: Fri Apr 29, 2022 8:55 am
by answerhappygod
- 2 Let X N E C Be A Length N 27 Sequence A How Many Complex Floating Point Multiplies Are Required To Com Pute Th 1 (45.45 KiB) Viewed 25 times
2. Let x[n] e C be a length N = 27 sequence. (a) How many complex floating point multiplies are required to com- pute the 27 point DFT? (10 points) (b) What is the formula for the radix-3 FFT of x[n]? (10 points) (c) How many complex floating point multiplies are required to com- pute the 27 point radix-3 FFT? (10 points) (d) If we allow N = 32 by zero padding x[n], what is the formula ] the for 32 point radix-2 FFT? (10 points) (e) How many complex floating point multiplies are required to com- pute the 32 point radix-2 FFT? (10 points) =