Prime Length Symmetric FFTS and Their Computer Implementations

Optimizing parallel reduction operations

“…Typically an index set is permuted and used to assemble the final values in the new order as in FFT algorithms [17]. The general analysis to prove uniqueness in the update of each element of the array is approachable by integer linear programming as discussed in [ll].…”