Browse Prior Art Database

Algorithm for Printed Wiring Evaluation

IP.com Disclosure Number: IPCOM000074830D
Original Publication Date: 1971-Jun-01
Included in the Prior Art Database: 2005-Feb-23
Document File: 2 page(s) / 13K

Publishing Venue

IBM

Related People

Poch, LJ: AUTHOR [+2]

Abstract

This algorithm analyzes the wiring problem of a printed circuit board package design to estimate the number of overflow wires that will be required to manufacture the package. Overflow wires are those discrete wire connections that, due to wiring density, cannot be embedded as printed wire connections. The number of predicted overflow wires is used to evaluate the wireability of the package design.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 54% of the total text.

Page 1 of 2

Algorithm for Printed Wiring Evaluation

This algorithm analyzes the wiring problem of a printed circuit board package design to estimate the number of overflow wires that will be required to manufacture the package. Overflow wires are those discrete wire connections that, due to wiring density, cannot be embedded as printed wire connections. The number of predicted overflow wires is used to evaluate the wireability of the package design.

The carrier and the physical layout of the components must be described. This is accomplished by establishing a two-dimensional grid pattern overlaying the carrier surface. The grid pattern must be such that the component leads fall on the grid coordinates. Each set of electrically common component leads are assigned a net number.

Wiring density must be established to determine the capacity of vertical and horizontal wiring paths on the surfaces of the carrier. This determines the maximum number of printed wire connections crossing any boundary defined by a straight line across the surface of the carrier. All printed wiring is assumed to be embedded vertically and/ or horizontally on the carrier surface. The physical design, net list, and component names and locations are the input items required for the algorithm.

The number of.overflow wires is determined by the following procedure.

1) Establish and name horizontal and vertical boundaries between each row and column of components. 2) Address and extract from each net the following data:

a. horizontal line length

b. vertical line length

c. total connection length

d. the horizontal boundaries cross...