Skip to main content
Article thumbnail
Location of Repository

Low-complexity RLS algorithms using dichotomous coordinate descent iterations

By Yuriy V. Zakharov, George P. White and Jie Liu

Abstract

In this paper, we derive low-complexity recursive least squares (RLS) adaptive filtering algorithms. We express the RLS problem in terms of auxiliary normal equations with respect to increments of the filter weights and apply this approach to the exponentially weighted and sliding window cases to derive new RLS techniques. For solving the auxiliary equations, line search methods are used. We first consider conjugate gradient iterations with a complexity of O(N-2) operations per sample; N being the number of the filter weights. To reduce the complexity and make the algorithms more suitable for finite precision implementation, we propose a new dichotomous coordinate descent (DCD) algorithm and apply it to the auxiliary equations. This results in a transversal RLS adaptive filter with complexity as low as 3N multiplications per sample, which is only slightly higher than the complexity of the least mean squares (LMS) algorithm (2N multiplications). Simulations are used to compare the performance of the proposed algorithms against the classical RLS and known advanced adaptive algorithms. Fixed-point FPGA implementation of the proposed DCD-based RLS algorithm is also discussed and results of such implementation are presented

Topics: 1711, 2208
Year: 2008
DOI identifier: 10.1109/TSP.2008.917874
OAI identifier: oai:eprints.whiterose.ac.uk:4124

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.