Fig. 23From: Canonic FFT flow graphs for real-valued even/odd symmetric inputs a The original odd size P-point FFT whose inputs have the pattern of x P [k]=x P [P−1−k]. b Compute the shifted FFT, \(n_{0}=\frac {P-1}{2}Q\). c The final P-point RFFT whose inputs are even symmetricBack to article page