Patent US2670303A successfully refreshed from Google Patents.
Patent US5539755A successfully refreshed from Google Patents.
US5539755A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for decoding an error protected block of extended data
Assignee: US Philips Corp
•
Filing: 1993-05-17
•
Granted: 1996-07-23
•
Expires: 2013-05-17
Abstract
Abstract Extended error protected communication system. An extended consumer communication system uses a signal that is error protected by a block code. The generator polynomial isGn(x)=go(x) . . . gn(x)which is factorizable, and each of the factors implement a linear and systematic code. Generally, each of the factors adds redundancy and raises the level of error protection. In this way, redundancy that is associated to a later term of the sequence occupies code positions that are protected by at least one earlier term in the sequence and may in consequence be used for positioning data that is protected by such earlier term, upon surrender of such higher protection level.
Inventors
- 👤 Constant P. M. J. Baggen
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 04:41
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/03; H03M13/05; H03M13/13; H03M13/15; H03M13/151; H03M13/01; A; A61; A61P; A61P25/00; A61P25/18; C; C07; C07D; C07D333/00; C07D333/50; C07D333/52; C07D333/62; C07D333/66; H03M13/29; H03M13/2906; H03M13/35; H04; H04N; H04N5/00; H04N5/76; H04N5/91; H04N5/92; H04N5/9201; H04N5/9206; H04N5/926; H04N5/93; H04N5/94; H04N5/945
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
226 words
A method of decoding an error protection block of extended data to produce a user block of user data, the error protection block having been produced by (a) encoding an original user block of user data by a linear and systematic primary error protection block code defined by a factorizable generator polynomial G.sub.n (x)=g.sub.0 (x) . . g.sub.n-1 (x)*g.sub.n (x)=G.sub.n-1 (x)*g.sub.n (x) if the original user block had a first length, or (b) encoding the original user block by a linear and systematic secondary error protection block code defined by a generator polynomial G.sub.n-1 (x)=g.sub.0 (x) . . g.sub.n-1 (x) if the original user block had a second length which was greater than the first length, the error protection block being the same length whether the original user block which was encoded to produce it had the first length or the second length, the method comprising: decoding the error protection block in accordance with the secondary code to produce a first decoded block; detecting whether the first decoded block contains correct user data, and if it does, outputting the first decoded block as the user block; and decoding the error protection block in accordance with the primary code to produce a second decoded block if the first decoded block does not contain correct user data, and thereafter, outputting the second decoded block as the user block.
Claim 2
Independent Claim
226 words
A method of decoding an error protection block of extended data to produce a user block of user data, the error protection block having been produced by (a) encoding an original user block of user data by a linear and systematic primary error protection block code defined by a factorizable generator polynomial G.sub.n (x)=g.sub.0 (x) . . g.sub.n-1 (x)*g.sub.n (x)=G.sub.n-1 (x)*g.sub.n (x) if the original user block had a first length, or (b) encoding the original user block by a linear and systematic secondary error protection block code defined by a generator polynomial G.sub.n-1 (x)=g.sub.0 (x) . . g.sub.n-1 (x) if the original user block had a second length which was greater than the first length, the error protection block being the same length whether the original user block which was encoded to produce it had the first length or the second length, the method comprising: decoding the error protection block in accordance with the secondary code to produce a first decoded block; detecting whether the first decoded block contains correct user data, and if it does, outputting the first decoded block as the user block; and decoding the error protection block in accordance with the primary code to produce a second decoded block if the first decoded block does not contain correct user data, and thereafter, outputting the second decoded block as the user block.
Claim 3
Dependent Claim
17 words
The decoding method as claimed in claim 1, wherein the primary and secondary codes are BCH codes.
Claim 4
Dependent Claim
250 words
A decoder for decoding an error protection block of extended data to produce a user block of user data, the error protection block having been produced by (a) encoding an original user block of user data by a linear and systematic primary error protection block code defined by a factorizable generator polynomial G.sub.n (x)=g.sub.0 (x) . . g.sub.n-1 (x)*g.sub.n (x)=G.sub.n-1 (x)*g.sub.n (x) if the original user block had a first length, or (b) encoding the original user block by a linear and systematic secondary error protection block code defined by a generator polynomial G.sub.n-1 (x)=g.sub.0 (x) . . g.sub.n-1 (x) if the original user block had a second length which was greater than the first length, the error protection block being the same length whether the original user block which was encoded to produce it had the first length or the second length, the method comprising: first decoding means for decoding the error protection block in accordance with the secondary code to produce a first decoded block; detection means for detecting whether the first decoded block contains correct user data; second decoding means for decoding the error protection block in accordance with the primary code to produce a second decoded block if the first decoded block does not contain correct user data; and means for outputting the first decoded block as the user block if it contains correct user data, or the second decoded block as the user block if the first decoded block does not contain correct user data.
Claim 5
Dependent Claim
250 words
A decoder for decoding an error protection block of extended data to produce a user block of user data, the error protection block having been produced by (a) encoding an original user block of user data by a linear and systematic primary error protection block code defined by a factorizable generator polynomial G.sub.n (x)=g.sub.0 (x) . . g.sub.n-1 (x)*g.sub.n (x)=G.sub.n-1 (x)*g.sub.n (x) if the original user block had a first length, or (b) encoding the original user block by a linear and systematic secondary error protection block code defined by a generator polynomial G.sub.n-1 (x)=g.sub.0 (x) . . g.sub.n-1 (x) if the original user block had a second length which was greater than the first length, the error protection block being the same length whether the original user block which was encoded to produce it had the first length or the second length, the method comprising: first decoding means for decoding the error protection block in accordance with the secondary code to produce a first decoded block; detection means for detecting whether the first decoded block contains correct user data; second decoding means for decoding the error protection block in accordance with the primary code to produce a second decoded block if the first decoded block does not contain correct user data; and means for outputting the first decoded block as the user block if it contains correct user data, or the second decoded block as the user block if the first decoded block does not contain correct user data.
Claim 6
Dependent Claim
31 words
The decoder as claimed in claim 3, further comprising control means for activating said first decoding means and said detection means in sequence and, if necessary, said second decoding means thereafter.
Claim 7
Dependent Claim
37 words
The decoder as claimed in claim 3, wherein said first decoding means is adapted to correct a first amount of errors and detect a second amount of errors which is greater than the first amount of errors.
Claim 8
Dependent Claim
17 words
The decoder as claimed in claim 3, wherein said first and second decoding means utilize common hardware.
Claim 9
Dependent Claim
16 words
The decoder as claimed in claim 3, wherein the primary and secondary codes are BCH codes.
Claim 10
Dependent Claim
252 words
A transmitter-receiver communication system, comprising: an encoder, including receiving means for receiving a user block of user data having either a first length or a second length, where the second length is greater than the first length; first encoding means for encoding the user block by a linear and systematic primary error protection block code defined by a factorizable generator polynomial G.sub.n (x)=g.sub.0 (x) . . g.sub.n-1 (x)*g.sub.n (x)=G.sub.n-1 (x)*g.sub.n (x) to produce the error protection block if the user block has the first length; and second encoding means for encoding the user block by a linear and systematic secondary error protection block code defined by a generator polynomial G.sub.n-1 (x)=g.sub.0 (x) . . g.sub.n-1 (x) to produce the error protection block if the user block has the second length; wherein the error protection block produced by either said first encoding means or said second encoding means has the same length; and a decoder, including: first decoding means for decoding the error protection block in accordance with the secondary code to produce a first decoded block; first detection means for detecting whether the first decoded block contains correct user data; second decoding means for decoding the error protection block in accordance with the primary code to produce a second decoded block if the first decoded block does not contain correct user data; and means for outputting the first decoded block if it contains correct user data or the second decoded block if the first decoded block does not contain correct user data.
Claim 11
Dependent Claim
252 words
A transmitter-receiver communication system, comprising: an encoder, including receiving means for receiving a user block of user data having either a first length or a second length, where the second length is greater than the first length; first encoding means for encoding the user block by a linear and systematic primary error protection block code defined by a factorizable generator polynomial G.sub.n (x)=g.sub.0 (x) . . g.sub.n-1 (x)*g.sub.n (x)=G.sub.n-1 (x)*g.sub.n (x) to produce the error protection block if the user block has the first length; and second encoding means for encoding the user block by a linear and systematic secondary error protection block code defined by a generator polynomial G.sub.n-1 (x)=g.sub.0 (x) . . g.sub.n-1 (x) to produce the error protection block if the user block has the second length; wherein the error protection block produced by either said first encoding means or said second encoding means has the same length; and a decoder, including: first decoding means for decoding the error protection block in accordance with the secondary code to produce a first decoded block; first detection means for detecting whether the first decoded block contains correct user data; second decoding means for decoding the error protection block in accordance with the primary code to produce a second decoded block if the first decoded block does not contain correct user data; and means for outputting the first decoded block if it contains correct user data or the second decoded block if the first decoded block does not contain correct user data.
Claim 12
Dependent Claim
62 words
The system as claimed in claim 8, further comprising a set of spatially distributed transmitter stations collectively fed by said receiving means, wherein said first encoding means is situated in each of a first subset of said set and said second encoding means is situated in each of a second subset of said set, said first and second subsets being mutually exclusive.
Claim 13
Dependent Claim
62 words
The system as claimed in claim 8, further comprising a set of spatially distributed transmitter stations collectively fed by said receiving means, wherein said first encoding means is situated in each of a first subset of said set and said second encoding means is situated in each of a second subset of said set, said first and second subsets being mutually overlapping.
Claim 14
Dependent Claim
16 words
The system as claimed in claim 8, wherein the primary and secondary codes are BCH codes.
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) | 1999-07-23 | 2000-01-22 | 2000-07-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-07-23 | 2004-01-22 | 2004-07-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-07-23 | 2008-01-22 | 2008-07-23 | $7700.00 | Window Closed / Lapsed |