Patent US5134618A successfully refreshed from Google Patents.
US5134618A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of testing connecting and/or switching devices and/or lines
Assignee: Alcatel Lucent NV
•
Filing: 1989-12-22
•
Granted: 1992-07-28
•
Expires: 2009-12-22
Abstract
Abstract A method of testing connecting and/or switching devices, particularly of a space-division multiplex switching matrix (K), in which one or more of a plurality of input lines (D i , C j ) is connectable with one or more of a plurality of output lines (Y k ), and which is carried out to check the formation of a check word is described. A first check word PB1 is derived from the signals on the input lines (D i , C j ), and also, according to the same rules of formation, a second check word PB2 is derived from the signals on the output lines (Y k ), both derived continuously. The two check words are compared to each other. In case of a disagreement, an error indication is provided.
Inventors
- 👤 Hans J. Matt
- 👤 Mark G. Karpovsky
- 👤 Lev B. Levitin
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 17:39
CPC Classifications
H; H04; H04Q; H04Q1/00; H04Q1/18; H04Q1/20; H04Q1/22; H04Q1/24; H04Q1/245; H04Q11/00; H04Q11/04
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
130 words
A method for testing a spec-division multiplex switching matrix (K) in which one or more of a plurality of input lines (D i , C j ) are connectable with one or more of a plurality of output lines (Y j ), said testing being performed by means of check words, said method comprising the steps of: continuously deriving from signals on the input lines (D i , C j ) a first check word (PB1) on a parallel basis in accordance with a set of rules; continuously deriving from signals on the output lines (Y j ) a second check word (PB2) on a parallel basis in accordance with the set of rules; comparing the two check words; and providing an error indication when the two check words disagree.
Claim 2
Independent Claim
130 words
A method for testing a spec-division multiplex switching matrix (K) in which one or more of a plurality of input lines (D i , C j ) are connectable with one or more of a plurality of output lines (Y j ), said testing being performed by means of check words, said method comprising the steps of: continuously deriving from signals on the input lines (D i , C j ) a first check word (PB1) on a parallel basis in accordance with a set of rules; continuously deriving from signals on the output lines (Y j ) a second check word (PB2) on a parallel basis in accordance with the set of rules; comparing the two check words; and providing an error indication when the two check words disagree.
Claim 3
Dependent Claim
106 words
A method as claimed in claim 1, characterized in that the derivation of the first check word (PB1) from the signals on the lines (D i , C j ) for the first group takes place in a parity generator (PG) having al input lines connected to its inputs in parallel, that the derivation of the second check word (PB2) takes place in a parity checker (PC) having al lines (Y i ) of the second group connected to its inputs in parallel, and that the comparison between the check words takes place in a logic element (G 2 ) whose output actuates the error indication.
Claim 4
Dependent Claim
82 words
A method as claimed in claim 1, characterized in that in comparing the check words (PB1, PB2), an auxiliary check word derived in a parity correction device (PCB) compensates for a check word (PB2) if one check word (PB2) differs from the other check word because one of the lines (D i , C j ) of the first group is connected either to none of the output lines (Y j ) or to two or more output lines (Y j ).
Claim 5
Dependent Claim
159 words
A method as claimed in claim 3, characterized in that a switching network (K) is tested which has switching cells (S) arranged in columns and rows in matrix-like fashion and each being controlled by a state of one memory cell (BC), a check word is formed in a first unit (S i ) of the parity correction device (PCB) by evaluating states (Q) of the memory cells (BC), of a column that on an occurrence of a signal at an input line (D i , C j ) associated with the column, the check words determined for the columns are evaluated together (A i ) in a second unit (G 4 ), to form an additional check word, and that said additional check word is used for parity correction in the comparison between the check words (PB1, PB2) derived from the signals on the input lines (D i , C j ) and the output lines (Y i ).
Claim 6
Dependent Claim
104 words
A method as claimed in claim 4, characterized in that the check words derived for the memory cells (BC) per column of the switching network arranged in a matrix-like fashion are evaluated in a memory parity checker (P5, G 5 ) by formation of an additional check word, in such a way that an error indication is provided if more than only one input line (D i , C j ) is provided with an output line (Y i ) as a result of an error in a memory (BC) or an error in its control (b) by means of an input decoder (ED).
Claim 7
Dependent Claim
49 words
A method as claimed in claim 4, characterized in that in the presence of an enable signal (E), an output parity checker (ODP; G 6 , G 7 ) evaluates the control signals (a) controlling the memories (BC) for the switching cells (S) to form an additional check word.
Claim 8
Dependent Claim
92 words
A method as claimed in claim 1, characterized in that the matrix includes switching cells (S) include a binary memory unit (BC) which, when in one state, causes a signal on an associated input line (D i , C j ) to be switched to an associated output line (Y i ), the change to this state taking place if a control signal (a) is applied to said binary memory unit (BC) from an input decoder (ED) associated with the input lines from an output decoder (OD) associated with the output lines.
Claim 9
Dependent Claim
54 words
A method as claimed in claim 1, characterized in that the first check word (PB1) consists of a number which indicates how many input lines are carrying a given signal simultaneously, and that the second check word (PB2) consists of a number which indicates how many output lines are carrying a given signal simultaneously.
Claim 10
Dependent Claim
72 words
A method as claimed in claim 8, characterized in that the first check word (PB1) is a parity bit which indicates whether an even or odd number of input lines (D i , C j ) is carrying a given signal, and that the second check word (PB2) is a parity bit which indicates whether an even or odd number of of output lines (Y i ) is carrying a given signal.
Claim 11
Dependent Claim
30 words
A method as claimed in claim 9, characterized in that the devices (P, PG, PC, PCB, ODP, SP) for the derivation of check words are formed by means of exclusive-OR-gates.
Claim 12
Independent Claim
176 words
A method of testing connection s between a first group of lines (D i , C j ) and a second group of lines (Y j ) by means of check words, comprising the steps of: continuously deriving from signals on the lines (D i , C j ) of the first group on a parallel basis a first check word (PB1) according a set of rules; deriving from signals on the lines (Y j ) of the second group of lines on a parallel basis a second check word (PB2) in accordance with the set of rules; deriving an auxiliary check word in a parity correction device (PCB) which compensates for a second check word (PB2) when the second check word (PB2) differs from the first check word (PB1) because one of the lines (D i , C j ) of the first group is connected to other than a single line (Y j ) of the second group; and comparing the two check words and providing an error indication when the check words disagree.
Claim 13
Independent Claim
176 words
A method of testing connection s between a first group of lines (D i , C j ) and a second group of lines (Y j ) by means of check words, comprising the steps of: continuously deriving from signals on the lines (D i , C j ) of the first group on a parallel basis a first check word (PB1) according a set of rules; deriving from signals on the lines (Y j ) of the second group of lines on a parallel basis a second check word (PB2) in accordance with the set of rules; deriving an auxiliary check word in a parity correction device (PCB) which compensates for a second check word (PB2) when the second check word (PB2) differs from the first check word (PB1) because one of the lines (D i , C j ) of the first group is connected to other than a single line (Y j ) of the second group; and comparing the two check words and providing an error indication when the check words disagree.
Claim 14
Dependent Claim
157 words
A method as claimed in claim 11, characterized in that a switching network (K) is tested which has switching cells (S) arranged in columns and rows in matrix-like fashion and each controlled by a state of one memory cell (BC), a check word is formed in a first unit (S i ) of the parity correction device (PCB) by evaluating states (Q) of them emory cells (BC) of a column, that on the occurrence of a signal at an input line (D i , c j ) associated with the column, the check words determined for the columns are evaluated together (A i ) in a second unit (G 4 ), to form an additional check word, that said additional check word is used for parity correction in the comparison between the check words (PB1, PB2) derived from the signals on the input lines (D i , C j ) and the output lines (Y i ).
Claim 15
Dependent Claim
104 words
A method as claimed in claim 12, characterized in that the check words derived for the memory cells (BC) per column of the switching network arranged in a matrix-like fashion are evaluated in a memory parity checker (P5, G 5 ) by formation of an additional check word, in such a way that an error indication is provided if more than only one input line (D i , C j ) is provided with an output line (Y i ) as a result of an error in a memory (BC) or an error in its control (b) by means of an input decoder (ED).
Claim 16
Dependent Claim
49 words
A method as claimed in claim 12, characterized in that in the presence of an enable signal (E), an output parity checker (ODP; G 6 , G 7 ) evaluates the control signals (a) controlling the memories (BC) for the switching cells (S) to form an additional check word.
Claim 17
Dependent Claim
91 words
A method as claimed in claim 12, characterized in that the matrix includes switching cells (S) include a binary memory unit (BC) which, when in one state, causes a signal on an associated input line (D i , C j ) to be switched to an associated output line (Y i ), change to this state taking place if a control signal (a) is applied to said binary memory unit (BC) from an input decoder (ED) associated with the input lines form an output decoder (OD) associated with the output lines.
Claim 18
Independent Claim
162 words
A method for testing connections between a fist group of line (D i , C j ) and a second group of liens (Y j ) by means of check words, comprising the steps of: continuously deriving from signals on the lines (D i , C j ) of the first group on a parallel basis, a first check word (PB1) in accordance with a set of rules, said fist check word (PB1) consisting of a number which indicates how many lines of the first group are a carrying a given signal simultaneously; deriving from signals on the lines (Y j ) of the second group on a parallel basis a second check word (PB2) in accordance with the set of rules, said second check word (PB2) consisting of a number which indicate how many lines of the second group are carrying a given signal simultaneously; and comparing the two check words and providing an error indication when the check words disagree.
Claim 19
Independent Claim
162 words
A method for testing connections between a fist group of line (D i , C j ) and a second group of liens (Y j ) by means of check words, comprising the steps of: continuously deriving from signals on the lines (D i , C j ) of the first group on a parallel basis, a first check word (PB1) in accordance with a set of rules, said fist check word (PB1) consisting of a number which indicates how many lines of the first group are a carrying a given signal simultaneously; deriving from signals on the lines (Y j ) of the second group on a parallel basis a second check word (PB2) in accordance with the set of rules, said second check word (PB2) consisting of a number which indicate how many lines of the second group are carrying a given signal simultaneously; and comparing the two check words and providing an error indication when the check words disagree.
Claim 20
Dependent Claim
71 words
A method as claimed in claim 16, characterized in that the first check word (PB1) is a parity bit which indicates whether an even or odd number of input lines (D i , C j ) is carrying a given signal, and that the second check word (PB2) is a parity bit which indicates whether an even or odd number of output lines (Y i ) is carrying a given signal.
Claim 21
Dependent Claim
30 words
A method as claimed in claim 17, characterized in that the devices (P, PG, PC, PCB, ODP, SP) for the derivation of check words are formed by means of exclusive-OR-gates.
References Cited (Backward Citations)
GB217555A
Cited
US3452328A
Cited
US3784976A
Cited
US4456980A
Cited
US4596015A
Cited
US4593393A
Cited
US4768193A
Cited
US4710935A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-07-28 | 1996-01-27 | 1996-07-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-07-28 | 2000-01-27 | 2000-07-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-07-28 | 2004-01-27 | 2004-07-28 | $7700.00 | Window Closed / Lapsed |