The mesh of trees architecture for parallel computation

This thesis considers the mesh of trees architecture as both a special-purpose and a general-purpose parallel computer. A family of special-purpose VLSI architectures for computing an ($n\sb1 \times n\sb2 \times \cdots \times n\sb{d}$)-point multidimensional DFT over $\doubz\sb{M}$, the ring of integers modulo $M$, is proposed. Using the two-dimensional mesh of trees as a component, these architectures achieve optimal VLSI area $A$ = $\Theta((N\sp2\log\sp{2}M)/T\sp2)$ for any given computation time T ε ($\Omega(\log N),O(\sqrt{N\log M})\rbrack.$

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Electrical and Computer Engineering

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Hornick, Scot W.

• Engineering, Electronics and Electrical
• Computer Science

Statement dc:rights

• Copyright 1989 Hornick, Scot Wayne

Language dc:language

eng

Identifier

AAI8924842
(UMI)AAI8924842

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/23253