US3821527A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for walsh function filtering
Assignee: Bunker Ramo Corp
•
Filing: 1971-10-04
•
Granted: 1974-06-28
•
Expires: 1991-10-04
Abstract
Abstract A method and apparatus for generating running Walsh series expansion coefficients and for utilizing these coefficients to perform Walsh function filtering. An input signal is sampled, and the N most recent sampled values are commutatively stored. The stored sampled values are operated upon by a suitable means to generate N Walsh coefficients of the sampled input. Each of the generated Walsh coefficients is multiplied (-1)n. The outputs from the multipliers are the N running Walsh coefficients for the received input. The weighted sum of the outputs from the multipliers may also be formed. By controlling the weighting values, digital filtering may be performed.
Inventors
- 👤 G Kang
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 01:29
CPC Classifications
H; H03; H03H; H03H17/00; H03H17/02; H03H17/0211; G; G06; G06F; G06F17/00; G06F17/10; G06F17/14; G06F17/145
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
93 words
A Walsh function filter comprising: means for sequentially sampling an input signal at a Nyquist rate; means for storing the N most recent of the samples; means operative at times corresponding to the sampling by said sampling means for utilizing said stored sampled values for generating N Walsh coefficients of the sampled input signal; means for multiplying each generated nth Walsh coefficient by (1)n, n being an indexing integer having the values 0, 1, 2, . . . N-1; and means for forming the weighted sum of the outputs from said multiplying means.
Claim 2
Dependent Claim
93 words
A Walsh function filter comprising: means for sequentially sampling an input signal at a Nyquist rate; means for storing the N most recent of the samples; means operative at times corresponding to the sampling by said sampling means for utilizing said stored sampled values for generating N Walsh coefficients of the sampled input signal; means for multiplying each generated nth Walsh coefficient by (1)n, n being an indexing integer having the values 0, 1, 2, . . . N-1; and means for forming the weighted sum of the outputs from said multiplying means.
Claim 3
Dependent Claim
24 words
A filter of the type described in claim 1 wherein said weighted sum forming means includes means for independently weighting each multiplying means output.
Claim 4
Dependent Claim
21 words
A filter of the type described in claim 1 wherein said Walsh coefficients generating means is a fast Walsh transform circuit.
Claim 5
Dependent Claim
99 words
A circuit for generating the nth running Walsh filter coefficient of an input signal comprising: means for sequentially sampling the input signal at a Nyquist rate; means for storing the N most recent of the samples; means operative at times corresponding to the sampling by said sampling means for utilizing said stored sampled values to generate the nth Walsh coefficient of the input signal for the time window represented by the N-1 stored samples, n being an indexing integer having the values 0, 1, 2 . . . N; and means for multiplying each generated Walsh coefficient by (-1)n.
Claim 6
Dependent Claim
99 words
A circuit for generating the nth running Walsh filter coefficient of an input signal comprising: means for sequentially sampling the input signal at a Nyquist rate; means for storing the N most recent of the samples; means operative at times corresponding to the sampling by said sampling means for utilizing said stored sampled values to generate the nth Walsh coefficient of the input signal for the time window represented by the N-1 stored samples, n being an indexing integer having the values 0, 1, 2 . . . N; and means for multiplying each generated Walsh coefficient by (-1)n.
Claim 7
Dependent Claim
21 words
A filter of the type described in claim 4 wherein said Walsh coefficients generating means is a fast Walsh transform circuit.
Claim 8
Dependent Claim
90 words
A circuit for generating the nth running Walsh filter coefficient of an input signal comprising: means for sequentially sampling said input signal at a Nyquist rate so as to provide N input signal samples where n is an indexing integer having the values 0, 1, 2 . . . N-1; and means operative during each sampling interVal for performing convolution summation between the nth Walsh function and said sampled input signal, each of said summations yielding the nth Walsh filter coefficient for a selected time window of said input signal.
Claim 9
Dependent Claim
90 words
A circuit for generating the nth running Walsh filter coefficient of an input signal comprising: means for sequentially sampling said input signal at a Nyquist rate so as to provide N input signal samples where n is an indexing integer having the values 0, 1, 2 . . . N-1; and means operative during each sampling interVal for performing convolution summation between the nth Walsh function and said sampled input signal, each of said summations yielding the nth Walsh filter coefficient for a selected time window of said input signal.
Claim 10
Dependent Claim
27 words
A circuit of the type described in claim 6 including means for commutatively storing the most recent of said N samples, said samples defining said time window.
Claim 11
Dependent Claim
37 words
A filter of the type described in claim 6 wherein said means for performing convolution summation includes means for generating N Walsh coefficients of the sampled input, and means for multiplying each generated Walsh coefficient by (-1)n.
Claim 12
Dependent Claim
61 words
A Walsh function filter comprising: means for sequentially sampling an input signal at a Nyquist rate; means operative during each sampling interval for performing convolution summation between a corresponding set of Walsh functions and said sampled input signal, each of said summations yielding a set of coefficients; and means for forming the weighted sum of each of said sets of coefficients.
Claim 13
Dependent Claim
61 words
A Walsh function filter comprising: means for sequentially sampling an input signal at a Nyquist rate; means operative during each sampling interval for performing convolution summation between a corresponding set of Walsh functions and said sampled input signal, each of said summations yielding a set of coefficients; and means for forming the weighted sum of each of said sets of coefficients.
Claim 14
Dependent Claim
28 words
A filter of the type described in claim 9 wherein said weighted sum forming means includes means for independently weighting each coefficient yielded by said convolution summation means.
Claim 15
Dependent Claim
52 words
A filter of the type described in claim 9 wherein said convolution summation means includes means for generating N Walsh coefficients of the sampled input, and means for multiplying each generated nth Walsh coefficient by (-1)n where n is an indexing integer having the values 0, 1, 2 . . . N-1.
Claim 16
Dependent Claim
21 words
A filter of the type described in claim 9 including means for commutatively storing the N most recent of said samples.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1977-06-27 | 1977-12-27 | 1978-06-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1981-06-27 | 1981-12-27 | 1982-06-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1985-06-27 | 1985-12-27 | 1986-06-28 | $7700.00 | Window Closed / Lapsed |