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

PHSDL Packaging High Structure Design Language

IP.com Disclosure Number: IPCOM000123056D
Original Publication Date: 1998-Apr-01
Included in the Prior Art Database: 2005-Apr-04
Document File: 4 page(s) / 136K

Publishing Venue

IBM

Related People

Harrer, H: AUTHOR [+3]

Abstract

1. Summary PHSDL (Packaging High Structure Design Language) is a front end language for Logic Design in Higher Level Packaging, like Multi-Chip Modules, Cards and Boards. It enables compact description of logic connections, net and component attributes. Using its ability to define regular structures abstractly reduces the lines of code for the design, gives more flexibility and enhances the clearness of the design. Because of the level of abstraction dozens of buses with the same regularity can be defined in a single statement. The same can be achieved for any other type of signal structure like control- and clock- signals. For instance the complete logic connection of one S/390 Multi-Chip-Module with 14000 nets was described in 1000 lines of PHSDL-code.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 40% of the total text.

PHSDL Packaging High Structure Design Language

      1.  Summary

PHSDL (Packaging High Structure Design Language) is a front end
language for Logic Design in Higher Level Packaging, like Multi-Chip
Modules, Cards and  Boards.  It enables compact description of logic
connections, net and component attributes.  Using its ability to
define regular structures abstractly reduces the lines of code for
the design, gives more flexibility and enhances the clearness of the
design.  Because of the level of abstraction dozens of buses with the
same regularity can be defined in a single statement.  The same can
be achieved for any other type of signal structure like control- and
clock- signals.  For instance  the complete logic connection of one
S/390 Multi-Chip-Module with 14000 nets was described in 1000 lines
of PHSDL-code.

2.  Methodology

PHSDL source files consists of two parts.  The component-definition-
and the logic-connection part.  In the first part the component names
and their attributes are defined as directed graphs.  Because of
attribute-hierarchy subattributes can also be defined.  The second
part is a compressed net-list of logic connections (net-groups).
Again the logic connections are defined as directed graphs.  Data
like signal-name, name of components connected by the net and the
corres- ponding signal-name on the level of the connected components,
are generated by solving the graphs.  Language elements which defines
how the graph has to be solved can be included in the PHSDL
statements.

      The main elements of the language are "Bundle" {.,.,.,},
"Depen- dent-Bundle" {$Number:.,.,.,} and "String" xyz.  A "Bundle"
is used to define a group of sub-elements which are separated by
commas.  These subelements can be of any kind of the main elements
above (recursive approach of the language).  While solving the graph
for data generation the comma in the "Bundle" is an OR-operator.
That means that during a run through the graph only the element (n)
in the "Bundle" is used to complete the data.  For the next run
through the graph the element (n+1) in the "Bundle" will be used.
For two "Bundles" in sequence the combi- nation of each element of
the previous "Bundle" with each element of the next "Bundle" is used
for data generation.  For two Bundles in sequence with four elements
each => 16 combinations are generated.  "Dependent-Bundles" are
language elements which controls the run through the graph.  A
"Dependent-Bundle" is identified by a "Dependent- Bundle"-number
("$number").  "Dependent-Bundles" with the same $-number within a
net-group-definition have a dependency in terms of selecting
elements.  During a run through the graph ALL  "Dependent-Bundles"
with the same $-number switch synchronously to the element (n), for
the next run to element (n+1).  There is no combination of each
element with each element for "Dependent-Bundles" in sequence with
the SAME $-number.  For two Dependent-Bundles in seq...