Non-recursive digital filter

• US 4,388,693 A
• Filed: 12/31/1980
• Issued: 06/14/1983
• Est. Priority Date: 01/07/1980
• Status: Expired due to Term

• Current Assignee: Nippon Electric Company Limited (NEC Corporation)
• Original Assignee: Nippon Electric Company Limited (NEC Corporation)
• Inventors: Nakayama, Kenji
• Primary Examiner(s): Smith, Jerry
• Application Number:
  US06/221,808
• Time in Patent Office: 895 Days
• Field of Search: 364/724
• US Class Current: 708/301
• CPC Class Codes: H03H 17/02 Frequency selective networks digital computers for complex mathematical operations G06F17/10
• CPC Class Codes: H03H 17/06 Non-recursive filters

Abstract

A non-recursive digital filter has N predetermined filter coefficients to perform a specific computation in response to a sequence of consecutive binary codewords. The absolute values of the computation coefficients are arranged in an order of magnitude. The filter arranges the sequence to obtain a sequence corresponding to the arranged coefficients. A product is obtained for each sequence, which is given by the arrangement and by the corresponding polarity of each of the coefficients. The outputs given by these products are accumulated and are multiplied by certain differences.

Claims

1. A non-recursive digital filter having predetermined N filter coefficients h_i (i=0 to N-1) to perform ##EQU11## in response to a sequence x(n-i) of N consecutive binary coded words, where h*_j represent the coefficients of the absolute values of h_i arranged in the order of magnitude;

x*(n-j) represent x(n-i) corresponding to h*_j ;

sign (h_i) represent the polarities of h;

Δ

_j represent differences between adjoining coefficients h*_j ;

x*(n-j) represent the products of sign (h_i) and x*(n-j); and

##EQU12## said filter comprising;

arranging means for arranging said sequence x(n-i) corresponding to the coefficients h*_j to obtain x*(n-j);

first means for obtaining the product of each of the outputs x*(n-j) given from the arranging means and the corresponding polarity of each of the coefficients h_i ;

second means for accumulating the outputs x*(n-j) given from said first means to obtain u(n-j);

coefficient generating means for producing said differences Δ

_j ;

third means for multiplying the outputs u(n-j) supplied from said second means by said differences Δ

_j ; and

fourth means for accumulating outputs Δ

_j u(n-j) given from said third means.

2. A non-recursive digital filter having predetermined N filter coefficients h_i (i=0 to N-1) to perform ##EQU13## in response to a sequence x(n-i) of N consecutive binary coded words, where h*j represent the coefficients of the absolute values of h_i arranged in the order of magnitude;

x*(n-j) represent x(n-i) corresponding to h*j;

sign(h_i) represent the polarities of h_i ;

Δ

_j represent differences between adjoining coefficients h*_j ;

x*(n-j) represent the products of sign(h_i) and x*(n-j);

##EQU14## C_l represent differences between adjoining coefficients Δ

_l * obtained by arranging Δ

_j in the order of magnitude;

##EQU15## and u*(n-l) represent u(n-j) corresponding to Δ

*_l, said filter comprising;

first arranged means for arranging said sequence x(n-i) corresponding to the coefficients h*_j to obtain x*(n-j);

first arithmetic means for obtaining the product each of outputs x*(n-j) given from the first arranging means and the corresponding polarity of each of the coefficients h_i ;

first adding means for accumulating the outputs x*(n-j) given from the first arithmetic means to obtain u(n-j);

second arranging means for arranging the outputs u(n-j) supplied from said first adding means corresponding to the coefficients Δ

*_l to produce u*(n-l);

second adding means for accumulating the outputs fed from the second arranging means to obtain u(n-l);

coefficient generating means for producing said coefficients C_l ;

second arithmetic means for multiplying the outputs u(n-l) supplied from the second adding means by said coefficients C_l ; and

third adding means for accumulating the outputs C_l u(n-l) given from the second arithmetic means.

3. A non-recursive digital filter comprising a pair of random access memory means, each of said random access memory means including means for processing digital signal code words having different coefficients by arranging said digital signal code words according to the coefficients of said digital signal code words and the differences between said digital signal code words, read only memory means for driving each of said random access memory means through a sequence of operational steps, selector means responsive to said read only memory means for alternately operating said random access memory means, and addressing means for successively addressing said random access memory means for successively scanning the contents of said random access memory means, means for multiplying an output of an operating one of the random access memory means selected by said selector means in order to establish a digital sign, means responsive to said multiplying means for accumulating a codeword from said products of the multiplications, and means for multiplying the output of said accumulating means by differences between absolute values of said coefficients, as new coefficients.

4. A method of filtering digital signals comprising the steps of:

a. converting analog signals into digital signals to provide binary coded words, said digital signals having different coefficients;

b. arranging said digital signals in a sequence corresponding to said coefficients;

c. multiplying said arranged signals by a signal representing a sign of said digital signals;

d. accumulating products of the multiplication of step c;

e. multiplying said accumulated digital signals by differences between absolute values of said coefficients, as new coefficients; and

f. accumulating the products of the multiplication of step e.