US4864565A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for frame synchronization of an exchange of a PCM time multiplex telecommunication system
Assignee: Siemens AG
•
Filing: 1987-09-22
•
Granted: 1989-09-05
•
Expires: 2007-09-22
Abstract
Abstract A frame start word derived by superframe formation is found by testing for the presence of a correct binary value combination each bit position in a time window having the length of as many bits as framing bits are spaced apart, with the inclusion of so many overframes that a decision can be reached on the possibility of a relationsip to the frame start word. If this is to be excluded the corresponding bit position is flagged and thereafter no longer taken into consideration. Otherwise, the next binary value of the corresponding bit position is inferred from the binary value present. The procedure is continued, always including the same number of overframes until only one unflagged bit position remains.
Inventors
- 👤 Bernd Schuster
- 👤 Horst Martin
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 20:28
CPC Classifications
H; H04; H04J; H04J3/00; H04J3/02; H04J3/06; H04J3/0602; H04J3/0605
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
280 words
A method for frame synchronization of an exchange of a PCM time multiplex telecommunication system, in accordance with which the frame start of a time frame comprising information channels is ascertained from a data stream arriving serially at said exchange by monitoring a periodic occurrence of a frame start word formed by formation of superframes from start bits always transmitted at frame starts, comprising: (a) in said monitoring, forming a frame group comprising a number of frames, said number being equal to the number of frames separating bits of said frame start word; (b) subjecting to a determination each bit ordinal position of such a frame group, together with as many bit positions of the same ordinal position of a plurality of successive frame groups as are required so that a determination can be made whether such bits may form a component of a frame start word or not; (c) in accordance with a bit combination resulting in said determination, determining either that this bit position is not the frame start and undertaking a corresponding flagging, or ascertaining the binary value to be expected in this bit position in the following frame group and comparing it with the actually occurring binary value; (d) repeating steps (a), (b), and (c) with regard to bit positions not yet so flagged until only one bit position has not been so flagged; (e) determining whether a binary value valid for a frame start word occurs repeatedly in a bit position not yet so flagged in an interval corresponding to a frame start word; and (f) when such is the case, synchronizing a receiving direction of said exchange on this bit position as frame start.
Claim 2
Independent Claim
280 words
A method for frame synchronization of an exchange of a PCM time multiplex telecommunication system, in accordance with which the frame start of a time frame comprising information channels is ascertained from a data stream arriving serially at said exchange by monitoring a periodic occurrence of a frame start word formed by formation of superframes from start bits always transmitted at frame starts, comprising: (a) in said monitoring, forming a frame group comprising a number of frames, said number being equal to the number of frames separating bits of said frame start word; (b) subjecting to a determination each bit ordinal position of such a frame group, together with as many bit positions of the same ordinal position of a plurality of successive frame groups as are required so that a determination can be made whether such bits may form a component of a frame start word or not; (c) in accordance with a bit combination resulting in said determination, determining either that this bit position is not the frame start and undertaking a corresponding flagging, or ascertaining the binary value to be expected in this bit position in the following frame group and comparing it with the actually occurring binary value; (d) repeating steps (a), (b), and (c) with regard to bit positions not yet so flagged until only one bit position has not been so flagged; (e) determining whether a binary value valid for a frame start word occurs repeatedly in a bit position not yet so flagged in an interval corresponding to a frame start word; and (f) when such is the case, synchronizing a receiving direction of said exchange on this bit position as frame start.
Claim 3
Dependent Claim
24 words
A method according to claim 1 wherein in so far all bit positions are flagged through the foregoing procedure, said procedure is restarted anew.
Claim 4
Dependent Claim
91 words
A method according to claim 1 comprising the steps of: (g), in so far a plurality of bit positions remains unflagged over a longer period of time, synchronizing on said one bit position as frame start; (h) thereafter, further testing the validity of said one bit position; (i) in so far as said one position is found invalid in said further testing, flagging said one bit position and synchronizing on a further unflagged bit of said plurality; and repeating this process until a valid bit position is found as frame start.
Claim 5
Dependent Claim
250 words
Circuit arrangement for performing the method of claim 1 comprising: a number of shift registers clocked in accordance with a route clock of said arriving data stream equal to a number of frame groups included and having a number of stages respectively equal a number of bits in a frame group, whereof the first in a series order has applied thereto as input information the bits of the arriving data stream and whereof the remainder have applied thereto as input information bits read out from the last stage of the respective shift register preceding in the series order, through a combinatorial network having applied thereto as input quantities the bits read out from the last stages of the shift registers and which, corresponding to the given binary value combination of a frame start word, in so far the binary value combination of the input quantities may form part of a frame start word, provides a reference bit with the binary value expected for the next bit, and in so far this is not the case provides an erase signal, by way of an equality circuit which compares said reference bit with the respective data stream bit present, by way of a coincidence element associated with the shift registers, to which the erase signal, the output signal of the equality circuit and the data stream bits are applied and whereof the output signal is the input signal of the associated shift registers, and a counter for timely control of the network.
Claim 6
Dependent Claim
250 words
Circuit arrangement for performing the method of claim 2 comprising: a number of shift registers clocked in accordance with a route clock of said arriving data stream equal to a number of frame groups included and having a number of stages respectively equal a number of bits in a frame group, whereof the first in a series order has applied thereto as input information the bits of the arriving data stream and whereof the remainder have applied thereto as input information bits read out from the last stage of the respective shift register preceding in the series order, through a combinatorial network having applied thereto as input quantities the bits read out from the last stages of the shift registers and which, corresponding to the given binary value combination of a frame start word, in so far the binary value combination of the input quantities may form part of a frame start word, provides a reference bit with the binary value expected for the next bit, and in so far this is not the case provides an erase signal, by way of an equality circuit which compares said reference bit with the respective data stream bit present, by way of a coincidence element associated with the shift registers, to which the erase signal, the output signal of the equality circuit and the data stream bits are applied and whereof the output signal is the input signal of the associated shift registers, and a counter for timely control of the network.
Claim 7
Dependent Claim
250 words
Circuit arrangement for performing the method of claim 3 comprising: a number of shift registers clocked in accordance with a route clock of said arriving data stream equal to a number of frame groups included and having a number of stages respectively equal a number of bits in a frame group, whereof the first in a series order has applied thereto as input information the bits of the arriving data stream and whereof the remainder have applied thereto as input information bits read out from the last stage of the respective shift register preceding in the series order, through a combinatorial network having applied thereto as input quantities the bits read out from the last stages of the shift registers and which, corresponding to the given binary value combination of a frame start word, in so far the binary value combination of the input quantities may form part of a frame start word, provides a reference bit with the binary value expected for the next bit, and in so far this is not the case provides an erase signal, by way of an equality circuit which compares said reference bit with the respective data stream bit present, by way of a coincidence element associated with the shift registers, to which the erase signal, the output signal of the equality circuit and the data stream bits are applied and whereof the output signal is the input signal of the associated shift registers, and a counter for timely control of the network.
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) | 1992-09-04 | 1993-03-06 | 1993-09-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-09-04 | 1997-03-06 | 1997-09-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-09-04 | 2001-03-06 | 2001-09-05 | $7700.00 | Window Closed / Lapsed |