Area-Time Optimal VLSI Networks Based on the Cube-Connected-Cycles.

Abstract

This report presents designs for VLSI circuits computing Cyclic Shifts, Discrete Fourier Transforms, and Integer Multiplication, all based on a machine architecture, the Cube-Connected-Cycles CCC, introduced by the authors in (10). All of the designs match, to within a constant factor, the known theoretical lower bounds (3), (4), (8) for area X time sq products.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1980
Accession Number
ADA085751

Entities

People

  • Franco P. Preparata
  • Jean E. Vuillemin

Organizations

  • University of Illinois Urbana–Champaign

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Computational Complexity
  • Computations
  • Computer Science
  • Convolution
  • Discrete Fourier Transforms
  • Fabrication
  • Fast Fourier Transforms
  • Illinois
  • Lepidoptera
  • Parallel Computing
  • Parallel Processing
  • Sequences
  • Standards
  • Two Dimensional
  • United States
  • Very Large Scale Integration

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Integrated Circuit Design and Technology.
  • Linear Algebra