Divide and Conquer

Divide and Conquer

• Compute an n-point DFT using one or more n/2-point DFTs
• Need to find Terms involving w2 in following polynomial
• P(w)=p0+p1w+p2w2+p3w3+p4w4+ ... +pn-1wn-1

Here They Are

Previous slide

Next slide

Back to the first slide

View Graphic Version