KMITL

Permanent URI for this communityhttps://dspace.kmitl.ac.th/handle/123456789/1

Browse

Settings

Author: search.filters.author.Prongnuch, SethakarnSubject: search.filters.subject.Sign algorithm

Search Results

Now showing 1 - 2 of 2
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Diffusion Affine Projection Sign Algorithm based on QR-Decomposition
    (2021-03-10)
    Sitjongsataporn, Suchada
    ;
    Prongnuch, Sethakarn
    ;
    Wiangtong, Theerayod
    In this paper, an Adapt-Then-Combine diffusion strategy on affine projection sign algorithm is presented. Based on the QR-decomposition method, the modified inverse autocorrelation matrix is shortly brief to decrease the computational complexity. The Adapt-Then-Combine diffusion strategy is applied on the low complexity of sign algorithm version of inverse square-root affine projection algorithm including with the adaptation and combination steps. By applying an idea of diffusion adaptation algorithm, we derive a diffused version of an affine projection sign algorithm based on QR-Decomposition, denoted as DiQR-APSA. Experimental results show that the proposed DiQR-APSA can achieve the good performance in comparison with the standard affine projection sign algorithm.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Stochastic behaviour analysis of adaptive averaging step-size sign normalised hammerstein spline adaptive filtering
    (2021-01-01)
    Wiangtong, Theerayod
    ;
    Prongnuch, Sethakarn
    ;
    Sitjongsataporn, Suchada
    We introduce a sign algorithm based on the normalised least mean square with Hammerstein adaptive filtering using adaptive averaging step-size mechanism, which is derived by the minimised absolute a posteriori squared error. To improve the performance by reducing computational complexity, we suggest an adaptive averaging using energy of errors to update step-size variant. The analysis of convergence behaviour and mean square performance are derived. Experimental results reveal that the proposed algorithm can perform better than the least mean square approach based on the Hammerstein model of adaptive filtering.