Please use this identifier to cite or link to this item:
Degree Level: Mestrado
Title: Traçado completo de rotas em planos de dimenções não Pre-fixadas
Author: Liesenberg, Hans Kurt Edmund, 1953-
Advisor: Machado, Nelson Castro, 1941-
Abstract: Resumo: Não informado

Abstract: This paper presents a routing algorithm for printed circuit boards whose input is a description of the relative position of the components instead of the specific location of each component. Using two-layer boards with non-fixed dimensions the algorithm always defines all the desired connections. It is al so able to accept any component whose pins are on the boundary of a rectangle. The algorithm is non-cellular the connections are stablished macroscopically on a grid with a small number of rows and columns, where each component corresponds to an intersection. This approach yields great savings in memory space and computing time. The spacing between components is initially assumed unlimited, capable of supporting any number of connections. The actual number of connections in the macroscopic cells is determined by the algorithm and only then the final location of each component is established thus defining the dimensions of the board
Subject: Circuitos impressos
Placas de expansão (Microcomputadores)
Language: Português
Editor: [s.n.]
Citation: LIESENBERG, Hans Kurt Edmund. Traçado completo de rotas em planos de dimenções não Pre-fixadas. 1980. 144f. Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Ciencia da Computação, Campinas, SP. Disponível em: <>. Acesso em: 15 jul. 2018.
Date Issue: 1980
Appears in Collections:IMECC - Tese e Dissertação

Files in This Item:
File SizeFormat 
Liesenberg_HansKurtEdmund_M.pdf3.2 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.