Published in Wiley, 2023
This chapter reviews the state‐of‐the‐art channel coding techniques for ultra‐reliable and low‐latency communications (URLLC). The stringent requirements of URLLC services, such as ultra‐high reliability, low‐latency, and rat…
Published in IP Australia, 2025
Published in IP Australia, 2020
Published in IP Australia, 2018
Published in arXiv preprint arXiv:2602.22662, 2026
This paper introduces wireless human-machine collaboration (WHMC) as central to Industry 5.0, examining how 6G wireless networks can enable flexible, scalable, and low-cost deployment of geographically distributed human-machine collaboration systems….
Published in IEEE Transactions on Wireless Communications, 2026
This paper proposes a novel three-stage joint channel estimation and positioning (JCEP) framework for RIS-assisted communication systems. It employs a UAMP-SBL based channel estimator and a graph attention network (GAT) for robust positioning in dynamic environments, achieving superior performance in CE and positioning accuracy with low complexity….
Published in IEEE Transactions on Vehicular Technology, 2026
This paper proposes a novel end-to-end autoencoder framework for short analog fountain codes (AFC) that jointly optimizes encoder and decoder components. The framework combines a learnable AFC encoder featuring attention-enhanced weight selection with a graph neural network (GNN)-based decoder, maintaining the inherent rateless property while enabling systematic optimization….
Published in IEEE Transactions on Information Theory, 2025
This paper investigates guesswork over ordered statistics and formulates the achievable guesswork complexity of ordered statistics decoding (OSD) in binary additive white Gaussian noise (AWGN) channels. The achievable guesswork complexity is defined as the number of test error patterns (TEPs) processed by OSD immediately upon finding the correct codeword estimate….
Published in IEEE Transactions on Communications, 2025
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….
Published in IEEE Transactions on Communications, 2025
This paper presents the analysis and a proof-of-concept design of the low-complexity early termination hybrid automatic repeat request (ET-HARQ) for ultra-reliable low-latency communication (URLLC).
Published in IEEE Transactions on Communications, 2025
This paper presents a novel auto-encoder based end-to-end channel encoding and decoding. It integrates deep reinforcement learning (DRL) and graph neural networks (GNN) in code design by modeling the generation of code parity-check matrices as a Markov Decision Process (MDP), to optimize key coding performance metrics such as error-rates and code algebraic properties….
Published in arXiv preprint arXiv:2407.19863, 2024
The concept of distributed consensus gained widespread attention following the publication of ``Byzantine Generals Problem’ by Leslie Lamport in the 1980s. This research topic has been active and extensively studied over the last four decades, parti…
Published in IEEE Network, 2024
The connected and autonomous systems (CAS) and auto-driving era is coming into our life. To support CAS applications such as AI-driven decision-making and blockchain-based smart data management platform, data and message exchange/dissemination is a f…
Published in IEEE Communications Magazine, 2023
This article reviews the potential channel decoding techniques for ultra-reliable low-latency communications (URLLC). URLLC is renowned for its stringent requirements including ultra-reliability, low end-to-end transmission latency, and packet-size f…
Published in IEEE Transactions on Vehicular Technology, 2023
This article 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…
Published in IEEE Transactions on Communications, 2022
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 …
Published in IEEE Transactions on Wireless Communications, 2022
In this paper, we develop a density evolution (DE) framework for analyzing the iterative joint decoding (JD) for non-orthogonal multiple access (NOMA) systems, where the ordered-statistics decoding (OSD) is applied to decode short block codes. We fir…
Published in Journal of Systems Architecture, 2022
Since the advent of blockchain in 2009, it has drawn considerable attention from academia and industry. Later, the notion of Distributed Ledger Technology (DLT) extended the conception of blockchain, which covered both chain-based and Directed Acycli…
Published in IEEE Wireless Communications Letters, 2022
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 th…
Published in IEEE Communications Letters, 2021
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 …
Published in IEEE Transactions on Information Theory, 2021
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 fr…
Published in IEEE Communications Magazine, 2018
This article reviews state of the art channel coding techniques for URLLC. The stringent requirements of URLLC services, such as ultrahigh reliability and low latency, have made it the most challenging feature of 5G of mobile networks. The problem is…
Published in arXiv preprint arXiv:2602.23768, 2026
This paper incorporates Bose-Chaudhuri-Hocquenghem (BCH) error control coding into ghost imaging systems, combining it with ordered-statistic decoding to reconstruct images with improved quality across various signal-to-noise ratio (SNR) conditions….
Published in GLOBECOM 2025 - 2025 IEEE Global Communications Conference, 2025
This paper presents a novel semantic-enhanced decoding scheme for transmitting natural language sentences with multiple short block codes over noisy wireless channels….
Published in IEEE International Conference on Communications (ICC), 2025
This paper introduces a policy-guided Monte Carlo Tree Search (MCTS) decoder that achieves near maximum-likelihood decoding (MLD) performance for short block codes. A neural network policy trained via MCTS-based learning guides the search process, eliminating the need for Gaussian elimination while significantly reducing computational complexity….
Published in arXiv preprint arXiv:2511.05044, 2025
This work addresses the challenge of identifying target regions in medical images using natural language descriptions, proposing a next-token mask prediction approach that simplifies the multimodal fusion pipeline while achieving promising segmentation performance….
Published in GLOBECOM 2025 - 2025 IEEE Global Communications Conference, 2025
This paper proposes a low-complexity linear MAP (LMAP) decoding method for rate-1/2 non-binary convolutional codes (NBCCs). By representing the MAP forward and backward decoding processes as shift register structures operating on probability mass functions, the method achieves optimal bidirectional MAP decoding performance while significantly reducing decoding latency and hardware complexity….
Published in IEEE International Symposium on Information Theory (ISIT), 2025
This paper provides the first analytical characterization of the achievable guesswork complexity of ordered statistics decoding (OSD) in binary AWGN channels.
Published in IEEE International Symposium on Information Theory (ISIT), 2025
This paper proposes a linear representation of BCJR maximum a posteriori probability (MAP) decoding of a rate 1/2 convolutional code, referred to as linear MAP decoding (LMAP). The MAP forward and backward decoding can be implemented by the corresponding dual soft input and soft output (SISO) encoders using shift registers, achieving the same performance as BCJR MAP decoding with significantly reduced decoding delay….
Published in IEEE International Conference on Communications (ICC), 2024
In this paper, we propose an efficient decoding algorithm for short low-density parity check (LDPC) codes by carefully combining the belief propagation (BP) decoding and ordered statistics decoding (OSD) algorithms. Specifically, a modified BP (mBP) …
Published in IEEE International Conference on Communications （ICC）, 2023
In this work, we propose a novel decoding algorithm for short block codes based on an edge-weighted graph neural network (EW-GNN). The EW-GNN decoder operates on the Tanner graph with an iterative message-passing structure, which algorithmically alig…
Published in IEEE Globecom Workshops (GC Wkshps), 2022
In this paper, we propose an efficient ordered-statistics decoding (OSD) algorithm with an adaptive Gaussian elimination (GE) reduction technique. The proposed decoder utilizes two decoding conditions to adaptively remove GE in OSD. The first conditi…
Published in IEEE International Conference on Communications (ICC), 2022
In this paper, we design the joint decoding (JD) of non-orthogonal multiple access (NOMA) systems employing short block length codes. We first proposed a low-complexity soft-output ordered-statistics decoding (LC-SOSD) based on a decoding stopping co…
Published in IEEE Global Communications Conference (GLOBECOM), 2019
In this paper, we propose an efficient reliability based segmentation-discarding decoding (SDD) algorithm for short block-length codes. A novel segmentation- discarding technique is proposed along with the stopping rule to significantly reduce the de…
Published in 2019 IEEE International Symposium on Information Theory (ISIT), 2019
In this paper, we derive the distribution of the Hamming distance at 0-reprocessing of the ordered statistics decoding (OSD). With the assumption of decoding a random linear block code, we first find the distribution of the number of errors in any pa…
Published in IEEE WCSP, 2017
This paper provides an tractable analysis of the downlink spectral efficiency of multi-cell multi-user distributed antenna systems (DASs) using stochastic geometry with maximal ratio transmission (MRT) and zero-forcing (ZF) beamforming. Firstly, base…