US4542515A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Multilevel mate pair code compressor for codes expanded by the process of butting
Assignee: United States Department of the Army
•
Filing: 1983-11-14
•
Granted: 1985-09-17
•
Expires: 2003-11-14
Abstract
Abstract Multilevel code mates A and B expanded in accordance with the expression , b K and B=a K , b are compressed to a lobeless basic mate pair by repeatedly compressing corresponding code mate pairs in successive stages to provide diminishing codes of half the code length by amplifying the code mates by a predetermined amplification factor and then adding and subtracting the code mates in accordance with the expressions A i-1 =A i +B i K .sbsp.i and B i-1 =A i K .sbsp.i -B i where i is the i th compression stage and K i is the amplification factor applied to the codes A i and B i .
Inventors
- 👤 Frank S. Gutleber
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 17:34
CPC Classifications
H; H04; H04J; H04J13/00; H04J13/10; H04J13/102; H04J13/105; H04L; H04L23/00; H04L23/02; H04J13/0007; H04J2013/0037
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
218 words
A method of compressing a pair of multilevel expanded digital noise codes comprised of first and second multilevel code mates in successive multiple stages where the expanded noise codes are comprised of a predetermined number of code bits defining the code length of said code mates, comprising the steps of: at each stage, applying first and second multilevel expanded code mates; generating third and fourth multilevel code mates by respectively multiplying said first and second code mates by a predetermined gain factor, said predetermined gain factor being non-unity for at least one said each stage of said multiple stages; combining said first multilevel code mate with said fourth multilevel code mate in a first mathematical sense to form a first compressed code mate having a code length one half that of the preceding stage; combining said third multilevel code mate with said second multilevel code mate in a second mathematical sense to form a second compressed code mate also having a code length one half that of the preceding stage; and delaying said first compressed code mate by a time delay equal to said one half expanded code length prior to applying said first and second compressed code mates to the next stage whereby said compressed code mates become the expanded code mate for the said next stage.
Claim 2
Independent Claim
218 words
A method of compressing a pair of multilevel expanded digital noise codes comprised of first and second multilevel code mates in successive multiple stages where the expanded noise codes are comprised of a predetermined number of code bits defining the code length of said code mates, comprising the steps of: at each stage, applying first and second multilevel expanded code mates; generating third and fourth multilevel code mates by respectively multiplying said first and second code mates by a predetermined gain factor, said predetermined gain factor being non-unity for at least one said each stage of said multiple stages; combining said first multilevel code mate with said fourth multilevel code mate in a first mathematical sense to form a first compressed code mate having a code length one half that of the preceding stage; combining said third multilevel code mate with said second multilevel code mate in a second mathematical sense to form a second compressed code mate also having a code length one half that of the preceding stage; and delaying said first compressed code mate by a time delay equal to said one half expanded code length prior to applying said first and second compressed code mates to the next stage whereby said compressed code mates become the expanded code mate for the said next stage.
Claim 3
Dependent Claim
27 words
The method of claim 1 wherein said step of combining in a first mathematical sense comprises the step of adding said first and fourth multilevel code mates.
Claim 4
Dependent Claim
31 words
The method of claim 2 wherein said step of combining in a second mathematical sense comprises the step of subtracting said second multilevel code mate from said third multilevel code mate.
Claim 5
Dependent Claim
36 words
The method of claim 2 wherein said step of combining in a second mathematical sense comprises the step of generating the complement of said second multilevel code mate and adding it to said third code mate.
Claim 6
Dependent Claim
22 words
The method of claim 1 wherein said pair of multilevel noise codes comprise expanded code mates formed by butting code mate pairs.
Claim 7
Dependent Claim
16 words
The method of claim 5 wherein said code mate pair comprise equal length binary noise codes.
Claim 8
Dependent Claim
29 words
The method of claim 6 wherein said code mate pairs comprise noise codes wherein the pair of compressed code mates of the last stage comprise an impulse autocorrelation function.
Claim 9
Dependent Claim
34 words
The method of claim 7 and additionally including the step of adding compressed code mates out of the final stage to form a composite output signal comprised of an impulse autocorrelation function output signal.
Claim 10
Dependent Claim
90 words
The method of claim 1 and additionally including the steps of: generating a pair of multilevel noise codes comprised of said first and second multilevel code mates; multiplexing said pair of multilevel noise codes; modulating said multiplexed expanded noise codes of an RF carrier of communications apparatus and radiating said carrier; receiving and demodulating said carrier in communications apparatus to provide a multiplexed coded received signal; demultiplexing said received signal to provide respective coded signals of said pair of multilevel noise codes; and thereafter executing the above recited compression steps.
Claim 11
Dependent Claim
45 words
The method of claim 9 wherein said step of generating said pair of multilevel noise codes includes one or more steps of generating expanded code mate pairs generated by butting a code mate having a first amplitude with a code mate having a second amplitude.
Claim 12
Dependent Claim
39 words
The method of claim 1 wherein each stage comprises one of p successive stages which operate to compress N=2 p blocks of n code bits down to a last pair of code mate signals respectively comprising n bit signals.
Claim 13
Dependent Claim
218 words
Apparatus for compressing a pair of expanded noise codes comprised of first and second multilevel code mates and having a predetermined number of code bits defining the code length of said code mates, comprising: a plurality of series coupled compression stages, each stage including, means for generating third and fourth multilevel code mates respectively comprised of first and second multi-level input code mates multiplied by a predetermined gain factor, said predetermined gain factor being non-unity for at least one said each stage of said plurality of compression stages; means for combining said first multilevel code mate with said fourth multilevel code mate in a first manner to form a first compressed code mate having a code length one half that of the first and second multilevel input code mates; means for combining said third multilevel code mate with said second multilevel code mate in a second manner to form a second compressed code mate also having a code length one half that of the first and second input code mates; and means for delaying said first compressed code mate by a time delay equal to said one half expanded code length for providing a first output code mate coincident in time with said second compressed code mate, said second compressed code mate being a second output code mate.
Claim 14
Dependent Claim
218 words
Apparatus for compressing a pair of expanded noise codes comprised of first and second multilevel code mates and having a predetermined number of code bits defining the code length of said code mates, comprising: a plurality of series coupled compression stages, each stage including, means for generating third and fourth multilevel code mates respectively comprised of first and second multi-level input code mates multiplied by a predetermined gain factor, said predetermined gain factor being non-unity for at least one said each stage of said plurality of compression stages; means for combining said first multilevel code mate with said fourth multilevel code mate in a first manner to form a first compressed code mate having a code length one half that of the first and second multilevel input code mates; means for combining said third multilevel code mate with said second multilevel code mate in a second manner to form a second compressed code mate also having a code length one half that of the first and second input code mates; and means for delaying said first compressed code mate by a time delay equal to said one half expanded code length for providing a first output code mate coincident in time with said second compressed code mate, said second compressed code mate being a second output code mate.
Claim 15
Dependent Claim
31 words
The apparatus of claim 12 and wherein said means for combining in a first manner comprises means for linearly adding said first multilevel code mate with said fourth multilevel code mate.
Claim 16
Dependent Claim
30 words
The apparatus of claim 13 wherein said means for combining in a second manner comprises means for linearly subtracting said secnd multilevel code mate from said third multilevel code mate.
Claim 17
Dependent Claim
45 words
The apparatus of claim 13 wherein said means for combining in a second manner comprises means for generating the complement of said second multilevel code mate, and means for linearly adding said third multilevel code mate to said complement of said second multilevel code mate.
Claim 18
Dependent Claim
17 words
The apparatus of claim 12 wherein said pair of code mates comprise equal length binary noise codes.
Claim 19
Dependent Claim
26 words
The apparatus of claim 12 wherein said pair of multilevel noise codes comprise noise codes producing impulse autocorrelation functions when compressed to a single code bit.
Claim 20
Dependent Claim
36 words
The apparatus of claim 12 wherein said pair of multilevel noise codes comprise expanded multibit code mates generated by butting one code mate having a first amplitude with the other code mate having a second amplitude.
Claim 21
Dependent Claim
99 words
The apparatus of claim 12 and further comprising: means for generating said pair of expanded multilevel noise codes; means for multiplexing said pair of multilevel noise codes; communications apparatus including means for modulating said multiplexed expanded noise codes on an RF carrier and radiating said carrier; communications apparatus including means for receiving and demodulating said carrier to provide a multiplexed coded receive signal; means for demultiplexing said received signal to provide respective coded signals of said pair of expanded multilevel noise codes, and means coupling said demultiplexed multilevel noise codes to the first of said plurality of compression stages.
Claim 22
Dependent Claim
36 words
The apparatus of claim 19 wherein said means for generating said pair of extended multilevel noise codes includes means for generating and butting multilevel code mate pairs to form said first and second multilevel code mates.
Claim 23
Dependent Claim
42 words
The apparatus of claim 19 and additionally including linear adder means coupled to the final stage of said plurality of compression stages for combining said first and second compressed output code mates to generate an output signal comprising an impulse autocorrelation function.
References Cited (Backward Citations)
US3519746A
Cited
US3461451A
Cited
US3634765A
Cited
US3751596A
Cited
US4293953A
Cited
US4471342A
Cited
US4511885A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1988-09-16 | 1989-03-18 | 1989-09-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-09-16 | 1993-03-18 | 1993-09-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-09-16 | 1997-03-18 | 1997-09-17 | $7700.00 | Window Closed / Lapsed |