1. A method for discrete Fourier transform (DFT) processing of a selected number P of data values using a prime factor algorithm, where P has a plurality of relatively prime factors F i , comprising: storing P data values in a memory; receiving successive groups of K data values from said memory for DFT processing; processing data values in groups of a selected number K by a K-point DFT process according a prime factor algorithm having F i prime factors, for M consecutive iterations, one for each factor F i , such that KF i and P/F i groups of data values are processed for each iteration, while aligning the K-points of the DFT processing according to symmetrical twiddle factor sets; and receiving a reduced number of twiddle factor sets from said memory by eliminating redundant twiddle factor sets that are symmetrical to the received twiddle factor sets.