A Self-Adjusting Simple Hyperstable Adaptive Recursive Algorithm

Adaptive infinite impulse response (IIR), or recursive, filters are less attractive mainly because of the stability and the difficulties associated with their adaptive algorithms. Hyperstability theory when simplified and adapted for digital signal processing offers a new class of IIR filters, simpl...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of modelling & simulation Ročník 27; číslo 2; s. 164 - 170
Hlavní autoři: Sezer, O., Ferdjallah, M.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Calgary Taylor & Francis 2007
Taylor & Francis Ltd
Témata:
Algorithms
Design
hyperstability
pole-zero placement
Self-adjusting
Signal processing
simple hyper-stable adaptive recursive filter
strictly positive real
Studies
ISSN:0228-6203, 1925-7082
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Adaptive infinite impulse response (IIR), or recursive, filters are less attractive mainly because of the stability and the difficulties associated with their adaptive algorithms. Hyperstability theory when simplified and adapted for digital signal processing offers a new class of IIR filters, simple hyperstable adaptive recursive filters (SHARFs), which is directly related to strictly positive real (SPR) transfer functions. One of the most important drawbacks of the SHARF algorithm is the presence of the unknown denominator in the transfer function that must be SPR in order to ensure convergence. In this paper, SHARF is investigated with SPR transfer functions designed without any priori knowledge of the filter parameters by the pole-zero placement on the unit circle method and made self-adjusting. To demonstrate self-adjustment of the algorithm, SHARF algorithm using constraint least-mean square (LMS) method is applied to a pure four-pole autoregressive process.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0228-6203
1925-7082
DOI:10.1080/02286203.2007.11442413