\documentstyle[10pt]{cmu-art}
\begin{document}

\title{
Computational Aspects of the Pipelined Phase-Rotation FFT\\
{\em (Technical Paper for Supercomputing '93)}
}

\author{
\begin{tabular}{c c}
 Langhorne P. Withers, Jr., John E. Whelchel 
& David R. O'Hallaron, Peter J. Lieu \\ 
\\
{E-Systems, Inc., Melpar Div.} & {School of Computer Science}\\
{7700 Arlington Boulevard}     & {Carnegie Mellon University}\\     
{Falls Church, VA 22046}       & {5000 Forbes Ave, Pittsburgh, PA 15213}\\
\end{tabular}
\\ \\
Presenting Author:\\ 
David R. O'Hallaron\\ \\ \\
Corresponding Author:\\ 
David R. O'Hallaron\\ 
School of Computer Science\\
Carnegie Mellon University\\
5000 Forbes Avenue\\
Pittsburgh, PA 15213\\ \\
phone: (412) 268-8199\\
fax: (412) 681-5739\\
email: ohallaron@cs.cmu.edu\\ 
}

\date{}
\maketitle

\begin{abstract}
The phase-rotation FFT has a simple, constant-geometry,
parallel-pipeline architecture.  This paper considers computational
aspects of implementing the FFT on a parallel computer system.
Shuffle address and twiddle recipes, described directly in terms of
the pipeline, are provided, and a recent full-bandwidth implementation
on the iWarp parallel computer system is described.  A new,
parallel-pipeline equivalent of the index-reversing shuffle is added
to complete the original phase-rotation FFT design.
\end{abstract}

\end{document}