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.
Collaboration network of the authors
7 authors ·
8 co-authorship links
· 4 across different organisations
Hover or tap a name to highlight its co-authors. Double-click to open the author's page.
Mahanakorn University of Technology
Suan Sunandha Rajabhat University
King Mongkut's Institute of Technology Ladkrabang
Different organisations
Same organisation
Affiliation unknown
Thicker line = more joint articles · bigger circle = more articles
Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.