Patent US4689441A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4689441A Expired / Lapsed US ⏱️ 0.0 years remaining

Routing method and pattern for reducing cross talk noise problems on printed interconnection boards

Assignee: International Business Machines Corp
•
Filing: 1985-04-05
•
Granted: 1987-08-25
•
Expires: 2005-04-05
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract In printed circuit boards having dense printed connections, cross talk noise immunity is significantly improved by preferentially routing adjacent to one another serially connected conductors of the same net rather than conductors of different nets. By such routing inter-net cross talk is reduced while the resultant intra-net cross talk is maintained at tolerable levels.

Inventors

  • 👤 Carroll J. Dick
  • 👤 Ralph Linsker
  • 👤 Roger S. Rutter
  • 👤 David L. Thomas

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-01 20:26
CPC Classifications
H; H05; H05K; H05K1/00; H05K1/02; H05K1/0213; H05K1/0216; H05K1/0228; H05K2201/00; H05K2201/09; H05K2201/09209; H05K2201/09218; H05K2201/09236; H05K2201/09254

Claims Analysis

Total Claims: 22
Claim 1
Independent Claim 129 words
In a circuit disposed on or within a wiring media and including a plurality of nets adjacently routed for adjacency lengths exceeding an inter-net adjacency routing limit thereby subjecting said plurality of nets to cross-talk inducing signals, anyone net of said nets having at least a first end point, an intermediate point, a second end point, a first conductor of said net interconnecting said first end point to said intermediate point, and a second conductor of said net interconecting said intermediate point to said second end point the improvement comprising a wiring pattern for reducing inter-net cross talk wherein said first and second conductors of said net are adjacently routed to one another for an adjacency length that does not exceed an intra-net adjacency routing limit for said net.
Claim 2
Dependent Claim 129 words
In a circuit disposed on or within a wiring media and including a plurality of nets adjacently routed for adjacency lengths exceeding an inter-net adjacency routing limit thereby subjecting said plurality of nets to cross-talk inducing signals, anyone net of said nets having at least a first end point, an intermediate point, a second end point, a first conductor of said net interconnecting said first end point to said intermediate point, and a second conductor of said net interconecting said intermediate point to said second end point the improvement comprising a wiring pattern for reducing inter-net cross talk wherein said first and second conductors of said net are adjacently routed to one another for an adjacency length that does not exceed an intra-net adjacency routing limit for said net.
Claim 3
Dependent Claim 24 words
The improved wiring pattern as defined in claim 1 wherein said routing is dimensioned to accomodate both cross talk minimization and propagation time requirements.
Claim 4
Dependent Claim 68 words
The improved wiring pattern as defined in claim 1 wherein said adjacent routing is such that cross talk has the same polarity as, and an amplitude lower than the active, cross talk-inducing signal, and wherein said cross talk leads said active signal by a time equal to twice the time required for said active signal to propagate the distance said first and second conductors run adjacent one another.
Claim 5
Dependent Claim 68 words
The improved wiring pattern as defined in claim 2 wherein said adjacent routing is such that cross talk has the same polarity as, and an amplitude lower than the active, cross talk-inducing signal, and wherein said cross talk leads said active signal by a time equal to twice the time required for said active signal to propagate the distance said first and second conductors run adjacent one another.
Claim 6
Dependent Claim 44 words
The improved wiring pattern as defined in claim 4 wherein said adjacent routing is such that cross talk constitutes a displacement in time of said active signal equal to or less than the transition time required for said active signal to change logic states.
Claim 7
Dependent Claim 28 words
The improved wiring pattern as defined in claim 1 wherein said first and second conductors are routed in immediately adjacent parallel wiring tracks of a single wiring channel.
Claim 8
Dependent Claim 28 words
The improved wiring pattern as defined in claim 2 wherein said first and second conductors are routed in immediately adjacent parallel wiring tracks of a single wiring channel.
Claim 9
Dependent Claim 35 words
The improved wiring pattern as defined in claim 1 wherein said adjacent routing of said first and second conductors is configured to replace inter-net cross talk with intra-net cross talk without substantially reducing wiring density.
Claim 10
Dependent Claim 35 words
The improved wiring pattern as defined in claim 2 wherein said adjacent routing of said first and second conductors is configured to replace inter-net cross talk with intra-net cross talk without substantially reducing wiring density.
Claim 11
Dependent Claim 50 words
A printed circuit board which includes a plurality of cross talk sensitive nets having a topology which includes the routing of conductors of the same net rather than those of different nets in channels of said board, where greater density can be achieved without violating intra-net adjacency routing length limits.
Claim 12
Dependent Claim 50 words
A printed circuit board which includes a plurality of cross talk sensitive nets having a topology which includes the routing of conductors of the same net rather than those of different nets in channels of said board, where greater density can be achieved without violating intra-net adjacency routing length limits.
Claim 13
Dependent Claim 18 words
The board as defined in claim 10 in which said conductors are serially interconnected at an intermediate pin.
Claim 14
Dependent Claim 110 words
In the method of constructing a circuit which includes at least two nets, one for carrying a signal having the potential of inducing excessive cross talk in the other and wherein at least one of said nets comprises a first end point, an intermediate point, a second end point, a first conductor of said net interconnecting said first end point to said intermediate point, and a second conductor of said net interconnecting said intermediate point with said second end point the improvement comprising: routing said first and second conductors to run adjacent one another for an adjacency length that does not exceed an intra-net adjacency routing limit in said net.
Claim 15
Dependent Claim 110 words
In the method of constructing a circuit which includes at least two nets, one for carrying a signal having the potential of inducing excessive cross talk in the other and wherein at least one of said nets comprises a first end point, an intermediate point, a second end point, a first conductor of said net interconnecting said first end point to said intermediate point, and a second conductor of said net interconnecting said intermediate point with said second end point the improvement comprising: routing said first and second conductors to run adjacent one another for an adjacency length that does not exceed an intra-net adjacency routing limit in said net.
Claim 16
Dependent Claim 72 words
A method as defined in claim 12 wherein said first and second conductors are routed adjacent to one another a distance D such that the induced cross talk has the same polarity as, and an amplitude lower than the active, cross talk-inducing, signal in said first and second conductors, and leads said active signal by a time equal to twice the time required for said active signal to propagate said distance D.
Claim 17
Dependent Claim 37 words
A method as defined in claim 12 wherein the step of routing said first and second conductors to run adjacent to one another comprises routing them in immediately adjacent parallel wiring tracks of a single wiring channel.
Claim 18
Dependent Claim 98 words
In the process of computing the topology of printed conductor patterns for interconnecting components in a plurality of nets on a substrate wherein said nets each include first and second conductors interconnected at a common intermediate point and wherein conductor layout is determined according to rules related to component location, spatial parameters, propagation time, stability, radiation, heat, noise and cross talk, the improvement comprising including among said process-controlling rules, for the purposes of minimizing cross talk, the preferred routing adjacent one another of said first and second conductors of a common net rather than conductors from different nets.
Claim 19
Dependent Claim 98 words
In the process of computing the topology of printed conductor patterns for interconnecting components in a plurality of nets on a substrate wherein said nets each include first and second conductors interconnected at a common intermediate point and wherein conductor layout is determined according to rules related to component location, spatial parameters, propagation time, stability, radiation, heat, noise and cross talk, the improvement comprising including among said process-controlling rules, for the purposes of minimizing cross talk, the preferred routing adjacent one another of said first and second conductors of a common net rather than conductors from different nets.
Claim 20
Dependent Claim 29 words
The process according to claim 15 wherein the computer layout comprises the routing of said adjacent conductors substantially in parallel in a channel bordered by pins of said components.
Claim 21
Dependent Claim 27 words
The process according to claim 15 in which one of said conductors connected to said common intermediate point is initially active while the other is initially quiet.
Claim 22
Dependent Claim 27 words
The process according to claim 16 in which one of said conductors connected to said common intermediate point is initially active while the other is initially quiet.

References Cited (Backward Citations)

US3631300A Cited
US4489364A Cited
US4571451A Cited
JPH115893A Cited
JPH111098A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1990-08-24 1991-02-23 1991-08-25 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1994-08-24 1995-02-23 1995-08-25 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1998-08-24 1999-02-23 1999-08-25 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag