Patent US2667252A successfully refreshed from Google Patents.
Patent US5764876A successfully refreshed from Google Patents.
US5764876A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and device for detecting a cyclic code
Assignee: Toyo Communication Equipment Co Ltd
•
Filing: 1994-06-22
•
Granted: 1998-06-09
•
Expires: 2014-06-22
Abstract
Abstract A method and device for detecting a cyclic code which detects an n-bit cyclic code or shortened cyclic code based on a degree-m generating polynomial or code with a predetermined bit pattern added to the cyclic code or shortened cyclic code in the bit sequence of a signal containing those codes by utilizing the principle that the remainder of division of those codes by the generating polynomial is zero or the added bit pattern. The method divides serially input receive data by the generating polynomial successively, and removes the remainder of division of X n by the generating polynomial from the remainder of the division of the bits up to the current bit if the nth bit before the current bit is 1 for each of the nth bit from the first bit and subsequent bits of the receive data. The device comprises a divider which divides serially input receive data by the generating polynomial successively and holds the remainder of the division hitherto performed, an n-stage shift register connected in parallel with the divider with respect to the input signal, and a decoder which receives the values of individual bits of the remainder calculated by the divider and outputs a predetermined detection signal when the values are all zero or form the predetermined bit pattern, and is constructed so as to remove the remainder of division of X n by the generating polynomial from the remainder calculated by the divider by utilizing the output signal of the last stage of the shift register when the value of the output of the last stage is 1.
Inventors
- 👤 Shigeki Yanagisawa
- 👤 Tetsuya Morizumi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 15:18
CPC Classifications
H; H04; H04L; H04L7/00; H03; H03M; H03M13/00; H03M13/03; H03M13/05; H03M13/13; H03M13/15; H03M13/33; H04L7/04; H04L7/048; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5672; H04L2012/5673; H04L2012/5674
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
138 words
A method for detecting a cyclic code which detects an n-bit cyclic code or shortened cyclic code based on a degree-m generating polynomial or code with a predetermined bit pattern added to said cyclic code or shortened cyclic code in the bit sequence of a signal containing those codes by utilizing the principle that the remainder of division of those codes by said generating polynomial is zero or the added bit pattern, characterized by dividing serially input receive data by said generating polynomial successively, and removing the remainder of division of X n by said generating polynomial from the remainder of the division of the bits up to the current bit if the nth bit before the current bit is 1 for each of the nth bit from the first bit and subsequent bits of the receive data.
Claim 2
Independent Claim
138 words
A method for detecting a cyclic code which detects an n-bit cyclic code or shortened cyclic code based on a degree-m generating polynomial or code with a predetermined bit pattern added to said cyclic code or shortened cyclic code in the bit sequence of a signal containing those codes by utilizing the principle that the remainder of division of those codes by said generating polynomial is zero or the added bit pattern, characterized by dividing serially input receive data by said generating polynomial successively, and removing the remainder of division of X n by said generating polynomial from the remainder of the division of the bits up to the current bit if the nth bit before the current bit is 1 for each of the nth bit from the first bit and subsequent bits of the receive data.
Claim 3
Independent Claim
198 words
A method for detecting a cyclic code which detects an n-bit cyclic code or shortened cyclic code based on a degree-m generating polynomial or code with a predetermined bit pattern added to said cyclic code or shortened cyclic code in the bit sequence of a signal containing those codes by utilizing the principle that the remainder of the division of those codes by said generating polynomial is zero or the added bit pattern, characterized by dividing serially input receive data by said generating polynomial successively, and removing the remainder of division of X n by said generating from the remainder of the division of the bits up to the current bit if the nth bit before the current bit is 1 for each of the nth bit from the first bit and the subsequent bits of the receive data; and wherein said generating polynomial is X 8 +X 2 +X+1, said shortened cyclic code is of 40 bits consisting of 32 bits of information bits and 8 bits of check bits, and said remainder of division of X n by said generating polynomial is X 6 +X 5 +X (remainder of X 40 /(X 8 +X 2 +X+1).
Claim 4
Independent Claim
198 words
A method for detecting a cyclic code which detects an n-bit cyclic code or shortened cyclic code based on a degree-m generating polynomial or code with a predetermined bit pattern added to said cyclic code or shortened cyclic code in the bit sequence of a signal containing those codes by utilizing the principle that the remainder of the division of those codes by said generating polynomial is zero or the added bit pattern, characterized by dividing serially input receive data by said generating polynomial successively, and removing the remainder of division of X n by said generating from the remainder of the division of the bits up to the current bit if the nth bit before the current bit is 1 for each of the nth bit from the first bit and the subsequent bits of the receive data; and wherein said generating polynomial is X 8 +X 2 +X+1, said shortened cyclic code is of 40 bits consisting of 32 bits of information bits and 8 bits of check bits, and said remainder of division of X n by said generating polynomial is X 6 +X 5 +X (remainder of X 40 /(X 8 +X 2 +X+1).
Claim 5
Independent Claim
188 words
A device for detecting a cyclic code which detects an n-bit cyclic code or shortened cyclic code based on a degree-m generating polynomial or code with a predetermined bit pattern added to said cyclic code or shortened cyclic code by utilizing the principle that the remainder of division of those codes by the generating polynomial is zero or the added bit pattern, characterized by comprising a divider which divides serially input receive data by said generating polynomial successively and holds the remainder of the division hitherto performed, an n-stage shift register connected in parallel with said divider with respect to the input signal, and a decoder which receives the values of individual bits of the remainder calculated by said divider and outputs a predetermined detection signal when the values are all zero or form said predetermined bit pattern, and being constructed so as to remove the remainder of division of X n by said generating polynomial from the remainder calculated by said divider by utilizing the output signal of the last stage of said shift register when the value of the output of the last stage is 1.
Claim 6
Independent Claim
188 words
A device for detecting a cyclic code which detects an n-bit cyclic code or shortened cyclic code based on a degree-m generating polynomial or code with a predetermined bit pattern added to said cyclic code or shortened cyclic code by utilizing the principle that the remainder of division of those codes by the generating polynomial is zero or the added bit pattern, characterized by comprising a divider which divides serially input receive data by said generating polynomial successively and holds the remainder of the division hitherto performed, an n-stage shift register connected in parallel with said divider with respect to the input signal, and a decoder which receives the values of individual bits of the remainder calculated by said divider and outputs a predetermined detection signal when the values are all zero or form said predetermined bit pattern, and being constructed so as to remove the remainder of division of X n by said generating polynomial from the remainder calculated by said divider by utilizing the output signal of the last stage of said shift register when the value of the output of the last stage is 1.
Claim 7
Independent Claim
300 words
A device for detecting a cyclic code which detects an n-bit cyclic code or shortened cyclic code based on a degree-m generating polynomial or code with a predetermined bit pattern added to said cyclic code or shortened cyclic code by utilizing the principle that the remainder of the division of those codes by the generating polynomial is zero or the added bit pattern, characterized by comprising a divider which divides serially input receive data by said generating polynomial successively and holds the remainder of the division hitherto performed, an n-stage shift register connected in parallel with said divider with respect to the input signal, a decoder which receives the values of individual bits of the remainder calculated by said divider and outputs a predetermined detection signal when the values are all zero or form said predetermined bit pattern, and being constructed so as to remove the remainder of division of X n by said generating polynomial from the remainder calculated by said divider by utilizing the output signal of the last stage of said shift register when the value of the output of the last stage is 1; and wherein said divider is a divider which divides the serially input bit sequence of receive data by generating polynomial X 8 +X 2 +X+1 successively and said shift register is a 40-stage shift register with the output of the last stage being connected to one input of the exclusive OR circuits put between the stages of said divider corresponding to the bits of the remainder of division of X 40 by generating polynomial X 8 +X 2 +X+1 whose value is 1 (bits X 6 , X 5 and X) and their preceding stages (between the 1st and 2nd stages, the 5th and 6th stages, and the 6th and 7th stages).
Claim 8
Independent Claim
300 words
A device for detecting a cyclic code which detects an n-bit cyclic code or shortened cyclic code based on a degree-m generating polynomial or code with a predetermined bit pattern added to said cyclic code or shortened cyclic code by utilizing the principle that the remainder of the division of those codes by the generating polynomial is zero or the added bit pattern, characterized by comprising a divider which divides serially input receive data by said generating polynomial successively and holds the remainder of the division hitherto performed, an n-stage shift register connected in parallel with said divider with respect to the input signal, a decoder which receives the values of individual bits of the remainder calculated by said divider and outputs a predetermined detection signal when the values are all zero or form said predetermined bit pattern, and being constructed so as to remove the remainder of division of X n by said generating polynomial from the remainder calculated by said divider by utilizing the output signal of the last stage of said shift register when the value of the output of the last stage is 1; and wherein said divider is a divider which divides the serially input bit sequence of receive data by generating polynomial X 8 +X 2 +X+1 successively and said shift register is a 40-stage shift register with the output of the last stage being connected to one input of the exclusive OR circuits put between the stages of said divider corresponding to the bits of the remainder of division of X 40 by generating polynomial X 8 +X 2 +X+1 whose value is 1 (bits X 6 , X 5 and X) and their preceding stages (between the 1st and 2nd stages, the 5th and 6th stages, and the 6th and 7th stages).
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) | 2001-06-08 | 2001-12-08 | 2002-06-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-06-08 | 2005-12-08 | 2006-06-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-06-08 | 2009-12-08 | 2010-06-09 | $7700.00 | Window Closed / Lapsed |