US4729123A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for establishing and maintaining synchronization between communicating multiplexers using checksum values
Assignee: General Datacomm Inc
•
Filing: 1986-08-14
•
Granted: 1988-03-01
•
Expires: 2006-08-14
Abstract
Abstract Methods for establishing and maintaining synchronization between communicating multiplexers are provided, wherein a first multiplexer having a frame format multiplexes at least data according to the frame format, and wherein the second multiplexer demultiplexes at least said data according to the frame format, and synchronization is established by: providing the frame format with bit positions for a plurality of bits including first predetermined bit positions for a plurality of checksum bits, and second predetermined bit positions for bits other than checksum bits; calculating a checksum for the bit values of bits located at said second predetermined bit positions, and inserting bits representing the said calculated checksum into said first predetermined bit positions; sending bits including bits located at said first and second predetermined bit positions in said frame format from said first multiplexer to said second multiplexer; and establishing synchronization between said first and second multiplexers by using said bits representing said calculated checksum. In establishing synchronization, the second multiplexer chooses an arbitrary bit as the first bit in the frame. Received bits located at distances from the first bit which are equivalent to the second predetermined bit positions are then used to calculate a checksum. Bits are then located at distances from the first bit which are equivalent to the predetermined first positions. If the checksum calculations do not correspond to the found checksum bits, frame synchronization is not established. The process is then repeated starting with the next bit after the arbitrary point, and continued until the calculated checksum agrees with the bits at the checksum locations.
Inventors
- 👤 Andrew J. T. Wheen
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 16:45
CPC Classifications
H; H04; H04L; H04L7/00; H04L7/04; H04L7/048
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
174 words
A method for providing synchronization between first and second communicating multiplexers, wherein said first multiplexer having a frame format multiplexes at least data according to the frame format and sends the data over an aggregate channel to said second multiplexer, and wherein said second multiplexer demultiplexes according to said frame format at least said data received from said aggregate channel, the method comprising: (a) providing said frame format with bit positions for a plurality of bits including first predetermined bit positions for a plurality of checksum bits, and second predetermined bit positions for bits other than checksum bits; (b) calculating a checksum for the bit values of bits located at said second predetermined bit positions, and inserting bits representing the said calculated checksum into said first predetermined bit positions; (c) sending bits including bits located at said first and second predetermined bit positions in said frame format from said first multiplexer to said second multiplexer; and (d) establishing synchronization between said first and second communicating multiplexers by using said bits representing said calculated checksum.
Claim 2
Independent Claim
174 words
A method for providing synchronization between first and second communicating multiplexers, wherein said first multiplexer having a frame format multiplexes at least data according to the frame format and sends the data over an aggregate channel to said second multiplexer, and wherein said second multiplexer demultiplexes according to said frame format at least said data received from said aggregate channel, the method comprising: (a) providing said frame format with bit positions for a plurality of bits including first predetermined bit positions for a plurality of checksum bits, and second predetermined bit positions for bits other than checksum bits; (b) calculating a checksum for the bit values of bits located at said second predetermined bit positions, and inserting bits representing the said calculated checksum into said first predetermined bit positions; (c) sending bits including bits located at said first and second predetermined bit positions in said frame format from said first multiplexer to said second multiplexer; and (d) establishing synchronization between said first and second communicating multiplexers by using said bits representing said calculated checksum.
Claim 3
Dependent Claim
25 words
A method according to claim 1, further comprising: (e) maintaining synchronization between said first and second multiplexers by using said bits representing said calculated checksum.
Claim 4
Dependent Claim
152 words
A method according to claim 1, wherein said synchronization between said multiplexers is established at step (d) by: at said second multiplexer (1) choosing a bit of information received from said first multiplexer and defining the chosen bit as the first bit of a frame, (2) locating bits which are at bit distances away from said bit chosen at step (1), said bit distances being equivalent to said second predetermined bit positions, (3) calculating a checksum of said bits located according to step (2); (4) locating bits which are at bit distances away from said bit chosen at step (1), said bit distances being equivalent to said first predetermined positions, (5) comparing said bits located by steps (3) and (4), and (6) if said compared bits are unequal, choosing another bit of information as the first bit of said frame and repeating steps (2) through (5) until said compared bits are equal.
Claim 5
Dependent Claim
30 words
A method according to claim 3, wherein: said another bit of information chosen when said compared bits are not equal is the next bit sequentially received by said demultiplexing multiplexer.
Claim 6
Dependent Claim
93 words
A method according to claim 3, wherein synchronization between said multiplexers is established according to step (d) further by: (7) if said compared bits at step (5) are equal, maintaining said position of said chosen bit of information as the position of the first bit of the next frame of information, (8) repeating steps (2) through (5) for a plurality of frames of information, and (9) if said bits are unequal for any of said plurality of frames, repeating steps (2) through (8) until said bits are equal for a plurality of frames.
Claim 7
Dependent Claim
93 words
A method according to claim 4, wherein synchronization between said multiplexers is established according to step (d) further by: (7) if said compared bits at step (5) are equal, maintaining the position of said chosen bit of information as the position of the first bit of the next frame of information, (8) repeating steps (2) through (5) for a plurality of frames of information, and (9) if said bits are unequal for any of said plurality of frames, repeating steps (2) through (8) until said bits are equal for a plurality of frames.
Claim 8
Dependent Claim
145 words
A method according to claim 3, further comprising: (e) maintaining synchronization between said communicating multiplexers by using said bits representing said calculated checksum, wherein synchronization is maintained by, maintaining the position of said chosen bit of information as the position of the first bit of the frame when said compared bits at step (5) are equal, for each new frame of information being received by said second multiplexer, calculating a new checksum for bits located according to step (2), and comparing the new checksum with bits located according to step (4), causing an up-down counter having a count to count down if said new calculated checksum bits and said checksum bits located according to step (4) are unequal, comparing the count of the up-down counter to a predetermined threshold, and repeating steps (1) through (6) to reestablish synchronization if said count reaches said predetermined threshold.
Claim 9
Dependent Claim
199 words
A method according to claim 6, further comprising: (e) maintaining synchronization between said communicating multiplexers by using said bits representing said calculated checksum, wherein synchronization is maintained by, maintaining the position of said chosen bit of information as the position of the first bit of said frame format when said compared bits are equal for a plurality of frames according to step (9), for each new frame of information being received by said second multiplexer after synchronization is determined according to steps (1) through (9), calculating a new checksum for the bits located according to step (2) and comparing the new checksum with bits located according to step (4), causing an up-down counter having a count to count down if said new bits occupying the checksum bit position and said new checksum are unequal, causing said up-down counter to count up if said new bits occupying the checksum bit position and said new checksum are equal and said up-down counter is at a count other than a maximum value threshold, comparing the count of the up-down counter to a predetermined lower threshold, and repeating steps (1) through (9) to reestablish synchronization if said count reaches said predetermined lower threshold.
Claim 10
Dependent Claim
39 words
A method according to claim 2, wherein: said checksum calculated at step (b) for the bit values of bits located at second predetermined positions in said frame format is calculated by successive exclusive OR operations of the bit values.
Claim 11
Dependent Claim
55 words
A method according to claim 2, wherein: said checksum calculated at step (b) for the bit values of bits located at second predetermined locations in said frame format is calculated by an exclusive OR operation between a function other than an identity function and the result of successive exclusive OR operations of the bit values.
Claim 12
Dependent Claim
34 words
A method according to claim 9, wherein: said bit values of bits located at said second predetermined locations in said frame format represent root mean square information for a plurality of voice frequency groupings.
Claim 13
Dependent Claim
33 words
A method according to claim 10, wherein: said bit values of bits located at second predetermined locations in said frame format represent root mean square information for a plurality of voice frequency groupings.
Claim 14
Dependent Claim
39 words
A method according to claim 6, wherein: said checksum calculated at step (b) for the bit values of bits located at second predetermined positions in said frame format is calculated by successive exclusive OR operations of the bit values.
Claim 15
Dependent Claim
55 words
A method according to claim 6, wherein: said checksum calculated at step (b) for the bit values of bits located at second predetermined locations in said frame format is calculated by an exclusive OR operation between a function other than an identity function and the result of successive exclusive OR operations of the bit values.
Claim 16
Dependent Claim
34 words
A method according to claim 13, wherein: said bit values of bits located at said second predetermined locations in said frame format represent root mean square information for a plurality of voice frequency groupings.
Claim 17
Dependent Claim
33 words
A method according to claim 14, wherein: said bit values of bits located at second predetermined locations in said frame format represent root mean square information for a plurality of voice frequency groupings.
Claim 18
Dependent Claim
39 words
A method according to claim 8, wherein: said checksum calculated at step (b) for the bit values of bits located at second predetermined positions in said frame format is calculated by successive exclusive OR operations of the bit values.
Claim 19
Dependent Claim
55 words
A method according to claim 8, wherein: said checksum calculated at step (b) for the bit values of bits located at second predetermined locations in said frame format is calculated by an exclusive OR operation between a function other than an identity function and the result of successive exclusive OR operations of the bit values.
Claim 20
Dependent Claim
33 words
A method according to claim 17, wherein: said bit values of bits located at second predetermined locations in said frame format represent root mean square information for a plurality of voice frequency groupings.
Claim 21
Dependent Claim
33 words
A method according to claim 18, wherein: said bit values of bits located at second predetermined locations in said frame format represent root mean square information for a plurality of voice frequency groupings.
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) | 1991-03-01 | 1991-08-31 | 1992-03-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-03-01 | 1995-08-31 | 1996-03-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-03-01 | 1999-08-31 | 2000-03-01 | $7700.00 | Window Closed / Lapsed |