Recursive Distributed Filtering for Time-Varying Systems over Sensor Network Via Rayleigh Fading Channels: Tackling Binary Measurements
IEEE Transactions on Signal and Information Processing over Networks(2023)SCI 3区
Northeast Petr Univ
Abstract
This paper is concerned with the distributed filtering problem for a class of discrete time-varying stochastic systems over binary sensor networks with the Rayleigh fading channels. Both the system state and measurement are subject to random noises with known statistical information, where the distribution function of measurement noise is employed to extract the functional information for state estimation purposes. The communication between a sensor node and its neighboring ones is implemented over a Rayleigh fading channel. For each binary sensor, a distributed filter is constructed by virtue of the available information from itself and its neighboring nodes, and the overall filtering error dynamics is guaranteed to be exponentially ultimately bounded in the mean square sense. By resorting to a local performance analysis method, sufficient criteria are established for ensuring the existence of the desired distributed filter in terms of a set of recursive linear matrix inequalities. The desired filter parameters are recursively calculated on every node by solving an optimization problem at each time instant with the aim of improving the estimation accuracy. Finally, some comparative results are presented to demonstrate the applicability and effectiveness of the developed distributed filtering scheme.
MoreTranslated text
Key words
Fading channels,Linear matrix inequalities,Performance analysis,Estimation,Petroleum,Information processing,Distribution functions,Binary measurement,distributed filtering,local performance analysis,Rayleigh fading channel,sensor network
求助PDF
上传PDF
View via Publisher
AI Read Science
AI Summary
AI Summary is the key point extracted automatically understanding the full text of the paper, including the background, methods, results, conclusions, icons and other key content, so that you can get the outline of the paper at a glance.
Example
Background
Key content
Introduction
Methods
Results
Related work
Fund
Key content
- Pretraining has recently greatly promoted the development of natural language processing (NLP)
- We show that M6 outperforms the baselines in multimodal downstream tasks, and the large M6 with 10 parameters can reach a better performance
- We propose a method called M6 that is able to process information of multiple modalities and perform both single-modal and cross-modal understanding and generation
- The model is scaled to large model with 10 billion parameters with sophisticated deployment, and the 10 -parameter M6-large is the largest pretrained model in Chinese
- Experimental results show that our proposed M6 outperforms the baseline in a number of downstream tasks concerning both single modality and multiple modalities We will continue the pretraining of extremely large models by increasing data to explore the limit of its performance
Upload PDF to Generate Summary
Must-Reading Tree
Example

Generate MRT to find the research sequence of this paper
Related Papers
2003
被引用5071 | 浏览
2012
被引用57 | 浏览
2014
被引用104 | 浏览
2014
被引用62 | 浏览
2016
被引用370 | 浏览
2016
被引用672 | 浏览
2017
被引用26 | 浏览
2017
被引用133 | 浏览
2019
被引用10 | 浏览
2020
被引用58 | 浏览
2019
被引用24 | 浏览
Consensus of Multi-Agent Systems under Binary-Valued Measurements and Recursive Projection Algorithm
2019
被引用44 | 浏览
2019
被引用41 | 浏览
2021
被引用169 | 浏览
2021
被引用56 | 浏览
2019
被引用23 | 浏览
2021
被引用169 | 浏览
2022
被引用33 | 浏览
Data Disclaimer
The page data are from open Internet sources, cooperative publishers and automatic analysis results through AI technology. We do not make any commitments and guarantees for the validity, accuracy, correctness, reliability, completeness and timeliness of the page data. If you have any questions, please contact us by email: report@aminer.cn
Chat Paper