File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Transform domain approximate QR-LS adaptive filtering algorithm
Title | Transform domain approximate QR-LS adaptive filtering algorithm |
---|---|
Authors | |
Issue Date | 2003 |
Citation | Proceedings - Ieee International Symposium On Circuits And Systems, 2003, v. 4, p. IV373-IV376 How to Cite? |
Abstract | An improved approximate QR-least squares (A-QR-LS) algorithm, called the transform domain A-QR-LS (TA-QR-LS) algorithm, is introduced. The input signal vector is approximately decorrelated by some unitary transformations before applying the A-QR-LS, which is shown to improve considerably the convergence speed of the A-QR-LS algorithm recently proposed by Liu [4]. Further, it is possible to reduce the arithmetic complexities (O(N)) of the A-QR-LS, and TA-QR-LS algorithms by using Givens rotations instead of the Householder transformation. Simulation results show that the proposed TA-QR-LS algorithm is a good alternative to the conventional recursive least squares (RLS) algorithm in adaptive filtering applications involving multiple channels, acoustic modeling, and fast parameter variations. |
Persistent Identifier | http://hdl.handle.net/10722/158406 |
ISSN | 2023 SCImago Journal Rankings: 0.307 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yang, XX | en_US |
dc.contributor.author | Chan, SC | en_US |
dc.date.accessioned | 2012-08-08T08:59:29Z | - |
dc.date.available | 2012-08-08T08:59:29Z | - |
dc.date.issued | 2003 | en_US |
dc.identifier.citation | Proceedings - Ieee International Symposium On Circuits And Systems, 2003, v. 4, p. IV373-IV376 | en_US |
dc.identifier.issn | 0271-4310 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/158406 | - |
dc.description.abstract | An improved approximate QR-least squares (A-QR-LS) algorithm, called the transform domain A-QR-LS (TA-QR-LS) algorithm, is introduced. The input signal vector is approximately decorrelated by some unitary transformations before applying the A-QR-LS, which is shown to improve considerably the convergence speed of the A-QR-LS algorithm recently proposed by Liu [4]. Further, it is possible to reduce the arithmetic complexities (O(N)) of the A-QR-LS, and TA-QR-LS algorithms by using Givens rotations instead of the Householder transformation. Simulation results show that the proposed TA-QR-LS algorithm is a good alternative to the conventional recursive least squares (RLS) algorithm in adaptive filtering applications involving multiple channels, acoustic modeling, and fast parameter variations. | en_US |
dc.language | eng | en_US |
dc.relation.ispartof | Proceedings - IEEE International Symposium on Circuits and Systems | en_US |
dc.title | Transform domain approximate QR-LS adaptive filtering algorithm | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Chan, SC:scchan@eee.hku.hk | en_US |
dc.identifier.authority | Chan, SC=rp00094 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.scopus | eid_2-s2.0-17744408205 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-17744408205&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 4 | en_US |
dc.identifier.spage | IV373 | en_US |
dc.identifier.epage | IV376 | en_US |
dc.identifier.scopusauthorid | Yang, XX=7406506103 | en_US |
dc.identifier.scopusauthorid | Chan, SC=13310287100 | en_US |
dc.identifier.issnl | 0271-4310 | - |