arXiv subjects

Jinnan Piao

Publications and source records attributed to Jinnan Piao.

8 recordsLinked to original sources

arXiv2026

Performance Bounds of Joint Detection with Kalman Filtering and Channel Decoding for Wireless Networked Control Systems

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}$.

cs.IT↗

arXiv2025

Iterative Joint Detection of Kalman Filter and Channel Decoder for Sensor-to-Controller Link in Wireless Networked Control Systems

In this letter, we propose an iterative joint detection algorithm of Kalman filter (KF) and channel decoder for the sensor-to-controller link of wireless networked control systems, which utilizes the prior information of control system to improve control and communication performance. In this algorithm, we first use the KF to estimate the probability density of the control system outputs and calculate the prior probability of received signals to assist decoder. Then, the possible outputs of the control system are traversed to update the prior probability in order to implement iterative detection. The simulation results show that the prior information and the iterative structure can reduce the block error rate performance of communications while improving the root mean square error performance of controls.

cs.IT↗

arXiv2024

Construction Methods Based on Minimum Weight Distribution for Polar Codes with Successive Cancellation List Decoding

Minimum weight distribution (MWD) is an important metric to calculate the first term of union bound called minimum weight union bound (MWUB). In this paper, we first prove the maximum likelihood (ML) performance approaches MWUB as signal-to-noise ratio (SNR) goes to infinity and provide the deviation when MWD and SNR are given. Then, we propose a nested reliability sequence, namely MWD sequence, to construct polar codes independently of channel information. In the sequence, synthetic channels are sorted by partial MWD which is used to evaluate the influence of information bit on MWD and we prove the MWD sequence is the optimum sequence evaluated by MWUB for polar codes obeying partial order. Finally, we introduce an entropy constraint to establish a relationship between list size and MWUB and propose a heuristic construction method named entropy constraint bit-swapping (ECBS) algorithm, where we initialize information set by the MWD sequence and gradually swap information bit and frozen bit to satisfy the entropy constraint. The simulation results show the MWD sequence is more suitable for constructing polar codes with short code length than the polar sequence in 5G and the ECBS algorithm can improve MWD to show better performance as list size increases.

cs.IT↗

arXiv2023

Performance Analysis for Polar Codes under Successive Cancellation List Decoding with Fixed List Size

In this paper, we first indicate that the block error event of polar codes under successive cancellation list (SCL) decoding is composed of path loss (PL) error event and path selection (PS) error event, where the PL error event is that correct codeword is lost during the SCL decoding and the PS error event is that correct codeword is reserved in the decoded list but not selected as the decoded codeword. Then, we simplify the PL error event by assuming the all-zero codeword is transmitted and derive the probability lower bound via the joint probability density of the log-likelihood ratios of information bits. Meanwhile, the union bound calculated by the minimum weight distribution is used to evaluate the probability of the PS error event. With the performance analysis, we design a greedy bit-swapping (BS) algorithm to construct polar codes by gradually swapping information bit and frozen bit to reduce the performance lower bound of SCL decoding. The simulation results show that the BLER performance of SCL decoding is close to the lower bound in the medium to high signal-to-noise ratio region and we can optimize the lower bound to improve the BLER performance of SCL decoding by the BS algorithm.

cs.IT↗

arXiv2021

Polar-Precoding: A Unitary Finite-Feedback Transmit Precoder for Polar-Coded MIMO Systems

We propose a unitary precoding scheme, namely polar-precoding, to improve the performance of polar-coded MIMO systems. In contrast to the traditional design of MIMO precoding criteria, the proposed polar-precoding scheme relies on the \emph{polarization criterion}. In particular, the precoding matrix design comprises two steps. After selecting a basic matrix for maximizing the capacity in the first step, we design a unitary matrix for maximizing the polarization effect among the data streams without degrading the capacity. Our simulation results show that the proposed polar-precoding scheme outperforms the state-of-the-art DFT precoding scheme.

cs.IT↗

arXiv2020

Progressive Rate-Filling: A Framework for Agile Construction of Multilevel Polar-Coded Modulation

In this letter, we propose a progressive rate-filling method as a framework to study agile construction of multilevel polar-coded modulation. We show that the bit indices within each component polar code can follow a fixed, precomputed ranking sequence, e.g., the Polar sequence in the 5G standard, while their allocated rates (i.e., the number of information bits of each component polar code) can be fast computed by exploiting the target sum-rate approximation and proper rate-filling methods. In particular, we develop two rate-filling strategies based on the capacity and the rate considering the finite block-length effect. The proposed construction methods can be performed independently of the actual channel condition with ${O\left(m\right)}$ ($m$ denotes the modulation order) complexity and robust to diverse modulation and coding schemes in the 5G standard, which is a desired feature for practical systems.

cs.IT↗

arXiv2020

Sphere Constraint based Enumeration Methods to Analyze the Minimum Weight Distribution of Polar Codes

In this paper, the minimum weight distributions (MWDs) of polar codes and concatenated polar codes are exactly enumerated according to the distance property of codewords. We first propose a sphere constraint based enumeration method (SCEM) to analyze the MWD of polar codes with moderate complexity. The SCEM exploits the distance property that all the codewords with the identical Hamming weight are distributed on a spherical shell. Then, based on the SCEM and the Plotkin's construction of polar codes, a sphere constraint based recursive enumeration method (SCREM) is proposed to recursively calculate the MWD with a lower complexity. Finally, we propose a parity-check SCEM (PC-SCEM) to analyze the MWD of concatenated polar codes by introducing the parity-check equations of outer codes. Moreover, due to the distance property of codewords, the proposed three methods can exactly enumerate all the codewords belonging to the MWD. The enumeration results show that the SCREM can enumerate the MWD of polar codes with code length up to $2^{14}$ and the PC-SCEM can be used to optimize CRC-polar concatenated codes.

cs.IT↗

arXiv2019

Approaching the Finite Blocklength Capacity within 0.025dB by Short Polar Codes and CRC-Aided Hybrid Decoding

In this letter, we explore the performance limits of short polar codes and find that the maximum likelihood (ML) performance of a simple CRC-polar concatenated scheme can approach the finite blocklength capacity. Then, in order to approach the ML performance with a low average complexity, a CRC-aided hybrid decoding (CA-HD) algorithm is proposed and its decoding process is divided into two steps. In the first step, the received sequence is decoded by the adaptive successive cancellation list (ADSCL) decoding. In the second step, CRC-aided sphere decoding with a reasonable initial radius is used to decode the received sequence. To obtain the reasonable radius, the CRC bits of the survival paths in ADSCL are recalculated and the minimum Euclidean distance between the survival path and the received sequence is chosen as the initial radius. The simulation results show that CA-HD can achieve within about $0.025$dB of the finite blocklength capacity at the block error ratio $10^{-3}$ with code length $128$ and code rate $1/2$.

cs.IT↗