US4063082A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Device generating a digital filter and a discrete convolution function therefor
Assignee: International Business Machines Corp
•
Filing: 1976-03-10
•
Granted: 1977-12-13
•
Expires: 1996-03-10
Abstract
Abstract A digital filter is described which is based on the use of the so-called primitive roots transform and its inverse. This transform converts a series of binary numbers {a n } into a transformed series ##EQU1## WHERE G IS A PRIMITIVE ROOT OF A PRIME NUMBER P, AND THE VALUES BETWEEN SUPERFLUOUS PARENTHESES ARE TAKEN MODULO P. Said filter is provided with input means for applying fixed length data blocks made of a group of input samples appended with an equal number of zeros to the input of at least one circular convolutor. This convolutor is provided with accumulating means for generating multiples of each a n term, adding means for generating said A k terms by adding successively provided multiples of a n to selected partial terms of A k , and means for storing said partial A k terms as they are formed. There is also a device for storing the Primitive Roots transform B k of the set of filter coefficients appended with an equal number of zeros, a multiplier means for performing the operation C k = A k · B k modulo p, and an invertor for inverting the resulting C k bits. An inverse transformer having an accumulating means for generating multiples of the terms C k , adding means for generating the terms of the inverse transforms c n by adding selected multiples of C k and for storing said terms of said transforms is also provided. The filter also has an adding means for adding inverse transforms deriving from two consecutive blocks to generate a series of output terms representing a filtered signal.
Inventors
- 👤 Henri Nussbaumer
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-22 20:21
CPC Classifications
G; G06; G06F; G06F17/00; G06F17/10; G06F17/15; G06F17/156
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
172 words
A device for generating the circular convolution function of two series of values {a n } and {b n } said device including: a pair of means, each for generating the primitive root transforms {A k } or {B k } respectively of one of said series {a n } and {b n } means connected to said pair of means for multiplying term-by-term, the terms of said transforms generated by said pair of means; and a third means of generating a series of terms which are a constant multiple q of the terms of the inverse transform of the series of said products from said multiplying means, said device characterized in that at least one of said pair of means generating said primitive root transforms includes: a. means for building by successive accumulations, multiples of the terms of the associated one of said series; and b. means for building the primitive root transforms of the terms of said associated one of said series by successive and selective accumulations of said multiples.
Claim 2
Independent Claim
172 words
A device for generating the circular convolution function of two series of values {a n } and {b n } said device including: a pair of means, each for generating the primitive root transforms {A k } or {B k } respectively of one of said series {a n } and {b n } means connected to said pair of means for multiplying term-by-term, the terms of said transforms generated by said pair of means; and a third means of generating a series of terms which are a constant multiple q of the terms of the inverse transform of the series of said products from said multiplying means, said device characterized in that at least one of said pair of means generating said primitive root transforms includes: a. means for building by successive accumulations, multiples of the terms of the associated one of said series; and b. means for building the primitive root transforms of the terms of said associated one of said series by successive and selective accumulations of said multiples.
Claim 3
Dependent Claim
66 words
A circular convolution function generator device as set out in claim 1, wherein one of said series of values is a sequence of filter coefficients and characterized in that the associated one of said pair of means includes a memory containing multiples of the primitive root transform of the terms of said associated series where each term of said transform is multiplied by a constant value.
Claim 4
Dependent Claim
87 words
A circular convolution function generator device as set out in claim 1 characterized in that said third means for generating the series of terms of the inverse transform includes: means connected to said multiplying means for building by successive accumulations, the integral multiples of the terms q C k = q ((A k ·B k )) generated by said multiplying means; and means connected thereto for developing the inverse transform of the terms of series {q C k } by successive and selective accumulations of said multiples.
Claim 5
Dependent Claim
119 words
A circular convolution function generator according to claim 1 characterized in that at least one of the means for generating said transforms includes: means to recirculate for a set number of circulations each data sample of the series to be transformed; an accumulator connected to said recirculating means and selectively receiving said recirculating data samples for building at least some multiples of said data samples of said series; a memory for storing partially formed terms of said transforms as said terms are being formed; an adder; and means for selectively connecting the outputs of said memory and said accumulator to inputs of said adder to combine partially formed terms of said transforms with said multiples of said data samples.
Claim 6
Dependent Claim
326 words
A circular convolution function generator comprising: means for determining the primitive root transforms of a sequence of terms of a series {a n } and including: accumulating means for building at least some of the 1 to p-1 multiples of the terms of said series where p is a prime number; a first memory for storing partial terms of said transforms as said terms are formed; an adder having its output connected as an input of said first memory; and means for connecting an output of said memory and the output of said accumulating means to inputs of said adder to selectively combine partial transform terms from said memory with said multiples to form more complete partial terms of said transforms; a second memory for storing the negatives of the transforms of the terms of series {b n }; a multiplying means fed corresponding terms of said transforms of said {a n } series and said negatives of the transforms of said {b n } series by said first and second memories, to generate terms of a transform of a function of said {a n } and said {b n } terms; and means for determining the inverse transforms of the transform terms generated by the multiplying means, said means for determining including: a second accumulating means for building, at least some of the 1 to p-1 multiples of the terms issued by said multiplying means; another adder having an input receiving said multiples from said second accumulating means; a third memory connected to the output of said other adder for storing partial terms of said inverse transforms as said partial terms are formed in said other adder; and gating means for reading out selected ones of said stored partial terms from said third memory to another input of said other adder for addition to selected ones of said multiples from said second accumulator to generate more complete partial terms for storage in said third memory.
Claim 7
Dependent Claim
326 words
A circular convolution function generator comprising: means for determining the primitive root transforms of a sequence of terms of a series {a n } and including: accumulating means for building at least some of the 1 to p-1 multiples of the terms of said series where p is a prime number; a first memory for storing partial terms of said transforms as said terms are formed; an adder having its output connected as an input of said first memory; and means for connecting an output of said memory and the output of said accumulating means to inputs of said adder to selectively combine partial transform terms from said memory with said multiples to form more complete partial terms of said transforms; a second memory for storing the negatives of the transforms of the terms of series {b n }; a multiplying means fed corresponding terms of said transforms of said {a n } series and said negatives of the transforms of said {b n } series by said first and second memories, to generate terms of a transform of a function of said {a n } and said {b n } terms; and means for determining the inverse transforms of the transform terms generated by the multiplying means, said means for determining including: a second accumulating means for building, at least some of the 1 to p-1 multiples of the terms issued by said multiplying means; another adder having an input receiving said multiples from said second accumulating means; a third memory connected to the output of said other adder for storing partial terms of said inverse transforms as said partial terms are formed in said other adder; and gating means for reading out selected ones of said stored partial terms from said third memory to another input of said other adder for addition to selected ones of said multiples from said second accumulator to generate more complete partial terms for storage in said third memory.
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) | 1980-12-12 | 1981-06-13 | 1981-12-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1984-12-12 | 1985-06-13 | 1985-12-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1988-12-12 | 1989-06-13 | 1989-12-13 | $7700.00 | Window Closed / Lapsed |