dorsal/arxiv
View SchemaPerformance Bounds of Joint Detection with Kalman Filtering and Channel Decoding for Wireless Networked Control Systems
| Authors | Jinnan Piao, Dong Li, Zhibo Li, Ming Yang, Xueting Yu, Jincheng Dai |
|---|---|
| Categories | |
| ArXiv ID | 2601.07322vv1 |
| URL | https://arxiv.org/abs/2601.07322 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
The joint detection uses Kalman filtering (KF) to estimate the prior probability of control outputs to assist channel decoding. In this paper, we regard the joint detection as maximum a posteriori (MAP) decoding and derive the lower and upper bounds based on the pairwise error probability considering system interference, quantization interval, and weight distribution. We first derive the limiting bounds as the signal-to-noise ratio (SNR) goes to infinity and the system interference goes to zero. Then, we construct an infinite-state Markov chain to describe the consecutive packet losses of the control systems to derive the MAP bounds. Finally, the MAP bounds are approximated as the bounds of the transition probability from the state with no packet loss to the state with consecutive single packet loss. The simulation results show that the MAP performance of $\left(64,16\right)$ polar code and 16-bit CRC coincides with the limiting upper bound as the SNR increases and has $3.0$dB performance gain compared with the normal approximation of the finite block rate at block error rate $10^{-3}$.
{
"annotation_id": "9f0f15aa-4463-47ed-8968-ee96cf279989",
"date_created": "2026-02-17T05:53:12.434000Z",
"date_modified": "2026-02-17T05:53:12.434000Z",
"file_hash": "1304e4426b00434e070209063e488208dcce696d3208dd4aeaddb67fce462792",
"private": false,
"record": {
"abstract": "The joint detection uses Kalman filtering (KF) to estimate the prior probability of control outputs to assist channel decoding. In this paper, we regard the joint detection as maximum a posteriori (MAP) decoding and derive the lower and upper bounds based on the pairwise error probability considering system interference, quantization interval, and weight distribution. We first derive the limiting bounds as the signal-to-noise ratio (SNR) goes to infinity and the system interference goes to zero. Then, we construct an infinite-state Markov chain to describe the consecutive packet losses of the control systems to derive the MAP bounds. Finally, the MAP bounds are approximated as the bounds of the transition probability from the state with no packet loss to the state with consecutive single packet loss. The simulation results show that the MAP performance of $\\left(64,16\\right)$ polar code and 16-bit CRC coincides with the limiting upper bound as the SNR increases and has $3.0$dB performance gain compared with the normal approximation of the finite block rate at block error rate $10^{-3}$.",
"arxiv_id": "2601.07322",
"authors": [
"Jinnan Piao",
"Dong Li",
"Zhibo Li",
"Ming Yang",
"Xueting Yu",
"Jincheng Dai"
],
"categories": [
"cs.IT",
"math.IT"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Performance Bounds of Joint Detection with Kalman Filtering and Channel Decoding for Wireless Networked Control Systems",
"url": "https://arxiv.org/abs/2601.07322",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "e03d4801-9753-4f4e-ba14-d0c90331bae0",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}