Paper
1 November 1993 Pipelined implementation of high-speed STAR-RLS adaptive filters
Kalavai J. Raghunath, Keshab K. Parhi
Author Affiliations +
Abstract
The popular QR decomposition based recursive least-squares (RLS) adaptive filtering algorithm (referred to as QRD-RLS) has a limited speed of operation depending on the processing time of each individual cell. A new scaled tangent rotation based STAR-RLS algorithm has been designed which is suitable for fine-grain pipelining and also has a lower complexity. The inter-cell communication is also reduced by about half. A direct application of look-ahead to STAR-RLS can still lead to some increase in hardware. In this paper look- ahead is applied using delayed update operations such that the complexity is reduced while maintaining a fast convergence. The pipelined STAR-RLS (or PSTAR-RLS) algorithm requires the same number of operations (multiplications or divisions) as the serial STAR-RLS algorithm. Practical issues related to the STAR-RLS algorithm such as numerical stability and dynamic range are also examined.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kalavai J. Raghunath and Keshab K. Parhi "Pipelined implementation of high-speed STAR-RLS adaptive filters", Proc. SPIE 2027, Advanced Signal Processing Algorithms, Architectures, and Implementations IV, (1 November 1993); https://doi.org/10.1117/12.160428
Lens.org Logo
CITATIONS
Cited by 4 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Digital filtering

Algorithm development

Error analysis

Stars

Tantalum

Very large scale integration

Data modeling

Back to Top