AT2 = O(N log4 N), T = O(log N) fast Fourier transform in a light connected 3-dimensional VLSI

Authors:
M. Hasegawa;Y. Shigei
Affiliations:
-;-
Venue:
ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
Year:
1986

Citing 4
Cited 1

An Adaptation of the Fast Fourier Transform for Parallel Processing

Journal of the ACM (JACM)
High-speed top-of-stack scheme for VLSI processor: a management algorithm and its analysis

ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
Introduction to VLSI Systems

Introduction to VLSI Systems
Architecture of the PSC-a programmable systolic chip

ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture

A template matching algorithm using optically-connected 3-D VLSI architecture

ISCA '87 Proceedings of the 14th annual international symposium on Computer architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

We can perform a N-point FFT with time performance T=&Ogr;(log N) and area-time performance AT2=&Ogr;(N log4 N), by using the 3-dimensional VLSI system which is optically interconnected. This performance exceeds the theoretical lower bound of the area-time performance (N2 log2 N) of the conventional VLSI.