Patent US5999566A successfully refreshed from Google Patents.
US5999566A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for providing error-tolerant communication of information
Assignee: Nokia of America Corp
•
Filing: 1996-09-19
•
Granted: 1999-12-07
•
Expires: 2016-09-19
Abstract
Abstract The device and method according to the present invention permute the order of signals representing information intended for transmission over a communication medium. The signal ordering is permuted prior to or at the time of transmission over the communication medium such that when the information or data is transmitted in the permuted order, it is more tolerant to data corrupting defects, such as a faulty communications line, or events, such as an electromagnetic pulse, that exist or may occur during the communication process.
Inventors
- 👤 Jeffrey C. Lagarias
- 👤 Nuggehally S. Jayant
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 15:35
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/004; H04L1/0056; H04L1/0071; H04L1/0041
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
189 words
A method for providing error-tolerant communication of information comprising the steps of: partitioning said information into groups, at least one of said groups is represented by a plurality of samples in consecutive time order and being suitable for transmission over a communication medium; arranging said plurality of samples in a permuted order; transmitting said permuted samples of said consecutive samples of said at least one of said groups to a storage medium in response to at least one clock pulse of a clock signal; storing said permuted samples of said consecutive samples of said at least one of said groups in said storage medium having different columns and rows of M×N storage sites where neighboring samples of said consecutive samples occupy different rows and columns of said M×N storage sites; accessing said plurality of samples in one of a column-by-column and a row-by-row method from said storage medium according to at least one communication protocol or timing arrangement; and transmitting said plurality of samples in said permuted order according to said at least one communication protocol or timing arrangement whereby consecutive samples are transmitted nonconsecutively over said communication medium.
Claim 2
Independent Claim
189 words
A method for providing error-tolerant communication of information comprising the steps of: partitioning said information into groups, at least one of said groups is represented by a plurality of samples in consecutive time order and being suitable for transmission over a communication medium; arranging said plurality of samples in a permuted order; transmitting said permuted samples of said consecutive samples of said at least one of said groups to a storage medium in response to at least one clock pulse of a clock signal; storing said permuted samples of said consecutive samples of said at least one of said groups in said storage medium having different columns and rows of M×N storage sites where neighboring samples of said consecutive samples occupy different rows and columns of said M×N storage sites; accessing said plurality of samples in one of a column-by-column and a row-by-row method from said storage medium according to at least one communication protocol or timing arrangement; and transmitting said plurality of samples in said permuted order according to said at least one communication protocol or timing arrangement whereby consecutive samples are transmitted nonconsecutively over said communication medium.
Claim 3
Dependent Claim
46 words
The method according to claim 1, further including the steps of: receiving said plurality of samples transmitted over said communication medium; and reconstructing said at least one of said groups in said consecutive time order by rearranging said received plurality of samples in a de-permuting order.
Claim 4
Dependent Claim
45 words
The method according to claim 2, wherein said step of reconstructing said at least one of said groups from said received samples includes reconstructing samples in said consecutive time order despite the existence of defects or events which cause data corruption in said communication medium.
Claim 5
Dependent Claim
13 words
The method of claim 1, wherein M and N are the same dimension.
Claim 6
Dependent Claim
193 words
A circuit for providing error-tolerant communication of digital signals over a communication medium, said circuit comprising: a storage medium having at least one area definable by M×N storage sites; means for time ordering said digital signals into S consecutive samples, S being equal to M×N; a permutator for permuting said time ordering of said S consecutive samples; means for transmitting said S permuted samples to said storage medium in response to at least one clock pulse of a clock signal; means for storing each of said S permuted samples in different M×N storage sites of said storage medium where neighboring samples of said S consecutive samples occupy different rows and columns of said M×N storage sites; means for accessing said permuted samples of said S consecutive samples from said storage medium in one of a column-by-column and a row-by-row method according to at least one communication protocol or timing arrangement and transmitting said permuted samples of said S consecutive samples over said communication medium according to said at least one communication protocol or timing arrangement, wherein neighboring samples of said S consecutive samples are transmitted in non-neighboring time slots over said communication medium.
Claim 7
Dependent Claim
193 words
A circuit for providing error-tolerant communication of digital signals over a communication medium, said circuit comprising: a storage medium having at least one area definable by M×N storage sites; means for time ordering said digital signals into S consecutive samples, S being equal to M×N; a permutator for permuting said time ordering of said S consecutive samples; means for transmitting said S permuted samples to said storage medium in response to at least one clock pulse of a clock signal; means for storing each of said S permuted samples in different M×N storage sites of said storage medium where neighboring samples of said S consecutive samples occupy different rows and columns of said M×N storage sites; means for accessing said permuted samples of said S consecutive samples from said storage medium in one of a column-by-column and a row-by-row method according to at least one communication protocol or timing arrangement and transmitting said permuted samples of said S consecutive samples over said communication medium according to said at least one communication protocol or timing arrangement, wherein neighboring samples of said S consecutive samples are transmitted in non-neighboring time slots over said communication medium.
Claim 8
Dependent Claim
30 words
The circuit according to claim 5, wherein said permutator permutes said S consecutive samples in an order defined by a Manhattan distance of at least 2 between any neighboring samples.
Claim 9
Dependent Claim
36 words
The circuit according to claim 5, further including a decoder for receiving said S samples transmitted over said communication medium and for decoding said permuted order for reconstructing said time ordering of said S successive samples.
Claim 10
Dependent Claim
48 words
The circuit according to claim 5, wherein said permutator permutes said S consecutive samples in an order which provides storage of neighboring samples in said storage medium having different rows and columns of said M×N storage sites before said S consecutive samples are transmitted over said communication medium.
Claim 11
Dependent Claim
14 words
The circuit according to claim 5, wherein M and N are the same dimension.
Claim 12
Independent Claim
141 words
A method for providing error-tolerant communication of information, said method comprising the steps of: partitioning said information into a plurality of signals, each suitable for transmission over a communication medium, said plurality of signals being in consecutive time order; permuting said plurality of signals; transmitting said plurality of signals to a storage medium in response to at least one clock pulse of a clock signal; storing said consecutive signals in different rows and columns of M×N storage sites of said storage medium where neighboring samples of said consecutive signals occupy different rows and columns of said M×N storage sites; and accessing and transmitting said plurality of signals stored in rows and columns over said communication medium in one of a column-by-column and a row-by-row method according to at least one communication protocol or timing arrangement wherein consecutive signals are transmitted nonconsecutively.
Claim 13
Independent Claim
141 words
A method for providing error-tolerant communication of information, said method comprising the steps of: partitioning said information into a plurality of signals, each suitable for transmission over a communication medium, said plurality of signals being in consecutive time order; permuting said plurality of signals; transmitting said plurality of signals to a storage medium in response to at least one clock pulse of a clock signal; storing said consecutive signals in different rows and columns of M×N storage sites of said storage medium where neighboring samples of said consecutive signals occupy different rows and columns of said M×N storage sites; and accessing and transmitting said plurality of signals stored in rows and columns over said communication medium in one of a column-by-column and a row-by-row method according to at least one communication protocol or timing arrangement wherein consecutive signals are transmitted nonconsecutively.
Claim 14
Dependent Claim
19 words
The method according to claim 10, wherein said M×N storage sites have a Manhattan distance of at least two.
Claim 15
Dependent Claim
28 words
The method according to claim 10, further including the steps of: receiving signals transmitted over said communication medium; and de-permuting said signals received into said consecutive time order.
Claim 16
Dependent Claim
14 words
The method according to claim 11, wherein M and N are the same dimension.
References Cited (Backward Citations)
US3679977A
Cited
US3700819A
Cited
US4100374A
Cited
US5056112A
Cited
US5295159A
Cited
US5384722A
Cited
US5438293A
Cited
US5506848A
Cited
US5594435A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-12-06 | 2003-06-07 | 2003-12-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-12-06 | 2007-06-07 | 2007-12-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-12-06 | 2011-06-07 | 2011-12-07 | $7700.00 | Window Closed / Lapsed |