[SI-LIST] : RE:

Benny Lima (bennylima@ami.com)
Wed, 14 Apr 1999 16:25:52 -0400

It better if we knew he was using quad!

Then its embedded in the topspec...

---Benny

=A0=A0=A0 ^=A0=A0=A0=A0=A0 Benny Lima=20
=A0 /___\=A0=A0=A0 Junior Hardware Engineer=20
=A0 ^=A0=A0=A0=A0 ^=A0 Ph: =
770-326-9160=A0=A0=A0=A0=A0=A0=A0=A0=A0=A0=A0 Mail: 6145-f northbelt =
parkway=20
/___\ /___\Fax: =
770-246-8765=A0=A0=A0=A0=A0=A0=A0=A0=A0=A0=A0=A0=A0=A0=A0=A0 Norcross, =
GA 33071=20
=A0=A0=A0=A0=A0=A0=A0=A0=A0=A0 Web: www.ami.com =
<http://www.ami.com/>
=A0=A0=A0=A0=A0=A0=A0=A0=A0=A0 Email: BennyLima@ami.com =
<mailto:BennyLima@ami.com> =20

=A0

=A0

-----Original Message-----
From: Stephen Peters [mailto:sjpeters@ichips.intel.com]
Sent: Wednesday, April 14, 1999 3:33 PM
To: si-list@silab.eng.sun.com
Subject:=20

Otto Benning wrote:

> Hi
>=20
> I am using IBIS 3.0 and the question is=20
>=20
> I am trying to model the circuit board traces of a memory board
> how do I model forks in side of forks
> example
>=20
> Fork=20
> Len =3D 20
> Fork=20
> Len =3D30
> Endfork
>=20
> or=20
> are they just separate forks, no matter how many times the traces
> has forks in it.
>=20
> example
> fork
> Len =3D 20
> Endfork
> Fork
> Len =3D 30
> Endfork
>=20

The first example describes a trace (of Len=3D20) that branches (forks) =
from
some unspecified main trace, then a trace (of Len=3D30) that forks from =
the=20
previous fork:

main trace -------------------+------------------------
|
|
Len=3D20 at this point +-------------------- (Len=3D30)
|
|

The second example describes two forks (one of Len=3D20, the other =
Len=3D30)
that branch from the same point on an again unspecified main trace -- =
in
other words, a 'Y' or 'V' type structure. =20

The general algorithm for producing this kind of tree diagram (there is =
some
formal name for this style of topological description but I can't think =
of
it off hand) is:
1. Start walking down a path
2. If a branch (fork) is encountered, then branch from this main path.
3. Walk down the branch until a matching endfork is encountered.
4. Return to the main path at the point at which the fork occurred and
continue
tracing the main path.

Of course, while is step 3, step 2 can be called recursively. I hope =
this
helps.

Regards,
Stephen Peters
Intel Corp.

**** To unsubscribe from si-list: send e-mail to
majordomo@silab.eng.sun.com. In the BODY of message put: UNSUBSCRIBE
si-list, for more help, put HELP. si-list archives are accessible at
http://www.qsl.net/wb6tpu/si-list ****

**** To unsubscribe from si-list: send e-mail to majordomo@silab.eng.sun.com. In the BODY of message put: UNSUBSCRIBE si-list, for more help, put HELP. si-list archives are accessible at http://www.qsl.net/wb6tpu/si-list ****