US4862402A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Fast multiplierless architecture for general purpose VLSI FIR digital filters with minimized hardware
Assignee: Philips North America LLC
•
Filing: 1986-07-24
•
Granted: 1989-08-29
•
Expires: 2006-07-24
Abstract
Abstract A digital transversal filter which employs a multiplierless algorithm for effecting convolutions of samples of a digital input word by the filter coefficients. Each of the samples of an input word is bit sliced into segments of two or more bits, and convolutions are carried out in parallel on all segments using only adders and registers. The convolution products are then summed in a pipeline adder tree to derive the convolution of the complete input word. This architecture provides high frequency capability and significantly lower transistor count and hardware complexity, enabling efficient very large scale integration (VLSI) implementation.
Inventors
- 👤 Imran A. Shah
- 👤 Arup K. Bhattacharya
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 21:42
CPC Classifications
H; H03; H03H; H03H17/00; H03H17/02; H03H17/0223; H03H17/0225; H03H17/0233
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
298 words
A multiplierless digital transversal filter comprising: a first set of N registers for respectfully receiving and storing respective coefficients of a set of N filter tap coefficients C i , where i=0, 1, . . . N-1, each coefficient having L bits in successive bit positions j, where j=0, 1, . . . , L-1; means for receiving successive samples x n of a digital input word X, all bits of a sample x n being received in parallel and each such sample having M bits in successive bit positions k, where k=0, 1, . . . , M-1; means to bit slice each input word sample x n into a plurality of segments, each segment having a number w of bits, each segment constituting a processing plane of said filter; means to perform a convolution of the w-bits of the bit-slice segment of each of said processing planes by said set of coefficients C i in parallel, each segment being convolved with said set of coefficients C i , the output of each processing plane being the convolution of the w-bits of the bit slice segment thereof and the L bits of each of said set of coefficients C i ; means to add the results of all said convolutions of all of said M bits of each input word sample x n , the sum so derived being Y n ; means to output said sum Y n as a filtered digital output signal sample corresponding to said input word sample x n ; and means for biasing the input word samples x n and the coefficients C i so that they represent only positive numbers, whereby said sum Y n is derived over all four possible quadrants of the results of each of said convolutions.
Claim 2
Dependent Claim
298 words
A multiplierless digital transversal filter comprising: a first set of N registers for respectfully receiving and storing respective coefficients of a set of N filter tap coefficients C i , where i=0, 1, . . . N-1, each coefficient having L bits in successive bit positions j, where j=0, 1, . . . , L-1; means for receiving successive samples x n of a digital input word X, all bits of a sample x n being received in parallel and each such sample having M bits in successive bit positions k, where k=0, 1, . . . , M-1; means to bit slice each input word sample x n into a plurality of segments, each segment having a number w of bits, each segment constituting a processing plane of said filter; means to perform a convolution of the w-bits of the bit-slice segment of each of said processing planes by said set of coefficients C i in parallel, each segment being convolved with said set of coefficients C i , the output of each processing plane being the convolution of the w-bits of the bit slice segment thereof and the L bits of each of said set of coefficients C i ; means to add the results of all said convolutions of all of said M bits of each input word sample x n , the sum so derived being Y n ; means to output said sum Y n as a filtered digital output signal sample corresponding to said input word sample x n ; and means for biasing the input word samples x n and the coefficients C i so that they represent only positive numbers, whereby said sum Y n is derived over all four possible quadrants of the results of each of said convolutions.
Claim 3
Dependent Claim
122 words
The filter of claim 1, wherein said means to perform a convolution comprises: multiplicaton equivalent means for determining the product of the w-bits of each of said segments by the L bits of a coefficient C i , there being 2 w possible resultant products for each segment; means for controlling said multiplication equivalent means to select one of said 2 w possible products for each of said segments; means for sequentially adding the selected products of a segment by each of said coefficients, such additions being performed in parallel for said plurality of segments; means for adding the sums of said sequential additions for all of said segments; and means to output said final sum as a filtered digital output signal.
Claim 4
Dependent Claim
61 words
The filter of claim 2 further comprising: a second set of registers; and means to precalculate and store in said second set of registers a subset of the total number of product of the w-bits of each of said segments of said input word sample x n and the L bits of each of said set of coefficients C i .
Claim 5
Dependent Claim
37 words
The filter of claim 3 wherein said subset of products is precalculated and stored in said second set of registers simultaneously with the loading of the set of coefficients C i in said first set of registers.
Claim 6
Dependent Claim
124 words
The filter of claim 2 wherein said means to selecte a product comprises: means to shift the bits of each coefficient C i to obtain even multiples of such coefficient; means to store precalculated odd multiples of C i ; respective decoders for the respective bit-slice segment processing planes of said filter, each such decoder translating the w-bits of such bit-slice segment into 2 w respective outputs representing 2 w possible products of a multiplication of the w-bits of such bit-slice segment by C i ; and respective tristate multiplexers each having one gate level, regardless of the number of bits w in a bit-slice segment, each connected to the output of a respective decoder for selecting one of said 2 w possible products.
Claim 7
Dependent Claim
115 words
The filter of claim 2, wherein said multiplication equivalent means comprises: respective decoders for the respective bit slice planes of said filter, each such decoder translating the w-bits of such bit-slice into a number 2 w of respective outputs representing 2 w possible products of a multiplicaton of the w-bits of a bit-slice by C i ; respective tristate multiplexers each having one gate level, regardless of the number of bits w in a bit-slice, each connected to the output of a respective decoder for selecting one of said 2 w possible products; and delay means respectively connected to the outputs of the respective multiplexers for delaying the selected products produced at the outputs thereof.
Claim 8
Dependent Claim
138 words
The filter of claim 1 wherein said means to perform a w-bit convolution comprises: means to multiply the w bits of a bit-slice segment by a coefficient C i , there being 2 w possible resultant products thereof, such multiplying means producing even multiples of C i by shifting the bits thereof; means to precalculate and store odd multiples of Ci and supply such odd multiples to said multiplying means; means for controlling said multiplying means to select one of said 2 w possible products for each of said segments; means to sequentially add the selected products of a segment by each of said coefficients, such additions taking place in parallel; means to add the sums of said sequential additions for all of said segments; and means to output said final sum as a filtered digital output signal.
Claim 9
Dependent Claim
20 words
The filter of claim 1, wherein said means to add the results of said convolutions is a pipeline adder tree.
Claim 10
Dependent Claim
75 words
The filter of claim 8, wherein said pipeline adder tree comprises: means to calculate the Y n ,k outputs of the additions of all of said filter planes and shift such outputs in accordance with the significance of the bits thereof, such shifts being related to the variable k in accordance with the equation ##EQU19## in which a, b, . . . d are integers such that a<b<. . . <d<M-1 and in which. ##EQU20##
Claim 11
Dependent Claim
20 words
The filter of claim 9, wherein said pipe line adder tree comprises a plurality of half adders and full adders.
References Cited (Backward Citations)
US3521042A
Cited
US3670151A
Cited
US3732409A
Cited
US3831013A
Cited
US4031364A
Cited
JPS54162937A
Cited
US4237551A
Cited
EP0015681A1
Cited
GB2095067A
Cited
US4559606A
Cited
US4644488A
Cited
US4660164A
Cited
US4641259A
Cited
EP0166653A1
Cited
JPS617717A
Cited
JPS617716A
Cited
US4736335A
Cited
US4745570A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-08-28 | 1993-02-27 | 1993-08-29 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-08-28 | 1997-02-27 | 1997-08-29 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-08-28 | 2001-02-27 | 2001-08-29 | $7700.00 | Window Closed / Lapsed |