LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Communication-Reducing Algorithm of Distributed Least Mean Square Algorithm with Neighbor-Partial Diffusion

Photo by headwayio from unsplash

With the development of distributed algorithms, many researchers are committed to the goal of maintaining the long-term stability of the network by reducing the communication cost. However, many algorithms that… Click to show full abstract

With the development of distributed algorithms, many researchers are committed to the goal of maintaining the long-term stability of the network by reducing the communication cost. However, many algorithms that lessen communication costs often result in a significant decrease in estimation accuracy. In order to reduce the communication cost with less performance degradation, the distributed neighbor-partial diffusion least-mean-square algorithm (NPDLMS) is proposed in this paper. Besides, considering the data redundancy in the network, we offer the distributed data selection NPDLMS algorithm, which further improves the estimation accuracy and reduces the communication cost. In the performance analysis, the stability and the communication cost of the algorithms are given.

Keywords: partial diffusion; communication; neighbor partial; mean square; least mean; communication cost

Journal Title: Circuits, Systems, and Signal Processing
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.