DSpace@nitr >
National Institue of Technology- Rourkela >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/53

Full metadata record

DC FieldValueLanguage
contributor.authorMeher, P K-
contributor.authorPanda, G-
date.accessioned2005-06-06T06:37:46Z-
date.available2005-06-06T06:37:46Z-
date.issued1993-09-
identifier.citationIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, Vol 40, Iss 9, P 582-585en
identifier.urihttp://hdl.handle.net/2080/53-
descriptionPersonal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE DOI: 10.1109/82.257341en
description.abstractAn efficient adaptive filtering algorithm named as the unconstrained Hartley domain least mean square (UHLMS) algorithm has been proposed. It is found from computer simulation that the proposed algorithm has similar performance to the time domain least mean square (LMS) algorithm for uncorrelated signals; but yields faster and better convergence for highly correlated signals. The UHLMS algorithm has identical performance to that of the unconstrained frequency domain least mean square (UFLMS) algorithm, but requires significantly less computationen
format.extent383677 bytes-
format.mimetypeapplication/pdf-
language.isoen-
publisherIEEEen
subjectadaptive filtersen
subjectcomputational complexityen
subjectsignal processingen
titleUnconstrained Hartley domain least mean square adaptive filteren
typeArticleen
Appears in Collections:Journal Articles

Files in This Item:

File Description SizeFormat
meher1.pdf374KbAdobe PDFView/Open

Show simple item record

All items in DSpace are protected by copyright, with all rights reserved.

 

Powered by DSpace Feedback