Patent US2895327A successfully refreshed from Google Patents.
Patent US4796282A successfully refreshed from Google Patents.
US4796282A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Frame synchronization detection system
Assignee: NEC Corp
•
Filing: 1987-01-07
•
Granted: 1989-01-03
•
Expires: 2007-01-07
Abstract
Abstract In a frame synchronization system for synchronizing a frame consisting of N sub-frames each consisting of M bits, a transmitting side includes a circuit for generating an N-bit cyclic code from a generating polynomial and sequentially and respectively inserting bits of the cyclic code in bit positions of the sub-frames, and a receiving side includes a divider for dividing a code polynomial having N-bit values of the data trains as coefficients by the generating polynomial to output the remainder, and a frame synchronization detector for sending a frame synchronization clock signal to the N-bit data train producing circuit when the remainder from the divider is zero.
Inventors
- 👤 Norio Yoshida
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 02:07
CPC Classifications
H; H04; H04J; H04J3/00; H04J3/02; H04J3/06; H04J3/0602; H04J3/0605; H04J3/0611
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
129 words
A frame synchronization detection system in a digital transmission system, wherein a frame consisting of N sub-frames each consisting of M bits is synchronized, comprising: at a sending side, means for generating an N-bit cyclic code from a generating polynomial and sequentially and respectively inserting bits of the cyclic code in bit positions of the sub-frames; and at a receiving side, means for extracting a reception signal for every M bits and producing an N-bit data train, dividing means for dividing a code polynomial having N-bit values of the N-bit data trains as coefficients by the generating polynomial to output a remainder, and clock control means for sending a frame synchronization clock signal to said N-bit data train producing means when the remainder from said dividing means is zero.
Claim 2
Dependent Claim
129 words
A frame synchronization detection system in a digital transmission system, wherein a frame consisting of N sub-frames each consisting of M bits is synchronized, comprising: at a sending side, means for generating an N-bit cyclic code from a generating polynomial and sequentially and respectively inserting bits of the cyclic code in bit positions of the sub-frames; and at a receiving side, means for extracting a reception signal for every M bits and producing an N-bit data train, dividing means for dividing a code polynomial having N-bit values of the N-bit data trains as coefficients by the generating polynomial to output a remainder, and clock control means for sending a frame synchronization clock signal to said N-bit data train producing means when the remainder from said dividing means is zero.
Claim 3
Dependent Claim
22 words
A system according to claim 1, wherein the bits of the N-bit cyclic code are respectively inserted in MSBs of the sub-frames.
Claim 4
Dependent Claim
88 words
A system according to claim 1, further comprising: at the sending side, means for sequentially and respectively inserting N bits of an N-bit frame pattern in bit positions of (M-1) bits of the sub-frames which exclude the bit positions corresponding to the bits of the cyclic code; and wherein at the receiving side, said clock control means comprises memory means for storing the frame pattern, the synchronization clock signal being generated by using the remainder from said dividing means and the frame pattern stored in said memory means.
Claim 5
Dependent Claim
26 words
A system according to claim 3, wherein the frame pattern and the cyclic code are respectively inserted in the MSB and an LSB of each sub-frame.
Claim 6
Dependent Claim
195 words
A frame synchronization detection system in a digital transmission system, wherein a frame consisting of N sub-frames each consisting of M bits, comprising: at a transmitting end, means for dividing N bits selected from the sub-frames into K trains (K is a factor of N) and inserting an N/K-bit frame synchronization pattern in one of the K trains, means for sequentially inserting (K-1) cyclic codes, each comprising an N/K-bit word generated from a generating polynomial, in one of remaining (K-1) trans, and means for sending out as serial information a frame with the cyclic codes and the synchronization pattern; and at a receiving side first serial-to-parallel converting means for extracting a reception signal for every M bits and producing an N-bit data train, second serial-to-parallel converting means for dividing a code polynomial, having as coefficients N/K bits (N is a multiple of K) extracted from at least one train out of outputs from said first serial-to-parallel converting means, by a predetermined generating polynomial to obtain a remainder, and means, coupled to an output of said second serial-to-parallel converting means and the remainder, for detecting synchronization by using K N/K-bit trains extracted from the data trains.
Claim 7
Dependent Claim
195 words
A frame synchronization detection system in a digital transmission system, wherein a frame consisting of N sub-frames each consisting of M bits, comprising: at a transmitting end, means for dividing N bits selected from the sub-frames into K trains (K is a factor of N) and inserting an N/K-bit frame synchronization pattern in one of the K trains, means for sequentially inserting (K-1) cyclic codes, each comprising an N/K-bit word generated from a generating polynomial, in one of remaining (K-1) trans, and means for sending out as serial information a frame with the cyclic codes and the synchronization pattern; and at a receiving side first serial-to-parallel converting means for extracting a reception signal for every M bits and producing an N-bit data train, second serial-to-parallel converting means for dividing a code polynomial, having as coefficients N/K bits (N is a multiple of K) extracted from at least one train out of outputs from said first serial-to-parallel converting means, by a predetermined generating polynomial to obtain a remainder, and means, coupled to an output of said second serial-to-parallel converting means and the remainder, for detecting synchronization by using K N/K-bit trains extracted from the data trains.
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-01-03 | 1992-07-04 | 1993-01-03 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-01-03 | 1996-07-04 | 1997-01-03 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-01-03 | 2000-07-04 | 2001-01-03 | $7700.00 | Window Closed / Lapsed |