Ken P.
AVID Technologies, Inc.
>> It would be quite painful to describe these sort of toplogies by =
hand. It=20
>> should be left upto a simulator that can read the PCB database =
and
>> generate=20
>> the topology automatically. The one that can do this easily is=20
>> XTK(www.viewlogic.com)
>> Syed.
>> Cisco Systems, Inc
>> > X-SMAP-Received-From: outside
>> > To: [email protected]
>> > Mime-Version: 1.0
>> > Date: Wed, 14 Apr 1999 12:32:45 -0700
>> > From: Stephen Peters <[email protected]>
>> >=20
>> >=20
>> > Otto Benning wrote:
>> >=20
>> > > 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
>> >=20
>> > The first example describes a trace (of Len=3D20) that branches =
(forks)
>> from=20
>> some unspecified main trace, then a trace (of Len=3D30) that =
forks from the=20
>> > previous fork:
>> >=20
>> >=20
>> > main trace -------------------+------------------------
>> > |
>> > |
>> > Len=3D20 at this point +-------------------- =
(Len=3D30)
>> > |
>> > |
>> >=20
>> >=20
>> > The second example describes two forks (one of Len=3D20, the =
other
>> Len=3D30)=20
>> that branch from the same point on an again unspecified main =
trace -- in
>> other=20
>> words, a 'Y' or 'V' type structure. =20
>> >=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=20
>> 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=20
>> continue
>> > tracing the main path.
>> >=20
>> > Of course, while is step 3, step 2 can be called recursively. =
I hope
>> this
>> > helps.
>> >=20
>> > Regards,
>> > Stephen Peters
>> > Intel Corp.
>> >=20
>> >=20
>> >=20
>> > **** To unsubscribe from si-list: send e-mail to
>> [email protected].=20
>> In the BODY of message put: UNSUBSCRIBE si-list, for more help, =
put HELP.=20
>> =20
>> si-list archives are accessible at =
http://www.qsl.net/wb6tpu/si-list ****
>> >=20
>> **** To unsubscribe from si-list: send e-mail to
>> [email protected]. 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 [email protected]. 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 ****