Binary transversal filters with quantised coefficients

Lockhart, G.B.

doi:10.1049/el:19710211

Cited by 8 publications

(5 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The extreme case is the class of FIR filters with coefficients quantized to the ternary set ( -1, 0, I ) . The binary transversal filter of Lockhart [3], and the one-dimensional Binomial filters introduced by Haddad [4] were early members of this class. These efforts were followed by the papers of Van Gerwen et al [ 5 ] , Benvenuto et al [6], and Bateman and Liu [7].…”

Section: Introductionmentioning

confidence: 99%

A class of fast Gaussian binomial filters for speech and image processing

Haddad¹,

Akansu

1991

IEEE Trans. Signal Process.

237

View full text Add to dashboard Cite

Denote the joint pdf of the n-variate normal random vector X with mean p and variance matrix C by +,(x I p , E). Theorem: Let e be the n-variate normal random vector with mean 0 and covariance matrix 6'1. Then, the joint pdf minimizing the time-domain KL information number subject to the first p + 1 autocovariance constraints a (0) = (Yo, a(1) = (Y I , * * ,. (p) = ap is +,(e10, %I. Proof: The KL information number can be decomposed into two parts: The first integral of the RHS is greater than or e ual to 0 by Jensen's inequality. It equals 0 if the joint pdf is ,,,(eqO, V n) .

show abstract

Section: Introductionmentioning

confidence: 99%

A class of fast Gaussian binomial filters for speech and image processing

Haddad¹,

Akansu

1991

IEEE Trans. Signal Process.

237

View full text Add to dashboard Cite

show abstract

“…In this situation, the common approach used is to decrease the effective passband width of the overall filter by interpolation [1]- [3]. This approach can be (5) explained with the aid of Fig.…”

Section: Predictor Designmentioning

confidence: 99%

“…An approach to the reduction of multiplication complexity is to reduce the number of non-zero bits in every multiplier coefficient to a very small number so that the multiplication can be implemented by a few shift and add operations [1]-[3}.…”

Section: Introductionmentioning

confidence: 99%

“…Lockhart [1] investigated the design of a binary transversal filter having delta modulated filter coefficients.…”

Section: Introductionmentioning

confidence: 99%

“…The earlier approaches [1]-[31 do show good results for the implementation of very narrowband filters, but require interpolation for the design (1) of wider band filters to reduce the effective bandwidth. If interpolation by L is used, to get the same transition bandwidth the filter length should be increased by L, which is not desirable.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Efficient FIR fillter design using differential coding of filter coefficients

Sung

Mitra²

ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing

View full text Add to dashboard Cite

A general framework for the design of an FIR filter based on the cascade of an FIR pre-filter with quantized coefficients followed by an all pole IIR stage is proposed. A simple design method results by designing the pre-filter stage coefficients via a differential coding scheme. The IIR stage is then simply a linear predictor reconstruction stage. The differential coding method eliminates the redundancies of the filter coefficient sequence and makes it possible to quantize the coefficients into a few levels. A linear prediction algorithm is applied to optimize the differential coding method using the statistical characteristics of the given filter. Relatively wideband filters as well as narrowband filters have been sucessfully designed without interpolating the original filters.Overall design procedures arid design examples for a variety of filters are included, and the theoretical aspects of this approach are studied.

show abstract

Optimization of binary transversal filters with constrained sampled impulse response

Gibbs¹

1976

Circuit Theory & Apps

View full text Add to dashboard Cite

SUMMARYThe design of binary transversal filters (BTF's) suitable for shaping binary data signals is considered. It is shown that the approximation problem for such BTF's can be solved with respect to minimum mse or min-max time and/or frequency domain error, under the constraint that the impulse response exhibits a specified intersymbol interference. The BTF's considered employ only the lowpass filtering inherent in the non return-to-zero input data and exhibit the property that for a fixed number of taps there is an optimum BTF clock rate which minimizes the approximation error.The design of BTF's with quantized coefficients is also considered and the approximation problem solved with respect to min-max error by using mixed integer programming.

show abstract

Binary transversal filters with quantised coefficients

Cited by 8 publications

References 0 publications

A class of fast Gaussian binomial filters for speech and image processing

A class of fast Gaussian binomial filters for speech and image processing

Efficient FIR fillter design using differential coding of filter coefficients

Optimization of binary transversal filters with constrained sampled impulse response

Contact Info

Product

Resources

About