Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

# Computation Of Interline Spacing Distribution

IP.com Disclosure Number: IPCOM000048020D
Original Publication Date: 1983-Aug-01
Included in the Prior Art Database: 2005-Feb-08
Document File: 1 page(s) / 11K

IBM

## Related People

Heath, DC: AUTHOR [+4]

## Abstract

Described is a method for computing the spacing distribution between adjacent conductors in a printed circuit plane. First, a table describing each wiring segment ("bracket") is created. The spacing distribution is calculated for one wiring plane at a time. On each plane all brackets are parallel and begin and end at integer coordinates. Choosing the "X" axis parallel to the brackets allows three integers to describe each bracket: an "x" coordinate for each end and a single "y" coordinate. For bracket I let these be denoted XB(I), XE(I), and Y(I).

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

Page 1 of 1

Computation Of Interline Spacing Distribution

Described is a method for computing the spacing distribution between adjacent conductors in a printed circuit plane. First, a table describing each wiring segment ("bracket") is created. The spacing distribution is calculated for one wiring plane at a time. On each plane all brackets are parallel and begin and end at integer coordinates. Choosing the "X" axis parallel to the brackets allows three integers to describe each bracket: an "x" coordinate for each end and a single "y" coordinate. For bracket I let these be denoted XB(I), XE(I), and Y(I).

The brackets are sorted so that the y coordinates are in increasing order, and then proceeds as follows: Let DEPTH(I) = l0000000 for I-l,2,...to the maximal x-co-

ordinate.

Let ITALLY(J) = 0 for J-l,2,...to the maximal possible spacing.

For each bracket (say bracket I):

For each J between XB(I) and XE(I):

Let SPACE = Y(I) - DEPTH(J).

If SPACE > 0, then let ITALLY(SPACE)=

ITALLY(SPACE) + l.

Let DEPTH(J) = Y(I).

Note: ITALLY(SPACE) now contains the length of center-to- center spacing of width SPACE.

The edge-to-edge spacing is calculated by subtracting the line width for the center-to-center spacing.

Anonymous

1