← Back to Patent Explorer
US4737951A Expired / Lapsed US ⏱️ 0.0 years remaining

Exchange with error correction

Assignee: US Philips Corp
•
Filing: 1986-10-22
•
Granted: 1988-04-12
•
Expires: 2006-10-22
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A switching exchange in which data on each incoming line are applied to an encoder which produces redundant code words therefrom. The switching matrix is divided into n sub-switching matrices which each transmit a different sub-code word. The outputs of the sub-switching matrices are connected to a decoder which corrects erroneous data words and in addition indicates the occurrence of a fault. Each sub-switching matrix may have its own setting processor receiving identical setting information from a central switching processor. In the event of failure of a sub-switching matrix the decoder can correctly restore the data words. It therefore is possible to effet repair simply replacing the defective sub-switching matrix without switching-off the exchange.

Inventors

  • 👤 Johann E. W. Kruger
  • 👤 Wolfang E. Jasmer

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 10:30
CPC Classifications
H; H04; H04Q; H04Q11/00; H04Q11/04

Claims Analysis

Total Claims: 7
Claim 1
Independent Claim 182 words
In a switching exchange for computer-controlled switching of a plurality of lines each of which receives digital time-interleaved data, which exchange comprises a switching matrix which transmits the data in parallel in the form of data words comprising a plurality of data bits, the improvement characterized in that: the switching matrix (10) is preceded by an encoder (2) which from each data word produces a code word having a number of code bits exceeding the number of data bits of each data word and applies it to the switching matrix (10); the switching matrix is divided into a number of parallel sub-switching matrices (12, 14, 16, 18) which each transmit a sub-code word consisting of the bits of a portion of the code word; and the switching matrix is followed by a decoder (4, 4a) which produces the original data words from all the sub-code words; the code words and the sub-code words being structured so that when there is at least one mutilated sub-code word the decoder produces the correct data words and an error signal indicating the mutilated sub-code word.
Claim 2
Dependent Claim 182 words
In a switching exchange for computer-controlled switching of a plurality of lines each of which receives digital time-interleaved data, which exchange comprises a switching matrix which transmits the data in parallel in the form of data words comprising a plurality of data bits, the improvement characterized in that: the switching matrix (10) is preceded by an encoder (2) which from each data word produces a code word having a number of code bits exceeding the number of data bits of each data word and applies it to the switching matrix (10); the switching matrix is divided into a number of parallel sub-switching matrices (12, 14, 16, 18) which each transmit a sub-code word consisting of the bits of a portion of the code word; and the switching matrix is followed by a decoder (4, 4a) which produces the original data words from all the sub-code words; the code words and the sub-code words being structured so that when there is at least one mutilated sub-code word the decoder produces the correct data words and an error signal indicating the mutilated sub-code word.
Claim 3
Dependent Claim 27 words
A switching exchange as claimed in claim 1, wherein the number of bits of each code word is twice the number of bits of each data word.
Claim 4
Dependent Claim 41 words
A switching exchange is claimed in claim 1 wherein each sub-switching matrix (12, 14, 16, 18) has its own, setting computer (22, 24, 26, 28) and all the setting computers are controlled in parallel by a central switching control computer (6).
Claim 5
Dependent Claim 131 words
A switching exchange as claimed in claim 1, wherein the encoder (2) preceding the switching matrix (10) comprises at least two sub-encoders (32, 36) each of which receives a different portion of the data words and produces a sub-code word; each sub-switching matrix (12, 14, 16, 18) respectively transmits as a sub-code word the bits from a different portion of a sub-code word, so that all the sub-switching matrices transmit all the sub-code words; and the decoder subsequent to the switching matrix (10) consists of a number of sub-decoders (42,46) equal to the number of sub-encoders (32, 36), the sub-decoders being connected to the outputs of the switching matrix (10) such that each sub-decoder receives all the bits of a sub-code word and produces the corresponding portion of the data word.
Claim 6
Dependent Claim 118 words
A switching exchange as claimed in claim 1, wherein the error signal of the decoder is evaluated by a supervisory computer (8), further characterized in that: a fault memory (52) assigned to the decoder (4, 4a) is connected to the error signal outputs (F1 to F4) of the decoder (4, 4a) and to a counter (54) which identifies the transmission path through the switching matrix (10), said counter counting the data words within a frame; whereby upon the occurrence of an error signal such error signal and the identification of the transmission path are stored in the fault memory (52) and the supervisory computer (8) retrieves the content of the fault memory (52) and erases the fault memory.
Claim 7
Dependent Claim 39 words
A switching exchange as claimed in claim 5, characterized in that the fault memory (52) stores the signals of several sequentially occurring code word errors and the supervision computer (8) only erases the stored signals of the retrieved errors.

References Cited (Backward Citations)

US3886318A Cited
US4074077A Cited
US4489412A Cited
US4456987A Cited
US4535442A Cited
US4608684A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1991-04-12 1991-10-12 1992-04-12 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1995-04-12 1995-10-12 1996-04-12 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1999-04-12 1999-10-12 2000-04-12 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag