Patent US4633426A successfully refreshed from Google Patents.
US4633426A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for detecting a binary convoluted coded signal
Assignee: Department of National Defence
•
Filing: 1984-08-31
•
Granted: 1986-12-30
•
Expires: 2004-08-31
Abstract
Abstract A method and apparatus are disclosed for detecting, in a plurality of stages of a matched filter, a binary convoluted coded signal having a plurality of code levels ranging from a low level, high repetition rate code to a high level, low repetition rate code, in which each filter stage of the matched filter is used to store elements of the convoluted coded signal in a memory such as a tapped delay line. The stored code is then tapped at intervals defined by the convoluted code to obtain a set of samples. The samples are then multiplied, each with a polarity coefficient determined by the convoluted code level at the tap locations resulting in translated samples. The samples are then summed in an adder to obtain an output signal. The output is connected to the input of the memory of a next filter stage of the matched filter and the sequence is continued for all the code levels in the signal.
Inventors
- 👤 Gerald O. Venier
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 22:29
CPC Classifications
H; H03; H03H; H03H17/00; H03H17/02; H03H17/0248; H03H17/0254
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
130 words
A matched filter, having a plurality of filter stages, for processing a binary convoluted code having a plurality of code levels ranging from a low level, high repetition rate code to a high level, low repetition rate code, said filter stages comprising: a. means for storing the elements of a convoluted coded input signal; b. means for tapping the stored elements at intervals defined by a specified convoluted code level to obtain a set of samples; c. means for multiplying the samples, each with a polarity coefficient corresponding to the polarity of a related convoluted code element to obtain translated samples; d. means for summing the translated samples to obtain an output signal, said summing means being connected to the input of the storing means of a next filter stage.
Claim 2
Dependent Claim
130 words
A matched filter, having a plurality of filter stages, for processing a binary convoluted code having a plurality of code levels ranging from a low level, high repetition rate code to a high level, low repetition rate code, said filter stages comprising: a. means for storing the elements of a convoluted coded input signal; b. means for tapping the stored elements at intervals defined by a specified convoluted code level to obtain a set of samples; c. means for multiplying the samples, each with a polarity coefficient corresponding to the polarity of a related convoluted code element to obtain translated samples; d. means for summing the translated samples to obtain an output signal, said summing means being connected to the input of the storing means of a next filter stage.
Claim 3
Dependent Claim
66 words
A matched filter as defined in claim 1, wherein said filter stages comprise a first filter stage for processing a binary phase coded signal corresponding to the high level, low repetition rate code and a second filter stage for processing a binary phase coded signal corresponding to the low level, high repetition rate code and having its input connected to the output of the first stage.
Claim 4
Dependent Claim
41 words
A matched filter as defined in claim 2 further comprising a third filter stage for processing a binary phase coded signal corresponding to a lower level, higher repetition rate code having its input connected to the output of the second stage.
Claim 5
Dependent Claim
18 words
A matched filter as defined in claim 1 in which the storing means are each analog shift registers.
Claim 6
Dependent Claim
18 words
A matched filter as defined in claim 4 in which each shift register is a charge coupled device.
Claim 7
Dependent Claim
22 words
A matched filter as defined in claim 1 in which each of the storing means is comprised of a tapped delay line.
Claim 8
Dependent Claim
22 words
A matched filter as defined in claim 1 in which each of the storing means is comprised of a digital shift register.
Claim 9
Dependent Claim
25 words
A matched filter as defined in claim 1, in which the tapping means is adapted to provide quantized representations of said samples with predetermined resolution.
Claim 10
Dependent Claim
35 words
A matched filter as defined in claim 8, in which the storing means are comprised of a random access memory adapted to store binary bits of digital words representing the quantized representations of said samples.
Claim 11
Dependent Claim
117 words
A matched filter for a binary convoluted code having code levels ranging from a low level, high repetition rate code to a high level, low repetition rate code, comprising a plurality of filter stages for processing at a first stage, a binary phase coded signal corresponding to a high level, low repetition rate code, at a second stage, a binary phase coded signal corresponding to a low level, high repetition rate code and, at a last stage, a binary phase coded signal corresponding to a lower level, higher repetition rate code having its input connected to the output of the second stage, and means for carrying an output signal at the output of said last filter stage.
Claim 12
Dependent Claim
117 words
A matched filter for a binary convoluted code having code levels ranging from a low level, high repetition rate code to a high level, low repetition rate code, comprising a plurality of filter stages for processing at a first stage, a binary phase coded signal corresponding to a high level, low repetition rate code, at a second stage, a binary phase coded signal corresponding to a low level, high repetition rate code and, at a last stage, a binary phase coded signal corresponding to a lower level, higher repetition rate code having its input connected to the output of the second stage, and means for carrying an output signal at the output of said last filter stage.
Claim 13
Dependent Claim
35 words
A matched filter as defined in claim 10, in which each of said filter stages are comprised of digital shift registers, each adapted to store elements of a corresponding code level in parallel binary code.
Claim 14
Dependent Claim
38 words
A matched filter as defined in claim 10, in which each of said filter stages are comprised of delay lines each adapted to store the elements of a corresponding code level, less one element of that code level.
Claim 15
Independent Claim
115 words
A method of detecting, in a plurality of stages, a convoluted coded signal having a plurality of code levels ranging from a low level, high repetition rate code to a high level, low repetition rate code comprising the steps of: a. storing the elements of the convoluted coded signal, b. tapping the stored elements at intervals defined by a specified convoluted code level to obtain a set of samples, c. multiplying the samples, each with a polarity coefficient determined by the polarity of a related convoluted code element to obtain translated samples, d. summing the translated samples to obtain an output signal, e. carrying the output signal to the input of a next filter stage.
Claim 16
Independent Claim
115 words
A method of detecting, in a plurality of stages, a convoluted coded signal having a plurality of code levels ranging from a low level, high repetition rate code to a high level, low repetition rate code comprising the steps of: a. storing the elements of the convoluted coded signal, b. tapping the stored elements at intervals defined by a specified convoluted code level to obtain a set of samples, c. multiplying the samples, each with a polarity coefficient determined by the polarity of a related convoluted code element to obtain translated samples, d. summing the translated samples to obtain an output signal, e. carrying the output signal to the input of a next filter stage.
Claim 17
Independent Claim
134 words
A method of detecting, in a plurality of stages, a convoluted coded signal having a plurality of code levels ranging from a low level, high repetition rate code to a high level, low repetition rate code comprising the steps of: a. separating in-phase and quadrature components of a convoluted coded signal, b. separately storing the elements of the components of the convoluted coded signals, c. tapping the stored elements at intervals defined by a specified convoluted code level to obtain two sets of samples, d. multiplying the samples, each with a polarity coefficient determined by the polarity of a related convoluted code element to obtain two sets of translated samples, e. separately summing the two sets of translated samples to obtain output signals, and f. combining the sums to obtain a complex output signal.
Claim 18
Independent Claim
134 words
A method of detecting, in a plurality of stages, a convoluted coded signal having a plurality of code levels ranging from a low level, high repetition rate code to a high level, low repetition rate code comprising the steps of: a. separating in-phase and quadrature components of a convoluted coded signal, b. separately storing the elements of the components of the convoluted coded signals, c. tapping the stored elements at intervals defined by a specified convoluted code level to obtain two sets of samples, d. multiplying the samples, each with a polarity coefficient determined by the polarity of a related convoluted code element to obtain two sets of translated samples, e. separately summing the two sets of translated samples to obtain output signals, and f. combining the sums to obtain a complex output signal.
References Cited (Backward Citations)
US2124599A
Cited
US3270188A
Cited
US3624562A
Cited
US3631232A
Cited
US3818348A
Cited
US3997973A
Cited
US3890618A
Cited
US3899666A
Cited
US4100378A
Cited
US4088960A
Cited
US4120035A
Cited
US4264983A
Cited
US4243958A
Cited
US4412301A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1989-12-29 | 1990-06-30 | 1990-12-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1993-12-29 | 1994-06-30 | 1994-12-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1997-12-29 | 1998-06-30 | 1998-12-30 | $7700.00 | Window Closed / Lapsed |