Patent US5729560A successfully refreshed from Google Patents.
US5729560A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and coding means for protected transmission of data on the basis of multi-component coding
Assignee: Nokia Solutions and Networks GmbH and Co KG
•
Filing: 1996-06-12
•
Granted: 1998-03-17
•
Expires: 2016-06-12
Abstract
Abstract Method for protected transmission of data with multi-component coding, whereby a non-uniform error protection is achieved by selection of important bits or bit sequences from an information sequence (I), the bit sequences being supplied to further component coders (COD1 through COD3).
Inventors
- 👤 Joachim Hagenauer
- 👤 Frank Burkert
- 👤 Martin Werner
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 14:11
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/004; H04L1/0056; H04L1/0064; H04L1/0066; H03; H03M; H03M13/00; H03M13/03; H03M13/05; H03M13/09; H03M13/098; H03M13/27; H03M13/2771; H03M13/35; H04L1/0001; H04L1/0009; H04L1/007; H04L1/0071; H04L1/0023; H04L1/0026; H04L1/12; H04L2001/0098
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
71 words
A method for protected transmission of information with multi-component coding, comprising the steps of: supplying chained information sequences to a plurality of component coders, said chained information sequences having code symbols; selecting important bits or bit sequences from the information sequences according to a selection algorithm; supplying said selected important bits or bit sequences to further component coders; and protecting said selected important bits or bit sequences with further component codes.
Claim 2
Independent Claim
71 words
A method for protected transmission of information with multi-component coding, comprising the steps of: supplying chained information sequences to a plurality of component coders, said chained information sequences having code symbols; selecting important bits or bit sequences from the information sequences according to a selection algorithm; supplying said selected important bits or bit sequences to further component coders; and protecting said selected important bits or bit sequences with further component codes.
Claim 3
Dependent Claim
20 words
The method according to claim 1, wherein the selection algorithm for the important bits is modifiable according to different demands.
Claim 4
Dependent Claim
17 words
The method according to claim 1, wherein the selected bits or bit sequences are conducted via interleavers.
Claim 5
Dependent Claim
15 words
The method according to claim 3, wherein a scrambling length of the interleavers is controllable.
Claim 6
Dependent Claim
14 words
The method according to claim 1, wherein convolution codes are employed as component codes.
Claim 7
Dependent Claim
16 words
The method according to claim 1, wherein single-parity check codes are employed as further component codes.
Claim 8
Dependent Claim
24 words
The method according to claim 1, wherein a different plurality of code symbols are selected from the coded code sequences for different changing demands.
Claim 9
Dependent Claim
26 words
The method according to claim 1, wherein redundancy is non-uniformly distributed over the information bits by dynamic selection of code symbols from the coded code sequences.
Claim 10
Dependent Claim
87 words
A coder apparatus for generating a multi-component code for an information sequence having important bits or bit sequences, comprising: a plurality of first component coders for receiving the information sequence; a plurality of filters also for receiving the information sequence; a plurality of second component coders respectively connected to said plurality of filters, said filters functioning as selection circuits for selecting bits from the important bits or sequence of bits; wherein the plurality of first and second component coders generate a multi-component code for the information sequence.
Claim 11
Dependent Claim
87 words
A coder apparatus for generating a multi-component code for an information sequence having important bits or bit sequences, comprising: a plurality of first component coders for receiving the information sequence; a plurality of filters also for receiving the information sequence; a plurality of second component coders respectively connected to said plurality of filters, said filters functioning as selection circuits for selecting bits from the important bits or sequence of bits; wherein the plurality of first and second component coders generate a multi-component code for the information sequence.
Claim 12
Dependent Claim
86 words
A decoder apparatus for decoding a multi-component code of an information sequence having important bits and bit sequences, comprising: a plurality of first component decoders for receiving the information sequence; a plurality of filters also for receiving the information sequence; a plurality of second component decoders respectively connected to said plurality of filters, said filters functioning as selection circuits for selecting bits from the important bits or sequence of bits; wherein the plurality of first and second component decoders effect a decoding of the information sequence.
Claim 13
Dependent Claim
86 words
A decoder apparatus for decoding a multi-component code of an information sequence having important bits and bit sequences, comprising: a plurality of first component decoders for receiving the information sequence; a plurality of filters also for receiving the information sequence; a plurality of second component decoders respectively connected to said plurality of filters, said filters functioning as selection circuits for selecting bits from the important bits or sequence of bits; wherein the plurality of first and second component decoders effect a decoding of the information sequence.
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-03-16 | 2001-09-15 | 2002-03-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-03-16 | 2005-09-15 | 2006-03-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-03-16 | 2009-09-15 | 2010-03-17 | $7700.00 | Window Closed / Lapsed |