@inproceedings{4a9f16ef1c3549608e103dc6d23976e3,
title = "Parallel power-of-two FFTs on hypercubes",
abstract = "Theoretical analysis of ordered power-of-two fast Fourier transforms (PO2FFTs) demonstrates that the most efficient algorithms for hypercube architectures may not always use nearest-neighbor communication. It is shown that an ordered PO2FFT can be obtained with just d interprocessor communications for any r if the restriction that all communications are distance one is removed. The two interprocessor communications requirements of this algorithm are determined. Packets of size N/2d+1 are transmitted in both of the ordered PO2FFT algorithms. The time complexity of both the distance one and the distance two algorithms is discussed.",
author = "Woo, {Mahn ling} and Rosemary Renaut",
year = "1991",
doi = "10.1145/125826.126178",
language = "English (US)",
isbn = "0818621583",
series = "Proc Supercomput 91",
publisher = "Publ by IEEE",
pages = "754--763",
booktitle = "Proc Supercomput 91",
note = "Proceedings of Supercomputing '91 ; Conference date: 18-11-1991 Through 22-11-1991",
}