Connections layout in the n-directional metric spaces

Michał Rudowski

Abstract

At the dissertation, the model for connections layout for integrated circuits and electronics equipment packages is introduced and methods for connections definition in 2, 3, 4 and 6 directional metric spaces on one or more layers are presented. Software implementation of the methods and examples of application of these methods also are presented. Some properties of n-way metric spaces are presented and proven. Benefits of introducing greater number of directions for connection are estimated. Previously unknown properties of the minimal Steiner tree in n-directional metrics and the possibility of their usage by applying algorithms determine the connections layout proposed in the dissertation. These algorithms define the shortest routes network on the plane. It is shown that these properties can also be used to reduce length of network connections obtained by other methods.
Diploma typeDoctor of Philosophy
Author Michał Rudowski (FEIT / IN)
Michał Rudowski,,
- The Institute of Computer Science
Title in EnglishConnections layout in the n-directional metric spaces
Languagepl polski
Certifying UnitFaculty of Electonics (FEIT)
Start date25-09-1979
Defense Date14-01-1986
End date21-06-1983
Supervisor Jan Zabrodzki (FEIT / IN)
Jan Zabrodzki,,
- The Institute of Computer Science

Internal reviewers Antoni Kiliński (FEIT / IN)
Antoni Kiliński,,
- The Institute of Computer Science
External reviewers Jacek Bańkowski
Jacek Bańkowski,,
-
Pages147
Keywords in Englishconnections layout, n-directional metrics, metric space, connection network, Steiner problem, algorithm
Abstract in EnglishAt the dissertation, the model for connections layout for integrated circuits and electronics equipment packages is introduced and methods for connections definition in 2, 3, 4 and 6 directional metric spaces on one or more layers are presented. Software implementation of the methods and examples of application of these methods also are presented. Some properties of n-way metric spaces are presented and proven. Benefits of introducing greater number of directions for connection are estimated. Previously unknown properties of the minimal Steiner tree in n-directional metrics and the possibility of their usage by applying algorithms determine the connections layout proposed in the dissertation. These algorithms define the shortest routes network on the plane. It is shown that these properties can also be used to reduce length of network connections obtained by other methods.
KBN classificationInformatyka

Get link to the record

Back
Confirmation
Are you sure?