Efficient block implementation of exact sequential least-squares problems

Author

Yu, Xiao-Hu ; He, Zhen-Ya

Author_Institution

Dept. of Radio Eng., Nanjing Inst. of Technol., China

fYear

1988

fDate

11-14 Apr 1988

Firstpage

1616

Abstract

An efficient blockwise algorithm, named the block sequential least-squares (BSLS) algorithm, is presented for sequentially solving exact LS problems in real time. The information is carried from block to block by iterating some correlation vectors. The average operations of the BSLS are fewer than sample-by-sample fast RLS algorithms. The BSLS algorithm allows efficient use of the FFT technique to make gains in computational complexity savings. It is shown that the new algorithm can provide improved numerical features over the existing fast-RLS algorithms due to the new adaptation version

Keywords

computational complexity; fast Fourier transforms; filtering and prediction theory; least squares approximations; FFT technique; adaptive filtering; block sequential least squares algorithm; computational complexity savings; correlation vectors; efficient blockwise algorithm; exact sequential least-squares problems; iteration; Computational efficiency; Costs; Delay effects; Filtering algorithms; Nonlinear filters; Packet switching; Resonance light scattering; Spectral analysis; System identification; Transversal filters;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on

Conference_Location

New York, NY

ISSN

1520-6149

Type

conf

DOI

10.1109/ICASSP.1988.196920

Filename

196920