Assertion: algorithm | /r/CapableOf | break down a dft of any composite size
Facets:
value: into many smaller dfts of sizes
type: OTHER
value: recursively
type: MANNER
Source sentences:
text: This is a divide and conquer algorithm that recursively breaks down a DFT of any composite size N = N 1 N 2 into many smaller DFTs of sizes N 1 and N 2 , along with O(N) multiplications by complex roots of unity traditionally called twiddle factors (after Gentleman and Sande, 1966).