Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/27388
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wang, S | - |
dc.contributor.author | Wang, Z | - |
dc.contributor.author | Dong, H | - |
dc.contributor.author | Shen, B | - |
dc.contributor.author | Chen, Y | - |
dc.date.accessioned | 2023-10-16T11:45:22Z | - |
dc.date.available | 2023-10-16T11:45:22Z | - |
dc.date.issued | 2023-09-25 | - |
dc.identifier | ORCID iD: Zidong Wang https://orcid.org/0000-0002-9576-7401 | - |
dc.identifier | 111268 | - |
dc.identifier.citation | Wang, S. et al. (2023) 'Quadratic filtering for discrete time-varying non-Gaussian systems under binary encoding schemes', Automatica, 158, 111268, pp. 1 - 12. doi: 10.1016/j.automatica.2023.111268. | en_US |
dc.identifier.issn | 0005-1098 | - |
dc.identifier.uri | https://bura.brunel.ac.uk/handle/2438/27388 | - |
dc.description.abstract | This paper is concerned with the recursive quadratic filtering problem for a class of linear discrete-time systems subject to non-Gaussian noises. Considering its robustness against channel noises, the binary encoding scheme is utilized in the process of data transmission from sensors to the filter. Under such a scheme, the original signal is first encoded into a bit string, and then transmitted via memoryless binary symmetric channels (with certain crossover probabilities). Subsequently, the received bit string is recovered by a decoder at the receiver end. The primary purpose of this paper is to design a recursive quadratic filter for the underlying non-Gaussian systems with a minimized upper bound on the filtering error covariance. For this purpose, an augmented system is first constructed by aggregating the original vectors and their second-order Kronecker powers. Accordingly, an upper bound on the filtering error covariance is obtained in the form of solutions to certain Riccati-like difference equations, and the obtained bound is then minimized by properly choosing the filter parameter. Moreover, sufficient conditions are established to guarantee the boundedness of filtering error covariance. Finally, a numerical example is provided to demonstrate the effectiveness of the proposed quadratic filtering algorithm. | en_US |
dc.description.sponsorship | National Natural Science Foundation of China under Grants 61933007, U21A2019, 62273088, 61973102 and U22A2044,; Natural Science Foundation of Shandong Province of China under Grant ZR2021MF088; Hainan Province Science and Technology Special Fund of China under Grant ZDYF2022SHFZ105; Alexander von Humboldt Foundation of Germany. | en_US |
dc.format.extent | 1 - 12 | - |
dc.format.medium | Print-Electronic | - |
dc.language.iso | en_US | en_US |
dc.publisher | Elsevier | en_US |
dc.rights | Copyright © 2023 Elsevier Ltd. All rights reserved. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/ (see: https://www.elsevier.com/about/policies/sharing). The version of record is available online at: https://doi.org/10.1016/j.automatica.2023.111268 . | - |
dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/4.0/ | - |
dc.subject | quadratic filtering | en_US |
dc.subject | non-Gaussian noises | en_US |
dc.subject | binary encoding schemes | en_US |
dc.subject | matrix difference equations | en_US |
dc.subject | boundedness | en_US |
dc.title | Quadratic filtering for discrete time-varying non-Gaussian systems under binary encoding schemes | en_US |
dc.type | Article | en_US |
dc.identifier.doi | https://doi.org/10.1016/j.automatica.2023.111268 | - |
dc.relation.isPartOf | Automatica | - |
pubs.publication-status | Published | - |
pubs.volume | 158 | - |
dc.identifier.eissn | 1873-2836 | - |
dc.rights.holder | Elsevier Ltd. | - |
Appears in Collections: | Dept of Computer Science Embargoed Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FullText.pdf | Embargoed until 25 September 2024 | 299.06 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License