Koroteyeva T. Models and algorithms of VLSI hierarchic routing with decomposition two and three-dimensional space.

Українська версія

Thesis for the degree of Candidate of Sciences (CSc)

State registration number

0403U000716

Applicant for

Specialization

  • 05.13.12 - Системи автоматизації проектувальних робіт

07-02-2003

Specialized Academic Board

Д 35.052.05

Lviv Polytechnic National University

Essay

The thesis is dedicated to strategies, models and algorithms to solve a routing problem of VLSI in two and three-dimensional space. The methods to increase an efficiency of VLSI macrorouting procedures are investigated and improved. The strategies to define a wave source, decomposition of search space for common results, forming of the chain fragments are realized. The system for FPGA routing in two and three-dimensional space is developed.

Files

Similar theses