A tight layout of the butterfly network
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Some compact layouts of the butterfly
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
VLSI layout and packaging of butterfly networks
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Layout area of the hypercube: (extended abstract)
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient VLSI Layouts of Hypercubic Networks
FRONTIERS '99 Proceedings of the The 7th Symposium on the Frontiers of Massively Parallel Computation
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Multilayer VLSI Layout for Interconnection Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
On the Bisection Width and Expansion of Butterfly Networks
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Efficient low-degree interconnection networks for parallel processing: topologies, algorithms, vlsi layouts, and fault tolerance
New area-time lower bounds for the multidimensional DFT
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
New area-time lower bounds for the multidimensional DFT
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
| Hi-index | 0.00 |
In this paper, we show that N-point fast Fourier transform (FFT) circuits with throughput 1 (i.e., time 1 after pipelining) can be optimally laid out with area N2/(4⌊ L2/2 ⌋) + o(N2/L2) under the multilayer 2-D grid model, where only one active layer (for network nodes) is required and L layers of wires are available, 2 <e; L <e; o(*sqrt;[3]N). We further propose AT2L2 or 2 AT2 ⌊ L2/2 ⌋ as a new parameter for characterizing the area-time complexity for multilayer VLSI, and show that AT2L2 ο N2/2 for N-point Fourier transform.