High-Speed Recursive Digital Filter Realization

Loomis, H.H.; Sinha, Bhaskar

doi:10.21236/ada140904

Cited by 59 publications

(16 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We can treat the real and complex impulse response problems simultaneously by replacing the upper index n by N and noting that for the real case N = n and for the complex case N = 2n. Also the basis functions for the real case are defined in (4) and for the complex case in (10). The frequency response of the FIR filter can be obtained by evaluating the z-transform on the unit circle which results in…”

Section: B Complex Impulse Responsementioning

confidence: 99%

“…The number of function evaluations required using a zero finder can be three or four times fewer. We have stayed with a discretized frequency, however, for the purpose of better comparison with existing work [4], [5], [7], and [8].…”

Section: (28)mentioning

confidence: 99%

“…A method, developed by Chen and Parks [4], converts the primal complex approximation problem into a real approximation problem which is nearly equivalent to the complex problem. A standard linear programming algorithm is then used to solve the real approximation problem.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Design of FIR filters with complex desired frequency response using a generalized Remez algorithm

Komodromos

Russell

Tak³

et al. 1995

IEEE Trans. Circuits Syst. II

View full text Add to dashboard Cite

Absfract-Complex approximation with a generalized Remez algorithm is used to design FIR digital filters with nonconjugate symmetric frequency responses. The minimax criterion is used and the Chebychev approximation is posed as a linear optimization problem. The primal problem is converted to its dual and is solved using an efficient, quadratically convergent algorithm developed by Tang [l]. Optimal Chebychev real-coefficient FIR filters with group delay smaller than half the filter length can be designed with slightly better magnitude responses compared to linear-phase filters. Linear-phase filters can also be designed when the group delay is specified to be half the filter length. Most importantly, the design method is capable to produce filters with complex coefficients that approximate noncoqjugate symmetric frequency responses.

show abstract

Section: B Complex Impulse Responsementioning

confidence: 99%

Section: (28)mentioning

confidence: 99%

See 1 more Smart Citation

Design of FIR filters with complex desired frequency response using a generalized Remez algorithm

Komodromos

Russell

Tak³

et al. 1995

IEEE Trans. Circuits Syst. II

View full text Add to dashboard Cite

show abstract

“…The additional correction factor MILA is necessary to make the average output profile of (6) identical to that of (4) for stationary a(.) and U(.…”

Section: I=o B Sum Relaxationmentioning

confidence: 99%

“…Thus, it is of interest to develop fine-grain pipelined DSP algorithms. Look-ahead techniques for pipelining of recursive fixed-coefficient filters have been proposed [2], [5]- [6] and have been successfully applied to two-dimensional recursive filtering [7], dynamic programming [SI-[ 101, algorithms with quantizer loops [ 1 11, finite state machines [9], and Huffman decoders [12]. The implementation of a recursive filter chip capable of filtering at 86 million operations per second [ 131 has clearly demonstrated the feasibility of fine-grain pipelining.…”

Section: Introductionmentioning

confidence: 99%

Relaxed look-ahead pipelined LMS adaptive filters and their application to ADPCM coder

Shanbhag

Parhi

1993

IEEE Trans. Circuits Syst. II

View full text Add to dashboard Cite

The relaxed look-ahead technique is presented as an attractive technique for pipelining adaptive filters. Unlike conventional look-ahead, the relaxed look-ahead does not attempt to maintain the input-output mapping between the serial and pipelined architectures but preserves the adaptation characteristics. The use of this technique results in a small hardware overhead which would not be possible with conventional lookahead. The relaxed look-ahead is employed to develop finegrained pipelined architectures for least mean-squared (LMS) adaptive filtering. Convergence analysis results are presented for the pipelined architecture. The proposed architecture achieves the desired speed-up with marginal or no degradation in the convergence behavior. Past work in pipelined transversal LMS filtering are shown to be special cases of this architecture. Simulation results verifying the convergence analysis results for the pipelined LMS filter are presented. The pipelined LMS filter is then employed to develop a high-speed adaptive differential pulse-code-modulation (ADPCM) codec. The new architecture has a negligible hardware overhead which is independent of the number of quantizer levels, the predictor order and the pipelining level. Additionally, the pipelined codec has a much lower output latency than the level of pipelining. Theoretical analysis indicates that the output signal-to-noise ratio ( S N R ) is degraded with increase in speed-up. Simulations with image data indicate that speed-ups of up to 44 can be achieved with less than 1 dB loss in SNR.

show abstract

Digital Signal Processing with Field Programmable Gate Arrays

Meyer-Baese¹

2007

Signals and Communication Technology

192

View full text Add to dashboard Cite

High-Speed Recursive Digital Filter Realization

Cited by 59 publications

References 2 publications

Design of FIR filters with complex desired frequency response using a generalized Remez algorithm

Design of FIR filters with complex desired frequency response using a generalized Remez algorithm

Relaxed look-ahead pipelined LMS adaptive filters and their application to ADPCM coder

Digital Signal Processing with Field Programmable Gate Arrays

Contact Info

Product

Resources

About