Recursive Filtering With Measurement Fading: A Multiple Description Coding Scheme
In this article, the recursive filtering problem is studied for a class of discrete-time nonlinear stochastic systems subject to fading measurements. In order to facilitate the data transmission in a resource-constrained communication network, the multiple description coding scheme is adopted to enc...
Saved in:
Published in | IEEE transactions on automatic control Vol. 66; no. 11; pp. 5144 - 5159 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
New York
IEEE
01.11.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
ISSN | 0018-9286 1558-2523 |
DOI | 10.1109/TAC.2020.3034196 |
Cover
Abstract | In this article, the recursive filtering problem is studied for a class of discrete-time nonlinear stochastic systems subject to fading measurements. In order to facilitate the data transmission in a resource-constrained communication network, the multiple description coding scheme is adopted to encode the fading measurements into two descriptions with the identical importance. Two independent Bernoulli distributed random variables are introduced to govern the occurrences of the packet dropouts in two channels from the encoders to the decoders. The channel fading phenomenon is characterized by the <inline-formula><tex-math notation="LaTeX">M</tex-math></inline-formula>th-order Rice fading model whose coefficients are mutually independent random variables obeying certain probability distributions. The purpose of the problem addressed is to design a recursive filter, such that in the simultaneous presence of the stochastic noises, the channel fading and the data coding-decoding mechanism, an upper bound of the filtering error variance is obtained and then minimized at each time step. In virtue of the Riccati difference equation technique and the stochastic analysis approach, the explicit form of the desired filter parameters is derived by solving a sequence of coupled algebraic Riccati-like difference equations. Finally, a simulation experiment is provided to show the applicability of the developed filtering scheme. |
---|---|
AbstractList | In this article, the recursive filtering problem is studied for a class of discrete-time nonlinear stochastic systems subject to fading measurements. In order to facilitate the data transmission in a resource-constrained communication network, the multiple description coding scheme is adopted to encode the fading measurements into two descriptions with the identical importance. Two independent Bernoulli distributed random variables are introduced to govern the occurrences of the packet dropouts in two channels from the encoders to the decoders. The channel fading phenomenon is characterized by the <inline-formula><tex-math notation="LaTeX">M</tex-math></inline-formula>th-order Rice fading model whose coefficients are mutually independent random variables obeying certain probability distributions. The purpose of the problem addressed is to design a recursive filter, such that in the simultaneous presence of the stochastic noises, the channel fading and the data coding-decoding mechanism, an upper bound of the filtering error variance is obtained and then minimized at each time step. In virtue of the Riccati difference equation technique and the stochastic analysis approach, the explicit form of the desired filter parameters is derived by solving a sequence of coupled algebraic Riccati-like difference equations. Finally, a simulation experiment is provided to show the applicability of the developed filtering scheme. In this article, the recursive filtering problem is studied for a class of discrete-time nonlinear stochastic systems subject to fading measurements. In order to facilitate the data transmission in a resource-constrained communication network, the multiple description coding scheme is adopted to encode the fading measurements into two descriptions with the identical importance. Two independent Bernoulli distributed random variables are introduced to govern the occurrences of the packet dropouts in two channels from the encoders to the decoders. The channel fading phenomenon is characterized by the [Formula Omitted]th-order Rice fading model whose coefficients are mutually independent random variables obeying certain probability distributions. The purpose of the problem addressed is to design a recursive filter, such that in the simultaneous presence of the stochastic noises, the channel fading and the data coding–decoding mechanism, an upper bound of the filtering error variance is obtained and then minimized at each time step. In virtue of the Riccati difference equation technique and the stochastic analysis approach, the explicit form of the desired filter parameters is derived by solving a sequence of coupled algebraic Riccati-like difference equations. Finally, a simulation experiment is provided to show the applicability of the developed filtering scheme. |
Author | Shen, Bo Wei, Guoliang Wang, Licheng Wang, Zidong |
Author_xml | – sequence: 1 givenname: Licheng orcidid: 0000-0001-5333-5881 surname: Wang fullname: Wang, Licheng email: wanglicheng1217@163.com organization: Shanghai Key Lab of Modern Optical System, the Department of Control Science and Engineering, University of Shanghai for Science and Technology, Shanghai, China – sequence: 2 givenname: Zidong orcidid: 0000-0002-9576-7401 surname: Wang fullname: Wang, Zidong email: Zidong.Wang@brunel.ac.uk organization: Department of Computer Science, Brunel University, London, U.K – sequence: 3 givenname: Bo orcidid: 0000-0003-3482-5783 surname: Shen fullname: Shen, Bo email: shenbodh@gmail.com organization: College of Information Science and Technology, Donghua University, Shanghai, China – sequence: 4 givenname: Guoliang orcidid: 0000-0003-2928-4142 surname: Wei fullname: Wei, Guoliang email: guoliang.wei1973@gmail.com organization: College of Science, University of Shanghai for Science and Technology, Shanghai, China |
BookMark | eNp9kM9LwzAUx4MouE3vgpeA5878app4G9WpsCHqxGNJs9RldG1NUsH_3pQNDx48Pd573897X75jcNy0jQHgAqMpxkher2b5lCCCphRRhiU_AiOcpiIhKaHHYIQQFokkgp-Csffb2HLG8Ag8vxjdO2-_DJzbOhhnmw_4bsMGLo3yvTM70wQ4V-s4v4EzuOzrYLvawFvjtbNdsG0D83ZYw1e9ifIzcFKp2pvzQ52At_ndKn9IFk_3j_lskWhCcEhYpqhGqShpiSXRNNqkpNK8XJe4ohJVEnGeqoxnVVUpwYgpS54hxjJJRYkzOgFX-7udaz9740OxbXvXxJcFSQXnhFORRhXfq7RrvXemKrQNanAdnLJ1gVExxFfE-IohvuIQXwTRH7Bzdqfc93_I5R6xxphfuSSMpQLTH2VoezA |
CODEN | IETAA9 |
CitedBy_id | crossref_primary_10_1002_asjc_3132 crossref_primary_10_1007_s11071_024_10764_y crossref_primary_10_1080_21642583_2024_2332419 crossref_primary_10_1109_TAC_2022_3172267 crossref_primary_10_1016_j_automatica_2023_111268 crossref_primary_10_1016_j_neucom_2022_08_041 crossref_primary_10_1007_s12555_022_0381_4 crossref_primary_10_1109_TNSE_2024_3395707 crossref_primary_10_1109_TSMC_2022_3226901 crossref_primary_10_1109_TCYB_2022_3169660 crossref_primary_10_1080_00207721_2021_2005178 crossref_primary_10_1109_TSIPN_2021_3125132 crossref_primary_10_1109_TSMC_2023_3290011 crossref_primary_10_1007_s11071_021_06986_z crossref_primary_10_1088_1742_6596_2898_1_012008 crossref_primary_10_1109_LSP_2022_3172623 crossref_primary_10_1002_asjc_2964 crossref_primary_10_1109_TCYB_2021_3049461 crossref_primary_10_1109_TNNLS_2021_3131661 crossref_primary_10_1016_j_jfranklin_2024_107005 crossref_primary_10_1016_j_ins_2022_01_009 crossref_primary_10_1016_j_amc_2023_128337 crossref_primary_10_1080_00207721_2024_2448775 crossref_primary_10_1016_j_neucom_2021_03_032 crossref_primary_10_1016_j_amc_2023_128250 crossref_primary_10_1109_TNNLS_2022_3201521 crossref_primary_10_1016_j_chaos_2023_114074 crossref_primary_10_1109_TCYB_2022_3232529 crossref_primary_10_1002_rnc_5807 crossref_primary_10_1016_j_neunet_2022_05_009 crossref_primary_10_1016_j_neucom_2024_128713 crossref_primary_10_1002_acs_3690 crossref_primary_10_1016_j_inffus_2023_101963 crossref_primary_10_1016_j_compbiomed_2022_106267 crossref_primary_10_1109_TITS_2022_3182506 crossref_primary_10_1002_rnc_6422 crossref_primary_10_1002_rnc_7155 crossref_primary_10_1109_TSIPN_2022_3210374 crossref_primary_10_1002_rnc_6187 crossref_primary_10_1016_j_inffus_2025_103103 crossref_primary_10_1109_JSYST_2024_3379572 crossref_primary_10_1002_rnc_5999 crossref_primary_10_1016_j_neucom_2024_127708 crossref_primary_10_1109_TCYB_2021_3110587 crossref_primary_10_1016_j_automatica_2021_109961 crossref_primary_10_1007_s00034_021_01799_2 crossref_primary_10_1007_s11432_021_3433_8 crossref_primary_10_1016_j_epsr_2025_111596 crossref_primary_10_1109_TVT_2024_3356516 crossref_primary_10_3390_math12233749 crossref_primary_10_1080_00207721_2025_2456001 crossref_primary_10_1109_JSYST_2023_3333823 crossref_primary_10_1109_TSMC_2021_3071390 crossref_primary_10_1109_TAC_2023_3349102 crossref_primary_10_1016_j_automatica_2023_111160 crossref_primary_10_1049_cth2_12181 crossref_primary_10_1002_acs_3831 crossref_primary_10_1109_TSP_2022_3144945 crossref_primary_10_1016_j_neucom_2022_05_063 crossref_primary_10_1109_TAC_2023_3316989 crossref_primary_10_1109_TFUZZ_2021_3112256 crossref_primary_10_1109_TNSE_2022_3173310 crossref_primary_10_1109_TFUZZ_2022_3153144 crossref_primary_10_1109_TSMC_2024_3509626 crossref_primary_10_1002_rnc_5787 crossref_primary_10_1016_j_automatica_2022_110421 crossref_primary_10_1109_TASE_2023_3329784 crossref_primary_10_1109_TCSII_2021_3061777 crossref_primary_10_1109_TSMC_2022_3189092 crossref_primary_10_1016_j_ins_2023_118946 crossref_primary_10_1109_TNNLS_2022_3184487 crossref_primary_10_1109_TFUZZ_2021_3072737 crossref_primary_10_1002_rnc_6084 crossref_primary_10_1002_rnc_6161 crossref_primary_10_1109_TASE_2024_3401740 crossref_primary_10_1002_rnc_6445 crossref_primary_10_1016_j_jfranklin_2022_05_026 crossref_primary_10_1109_TNSE_2021_3076113 crossref_primary_10_1109_TNNLS_2021_3104978 crossref_primary_10_3390_s24061967 |
Cites_doi | 10.1109/TAC.2016.2618000 10.1109/TCSI.2016.2605685 10.1109/TCYB.2017.2740309 10.1016/j.aeue.2014.04.021 10.1109/TAC.2016.2604921 10.1007/s12555-011-0408-8 10.1109/TAC.2012.2199152 10.1109/TAC.2013.2256015 10.1109/ICC.2014.6883929 10.1109/TIE.2014.2355133 10.1049/iet-cta.2016.0781 10.1109/TII.2015.2506545 10.1109/TNNLS.2019.2946290 10.1109/TAC.2020.2968975 10.1016/j.sigpro.2016.02.023 10.1109/TCYB.2018.2862914 10.1049/iet-cta.2017.0064 10.1109/TSMCB.2009.2024408 10.1109/ACCESS.2015.2467168 10.1109/TCYB.2016.2635122 10.1109/TAC.2015.2437526 10.1002/rnc.2848 10.1109/TAC.2007.900839 10.1016/j.ins.2015.04.026 10.1016/j.automatica.2019.108714 10.1016/j.apm.2017.01.023 10.1109/TAC.2019.2929817 10.1109/TCYB.2018.2885653 10.1016/j.automatica.2015.11.008 10.1080/03081079.2018.1461098 10.1109/TSP.2010.2070496 10.1109/TCST.2011.2154383 10.1109/TAC.2014.2380671 10.1109/TAC.2010.2095950 10.1016/j.neucom.2017.09.038 10.1016/j.automatica.2018.11.010 10.1016/j.sigpro.2016.02.014 10.1080/00207721.2014.973466 10.4173/mic.2009.1.3 10.1109/TCYB.2020.2980109 10.1109/TCSII.2017.2669102 10.1109/TIE.2013.2261038 10.1587/transinf.E97.D.384 10.1109/TSMC.2018.2809489 10.1109/TAC.2017.2696746 10.1134/S000511791602003X 10.1109/18.256491 10.1109/TMM.2011.2182184 10.1109/TSMCA.2009.2034836 |
ContentType | Journal Article |
Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021 |
Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021 |
DBID | 97E RIA RIE AAYXX CITATION 7SC 7SP 7TB 8FD FR3 JQ2 L7M L~C L~D |
DOI | 10.1109/TAC.2020.3034196 |
DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005-present IEEE All-Society Periodicals Package (ASPP) 1998-Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
DatabaseTitleList | Technology Research Database |
Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering |
EISSN | 1558-2523 |
EndPage | 5159 |
ExternalDocumentID | 10_1109_TAC_2020_3034196 9244581 |
Genre | orig-research |
GrantInformation_xml | – fundername: Alexander von Humboldt Foundation of Germany – fundername: China Postdoctoral Science Foundation grantid: 2019TQ0202; 2020M671172 funderid: 10.13039/501100002858 – fundername: Royal Society of the U.K. – fundername: National Natural Science Foundation of China grantid: 61873059; 61873148; 61873169; 61922024; 61933007 funderid: 10.13039/501100001809 – fundername: Shanghai Pujiang Program of China grantid: 19PJ1408100 |
GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS TAE TN5 VH1 VJK ~02 AAYOK AAYXX CITATION RIG 7SC 7SP 7TB 8FD FR3 JQ2 L7M L~C L~D |
ID | FETCH-LOGICAL-c221t-47a3c058b3b192c352332fc6bdb1f390f90665a767fffa842ebb670447938b173 |
IEDL.DBID | RIE |
ISSN | 0018-9286 |
IngestDate | Mon Jun 30 10:24:27 EDT 2025 Tue Jul 01 03:36:36 EDT 2025 Thu Apr 24 22:57:31 EDT 2025 Wed Aug 27 03:03:24 EDT 2025 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 11 |
Language | English |
License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037 |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c221t-47a3c058b3b192c352332fc6bdb1f390f90665a767fffa842ebb670447938b173 |
Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
ORCID | 0000-0002-9576-7401 0000-0003-3482-5783 0000-0003-2928-4142 0000-0001-5333-5881 |
PQID | 2586626385 |
PQPubID | 85475 |
PageCount | 16 |
ParticipantIDs | crossref_citationtrail_10_1109_TAC_2020_3034196 ieee_primary_9244581 crossref_primary_10_1109_TAC_2020_3034196 proquest_journals_2586626385 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 2000 |
PublicationDate | 2021-11-01 |
PublicationDateYYYYMMDD | 2021-11-01 |
PublicationDate_xml | – month: 11 year: 2021 text: 2021-11-01 day: 01 |
PublicationDecade | 2020 |
PublicationPlace | New York |
PublicationPlace_xml | – name: New York |
PublicationTitle | IEEE transactions on automatic control |
PublicationTitleAbbrev | TAC |
PublicationYear | 2021 |
Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
References | ref13 ref12 ref15 ref14 ref11 ref10 ref17 ref16 ref19 ref18 ref50 ref46 ref48 ref47 ref42 ref41 ref44 ref43 ref49 ref8 ref7 ref9 ref4 ref3 ref6 ref5 ref40 ref35 ref34 ref37 ref36 ref31 ref30 ref32 ref2 ref1 ref39 ref38 ref24 ref23 ref26 ref25 ref20 rappaport (ref33) 2001 ref21 ref28 ref27 ref29 xiong (ref45) 2010; 40 li (ref22) 2012; 57 |
References_xml | – ident: ref23 doi: 10.1109/TAC.2016.2618000 – ident: ref41 doi: 10.1109/TCSI.2016.2605685 – ident: ref40 doi: 10.1109/TCYB.2017.2740309 – ident: ref5 doi: 10.1016/j.aeue.2014.04.021 – ident: ref29 doi: 10.1109/TAC.2016.2604921 – ident: ref19 doi: 10.1007/s12555-011-0408-8 – volume: 57 start-page: 3023 year: 2012 ident: ref22 article-title: Distributed coordination of multi-agent systems with quantized-observer based encoding-decoding publication-title: IEEE Trans Autom Control doi: 10.1109/TAC.2012.2199152 – ident: ref30 doi: 10.1109/TAC.2013.2256015 – ident: ref20 doi: 10.1109/ICC.2014.6883929 – ident: ref1 doi: 10.1109/TIE.2014.2355133 – ident: ref44 doi: 10.1049/iet-cta.2016.0781 – ident: ref47 doi: 10.1109/TII.2015.2506545 – ident: ref36 doi: 10.1109/TNNLS.2019.2946290 – ident: ref50 doi: 10.1109/TAC.2020.2968975 – ident: ref13 doi: 10.1016/j.sigpro.2016.02.023 – ident: ref24 doi: 10.1109/TCYB.2018.2862914 – ident: ref38 doi: 10.1049/iet-cta.2017.0064 – ident: ref17 doi: 10.1109/TSMCB.2009.2024408 – ident: ref32 doi: 10.1109/ACCESS.2015.2467168 – ident: ref46 doi: 10.1109/TCYB.2016.2635122 – ident: ref12 doi: 10.1109/TAC.2015.2437526 – ident: ref9 doi: 10.1002/rnc.2848 – ident: ref43 doi: 10.1109/TAC.2007.900839 – ident: ref21 doi: 10.1016/j.ins.2015.04.026 – ident: ref26 doi: 10.1016/j.automatica.2019.108714 – year: 2001 ident: ref33 publication-title: Wireless Communications Principles and Practice – ident: ref11 doi: 10.1016/j.apm.2017.01.023 – ident: ref27 doi: 10.1109/TAC.2019.2929817 – ident: ref28 doi: 10.1109/TCYB.2018.2885653 – ident: ref16 doi: 10.1016/j.automatica.2015.11.008 – ident: ref15 doi: 10.1080/03081079.2018.1461098 – ident: ref25 doi: 10.1109/TSP.2010.2070496 – ident: ref49 doi: 10.1109/TCST.2011.2154383 – ident: ref10 doi: 10.1109/TAC.2014.2380671 – ident: ref31 doi: 10.1109/TAC.2010.2095950 – ident: ref42 doi: 10.1016/j.neucom.2017.09.038 – ident: ref35 doi: 10.1016/j.automatica.2018.11.010 – ident: ref6 doi: 10.1016/j.sigpro.2016.02.014 – ident: ref4 doi: 10.1080/00207721.2014.973466 – ident: ref18 doi: 10.4173/mic.2009.1.3 – ident: ref37 doi: 10.1109/TCYB.2020.2980109 – ident: ref34 doi: 10.1109/TCSII.2017.2669102 – ident: ref14 doi: 10.1109/TIE.2013.2261038 – ident: ref2 doi: 10.1587/transinf.E97.D.384 – ident: ref48 doi: 10.1109/TSMC.2018.2809489 – ident: ref7 doi: 10.1109/TAC.2017.2696746 – ident: ref3 doi: 10.1134/S000511791602003X – ident: ref39 doi: 10.1109/18.256491 – ident: ref8 doi: 10.1109/TMM.2011.2182184 – volume: 40 start-page: 399 year: 2010 ident: ref45 article-title: Robust extended Kalman filtering for nonlinear systems with stochastic uncertainties publication-title: IEEE Trans Syst Man Cybern Part A-Syst Humans doi: 10.1109/TSMCA.2009.2034836 |
SSID | ssj0016441 |
Score | 2.6219206 |
Snippet | In this article, the recursive filtering problem is studied for a class of discrete-time nonlinear stochastic systems subject to fading measurements. In order... |
SourceID | proquest crossref ieee |
SourceType | Aggregation Database Enrichment Source Index Database Publisher |
StartPage | 5144 |
SubjectTerms | Coders Coding Communication networks Data transmission Decoders Decoding Difference equations Discrete time systems Fading Fading channels Filtering IIR filters Independent variables Mathematical model multiple description coding (MDC) nonlinear stochastic systems Nonlinear systems packet dropout Random variables recursive filtering Stochastic systems Upper bounds |
Title | Recursive Filtering With Measurement Fading: A Multiple Description Coding Scheme |
URI | https://ieeexplore.ieee.org/document/9244581 https://www.proquest.com/docview/2586626385 |
Volume | 66 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LSwMxEA61Jz34qmK1Sg5eBLdNso8k3kpxEWEFtcXels1ugkVtRbcXf72ZfflEvC3ZBMLMJJlvnggdKz-RVHLlZEkiHE8b40hFEicjPMuoVbi1gWzk6Cq4mHiXU3_aQqdNLozWugg-0334LHz52SJdgqlsYLGC50Oe9YoVszJXq_EYwLte3rr2ADPRuCSJHIyHIwsEmcWnBKqXBV-eoKKnyo-LuHhdwg0U1fsqg0oe-stc9dO3byUb_7vxTbReqZl4WMrFFmrp-TZa-1R8sIOub8DUDtHrOJyBz9yO4rtZfo-jD7shDosY-zM8xFEVeogtVK2vGjxawG98a1n_pHfQJDwfjy6cqsGCkzJGc8fjiZsSXyhXWUUvtbqY6zKTBipT1LiSGAmOmYQH3BiTCI9ppQJOPLDGCUW5u4va88Vc7yGcGd9YKCM5NdwTgHuVokRZ9YZaxCSSLhrUNI_Tqvo4NMF4jAsUQmRsuRQDl-KKS1100qx4Litv_DG3A0Rv5lX07qJezda4OpqvMfNFACV4hL__-6oDtMogcKVIOOyhdv6y1IdW88jVUSFy7z0A0zE |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwED5VZQAGXgVRKOCBBYm0ztMOW1VRFWgqAa3oFsWJLSqgRZAu_Hp8SRqeQmyRY0uWz767754Ax8KNfNNnwkiiiBuOVMrwBY2MhLIkMbXCLRVmIwcDrzdyLsfuuAKnZS6MlDILPpNN_Mx8-cksnqOprKWxguNinvWSq1EFy7O1Sp8BSvac7-onbPHSKUn91rDd0VDQ0giVYv0y74sQyrqq_GDFmXzprkOw2FkeVvLQnKeiGb99K9r4361vwFqhaJJ2fjM2oSKnW7D6qfxgDa5v0NiO8eukO0GvuR4ld5P0ngQflkPSzaLsz0ibBEXwIdFgdcFsSGeGv8mtJv6T3IZR93zY6RlFiwUjtiwzNRwW2TF1ubCFVvVirY3ZtqViTyTCVLZPlY-umYh5TCkVcceSQniMOmiP48Jk9g5Up7Op3AWSKFdpMOMzUzGHI_IVwqRCKzimxkw8qkNrceZhXNQfxzYYj2GGQ6gfaiqFSKWwoFIdTsoVz3ntjT_m1vDQy3nFedehsSBrWDzO19ByuYdFeLi79_uqI1juDYN-2L8YXO3DioVhLFn6YQOq6ctcHmg9JBWH2fV7B4bZ1oM |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Recursive+Filtering+With+Measurement+Fading%3A+A+Multiple+Description+Coding+Scheme&rft.jtitle=IEEE+transactions+on+automatic+control&rft.au=Wang%2C+Licheng&rft.au=Wang%2C+Zidong&rft.au=Shen%2C+Bo&rft.au=Wei%2C+Guoliang&rft.date=2021-11-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0018-9286&rft.eissn=1558-2523&rft.volume=66&rft.issue=11&rft.spage=5144&rft_id=info:doi/10.1109%2FTAC.2020.3034196&rft.externalDBID=NO_FULL_TEXT |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9286&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9286&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9286&client=summon |