Presentation 2002/1/2
A study on an LRLS algorithm with discrete cosine transform
Ryota SATO, Eisuke HORITA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In recent years, an LRLS algorithm which is more accurate and stable in a noisy environment than the RLS algorithm has been proposed. However, since the LRLS algorithm needs to compute a matrix inverse in each iteration, the computational complexity in the LRLS algorithm is on the order of M^3. In this report, since a matrix inverse is approximately computed by using discrete cosine transform, the LRLS algorithm whose computational complexity is reduced from the order of M^3 to the order of M^2 is considered.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) adaptive signal processing / LRLS algorithm / eigenvalue decomposition / discrete cosine transform
Paper # 2001-DSP-128, 2001-SAT-86, 2001-RCS-186
Date of Issue

Conference Information
Committee SAT
Conference Date 2002/1/2(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Satellite Telecommunications (SAT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A study on an LRLS algorithm with discrete cosine transform
Sub Title (in English)
Keyword(1) adaptive signal processing
Keyword(2) LRLS algorithm
Keyword(3) eigenvalue decomposition
Keyword(4) discrete cosine transform
1st Author's Name Ryota SATO
1st Author's Affiliation Faculty of Engineering, Kanazawa University()
2nd Author's Name Eisuke HORITA
2nd Author's Affiliation Faculty of Engineering, Kanazawa University
Date 2002/1/2
Paper # 2001-DSP-128, 2001-SAT-86, 2001-RCS-186
Volume (vol) vol.101
Number (no) 540
Page pp.pp.-
#Pages 6
Date of Issue