Non-recursive digital filter

Claim 2

A non-recursive digital filter having predetermined N filter coefficients hi (i = 0 to N-1) to perform 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 (hi) represent the polarities of hi: Δ j represent differences between adjoining coefficients h* j ; x̃*(n-j) represent the products of sign (h i ) and x*(n-j); and u(n-j) x̃*(n-k), said filter comprising: a) arranging means(11, 12, 13, 15-19, 20, 24)for arranging said sequence x(n-i) corresponding to the coefficients h *. to obtain x * ( n -j) ; b) first means(21)for obtaining the product of each of the outputs x * (n-j) given from the arranging means(11, 12, 13, 15-19, 20, 24)and the corresponding polarity of each of the coefficients h j ; c) second means(22)for accumulating the outputs x̃*(n-j) given from said first means(21)to obtain u(n-j); d) third means(25)for multiplying the outputs u(n-j) supplied from said second means(22)by said differences Δ j ; and e) fourth means (23) for accumulating outputs Δ j u(n-j) given from said third means (25).

Claim 3

A non-recursive digital filter having predetermined N filter coefficients h i (i = 0 to N-1) to perform 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 hi; Δ j represent differences between adjoining coefficients h* j ; x̃*(n-j) represent the products of sign (h i ) and x*(n-j); u(n-j) = x̃*(n-k); C ℓ represent differences between adjoining coefficients Δ ℓ * obtained by arranging Δ j in the order of magnitude; u(n-ℓ) = u (n-k); and u*(n-ℓ) represent u(n-j) corresponding to Δ ℓ *, said filter comprising: a) first arranging means (5) for arranging said sequence x(n-i) corresponding to the coefficients h * . to obtain x * (n-j); b) first arithmetic means(6)for obtaining the product each of outputs x * (n-j) given from the first arranging means (5) and the corresponding polarity of each of the coefficients h i ; c) first adding means(7)for accumulating the outputs x * (n-j) given from the first arithmetic means(6)to obtain u(n-j); d) second arranging.means(8)for arranging the outputs u(n-j) supplied from said first adding means(7)corresponding to the coefficients Δ ℓ * to produce u*(n-ℓ); e) second adding means(9)for accumulating the outputs fed from the second arranging means (8) to obtain u(n-ℓ); f) second arithmetic means (10) for multiplying the outputs u(n-ℓ) supplied from the second adding means(9)by said coefficients C ℓ ; and g) third adding means(4)for accumulating the outputs C ℓ u(n-ℓ) given from the second arithmetic means(10).

Claim 4

A non-recursive digital filter having predetermined N filter coefficients h i (i = 0 to N-1) to perform 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 hi; Δ j represent differences between adjoining coefficients h* j ; x̃*(n-j) represent the products of sign (h i ) and x*(n-j); u(n-j) = x̃*(n-k); C ℓ represent differences between adjoining coefficients Δ ℓ * obtained by arranging Δ j in the order of magnitude; u(n-ℓ) = u (n-k); and u*(n-ℓ) represent u(n-j) corresponding to Δ ℓ *, said filter comprising: a) first arranging means (5) for arranging said sequence x(n-i) corresponding to the coefficients h * . to obtain x * (n-j); b) first arithmetic means(6)for obtaining the product each of outputs x * (n-j) given from the first arranging means (5) and the corresponding polarity of each of the coefficients h i ; c) first adding means(7)for accumulating the outputs x * (n-j) given from the first arithmetic means(6)to obtain u(n-j); d) second arranging.means(8)for arranging the outputs u(n-j) supplied from said first adding means(7)corresponding to the coefficients Δ ℓ * to produce u*(n-ℓ); e) second adding means(9)for accumulating the outputs fed from the second arranging means (8) to obtain u(n-ℓ); f) second arithmetic means (10) for multiplying the outputs u(n-ℓ) supplied from the second adding means(9)by said coefficients C ℓ ; and g) third adding means(4)for accumulating the outputs C ℓ u(n-ℓ) given from the second arithmetic means(10).