Least squares approximation and polyphase decomposition for pipelining recursive filters
暂无分享,去创建一个
[1] Edoardo Mosca,et al. Hankel-Norm Approximation of IIR by FIR Models: A Constructive Method , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.
[2] Keshab K. Parhi,et al. Pipeline interleaving and parallelism in recursive digital filters. I. Pipelining using scattered look-ahead and decomposition , 1989, IEEE Trans. Acoust. Speech Signal Process..
[3] Keshab K. Parhi,et al. BIT PARALLEL BIT LEVEL RECURSIVE FILTER ARCHITECTURE. , 1986 .
[4] Keshab K. Parhi,et al. Look-ahead computation: Improving iteration bound in linear recursions , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.
[5] Guo Guang Rong. Maximum pipelining linear recurrence on static data flow computers , 1986 .
[6] Keshab K. Parhi,et al. AREA-EFFICIENT HIGH SPEED VLSI ADAPTIVE FILTER ARCHITECTURES. , 1987 .
[7] Keshab K. Parhi,et al. Pipelined CORDIC-based cascade orthogonal IIR digital filters , 2000 .
[8] Arnab K. Shaw,et al. Pipelined recursive digital filters: a general look-ahead scheme and optimal approximation , 1999 .
[9] Arnab K. Shaw. Optimal identification of discrete-time systems from impulse response data , 1994, IEEE Trans. Signal Process..
[10] Bhaskar Sinha,et al. High-speed recursive digital filter realization , 2017 .