Clark D. Thompson

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-82-105
September 1982

http://www2.eecs.berkeley.edu/Pubs/TechRpts/1982/CSD-82-105.pdf

One of the difficulties of VLSI design is the magnitude of the task. It is not easy to lay out one hundred thousand transistors, let alone ten million of them. Yet there is a sense in which the scale of VLSI is advantageous. The complexity of a VLSI chip is so great that asymptotic approximation can give insight into performance evaluation and design. This paper shows how asymptotic analysis can aid in the design of Fourier transform circuits in VLSI.

BibTeX citation:

@techreport{Thompson:CSD-82-105,
    Author = {Thompson, Clark D.},
    Title = {Fourier Transforms in VLSI},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1982},
    Month = {Sep},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1982/6354.html},
    Number = {UCB/CSD-82-105},
    Abstract = {One of the difficulties of VLSI design is the magnitude of the task.  It is not easy to lay out one hundred thousand transistors, let alone ten million of them. Yet there is a sense in which the scale of VLSI is advantageous. The complexity of a VLSI chip is so great that asymptotic approximation can give insight into performance evaluation and design. This paper shows how asymptotic analysis can aid in the design of Fourier transform circuits in VLSI.}
}

EndNote citation:

%0 Report
%A Thompson, Clark D.
%T Fourier Transforms in VLSI
%I EECS Department, University of California, Berkeley
%D 1982
%@ UCB/CSD-82-105
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1982/6354.html
%F Thompson:CSD-82-105