Open Access System for Information Sharing

Login Library

 

Thesis
Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
There are no files associated with this item.
DC FieldValueLanguage
dc.contributor.author강병훈en_US
dc.date.accessioned2014-12-01T11:48:58Z-
dc.date.available2014-12-01T11:48:58Z-
dc.date.issued2013en_US
dc.identifier.otherOAK-2014-01523en_US
dc.identifier.urihttp://postech.dcollection.net/jsp/common/DcLoOrgPer.jsp?sItemId=000001628584en_US
dc.identifier.urihttps://oasis.postech.ac.kr/handle/2014.oak/2025-
dc.descriptionDoctoren_US
dc.description.abstractAdaptive filters have been used in a wide variety of applications such as noise cancellation, system identification, and prediction. However, it is well established that noisy inputs cause bias in the estimates obtained by common adaptive filtering algorithms. Furthermore, the performances of the adaptive filtering algorithms, accuracy or convergence rate of the estimation, are severely degraded by outliers such as an impulsive noise. To overcome these problems, there have been proposed several algorithms but there still exists room for improvement on performance and efficiency. Therefore, this dissertation presents some adaptive filtering algorithms working with noisy input or impulsive noisy output and having improved performance and reduced computational complexity.At first, a bias-compensated normalized least mean square (NLMS) algorithm with a noisy input is presented. The algorithm produces unbiased estimate and overcomes the drawbacks of the consistent NLMS algorithm, a former work of this subject. The algorithm is obtained from an approximated cost function based on the statistical properties of the input noise and involves a condition checking constraint to decide whether the weight coefficient vector must be updated.At second, an efficient unbiased recursive least squares (RLS) filtering algorithm with noisy input is proposed. The unbiased estimate is obtained without knowing any a priori information via a new cost. Furthermore, to reduce computational complexity, the estimate is updated along the current input-vector direction and the corresponding gain is efficiently computed. In addition, to increase a convergence rate, the algorithm is extended to update the estimate along not only current but also past input-vector directions.At third, a fast RLS algorithm for impulsive noisy adaptive filtering is presented. An outlier identifier is designed to recognize measurements corrupted by impulsive noises and used to produce the robust RLS algorithm using a new cost with the outlier identifier. To find its fast version, the stochastic line search method is used. The detection and reinitialization procedure for sudden system changes is also included to enhance tracking performance. The algorithm achieves a small steady-state error and a good tracking performance simultaneously while dramatically reducing computational complexity.Lastly, an efficient algorithm that is developed to handle both noisy input and impulsive noisy output is presented by combining the above algorithms.en_US
dc.languageengen_US
dc.publisher포항공과대학교en_US
dc.rightsBY_NC_NDen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.0/kren_US
dc.titleEfficient Algorithms for Identifying an Unknown FIR System in Noisy Adaptive Filteringen_US
dc.typeThesisen_US
dc.contributor.college일반대학원 전자전기공학과en_US
dc.date.degree2013- 8en_US
dc.type.docTypeThesis-

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Views & Downloads

Browse