US4489393A — Monolithic discrete-time digital convolution circ…

Claim 1

Independent Claim 187 words

A monolithic discrete-time digital convolution circuit, comprising: a pluralith (N) of storage circuits for holding N respective values of a first function; a like plurality (N) of multipliers having first inputs connected to respective ones of said storage circuits and second inputs connected together to receive N successive values of a second function, and providing output signals indicative of the products of the respective values of the first function and the successive values of the second function; a like plurality (N) of shift registers; a like plurality (N) of adders having first inputs connected to receive products from respective ones of said multipliers, outputs connected to respective ones of said shift registers, and second inputs connected to receive accumulated data from adjacent ones of said shift registers, said adders and shift registers being connected together in a chain in which each adder combines a multiplier product with a cumulative sum derived from an adjacent adder in the chain, and the final adder in the chain produces a sucession of N accumulated product summations proportional to the discrete values of the convolution of the first and second functions.

Claim 2

Dependent Claim 187 words

A monolithic discrete-time digital convolution circuit, comprising: a pluralith (N) of storage circuits for holding N respective values of a first function; a like plurality (N) of multipliers having first inputs connected to respective ones of said storage circuits and second inputs connected together to receive N successive values of a second function, and providing output signals indicative of the products of the respective values of the first function and the successive values of the second function; a like plurality (N) of shift registers; a like plurality (N) of adders having first inputs connected to receive products from respective ones of said multipliers, outputs connected to respective ones of said shift registers, and second inputs connected to receive accumulated data from adjacent ones of said shift registers, said adders and shift registers being connected together in a chain in which each adder combines a multiplier product with a cumulative sum derived from an adjacent adder in the chain, and the final adder in the chain produces a sucession of N accumulated product summations proportional to the discrete values of the convolution of the first and second functions.

Claim 3

Dependent Claim 66 words

A monolithic discrete-time digital convolution circuit as set forth in claim 1, wherein: each of said adders produces a partial sum and a set of carry digits for storage in a corresponding one of said shift registers; and said convolution circuit further includes a high-speed adder coupled to the final shift register in the chain to add the partial sum and carry digits stored in it.

Claim 4

Dependent Claim 43 words

A monolithic discrete-time digital convolution circuit as set forth in claim 1, and further comprising: an input storage buffer coupled to said plurality of storage circuits, said input storage buffer being loadable independently of processing of the first-function values in said storage circuits.

Claim 5

Dependent Claim 30 words

A monolithic discrete-time digital convolution circuit as set forth in claim 3, wherein said input storage buffer is loadable in serial fashion to reduce the number of input-output pins required.

Claim 6

Dependent Claim 62 words

A monolithic discrete-time digital convolution circuit as set forth in claim 1, wherein said convolver circuit is constructed in the form of N repeated stages, each having one of said storage circuits, one of said multipliers, one of said adders, and one of said shift registers, to facilitate implementation of the circuit in monolithic form by providing a regular, repeating circuit pattern.

Claim 7

Dependent Claim 31 words

A monolithic discrete-time digital convolution circuit as set forth in claim 1, wherein: each of said multipliers employs a hybrid encoding scheme for the first-function values, to maximize speed of multiplication.

Claim 8

Dependent Claim 79 words

A monolithic discrete-time digital convolution circuit as set forth in claim 6, wherein: said hybrid encoding scheme uses one digit to indicate whether a value has a magnitude of two, one digit to indicate the sign of the value, and one digit to indicate if the value is zero; and each of said multipliers includes a first stage for multiplying by two, a second stage complementing to effect sign reversal, and a third stage to substitute a zero value.

Claim 9

Dependent Claim 188 words

