2026· IEEE Transactions on Wireless Communications· Vol 25, pp. 21433-21448· 5 citations· 61 references
Computer Science
Abstract
The unprecedented growth of machine-type devices has underscored the need for fundamental solutions to support emerging massive connectivity. In particular, unsourced random access (URA) has emerged as a promising paradigm, reframing the massive connectivity problem as a coding-theoretic challenge with favorable energy and spectral efficiency. Among the widely studied URA models, the Gaussian multiple-access channel (GMAC) and multi-input multi-output (MIMO) systems are of particular significance. Sparse code design is well-suited for URA, offering scalable solutions while retaining many advantages of legacy access protocols. However, existing sparse code designs often suffer from limited sparsity control, inefficient interference cancellation, and a strong dependence on specific channel code designs, posing challenges for long-term adaptability as more powerful channel codes continue to evolve. In MIMO-URA systems, additional activity detection and channel estimation phases typically lead to increased missed detection (MD) and false alarm (FA) errors compared with the GMAC model, which does not require these phases. While prior studies have predominantly focused on minimizing MD errors, the effective mitigation of FA errors remains an open problem. To address this challenge, we propose a sparse code with slotted transmission under the GMAC model, combined with an analytical power division strategy to enhance interference cancellation. Furthermore, we introduce a novel MIMO receiver framework based on joint pattern–data–channel (JPDC) estimation, which significantly reduces FA errors by leveraging the intrinsic correlation between user activity and transmitted data. Notably, the proposed method achieves improved overall system performance without requiring additional transmission overhead or complex algorithms.
This paper investigates the design of the on-off division multiple access (ODMA) transmission scheme for multiple-input multiple-output (MIMO) massive unsourced random access (URA) systems with soft-output (SO) polar codes. First, a three-segment pilot-uncoupled coding scheme is introduced under the ODMA framework, whi...
Tian-Ya Li, Xiao-Ran Zhang, Nan Hu et al.· IEEE Transactions on Wireles...· 0 citations
Simulation results on MIMO systems demonstrate that RP with CD-OAMP/MAMP achieves near-RM performance with much lower complexity, with additional benefits of flexible compression ratios for spectral efficiency.
Jiazhen Dong, Lei Liu, Xiao-Jun Yuan et al.· 0 citations
Grant-free random access (GFRA) is a promising solution for massive machine-type communications (mMTC) in future wireless networks. However, reliable user activity detection and channel estimation are critical challenges, particularly when orthogonal time-frequency space (OTFS) modulation is integrated with GFRA to add...
This work develops an efficient data-aided iterative receiver, in which reliably decoded data symbols are fed back as additional pseudo-pilot information to assist channel estimation and sensing, and develops a grid evolution procedure that iteratively adjusts the virtual grids in the discrete affine Fourier domain acc...
Yi-Rui Luo, Yong-Liang Guan, Yao Ge et al.· IEEE Transactions on Communi...· 1 citation
A fluid-antenna-assisted distributed joint decoder for cell-free massive MIMO URA and the framework provides a feasible integration of fluid antennas and cell-free URA and motivates end-to-end evaluation under pilot collisions and switching overhead.
This work investigates unsourced random access (URA) over quasi-static fading channels, which is well suited for massive connectivity. In most existing URA schemes for fading channels, message recovery typically requires channel estimation, and these schemes therefore rely on pilot-assisted designs, resulting in limite...
Jianxiang Yan, Ying Li, Guang-Hui Song et al.· IEEE Transactions on Wireles...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.