12 February 2021 in IEEE Communications Letters
This letter proposes an efficient probability-based ordered-statistics decoding (PB-OSD) algorithm for short block-length codes. In PB-OSD, we derive two probabilistic measures on the codeword estimates and test error patterns, respectively referred to as the success probability and promising probability. Based on these probabilities, a stopping criterion and a discarding criterion are developed to reduce the number of test error patterns and limit the decoding complexity. To further reduce the complexity, we propose a tree-based search strategy to find the most likely test error patterns in reprocessing stage of the OSD algorithm. Simulation results show that PB-OSD significantly reduces the decoding complexity under the same error performance, compared to the original OSD algorithm.
10 May 2021 in IEEE Transactions on Information Theory
This paper revisits the ordered statistics decoding (OSD). It provides a comprehensive analysis of the OSD algorithm by characterizing the statistical properties, evolution and the distribution of the Hamming distance and weighted Hamming distance from codeword estimates to the received sequence in the reprocessing stages of the OSD algorithm. We prove that the Hamming distance and weighted Hamming distance distributions can be characterized as mixture models capturing the decoding error probability and code weight enumerator. Simulation and numerical results show that our proposed statistical approaches can accurately describe the distance distributions. Based on these distributions and with the aim to reduce the decoding complexity, several techniques, including stopping rules and discarding rules, are proposed, and their decoding error performance and complexity are accordingly analyzed. Simulation results for decoding various eBCH codes demonstrate that the proposed techniques can significantly reduce the decoding complexity with a negligible loss in the decoding error performance.
16 September 2022 in IEEE Transactions on Communications
In this paper, we propose a new linear-equation ordered-statistics decoding (LE-OSD). Unlike the OSD, LE-OSD uses high reliable parity bits rather than information bits to recover codeword estimates, which is equivalent to solving a system of linear equations (SLE). Only test error patterns (TEPs) that create feasible SLEs, referred to as the valid TEPs, are used to obtain codeword estimates. We introduce several constraints on the Hamming weight of TEPs to limit the overall decoding complexity. Furthermore, we analyze the block error rate (BLER) and the computational complexity of the proposed approach. It is shown that LE-OSD has a similar performance to OSD in terms of BLER, which can asymptotically approach Maximum-likelihood (ML) performance with proper parameter selections. Simulation results demonstrate that the LE-OSD has a significantly reduced complexity compared to OSD, especially for low-rate codes, that usually require high decoding order in OSD. Nevertheless, the complexity reduction can also be observed for high-rate codes. In addition, we further improve LE-OSD by applying the decoding stopping condition and the TEP discarding condition. As shown by simulations, the improved LE-OSD has a considerably reduced complexity while maintaining the BLER performance, compared to the latest OSD approaches from literature.
23 September 2022 in IEEE Wireless Communications Letters
The orthogonal time frequency space (OTFS) modulation is proposed for beyond 5G wireless systems to deal with high mobility communications. The existing low complexity OTFS detectors’ performance is suboptimal in rich scattering environments where there are a large number of moving reflectors that reflect the transmitted signal towards the receiver. In this paper, we propose an OTFS detector, referred to as the BPICNet OTFS detector that integrates NN, Bayesian inference, and parallel interference cancellation concepts. Simulation results show that the proposed detector outperforms the state-of-the-art.
11 February 2025 in IEEE Transactions on Communications
Sparse vector coding (SVC) is a promising coding technique to achieve high transmission reliability and low latency for short packet communications. However, for SVC with conventional combination-based sparse mapping, a small increase of transmitted bits may lead to excessively long sparse vectors, resulting in unsatisfactory transmission performance when coding efficiency is high. In this paper, we propose a generalized index redefinition (IR)-based SVC (GIR-SVC) to significantly enhance the efficiency of SVC. The IR mechanism enables multiple index bit streams to share position resources in SVC, with the help of constellation labels. GIR-SVC constructs the sparse vector using a hybrid IR mechanism that integrates the unlabeled IR and the pairwise-grouping-based labeled IR, which allows efficient mapping and de-mapping of index bits without requiring index tables. Consequently, the proposed GIR-SVC can be efficiently decoded without the index table using sparse recovery algorithms. Theoretical analysis is conducted to validate the block error rate (BLER) performance of GIR-SVC. Simulations show that GIR-SVC can significantly reduce the decoding delay compared to existing approaches, while maintaining the high transmission reliability.
28 September 2023 in IEEE Transactions on Vehicular Technology
This paper focuses on predicting the received signal strength (RSS) of mobile users, which is a fundamental problem for improving the coverage of cellular networks. Traditional methods for RSS prediction are based on ray tracing or stochastic radio propagation models. However, the former requires detailed environmental information that may not be practically available, while the latter cannot use the environmental data to its full potential and is not accurate enough. To address these issues, we design a practical RSS prediction system utilizing the trajectory information of users and satellite maps around base stations without sharing raw data. Specifically, we propose a map-based deep neural network (DNN) for the RSS prediction, empowered by the deep vision transformer (DeepVIT). Furthermore, to avoid sharing raw data, a novel split learning (SL) framework is developed. It splits the map-based DNN into two parts, which are deployed on the server and the user sides, respectively. The proposed models are evaluated by eight real-world data sets provided by an Australian Telecom operator, including 307,500 data samples. Simulation results show that in terms of prediction accuracy, the proposed map-based DNN significantly outperforms the 3GPP Urban Macro model and the long short-term memory method in centralized scenarios, while its SL variant outperforms the sequential SL and federated learning (FL) approaches in distributed scenarios. In addition, the communication overhead and the on-device computational burden of the proposed SL model are much lower than that of the FL approach.