Pipelined RLS adaptive filtering using scaled tangent rotations (STAR)

Kalavai J. Raghunath, Keshab K Parhi

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

The QR decomposition-based recursive least-squares (RLS) adaptive filtering algorithm (referred to as QRD-RLS) is very popular because it has good numerical properties and can be mapped onto a systolic array. However in this architecture pipelining of the operations within the systolic array cells is difficult. Pipelining would be necessary to operate at high speeds or ilo reduce the power dissipation in a VLSI implementation. Pipelining QRD-RLS using look-ahead techniques leads to a large hardware overhead. The square-root free forms of QRD-RLS are also difficult to pipeline. In this paper a new scaled tangent rotation (STAR) is used instead of the Givens rotations used in QRD-RLS. The STAR-based RLS algorithm (referred to as STAR-RLS) is designed such that fine-grain pipelining can be accomplished with little hardware overhead. The scaled tangent rotations are not exactly orthogonal transformations but tend to become orthogonal asymptotically. The STAR-RLS algorithm is square-root free and has less complexity and lower intercell communication than the QRD-RLS algorithm. The properties of the STAR-RLS algorithm such as stability numerical property and dynamic range are examined with and without pipelining and compared with those of QRD-RLS. Simulation results are presented to compare the performance of STAR-RLS and QRDRLS algorithms.

Original languageEnglish (US)
Pages (from-to)2591-2604
Number of pages14
JournalIEEE Transactions on Signal Processing
Volume44
Issue number10
DOIs
StatePublished - Dec 1 1996

Fingerprint

Adaptive filtering
Systolic arrays
Hardware
Convergence of numerical methods
Energy dissipation
Pipelines
Decomposition
Communication

Cite this

Pipelined RLS adaptive filtering using scaled tangent rotations (STAR). / Raghunath, Kalavai J.; Parhi, Keshab K.

In: IEEE Transactions on Signal Processing, Vol. 44, No. 10, 01.12.1996, p. 2591-2604.

Research output: Contribution to journalArticle

@article{eaeda2aeea51489783c7f03a69cd5e01,
title = "Pipelined RLS adaptive filtering using scaled tangent rotations (STAR)",
abstract = "The QR decomposition-based recursive least-squares (RLS) adaptive filtering algorithm (referred to as QRD-RLS) is very popular because it has good numerical properties and can be mapped onto a systolic array. However in this architecture pipelining of the operations within the systolic array cells is difficult. Pipelining would be necessary to operate at high speeds or ilo reduce the power dissipation in a VLSI implementation. Pipelining QRD-RLS using look-ahead techniques leads to a large hardware overhead. The square-root free forms of QRD-RLS are also difficult to pipeline. In this paper a new scaled tangent rotation (STAR) is used instead of the Givens rotations used in QRD-RLS. The STAR-based RLS algorithm (referred to as STAR-RLS) is designed such that fine-grain pipelining can be accomplished with little hardware overhead. The scaled tangent rotations are not exactly orthogonal transformations but tend to become orthogonal asymptotically. The STAR-RLS algorithm is square-root free and has less complexity and lower intercell communication than the QRD-RLS algorithm. The properties of the STAR-RLS algorithm such as stability numerical property and dynamic range are examined with and without pipelining and compared with those of QRD-RLS. Simulation results are presented to compare the performance of STAR-RLS and QRDRLS algorithms.",
author = "Raghunath, {Kalavai J.} and Parhi, {Keshab K}",
year = "1996",
month = "12",
day = "1",
doi = "10.1109/78.539042",
language = "English (US)",
volume = "44",
pages = "2591--2604",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

TY - JOUR

T1 - Pipelined RLS adaptive filtering using scaled tangent rotations (STAR)

AU - Raghunath, Kalavai J.

AU - Parhi, Keshab K

PY - 1996/12/1

Y1 - 1996/12/1

N2 - The QR decomposition-based recursive least-squares (RLS) adaptive filtering algorithm (referred to as QRD-RLS) is very popular because it has good numerical properties and can be mapped onto a systolic array. However in this architecture pipelining of the operations within the systolic array cells is difficult. Pipelining would be necessary to operate at high speeds or ilo reduce the power dissipation in a VLSI implementation. Pipelining QRD-RLS using look-ahead techniques leads to a large hardware overhead. The square-root free forms of QRD-RLS are also difficult to pipeline. In this paper a new scaled tangent rotation (STAR) is used instead of the Givens rotations used in QRD-RLS. The STAR-based RLS algorithm (referred to as STAR-RLS) is designed such that fine-grain pipelining can be accomplished with little hardware overhead. The scaled tangent rotations are not exactly orthogonal transformations but tend to become orthogonal asymptotically. The STAR-RLS algorithm is square-root free and has less complexity and lower intercell communication than the QRD-RLS algorithm. The properties of the STAR-RLS algorithm such as stability numerical property and dynamic range are examined with and without pipelining and compared with those of QRD-RLS. Simulation results are presented to compare the performance of STAR-RLS and QRDRLS algorithms.

AB - The QR decomposition-based recursive least-squares (RLS) adaptive filtering algorithm (referred to as QRD-RLS) is very popular because it has good numerical properties and can be mapped onto a systolic array. However in this architecture pipelining of the operations within the systolic array cells is difficult. Pipelining would be necessary to operate at high speeds or ilo reduce the power dissipation in a VLSI implementation. Pipelining QRD-RLS using look-ahead techniques leads to a large hardware overhead. The square-root free forms of QRD-RLS are also difficult to pipeline. In this paper a new scaled tangent rotation (STAR) is used instead of the Givens rotations used in QRD-RLS. The STAR-based RLS algorithm (referred to as STAR-RLS) is designed such that fine-grain pipelining can be accomplished with little hardware overhead. The scaled tangent rotations are not exactly orthogonal transformations but tend to become orthogonal asymptotically. The STAR-RLS algorithm is square-root free and has less complexity and lower intercell communication than the QRD-RLS algorithm. The properties of the STAR-RLS algorithm such as stability numerical property and dynamic range are examined with and without pipelining and compared with those of QRD-RLS. Simulation results are presented to compare the performance of STAR-RLS and QRDRLS algorithms.

UR - http://www.scopus.com/inward/record.url?scp=0030270561&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030270561&partnerID=8YFLogxK

U2 - 10.1109/78.539042

DO - 10.1109/78.539042

M3 - Article

VL - 44

SP - 2591

EP - 2604

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 10

ER -