KMITL

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

Browse

Search Results

Now showing 1 - 2 of 2
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Diffusion recursive least squares algorithm based on triangular decomposition
    (2023-10-01)
    Prongnuch, Sethakarn
    ;
    Sitjongsataporn, Suchada
    ;
    Wiangtong, Theerayod
    In this paper, diffusion strategies used by QR-decomposition based on recursive least squares algorithm (DQR-RLS) and the sign version of DQR-RLS algorithm (DQR-sRLS) are introduced for distributed networks. In terms of the QR-decomposition method and Cholesky factorization, a modified Kalman vector is given adaptively with the help of unitary rotation that can decrease the complexity from inverse autocorrelation matrix to vector. According to the diffusion strategies, combine-then-adapt (CTA) and adapt-then-combine (ATC) based on DQR-RLS and DQR-sRLS algorithms are proposed with the combination and adaptation steps. To minimize the cost function, diffused versions of CTA-DQR-RLS, ATC-DQR-RLS, CTA-DQR-sRLS and ATC-DiQR-sRLS algorithms are compared. Simulation results depict that the proposed DQR-RLS-based and DQR-sRLS-based algorithms can clearly achieve the better performance than the standard combine-then-adapt-diffusion RLS (CTA-DRLS) and ATC-DRLS mechanisms.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Diffusion Mixed-Node Recursive Least Square-based Algorithm over Adaptive Network
    (2022-01-01)
    Sitjongsataporn, Suchada
    ;
    Prongnuch, Sethakarn
    ;
    Wiangtong, Theerayod
    This paper proposes a diffusion framework related on the mixed-node constraint based on recursive least squares (RLS) algorithm with adaptive network. The proposed Combine-Then-Adapt and Adapt-Then-Combine diffusion algorithms based on RLS algorithm are derived shortly by minimising the mixed-node least square-based criterion for distributed estimation over the adaptive network. The mixed-node cost function is described and illustrated briefly. Experimental results depict that these proposed algorithms is able to achieve the fast convergence better than the conventional algorithms.