New Recursive Parameter Estimation Algorithms in Impulsive Noise Environment with Application to Frequency Estimation and System Identification
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Science, Technology & Agriculture > Energy technology and engineering > Electrical engineering > New Recursive Parameter Estimation Algorithms in Impulsive Noise Environment with Application to Frequency Estimation and System Identification
New Recursive Parameter Estimation Algorithms in Impulsive Noise Environment with Application to Frequency Estimation and System Identification

New Recursive Parameter Estimation Algorithms in Impulsive Noise Environment with Application to Frequency Estimation and System Identification


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

This dissertation, "New Recursive Parameter Estimation Algorithms in Impulsive Noise Environment With Application to Frequency Estimation and System Identification" by Wing-yi, Lau, 劉穎兒, was obtained from The University of Hong Kong (Pokfulam, Hong Kong) and is being sold pursuant to Creative Commons: Attribution 3.0 Hong Kong License. The content of this dissertation has not been altered in any way. We have altered the formatting in order to facilitate the ease of printing and reading of the dissertation. All rights not granted by the above license are retained by the author. Abstract: Abstract of the Thesis Entitled New Recursive Parameter Estimation Algorithms in Impulsive Noise Environment with Application to Frequency Estimation and System Identification submitted by Wing-Yi LAU for the degree of Master of Philosophy at The University of Hong Kong in August 2006 Least-squares (LS) parameter estimation algorithms are very useful in applications such as frequency estimation and system identification. In order to support online applications with a much lower arithmetic complexity, new QR-decomposition-(QRD)-based recursive algorithms for estimating the frequency components of multiple sinusoids based on the linear prediction (LP) approach and identifying the system under colored noise are proposed in this study. Furthermore, since the LS-based algorithms are sensitive to impulsive noise, new QRD- based recursive algorithms with M-estimation are introduced so that the robustness of the proposed algorithms can be improved and the impulsive noise can be de-emphasized and removed effectively. Simulation results show that the proposed algorithms give better performance with lower arithmetic complexity than the conventional LS algorithms. Besides parameter estimation, this thesis presents a new Kalman filter-based power spectral density (PSD) estimation algorithm for nonstationary pressure signals. The pressure signals are modeled as an autoregressive (AR) process and a stochastically perturbed difference equation constraint model is used to describe the dynamics of the AR coefficients. The proposed algorithm uses variable numbers of measurements to estimate the coefficients instead of fixed number of measurements in the conventional Kalman filter. In addition, the number of the measurements of the proposed algorithm is adaptively chosen by the intersection of confidence intervals (ICI) rule. Simulation results show that the proposed algorithm achieves a better time-frequency resolution and better tracking performance than the conventional Kalman filter-based algorithm which only updates the fixed number of measurements for each estimation. The above algorithms are proposed for linear models. For nonlinear models, this thesis proposes a new recursive parameter estimation algorithm for the nonlinear adaptive function coefficients autoregressive (AFAR) models. The AFAR model is a generalization of the familiar linear AR model and it is suitable for modeling nonlinear correlation of a time series governed by unknown nonlinearities. The nonlinearities are estimated using local polynomial regression (LPR), which gives a better bias-variance tradeoff than traditional polynomial approximations. Experimental results show that the model parameters can be estimated accurately using the proposed method. Moreover, using the close relationship between a simplified AFAR model and the nonlinear Wiener system, a new recursive algorithm for identifying the nonlinear Wiener system is proposed. Another new recursive algorithm for identifying the nonlinear Wiener-Hammerstein system (WHS) model is also proposed using the relationship between the AFAR model and the WHS model. DOI: 10.5353/th_b3759586 Subjects: Signal processing - Statistical methods Parameter estimation Algorithms


Best Sellers


Product Details
  • ISBN-13: 9781361468586
  • Publisher: Open Dissertation Press
  • Publisher Imprint: Open Dissertation Press
  • Height: 279 mm
  • No of Pages: 132
  • Weight: 322 gr
  • ISBN-10: 1361468580
  • Publisher Date: 27 Jan 2017
  • Binding: Paperback
  • Language: English
  • Spine Width: 7 mm
  • Width: 216 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
New Recursive Parameter Estimation Algorithms in Impulsive Noise Environment with Application to Frequency Estimation and System Identification
Open Dissertation Press -
New Recursive Parameter Estimation Algorithms in Impulsive Noise Environment with Application to Frequency Estimation and System Identification
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

New Recursive Parameter Estimation Algorithms in Impulsive Noise Environment with Application to Frequency Estimation and System Identification

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!