Back to Results
First PageMeta Content
Integrated circuits / Placement / Place and route / Field-programmable gate array / Routing / Application-specific integrated circuit / Integrated circuit design / Matrix / Electronic engineering / Electronic design automation / Electronics


AUTOMATED PLACEMENT AND ROUTING OF CELL MATRIX CIRCUITS by Dimitri V. Yatsenko A thesis submitted in partial fulfillment of the requirements for the degree of
Add to Reading List

Document Date: 2003-12-24 14:37:00

Open Document

File Size: 380,78 KB

Share Result on Facebook

Company

Neural Networks / Self-Organizing Maps / /

Event

Product Issues / /

Facility

BIT ADDER CIRCUIT ENTERED USING THE CELL MATRIX ELEMENT LIBRARY / Science Utah State University / /

IndustryTerm

shortest-path algorithm / /

Organization

UTAH STATE UNIVERSITY / Donald Cooley Department / /

Person

DONALD H. COOLEY / Dimitri V. Yatsenko / Lee-Moore Maze Routing / THOMAS KENT / LISA DURBECK / NICHOLAS MACIAS / SCOTT CANNON / /

Position

Major / General / Professor / Major Professor / /

Product

CELL RATE / CELL POSITIONS / /

ProvinceOrState

Utah / /

Technology

A* shortest-path algorithm / 15 Automated Routing Algorithms / 9 Automated Placement Algorithms / LEE-MOORE ROUTER / Neural Network / PLACEMENT ALGORITHM / 11 Steinberg Algorithm / 28 Algorithm / A* ROUTER / /

SocialTag