All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

A Novel Variable Step-Size LMS Algorithm for Decentralized Incremental Distributed Networks

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F23%3APU149358" target="_blank" >RIV/00216305:26230/23:PU149358 - isvavai.cz</a>

  • Result on the web

    <a href="https://link.springer.com/article/10.1007/s00034-023-02426-y" target="_blank" >https://link.springer.com/article/10.1007/s00034-023-02426-y</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s00034-023-02426-y" target="_blank" >10.1007/s00034-023-02426-y</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A Novel Variable Step-Size LMS Algorithm for Decentralized Incremental Distributed Networks

  • Original language description

    This work proposes a variable step-size strategy for estimation over distributed networks using the incremental scheme. The proposed algorithm employs the ratio of filtered squared instantaneous error to the squared instantaneous error in a windowed format. This reduces the dependency on the error power which is particularly beneficial in low signal-to-noise power ratio situations. A comprehensive theoretical analysis has been performed, and closed-form solutions of mean squared error, excess mean squared error and mean squared deviation have been derived. The theoretical results are verified via simulation results. Extensive testing has been done through experiments under various scenarios to show the supremacy of the proposed algorithm in comparison with several other algorithms.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    20206 - Computer hardware and architecture

Result continuities

  • Project

    <a href="/en/project/GA21-13001S" target="_blank" >GA21-13001S: Automated design of hardware accelerators for resource-aware machine learning</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2023

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    CIRCUITS SYSTEMS AND SIGNAL PROCESSING

  • ISSN

    0278-081X

  • e-ISSN

    1531-5878

  • Volume of the periodical

    41

  • Issue of the periodical within the volume

    12

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    24

  • Pages from-to

    7226-7249

  • UT code for WoS article

    001034471300001

  • EID of the result in the Scopus database

    2-s2.0-85165560638