Skip to main content

Table 1 Energy consumed for N-point FFT vs.

From: Implementation of a reconfigurable ASIP for high throughput low power DFT/DCT/FIR engine

Algorithm

Radix-2

Radix-4

Radix-8

Number of butterflies

2

1

1

Number of stages

log2(N)

log4(N)

log8(N)

Number of butterflies

operations/stage

N 2

N 4

N 8

Number of clock

cycles/butterflies

1

1

2

Total number of clock

cycles for N -point FFT

N 4 log 2 ( N ) N 4 ( x )

N 4 log 4 ( N ) N 4 x 2

N 4 log 8 ( N ) ×2 N 4 x 3

Normalized power

2

3

7

Power efficiency

0.5 × N × x

0.375 × N × x

0.43 × N × x

As N = 2x

   
  1. Radix-r algorithms