LMS algorithm and discrete orthogonal transforms

Author

Wang, Shuenn-Shyang

Author_Institution

Dept. of Electr. Eng., Tatung Inst. of Technol., Taipei, Taiwan

Volume

38

Issue

8

fYear

1991

fDate

8/1/1991 12:00:00 AM

Firstpage

949

Lastpage

951

Abstract

A general relation between the least mean square (LMS) algorithm and the discrete orthogonal transforms is established. Discrete orthogonal transforms, including the discrete Fourier transform (DFT), the discrete Hartley transform (DHT), the discrete cosine transform (DCT), the discrete sine transform (DST), and the Walsh-Hadamard transform (WHT), etc. are extensively used in signal and image processing. It is shown that the LMS algorithm could provide a means for the calculation of forward orthogonal transforms as well as inverse orthogonal transforms by properly choosing the input vector and adaptation speed

Keywords

computerised picture processing; computerised signal processing; least squares approximations; DCT; DFT; DHT; DST; LMS algorithm; WHT; Walsh-Hadamard transform; calculation of forward orthogonal transforms; discrete Fourier transform; discrete Hartley transform; discrete cosine transform; discrete orthogonal transforms; discrete sine transform; image processing; inverse orthogonal transforms; least mean square algorithm; Algorithm design and analysis; Circuits and systems; DH-HEMTs; Discrete Fourier transforms; Discrete cosine transforms; Discrete transforms; Fourier transforms; Image processing; Least squares approximation; Signal processing;

fLanguage

English

Journal_Title

Circuits and Systems, IEEE Transactions on

Publisher

ieee

ISSN

0098-4094

Type

jour

DOI

10.1109/31.85637

Filename

85637