Patent US4394642A successfully refreshed from Google Patents.
US4394642A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus for interleaving and de-interleaving data
Assignee: Unisys Corp
•
Filing: 1981-09-21
•
Granted: 1983-07-19
•
Expires: 2001-09-21
Abstract
Abstract A novel interleaver-de-interleaver is provided which is adapted to store bits of a data stream after being error encoded. The data bits are stored in a random access memory in addresses identifiable by an array of columns and rows. The interleaver comprises address pointer means and logic for reading the data bits out of the memory addresses in a predetermined reordered sequence to provide a quasi-random pattern sequence of data bits which when transmitted are substantially immune to periodic bursts of radio frequency interference signals.
Inventors
- 👤 Robert J. Currie
- 👤 Glen D. Rattlingourd
- 👤 Billie M. Spencer
- 👤 John W. Zscheile, Jr.
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 14:20
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/76; H; H03; H03M; H03M13/00; H03M13/27; H03M13/2703; H03M13/271; H03M13/2782; H03M13/2785
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
245 words
A data transmitting system of the type having an interleaver for changing the order of data bits in a data stream to be transmitted comprising: a data source for providing a stream of data bits to be transmitted, interleaver means coupled to said stream of data bits, transmitter means coupled to said interleaver means for transmitting said data bits in a quasi-random pattern sequence, said interleaver means comprising buffer memory means for storing a block of said stream of said data bits in a predetermined sequential pattern of memory addresses, said addresses being definable in terms of an array of columns and rows, first address pointer means coupled to said buffer memory means for generating said predetermined pattern of memory addresses and for storing said data bits in said buffer memory means in rows, second address pointer means coupled to said buffer memory means for generating a predetermined quasi-random pattern of memory addresses and for reading said stored data bits out of said buffer memory means by columns, said predetermined quasi-random pattern of memory addresses being generated by a predetermined rotation of bits within columns, and control means coupled to said buffer memory means and said first and second pointer means for alternately storing said stream of data bits into said buffer memory means as rows of data bits and for reading said stored data bits out of said buffer memory means as columns of data bits in a predetermined quasi-random stream of data bits.
Claim 2
Dependent Claim
245 words
A data transmitting system of the type having an interleaver for changing the order of data bits in a data stream to be transmitted comprising: a data source for providing a stream of data bits to be transmitted, interleaver means coupled to said stream of data bits, transmitter means coupled to said interleaver means for transmitting said data bits in a quasi-random pattern sequence, said interleaver means comprising buffer memory means for storing a block of said stream of said data bits in a predetermined sequential pattern of memory addresses, said addresses being definable in terms of an array of columns and rows, first address pointer means coupled to said buffer memory means for generating said predetermined pattern of memory addresses and for storing said data bits in said buffer memory means in rows, second address pointer means coupled to said buffer memory means for generating a predetermined quasi-random pattern of memory addresses and for reading said stored data bits out of said buffer memory means by columns, said predetermined quasi-random pattern of memory addresses being generated by a predetermined rotation of bits within columns, and control means coupled to said buffer memory means and said first and second pointer means for alternately storing said stream of data bits into said buffer memory means as rows of data bits and for reading said stored data bits out of said buffer memory means as columns of data bits in a predetermined quasi-random stream of data bits.
Claim 3
Dependent Claim
28 words
A data transmitting system as set forth in claim 1 which further includes generating said predetermined quasi-random pattern of memory addresses by further rotating said bits within rows.
Claim 4
Dependent Claim
32 words
A data transmitting system as set forth in claim 1 which further includes generating said predetermined quasi-random pattern of memory addresses by first rotating the order of said columns in said array.
Claim 5
Dependent Claim
38 words
A data transmitting system as set forth in claim 2 wherein the rotation of bits is a permutation in which the new position is equal to the old position plus one multiplied by one-half of the old position.
Claim 6
Dependent Claim
38 words
A data transmitting system as set forth in claim 3 wherein the rotation of columns is a permutation in which the new position is equal to the old position plus one multiplied by one-half of the old position.
Claim 7
Dependent Claim
27 words
A data transmitting system of the type set forth in claim 1 which comprises a forward error correction encoder coupled between said data source and said interleaver.
Claim 8
Dependent Claim
85 words
A data transmitting system of the type set forth in claim 6 which further includes; receiving means for receiving said transmitted quasi-random stream of data bits, de-interleaver means coupled to said receiving means for generating said stream of data bits in the same order as generated by said data source, and forward error correction decoding means coupled to said de-interleaving means coupled to said de-interleaving means for correcting bit errors in said stream of data bits introduced by a burst of high energy interference signals.
Claim 9
Dependent Claim
21 words
A data transmitting system of the type set forth in claim 1 wherein buffer memory means comprise a random access memory.
Claim 10
Dependent Claim
27 words
A data transmitting system of the type set forth in claim 8 wherein said first and second address pointers comprise a counter and a read only memory.
Claim 11
Dependent Claim
33 words
A data transmitting system of the type set forth in claim 9 wherein said counter is adapted to supply the same address to said random access memory and to said read only memory.
Claim 12
Dependent Claim
26 words
A data transmitting system of the type set forth in claim 10 wherein said read only memory is adapted to supply an address to said counter.
References Cited (Backward Citations)
US4281355A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1986-07-18 | 1987-01-17 | 1987-07-19 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1990-07-18 | 1991-01-17 | 1991-07-19 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1994-07-18 | 1995-01-17 | 1995-07-19 | $7700.00 | Window Closed / Lapsed |