Patent US5050119A successfully refreshed from Google Patents.
US5050119A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Optimized sparse transversal filter
Assignee: Philips North America LLC
•
Filing: 1989-10-06
•
Granted: 1991-09-17
•
Expires: 2009-10-06
Abstract
Abstract A transversal filter has more delay elements than adjustable multipliers, and a switching arrangement for supplying each multiplier with the signal from a selected one of a group of the elements. Each element is a member of one of the groups. The outputs of the multipliers are added, and their sum is used to control optimization of the multiplier weights for a given set of switched connections. Successive sets of connections are established to develop sets of optimized weights, until each delay element output has been used. A globally optimized set of connections and weights is then used for processing information.
Inventors
- 👤 Charles A. Lish
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-07 19:26
CPC Classifications
H; H03; H03H; H03H21/00; H03H21/0012; H04; H04N; H04N5/00; H04N5/14; H04N5/21; H04N5/211
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
174 words
A method of optimizing a sparse transversal filter for processing information, said filter having M taps and N multipliers where N<M, said method comprising: providing a plurality of selectable connection paths between a plurality of said N multipliers and a greater plurality of said M taps, selecting a first set of connection paths from said plurality of selectable connection paths, wherein each multiplier is connected to a respective tap, establishing initial multiplier values of each multiplier for that first set, and summing outputs of the multipliers to determine the response of said filter with said first set of connection paths and said initial multiplier values, optimizing first multiplier values of each multiplier with said first set of connection paths, storing information defining the first multiplier values and said first set, repeating the steps of selecting, establishing, summing, optimizing and storing until all of the taps have been utilized, combining the stored information to define a globally optimum set and N multiplier values, and processing information using said globally optimum set and N multiplier values.
Claim 2
Independent Claim
174 words
A method of optimizing a sparse transversal filter for processing information, said filter having M taps and N multipliers where N<M, said method comprising: providing a plurality of selectable connection paths between a plurality of said N multipliers and a greater plurality of said M taps, selecting a first set of connection paths from said plurality of selectable connection paths, wherein each multiplier is connected to a respective tap, establishing initial multiplier values of each multiplier for that first set, and summing outputs of the multipliers to determine the response of said filter with said first set of connection paths and said initial multiplier values, optimizing first multiplier values of each multiplier with said first set of connection paths, storing information defining the first multiplier values and said first set, repeating the steps of selecting, establishing, summing, optimizing and storing until all of the taps have been utilized, combining the stored information to define a globally optimum set and N multiplier values, and processing information using said globally optimum set and N multiplier values.
Claim 3
Dependent Claim
60 words
A method of optimizing a sparse transversal filter according to claim 1, wherein M=kN and k is an integer; the step of selecting a first carried out by distributing the N multipliers evenly over the first of every kN taps; and successive steps of selecting are carried out by advancing the position of each of the multipliers by one tap.
Claim 4
Dependent Claim
33 words
A method of optimizing a sparse transversal filter according to claim 2, further comprising: adjusting the globally optimum multiplier values to minimize the error between the filter output signal and a reference signal.
Claim 5
Dependent Claim
33 words
A method of optimizing a sparse transversal filter according to claim 1, further comprising: adjusting the globally optimum multiplier values to minimize the error between the filter output signal and a reference signal.
Claim 6
Dependent Claim
166 words
An optimum sparse transversal filter, comprising: a plurality of M delay elements connected in series for receiving a filter input signal; a plurality of N multipliers, each having a respective weight W, where N<M; means for selectively connecting each multiplier, respectively, to a selected one of a respective group of k of said delay elements, for each group k being an integer greater than 1, each delay element being a member of one only of said groups, summing means for summing the outputs of said multipliers for developing a filter output signal; means for optimizing the respective weights W of said multipliers to optimize said filter according to a predetermined criterion; means for storing values of the respective weights and connections; means for changing the selection of connections of said multipliers to different delay elements of the respective groups, and for optimizing and storing values of the changed respective weights and connections; and means for determining a globally optimum set of connections and respective multiplier values.
Claim 7
Dependent Claim
166 words
An optimum sparse transversal filter, comprising: a plurality of M delay elements connected in series for receiving a filter input signal; a plurality of N multipliers, each having a respective weight W, where N<M; means for selectively connecting each multiplier, respectively, to a selected one of a respective group of k of said delay elements, for each group k being an integer greater than 1, each delay element being a member of one only of said groups, summing means for summing the outputs of said multipliers for developing a filter output signal; means for optimizing the respective weights W of said multipliers to optimize said filter according to a predetermined criterion; means for storing values of the respective weights and connections; means for changing the selection of connections of said multipliers to different delay elements of the respective groups, and for optimizing and storing values of the changed respective weights and connections; and means for determining a globally optimum set of connections and respective multiplier values.
Claim 8
Dependent Claim
39 words
An optimum sparse transversal filter according to claim 5, wherein the connection of said multipliers to said delay elements and the weights of said multipliers have values for optimizing said filter according to the least mean square error criteria.
Claim 9
Dependent Claim
18 words
A filter as claimed in claim 5, wherein k is the same value for each group, and M=kN.
Claim 10
Dependent Claim
18 words
A filter as claimed in claim 5, wherein each group consists of adjacent delay elements in the series.
Claim 11
Dependent Claim
19 words
A filter as claimed in claim 5, wherein each group consists of 3 adjacent delay elements in the series.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-09-16 | 1995-03-18 | 1995-09-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-09-16 | 1999-03-18 | 1999-09-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-09-16 | 2003-03-18 | 2003-09-17 | $7700.00 | Window Closed / Lapsed |