US3952162A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Time division digital switching network
Assignee: Individual
•
Filing: 1975-05-27
•
Granted: 1976-04-20
•
Expires: 1995-05-27
Abstract
Abstract A time division digital switching network comprises first multiplexing means in which first-order digital data channels transmitting words consisting of a given number of bits and having first rates which are different from but multiples of one another undergo a first multiplexing converting them into a second-order digital data channels having a second predetermined rate. Thereafter there are provided second multiplexing means in which the second-order digital channels undergo a second multiplexing converting them into third-order digital data channels having a third predetermined rate. In a digital switching unit having at least one buffer store, the first-order-channel words multiplexed into the third-order channels are grouped at an address whose first part depends upon the second-order channel they occupy in the third-order channel and whose second part depends upon the first-order channel they occupy in the second-order channel. The bits of a given rank of the words of a second-order channel form a pseudorandom sequence having a known period and, therefore, the bits of a given rank of the words of a third-order channel form a number of interleaved pseudorandom sequences. The digital switching unit includes means for separating the interleaved pseudorandom sequences and for deducing from the bits composing them the second part of the address of the words.
Inventors
- 👤 Alain G. Texier
- 👤 Michel R. Davancens
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 05:56
CPC Classifications
H; H04; H04J; H04J3/00; H04J3/02; H04J3/06; H04J3/0602; H04J3/0605; H04J3/0611; H04L; H04L12/00; H04L12/50; H04L12/52
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
220 words
A time division digital switching network comprising: first multiplexing means in which first-order digital data channels transmitting words consisting of a given number of bits and having first rates which are different from but multiples of one another undergo a first multiplexing converting them into second-order digital data channels having a second predetermined rate; second multiplexing means in which said second-order digital channels undergo a second multiplexing converting them into third-order digital data channels having a third predetermined rate; and a digital switching unit having at least one buffer store in which the first-order-channel words multiplexed into the third-order channels are grouped at an address having first and second part and whose first part depends upon the second-order channel they occupy in the third-order channel and whose second part depends upon the first-order channel they occupy in the second-order channel, the bits of a given rank of the words of a second-order channel forming a pseudorandom sequence having a known period and, therefore, the bits of a given rank of the words of a third-order channel forming a number of interleaved pseudorandom sequences; the said switching network being characterized in that said digital switching unit includes means for separating the interleaved pseudorandom sequences and for deducing from the bits comprising them said second part of the address of the words.
Claim 2
Dependent Claim
220 words
A time division digital switching network comprising: first multiplexing means in which first-order digital data channels transmitting words consisting of a given number of bits and having first rates which are different from but multiples of one another undergo a first multiplexing converting them into second-order digital data channels having a second predetermined rate; second multiplexing means in which said second-order digital channels undergo a second multiplexing converting them into third-order digital data channels having a third predetermined rate; and a digital switching unit having at least one buffer store in which the first-order-channel words multiplexed into the third-order channels are grouped at an address having first and second part and whose first part depends upon the second-order channel they occupy in the third-order channel and whose second part depends upon the first-order channel they occupy in the second-order channel, the bits of a given rank of the words of a second-order channel forming a pseudorandom sequence having a known period and, therefore, the bits of a given rank of the words of a third-order channel forming a number of interleaved pseudorandom sequences; the said switching network being characterized in that said digital switching unit includes means for separating the interleaved pseudorandom sequences and for deducing from the bits comprising them said second part of the address of the words.
Claim 3
Dependent Claim
38 words
A switching network according to claim 1, in which said words consisting of a given number of bits are octets and the bits of a given rank forming a pseudorandom sequence are the first bits of the octets.
Claim 4
Dependent Claim
31 words
A switching network according to claim 1, in which the first different rates which are multiplex of one another and which undergo the first multiplexing are 12.8, 3.2 and 0.8 kbit/s.
Claim 5
Dependent Claim
164 words
A switching network according to claim 1, comprising a generator producing a pseudorandom sequence of period N consisting of a shift register having a number n of stages and an "Exclusive OR" gate whose two inputs are respectively connected to an intermediate stage and to the final stage of said shift register and whose output is so connected to the register input stage as to reintroduce thereinto a reinsertion bit equal to the logic sum of the bits in the intermediate and final stages, said generator comprising a circuit for shortening the period of latter said sequence from (2 n -1) to N, said shortening circuit consisting of a decoder of a predetermined n-bit word; said network further including means for inverting said reinsertion bit, latter said means being controlled by said decoder, and means for inserting the bits of said shortened pseudorandom sequence into the words transmitted by the second-order channels in the form of bits of given ranks of the latter words.
Claim 6
Dependent Claim
120 words
A switching network according to claim 4, in which the digital switching unit comprises a generator producing a pseudorandom sequence of period N and consisting of a shift register and a shortening circuit, and in which there are also provided means for synchronizing said generator, a transcoder of the words located in the n stages of said shift register and formed by the bits of said pseudorandom sequence into binary words, a store associated with said shift register and operating at the rate of the third-order channels, and means for so transferring the words of said pseudorandom sequence from said register to the store and vice versa as to separate out the interleaved pseudorandom sequences corresponding to the second-order channels.
Claim 7
Dependent Claim
76 words
A switching network according to claim 1, in which the digital switching unit comprises a store containing one word per incoming data channel, and in which the latter word contains: at least one status bit indicating whether the associated data channel is in use for data transmission or for ringing and trunking purposes, and the address of the correspondent, if data transmission is proceeded, or of the trunking bits, if a ringing or trunking are proceeded.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1979-04-20 | 1979-10-20 | 1980-04-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1983-04-20 | 1983-10-20 | 1984-04-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1987-04-20 | 1987-10-20 | 1988-04-20 | $7700.00 | Window Closed / Lapsed |