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

Rearrangeable switching network

Assignee: AT&T Inc
•
Filing: 1968-05-10
•
Granted: 1971-07-13
•
Expires: 1988-05-10
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Rearrangeable switching networks are disclosed employing various combinations of two-by-two cross-point switch modules, designated binary modules to signify the restriction on their operating capability to the interconnection of the two input terminals with the two output terminals in a maximum of two electrically conductive configurations, the networks comprising only the twoby-two cross-point binary modules.

Inventors

  • 👤 Amos E Joel Jr

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 19:50
CPC Classifications
H; H04; H04Q; H04Q3/00; H04Q3/0008; H04Q3/0012

Claims Analysis

Total Claims: 5
Claim 1
Independent Claim 170 words
A rearrangeable switching network having N input terminals and N output terminals, a plurality of binary cross-point modules included in square switches each having two input and two output leads for interconnecting said input and output terminals, said modules being arranged in sections in a nested tree configuration including at least a first section comprising a single stage selecting tree and a second section comprising two-stage superimposed trees, said superimposed trees comprising two modules in the first stage of said second section and two modules in the second stage of said second section, each output lead of each of said first stage modules being connected to an input lead of both of said second stage modules whereby each said first stage module defines a tree configuration with both said second stage modules, certain of said input terminals being directly connected to binary cross-point modules in each of said sections and each of said output terminals being connected to the binary cross-point modules in the last stage of the last section.
Claim 2
Dependent Claim 170 words
A rearrangeable switching network having N input terminals and N output terminals, a plurality of binary cross-point modules included in square switches each having two input and two output leads for interconnecting said input and output terminals, said modules being arranged in sections in a nested tree configuration including at least a first section comprising a single stage selecting tree and a second section comprising two-stage superimposed trees, said superimposed trees comprising two modules in the first stage of said second section and two modules in the second stage of said second section, each output lead of each of said first stage modules being connected to an input lead of both of said second stage modules whereby each said first stage module defines a tree configuration with both said second stage modules, certain of said input terminals being directly connected to binary cross-point modules in each of said sections and each of said output terminals being connected to the binary cross-point modules in the last stage of the last section.
Claim 3
Dependent Claim 26 words
A rearrangeable switching network in accordance with claim 1 further comprising a third section of said binary cross-point modules, said third section comprising three-stage superimposed trees.
Claim 4
Dependent Claim 37 words
A rearrangeable switching network in accordance with claim 2 wherein Each of said modules includes make and break contacts for interconnecting said input and output leads and single electromagnetic means for simultaneously energizing all of said contacts.
Claim 5
Dependent Claim 39 words
A rearrangeable switching network in accordance with claim 2 wherein each of said modules includes only make contacts for interconnecting said input and output leads and first and second electromagnetic means for simultaneously energizing all of said make contacts.

References Cited (Backward Citations)

US2864008A Cited
US3271523A Cited
FR1508191A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1974-07-12 1975-01-11 1975-07-13 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1978-07-12 1979-01-11 1979-07-13 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1982-07-12 1983-01-11 1983-07-13 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag