US4701875A — High speed convolution arithmetic circuit with mu…

Claim 1

Independent Claim 227 words

A convolution arithmetic circuit for performing convolution processing on an input sequence composed of a series of values obtained at a sampling frequency, said convolution processing also using a response sequence composed of a predetermined number of elements, said convolution arithmetic circuit comprising: a first memory that store said elements of said response sequence in a predetermined order; a second memory means for storing that stores said input sequence values; a scale of N counter, response to a clock signal, said scale of N counter providing a first series of count values which serve as addresses for said first memory, where N is an integer indicating said predetermined number sequence elements in said response sequence; a scale of N/a counter, also responsive to said clock signal, for providing a second series of count values which serve as addresses for said memory, where a is an integer divisor of N chosen according to said sampling frequency; accumulating means, coupled to said first and second memories, for computing a sum of a series of products of elements of said response sequence from said first memory and corresponding values of said input sequence from said second memory; and control means, coupled to said scale of N counter, for generating a control signal to alter the order of the second series of count values provided by said scale of N/a counter.

Claim 2

Dependent Claim 227 words

A convolution arithmetic circuit for performing convolution processing on an input sequence composed of a series of values obtained at a sampling frequency, said convolution processing also using a response sequence composed of a predetermined number of elements, said convolution arithmetic circuit comprising: a first memory that store said elements of said response sequence in a predetermined order; a second memory means for storing that stores said input sequence values; a scale of N counter, response to a clock signal, said scale of N counter providing a first series of count values which serve as addresses for said first memory, where N is an integer indicating said predetermined number sequence elements in said response sequence; a scale of N/a counter, also responsive to said clock signal, for providing a second series of count values which serve as addresses for said memory, where a is an integer divisor of N chosen according to said sampling frequency; accumulating means, coupled to said first and second memories, for computing a sum of a series of products of elements of said response sequence from said first memory and corresponding values of said input sequence from said second memory; and control means, coupled to said scale of N counter, for generating a control signal to alter the order of the second series of count values provided by said scale of N/a counter.

Claim 3

Dependent Claim 139 words

The arithmetic circuit of claim 1 wherein said accumulating means includes: an accumulating circuit, coupled to said first and second memories, for computing said sum of said products, said accumulating circuits including a clear terminal for receiving a clear signal to reset said accumulating circuit to a zero value; a first latch circuit coupled to said accumulating circuit and including an input terminal, said first latch circuit storing said sum upon receipt of a store signal at said input terminal; and a gate circuit, coupled to said scale of N counter, for generating said store signal for said first latch circuit when said scale of N counter reaches a predetermined one of said count values and for generating said clear signal for said accumulating circuit when said scale of N counter reaches said predetermined one of said count values.

Claim 4

Dependent Claim 64 words

The arithmetic circuit of claim 2 wherein said gate circuit includes: an AND gate having an output and also having inputs coupled to outputs of said scale of N counter, said AND gate providing said clear signal at said output; and a second latch circuit coupled to said output of said AND gate for generating said store signal in response to said clock signal.

Claim 5

Dependent Claim 76 words

The arithmetic circuit of claim 1 wherein said second memory includes first means for storing a first number of values of said input sequence, and second means for storing an additional value of said input sequence in response to a write signal, and wherein said arithmetic circuit further includes write means, coupled to said scale of N counter, for generating said write signal when said scale of N counter reaches selected ones of said count values.

Claim 6

Dependent Claim 96 words

The arithmetic circuit of claim 1 further including timing means, coupled to said scale of N counter, for generating a counter control signal when said scale of N counter reaches a predetermined one of said count values; and wherein said scale of N/a counter includes counting means for generating, in response to said clock signal, said series of count values as said addresses for said second memory; and reset means coupled to said timing means for causing said counting means to skip one of said series of count values in response to said counter control signal.

Claim 7

Dependent Claim 94 words

The arithmetic circuit of claim 5, wherein said first memory includes a ROM; wherein said second memory includes a RAM; wherein said timing means includes an AND gate having inputs coupled to said scale of N counter and an output providing said counter control signal at an output; wherein said counting means includes output terminals and a plurality of flip-flops for generating said count values at said output terminals; and wherein said reset means includes a plurality of logic elements connected between said plurality of flip-flops and coupled to receive said counter control signal.

Claim 8

Dependent Claim 99 words

The arithmetic circuit of claim 1 wherein said scale of N/a counter includes: a flip-flop coupled to receive said clock signal and said control signal and producing a first count value as a low order portion of said address for said second memory; logic circuitry means, coupled to receive said low order portion of said second memory address and said counter control signal, for generating a modified clock signal; and a scale of N/(2a) counter, coupled to said logic circuitry means and producing a high order portion of said second memory address in response to said modified clock signal.

Claim 9

Dependent Claim 214 words

A convolution arithmetic circuit for performing convolution processing on an input sequence composed of a series of values obtained at a sampling frequency, said convolution processing also using a response sequence composed of a predetermined number of elements, said circuit comprising: a first memory storing said elements of said response sequence in a predetermined order; a second memory storing said input sequence values; a first scale of N counter coupled to receive a clock signal, where N is an integer indicating said predetermined the number of said elements in said response sequence, said first scale of N counter providing a first series of count values which serve as addresses for said first memory; a second scale of N counter coupled to receive said clock signal and providing a second series of count values which serve as addresses for said second memory; accumulating means, coupled to said first and second memories, for computing a sum of a series of products of elements of said response sequence from said first memory and corresponding values of said input sequence from said second memory; and control means, coupled to said second scale of N counter, for generating a control signal to alter the order of said second series count values provided by said second scale of N counter.

Claim 10

Dependent Claim 214 words

A convolution arithmetic circuit for performing convolution processing on an input sequence composed of a series of values obtained at a sampling frequency, said convolution processing also using a response sequence composed of a predetermined number of elements, said circuit comprising: a first memory storing said elements of said response sequence in a predetermined order; a second memory storing said input sequence values; a first scale of N counter coupled to receive a clock signal, where N is an integer indicating said predetermined the number of said elements in said response sequence, said first scale of N counter providing a first series of count values which serve as addresses for said first memory; a second scale of N counter coupled to receive said clock signal and providing a second series of count values which serve as addresses for said second memory; accumulating means, coupled to said first and second memories, for computing a sum of a series of products of elements of said response sequence from said first memory and corresponding values of said input sequence from said second memory; and control means, coupled to said second scale of N counter, for generating a control signal to alter the order of said second series count values provided by said second scale of N counter.

Claim 11

Dependent Claim 90 words

The arithmetic circuit of claim 8 wherein said second scale of N counter includes output terminals containing said second series of count values, and a clear terminal for receiving a clear signal to reset the addresses at said output terminals to an initial state; and wherein said count control means includes an AND gate having input terminals connected to said output terminals of said second scale of N counter, and an output terminal connected to said clear terminal of said second scale of N counter to provide said clear signal.

Claim 12

Dependent Claim 68 words

The arithmetic circuit of claim 9 wherein the number of said AND gate input terminals is one fewer than the number of said second scale of N counter output terminals, and wherein each of said input terminals of said AND gate is each connected to a different one of said output terminals of said second scale of N counter representing the higher order bits of said count values.

Claim 13

Dependent Claim 80 words

The arithmetic circuit of claim 8 further including write means, coupled to said first scale of N counter, for generating a write signal when said first scale of N counter reaches predetermined ones of said first series of count values, and write means including a selection circuit, responsive to a selection signal, for directing said write means to generate a write signal when at least one of said predetermined ones of said first series of count values has been reached.

Claim 14

Dependent Claim 81 words

The arithmetic circuit of claim 8 wherein each of said first and second scale of N counters includes a latch circuit, the latch circuit for said first scale of N counter being coupled to said first memory and storing said first series of count values addresses for said first memory, and the latch circuit for said second scale of N counter being coupled to said second memory and storing said second series of count values as addresses for said second memory.

Claim 15

Dependent Claim 63 words

The arithmetic circuit of claim 8 wherein said control means includes a control generating cirucuit coupled to said first scale of N counter to receive said first series of count values, and logic circuit means, coupled to receive both said clock signal and an output of said control generating circuit, for generating a modified clock signal for said second scale of N counter.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1990-10-19	1991-04-20	1991-10-20	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	1994-10-19	1995-04-20	1995-10-20	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	1998-10-19	1999-04-20	1999-10-20	$7700.00	Window Closed / Lapsed

High speed convolution arithmetic circuit with multiple counters

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag