US4283787A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Cyclic redundancy data check encoding method and apparatus
Assignee: British Broadcasting Corp
•
Filing: 1979-08-06
•
Granted: 1981-08-11
•
Expires: 1999-08-06
Abstract
Abstract A cyclic redundancy check word is customarily placed at the end of a data block, occupying one or more of the last bytes of the block. This can impose an undesirable restraint upon the person composing the data block, e.g. the editor of a teletext page. The invention allows the check word effectively to be embedded anywhere convenient in the block. A location in the block is selected (one or more bytes--preset address 16) and all preceding bytes are cyclically encoded (encoder 18) to yield a first check word. The succeeding bytes are subjected in reverse order to complementary encoding (encoder 28) to yield a second check word. A third check word is formed from the first and second check words (encoding logic 32) and inserted in the selected location. Each bit of the third word is the logical product of the corresponding bit of the first word and selected bits of the second word, such that when the bytes of the complete block, including the third word, are cyclically encoded, the final check word has the required final form, e.g. all zeroes, to indicate compliance of the block with the cyclic redundancy check. The location can be selected by the editor but is preferably selected automatically by a search for a free location complying with predetermined conditions.
Inventors
- 👤 John P. Chambers
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 17:16
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/03; H03M13/05; H03M13/09; H03M13/091; H04; H04N; H04N7/00; H04N7/025; H04N7/035; H04N7/0357
Claims Analysis
Total Claims: 5
Claim 1
Independent Claim
198 words
Cyclic redundancy check data encoding apparatus comprising a multi-word memory for storing a block of data, input means for entering a block of data into the memory, addressing means operative to provide an address designating a selected part of the stored block in the memory, an encoder, means for reading words from the memory to the encoder for encoding the words preceding the said selected part designated by the addressing means, the encoder including a register and being constructed to provide a first check word in the register of the encoder, a complementary encoder, means for reading words from the memory to the complementary encoder for encoding, in reverse order, the words succeeding the said selected part designated by the addressing means, the complementary encoder including a register and being constructed to provide a second check word in the register of the complementary encoder, encoding logic responsive to the first and second check words in the registers to generate a third check word, and means responsive to the encoding logic and the addressing means for entering the third check word in the memory to occupy the selected part of the block of data designated by the addressing means.
Claim 2
Dependent Claim
198 words
Cyclic redundancy check data encoding apparatus comprising a multi-word memory for storing a block of data, input means for entering a block of data into the memory, addressing means operative to provide an address designating a selected part of the stored block in the memory, an encoder, means for reading words from the memory to the encoder for encoding the words preceding the said selected part designated by the addressing means, the encoder including a register and being constructed to provide a first check word in the register of the encoder, a complementary encoder, means for reading words from the memory to the complementary encoder for encoding, in reverse order, the words succeeding the said selected part designated by the addressing means, the complementary encoder including a register and being constructed to provide a second check word in the register of the complementary encoder, encoding logic responsive to the first and second check words in the registers to generate a third check word, and means responsive to the encoding logic and the addressing means for entering the third check word in the memory to occupy the selected part of the block of data designated by the addressing means.
Claim 3
Independent Claim
145 words
A method of processing a multi-word block of data to render the block consistent with a given cyclic redundancy check, comprising the steps of cyclically encoding the words preceding a predetermined part of the block to generate a first check word, cyclically encoding the words succeeding the said part of the block in reverse order and with complementary encoding to generate a second check word, generating a third check word from the first and second check words, and introducing the third check word into the said part of the block, and wherein the step of generating the third word comprises forming the bits of the third word in accordance with predetermined logical functions of bits of the first and second words such that when the whole block, including the introduced third word, is cyclically encoded, the final check word thereby generated has a predetermined form.
Claim 4
Independent Claim
145 words
A method of processing a multi-word block of data to render the block consistent with a given cyclic redundancy check, comprising the steps of cyclically encoding the words preceding a predetermined part of the block to generate a first check word, cyclically encoding the words succeeding the said part of the block in reverse order and with complementary encoding to generate a second check word, generating a third check word from the first and second check words, and introducing the third check word into the said part of the block, and wherein the step of generating the third word comprises forming the bits of the third word in accordance with predetermined logical functions of bits of the first and second words such that when the whole block, including the introduced third word, is cyclically encoded, the final check word thereby generated has a predetermined form.
Claim 5
Dependent Claim
34 words
A method according to claim 2, and further including the step of automatically scanning the block to select a free location for the introduced check word, thereby predetermining the said part of the block.
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) | 1984-08-10 | 1985-02-09 | 1985-08-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1988-08-10 | 1989-02-09 | 1989-08-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1992-08-10 | 1993-02-09 | 1993-08-11 | $7700.00 | Window Closed / Lapsed |