Email this article 
Open Access
Subscription or Fee Access
Implementation of Low Power Architecture of Fixed Point DLMS Adaptive Filter using RCA
Abstract
During this paper, we tend to exhibit a productive engineering for the usage of a delayed minimum mean sq. adaptation filter. The smallest amount Mean sq. (LMS) adaptation filter is that the most prevailing and general adaptation filter, visible of its straight pushiness and satisfactory union execution. Succeeding this LMS calculation doesn't support pipelined execution on account of its dreary conduct; it's modified to a structure known as delayed LMS (DLMS) calculation. A deliberate structure for the execution of a DLMS adaptive filter is proposed in this paper. Existing DLMS filter utilizes carry look ahead adder as a part of request to perform the addition function which brought about area and power utilization issues. For accomplishing range power proficient execution, a swell carry adder is actualized over the tedious combinational squares of the current delayed LMS filter plan. From the design of the carry look ahead adder, it is clear that there is a probability for minimizing the area and power utilization in proposed structure. This work utilizes an uncomplicated and thriving door level amendment to basically diminish the realm and power. This filter set up offers less space delay product (ADP) and less Energy Delay Product (EDP) than the most effective of this structures for filters N=8,16, and 32. Consequently it is clear that the aggregate range power utilization can be diminished to a more prominent degree utilizing the proposed strategy.
Keywords
References
S. Haykin and B. Widrow, Least-Mean-Square Adaptive Filters. Hoboken, NJ, USA: Wiley, 2003.
S. Ramanathan and V. Visvanathan, “A systolic architecture for LMS adaptive filtering with minimal adaptation delay,” in Proc. Int. Conf. Very Large Scale Integr. (VLSI) Designal, Jan. 1996, pp. 286–289.
L. D. Van and W. S. Feng, “An efficient systolic architecture for the DLMS adaptive filter and its applications,” IEEE Trans. Circuits Syst. II, Analog Digital Signal Process., vol. 48, no. 4, pp. 359–366, Apr. 2001.
P. K. Meher and M. Maheshwari, “A high-speed FIR adaptive filter architecture using a modified delayed LMS algorithm,” in Proc. IEEE Int. Symp. Circuits Syst., May 2011, pp. 121–124.
K. K. Parhi, VLSI Digital Signal Procesing Systems: Designal and Implementation. NewYork, USA: Wiley, 1999.
R. Rocher, D. Menard, O. Sentieys, and P. Scalart, “Accuracy evaluation of fixed-point LMS algorithm,” in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., May 2004, pp. 237–240.
L.-K. Ting, R. Woods, and C. F. N. Cowan, “Virtex FPGA implementation of a pipelined adaptive LMS predictor for electronic support measures receivers,” IEEE Trans. Very Large Scale Integr.(VLSI) Syst., vol. 13, no. 1, pp. 86–99, Jan. 2005.
S. Haykin (2002). Adaptive Filter Theory, 4th Edition, Prentice-Hall.
L. Ting, R. Woods, and C. Cowan, “Virtex FPGA implementation of a pipelined adaptive LMS predictor for electronic support measures receivers,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 13, no. 1, pp. 86–99, Jan. 2005.
P. K. Meher and S. Y. Park, “Low adaptation-delay LMS adaptive filter part-I: Introducing a novel multiplication cell,” in Proc. IEEE Int. Midwest Symp. Circuits Syst., Aug. 2011, pp. 1–4.
P. K. Meher and S. Y. Park, “Low adaptation-delay LMS adaptive filter part-II: An optimized architecture,” in Proc. IEEE Int. Midwest Symp. Circuits Syst., Aug. 2011, pp. 1–4.
Pramod Kumar Meher (2010) “Novel Input Coding Technique for High-Precision LUT-Based Multiplication for DSP Applications”, IEEE Transaction on Embedded System, IEEE/IFIP International Conference on Very Large Scale Integration (VLSI) and System-On-Chip (SOC)., pp 201-206.
Pramod Kumar Meher and Sang Yoon Park (2014)”Area-Delay-Power Efficient Fixed-Point LMS Adaptive Filter With Low Adaptation-Delay”, IEEE Transaction on Very Large Scale Integration (VLSI) Syst.,Vol.22,no.2,pp 362-371.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.