Question: Describe a version of the FFT that works when n is a power of 3 by dividing the input vector into three subvectors, recursing on
Describe a version of the FFT that works when n is a power of 3 by dividing the input vector into three subvectors, recursing on each one, and then merging the subproblem solutions. Derive a recurrence equation for the running time of this algorithm and solve this recurrence using the Master Theorem.
Step by Step Solution
3.40 Rating (162 Votes )
There are 3 Steps involved in it
This version of the FFT works by dividing the input vector into three subvectors recursing on ... View full answer
Get step-by-step solutions from verified subject matter experts