A monolithic discrete-time digital convolution circuit, comprising: a plurality of repeated stages, each stage including a storage register for holding a value of a first function, a multiplier connected to receive one input from said first storage register, an adder connected to receive one input from said multiplier, and a shift register connected to receive output from said adder; first input circuit means, for loading N values of the first function into said first storage registers; second input circuit means, for supplying N successive values of a second function as a second input to said multipliers; means for connecting said shift registers and said adders in a connected string such that each shift register except the last one in the string is coupled as an input to the adder in an adjacent repeated stage; and timing means for synchronizing operation of said multipliers, adders and shift registers, wherein successive sets of products of the first and second functions are accumulated by operation of said adders and shift registers, to produce a succession of product sums equivalent to discrete values of the convolution of the first and second functions.

Claim 10

Dependent Claim 188 words

A monolithic discrete-time digital convolution circuit, comprising: a plurality of repeated stages, each stage including a storage register for holding a value of a first function, a multiplier connected to receive one input from said first storage register, an adder connected to receive one input from said multiplier, and a shift register connected to receive output from said adder; first input circuit means, for loading N values of the first function into said first storage registers; second input circuit means, for supplying N successive values of a second function as a second input to said multipliers; means for connecting said shift registers and said adders in a connected string such that each shift register except the last one in the string is coupled as an input to the adder in an adjacent repeated stage; and timing means for synchronizing operation of said multipliers, adders and shift registers, wherein successive sets of products of the first and second functions are accumulated by operation of said adders and shift registers, to produce a succession of product sums equivalent to discrete values of the convolution of the first and second functions.

Claim 11

Dependent Claim 66 words

A monolithic discrete-time digital convolution circuit as set forth in claim 8, wherein: each of said adders produces a partial sum and a set of carry digits for storage in a corresponding one of said shift registers; and said convolution circuit further includes a high-speed adder coupled to the final shift register in the chain to add the partial sum and carry digits stored in it.

Claim 12

Dependent Claim 21 words

A monolithic discrete-time digital convolution circuit as set forth in claim 9, wherein: said high-speed adder is a conditional sum adder.

Claim 13

Dependent Claim 30 words

A monolithic discrete-time digital convolution circuit as set forth in claim 9, wherein: each of said shift registers is incorporated into the logic of a corresponding one of said adders.

Claim 14

Dependent Claim 90 words

A monolithic discrete-time digital convolution circuit as set forth in claim 11, wherein: each of said adders includes a plurality of one-bit adder modules, each having one sum input line for input of a sum bit from a prior-stage adder, one carry input line for input of a carry bit from a prior-stage adder, one multiplier result input line for input of a result bit from one of said multipliers, and one sum output line and one carry output line to provide a two-bit sum of the three input bits.

Claim 15

Dependent Claim 43 words

A monolithic discrete-time digital convolution circuit as set forth in claim 8, and further comprising: an input storage buffer coupled to said plurality of storage circuits, said input storage buffer being loadable independently of processing of the first-function values in said storage circuits.

Claim 16

Dependent Claim 30 words

A monolithic discrete-time digital convolution circuit as set forth in claim 13, wherein said input storage buffer is loadable in serial fashion to reduce the number of input/output pins required.

Claim 17

Dependent Claim 31 words

A monolithic discrete-time digital convolution circuit as set forth in claim 8, wherein: each of said multipliers employs a hybrid encoding scheme for the first-function values, to maximize speed of multiplication.

Claim 18

Dependent Claim 80 words

A monolithic discrete-time digital convolution circuit as set forth in claim 15, wherein: said hybrid encoding scheme uses one digit to indicate whether a value has a magnitude of two, one digit to indicate the sign of the value, and one digit to indicate if the value is zero; and each of said multipliers includes a first stage for multiplying by two, a second stage for complementing to effect sign reversal, and a third stage to substitute a zero value.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1987-12-18	1988-06-18	1988-12-18	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	1991-12-18	1992-06-18	1992-12-18	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	1995-12-18	1996-06-18	1996-12-18	$7700.00	Window Closed / Lapsed

Monolithic discrete-time digital convolution circuit

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag