[Author Prev][Author Next][Thread Prev][Thread Next][Author Index][Thread Index]
gEDA-user: Trace length
- To: geda-user@xxxxxxxx
- Subject: gEDA-user: Trace length
- From: David Carr <dc@xxxxxxxxx>
- Date: Sun, 14 May 2006 17:21:21 -0500
- Delivered-to: archiver@seul.org
- Delivered-to: geda-user-outgoing@seul.org
- Delivered-to: geda-user@seul.org
- Delivery-date: Sun, 14 May 2006 18:21:33 -0400
- Reply-to: geda-user@xxxxxxxx
- Sender: owner-geda-user@xxxxxxxx
- User-agent: Mail/News 1.5 (X11/20060309)
I saw a thread back in January where the topic of calculating trace
length came up. I'm getting started on a design with a PC133 memory
interface and it might be useful to be able calculate the trace lengths
in order to get them all the same. I believe that I saw that Larry
Dolittle had done some work toward this end, did anything come of it?
It seems to me that the basic idea is to add up the length of all the
traces connecting two points. It is a bit more complicated though when
nets are not merely point to point or the endpoints of lines are
perfectly overlapping.
-DC