Abstract
An angle and radius constrained IIR filter design approach using modified Remez exchange algorithm and least squares algorithm is designed to avoid tight pole-crowding in pipelined filters, resulting in improved frequency responses and reduced coefficient sensitivities. Experimental results demonstrate that our proposed method leads to chip area reduction by 33% and low power by 45% against the conventional method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Parhi, K.K., Messerschmitt, D.G.: Pipeline interleaving and parallelism in recursive digital filters-part: Pipelining using scattered look-ahead and decomposition. IEEE Trans.on Acoustics, Speech, and Signal Processing, 1099–1117 (July 1989)
Chung, J.G., Parhi, K.K.: Pipelined Lattice and Wave Digital Recursive Filters. Kluwer Academic Publishers, Norwell (1996)
Chung, J.G., Kim, H., Parhi, K.K.: Angle-constrained IIR filter pipelining for reduced coefficient sensitivities. IEEE Trans. on Circuits & Systems, Part II: Analog & Digital Signal Processing 47, 555–559 (2000)
Martinez, H.G., Parks, T.W.: Design of recursive digital filters with optimum magnitude and attenuation poles on the unit circle. IEEE Trans. on Acoustics, Speech, and Signal Processing ASSP-26, 150–157 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, DI., Bae, SH., Lee, M.MO., Chung, JG. (2004). Area Efficient and Low Power Pipelined IIR Filter Design for Intelligent Integrated Photonic System. In: Mammeri, Z., Lorenz, P. (eds) High Speed Networks and Multimedia Communications. HSNMC 2004. Lecture Notes in Computer Science, vol 3079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25969-5_77
Download citation
DOI: https://doi.org/10.1007/978-3-540-25969-5_77
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22262-0
Online ISBN: 978-3-540-25969-5
eBook Packages: Springer Book Archive