Advanced Search
Turn off MathJax
Article Contents
SHAO Caiping, QIU Yuping, XIE Zhaopeng, SONG Dan, CHEN Jian, CHEN Pingping. Physical-layer Network Coding Aided Polar Slotted Random Access Algorithm[J]. Journal of Electronics & Information Technology. doi: 10.11999/JEIT260867
Citation: SHAO Caiping, QIU Yuping, XIE Zhaopeng, SONG Dan, CHEN Jian, CHEN Pingping. Physical-layer Network Coding Aided Polar Slotted Random Access Algorithm[J]. Journal of Electronics & Information Technology. doi: 10.11999/JEIT260867

Physical-layer Network Coding Aided Polar Slotted Random Access Algorithm

doi: 10.11999/JEIT260867 cstr: 32379.14.JEIT260867
Funds:  The National Natural Science Foundation of China(62571134), The Young Scientists Fund of the National Natural Science Foundation of China (62501252), Fujian Provincial Industry-University-Research Cooperation Project (No.2024H6013)
  • Accepted Date: 2026-08-26
  • Rev Recd Date: 2026-08-26
  • Available Online: 2026-09-01
  •   Objective  In Fifth-Generation (5G) and emerging Sixth-Generation (6G) wireless networks, massive Machine-Type Communications (mMTC) supports large-scale connectivity for the Internet of Things (IoT). In grant-free Random Access (RA) scenarios, sporadic and uncoordinated transmissions by large numbers of terminals cause severe packet collisions under heavy traffic loads. Traditional scheduled access protocols become inefficient because of excessive signaling overhead. Therefore, grant-free slotted ALOHA protocols based on Successive Interference Cancellation (SIC), including Contention Resolution Diversity Slotted ALOHA (CRDSA), Irregular Repetition Slotted ALOHA (IRSA), and Coded Slotted ALOHA (CSA), have received considerable attention. However, these classical schemes rely on collision-free (degree-1) slots to initiate and sustain iterative graph-peeling decoding. Under finite frame lengths and heavy traffic loads, collision-free slots become scarce, causing severe decoding stalling and throughput degradation. In addition, SIC-only mechanisms are vulnerable to error propagation. Although Polar Slotted ALOHA (PSA) applies polarization transforms across time slots to improve packet recovery, its collision resolution remains constrained by the initial SIC condition. To address these limitations, a joint decoding algorithm that combines PSA with Physical-Layer Network Coding (PPNC), termed PSA-PNC, is proposed over the Slot Erasure Channel (SEC). The objective is to transform destructive multi-user packet collisions into algebraically solvable linear Network Coding (NC) equations, thereby removing the strict dependence on collision-free slots and improving concurrent multi-user detection and throughput under heavy traffic loads.  Methods  A joint physical-layer and Medium Access Control (MAC)-layer RA framework is established over the SEC (Fig. 1). At the transmitters, active users independently select transmission slots according to an irregular degree distribution polynomial, without inter-user coordination or collision feedback. The transmitters remain unaware of the multi-user collision patterns in the channel. At the base station receiver, superimposed signals across slots are represented by a sparse global input vector over a binary finite field and then encoded at the packet level using a polar code. To resolve dense collisions without relying on collision-free slots, a closed-loop iterative receiver architecture is developed (Fig. 2). In each iteration, channel observation sequences are first processed by a packet-level Successive Cancellation (pSC) or packet-level Successive Cancellation List (pSCL) decoder to extract reliable equivalent packets from information slots. Rather than discarding the corresponding collided slots, the receiver uses them to construct a local sparse system of linear NC equations. A Generalized Matrix Inversion (GMI) criterion is then applied to assess the column ranks of the access pattern matrix and achieve global algebraic multi-user decoupling. Recoverable user packets are obtained directly without requiring a full-rank matrix or degree-1 slots. The algebraically decoupled user packets are used as prior information to reconstruct physical-layer codewords. The reconstructed codewords are subtracted from the observation buffer through iterative SIC, progressively reducing the dimensionality of the unresolved collision space. Packets with high reliability produced by pSCL decoding paths are used in the iterative loop to suppress error propagation and preserve the linear independence of residual equations. Furthermore, the polarization evolution of equivalent multi-user packets over the SEC is theoretically shown to be equivalent to that over a scalar Binary Erasure Channel (BEC), enabling rigorous calculation of frame error rate bounds using Bhattacharyya parameters (Fig. 3).  Results and Discussions  Extensive theoretical analyses and Monte Carlo simulations are conducted to evaluate the proposed PSA-PNC scheme over the SEC. The theoretical polarization bounds for packet-level polar decoding are verified at slot erasure probabilities of $ \epsilon \in \left\{0.1,0.2,0.3\right\} $. The simulation curves agree closely with the theoretical bounds, confirming the polarization threshold effect (Fig. 3). For a frame length of $ N=1024 $, PSA-PNC with pSCL (decoding and a list size of $ L=8 $) achieves a peak normalized throughput of approximately 0.87 packets/slot at a normalized load of $ G\approx 0.90 $. This represents an approximately 15% throughput improvement over baseline PSA and exceeds the throughput of CSA under identical finite-length configurations (Fig. 4(a)). At low loads, all evaluated schemes exhibit nearly identical linear throughput growth because collision-free slots are abundant (Fig. 4(a)). When the slot erasure probability increases to $ \epsilon =0.35 $, fewer reliable equivalent packets can be recovered, resulting in insufficient NC equations and lower throughput in high-load regions. This result identifies the operational boundary of the algorithm (Fig. 4(a)). For a short frame length of$ N=64 $, PSA-PNC maintains a throughput gain ranging from 0.12 to 0.18, demonstrating strong robustness against finite-length decoding stalling in short-packet scenarios (Fig. 4(b)). In terms of transmission reliability, under a target Packet Loss Rate (PLR) of $ {10}^{-2} $ at $ N=1024 $, the maximum supported normalized load increases from $ G\approx 0.75 $ for baseline PSA to $ G\approx 0.84 $ for PSA-PNC (Fig. 5(a)). Furthermore, steeper waterfall regions and significantly lower error floors are maintained across frame lengths from $ N=64 $ to $ N=1024 $ (Fig. 5(b)).  Conclusions  The PSA-PNC joint decoding scheme is established to address severe decoding stalling in grant-free RA. By constructing a closed-loop iterative receiver that integrates packet-level polar decoding, GMI-based algebraic equation solving, and iterative SIC, destructive multi-user collisions are converted into solvable linear equations. The dependence on collision-free slots is eliminated, and the supported load threshold, peak normalized throughput, and packet recovery reliability are substantially improved under heavy traffic loads. Future work will address nonideal multipath fading channels, including Rayleigh fading, and low-complexity sparse receiver architectures for practical massive-access implementations.
  • loading
  • [1]
    NGUYEN D C, DING Ming, PATHIRANA P N, et al. 6G internet of things: A comprehensive survey[J]. IEEE Internet of Things Journal, 2022, 9(1): 359–383. doi: 10.1109/JIOT.2021.3103320.
    [2]
    逄小玮, 蒋旭, 卢华兵, 等. 面向6G多维扩展的新型多址接入技术综述[J]. 电子与信息学报, 2024, 46(6): 2323–2334. doi: 10.11999/JEIT231265.

    PANG Xiaowei, JIANG Xu, LU Huabing, et al. An overview of novel multi-access techniques for multi-dimensional expanded 6G[J]. Journal of Electronics & Information Technology, 2024, 46(6): 2323–2334. doi: 10.11999/JEIT231265.
    [3]
    GU Yiyang, XU Yunlai, ZHANG Bo, et al. Toward the random multiaccess in SIoT: A generalized-deduplication-based CRDSA mechanism[J]. IEEE Internet of Things Journal, 2024, 11(11): 20207–20222. doi: 10.1109/JIOT.2024.3370742.
    [4]
    CHEN Zhengchuan, FENG Yifan, TIAN Zhong, et al. Energy efficiency optimization for irregular repetition slotted ALOHA-based massive access[J]. IEEE Wireless Communications Letters, 2022, 11(5): 982–986. doi: 10.1109/LWC.2022.3151931.
    [5]
    PAOLINI E, LIVA G, and CHIANI M. Coded slotted ALOHA: A graph-based method for uncoordinated multiple access[J]. IEEE Transactions on Information Theory, 2015, 61(12): 6815–6832. doi: 10.1109/TIT.2015.2492579.
    [6]
    CHEN Zhengchuan, FENG Chundie, FENG Yifan, et al. Coded slotted ALOHA scheme with multi-packet reception under erasure channels[J]. IEEE Transactions on Vehicular Technology, 2023, 72(12): 15804–15818. doi: 10.1109/TVT.2023.3290978.
    [7]
    CHEN Zhengchuan, FENG Yifan, FENG Chundie, et al. Analytic distribution design for irregular repetition slotted ALOHA with multi-packet reception[J]. IEEE Transactions on Vehicular Technology, 2023, 72(1): 1360–1365. doi: 10.1109/TVT.2022.3207048.
    [8]
    王义文, 王千帆, 马啸. 强干扰环境下无速率随机码编译码方案及其性能分析[J]. 电子与信息学报, 2024, 46(10): 4017–4023. doi: 10.11999/JEIT230879.

    WANG Yiwen, WANG Qianfan, and MA Xiao. Rateless random coding scheme and performance analysis in strong interference environments[J]. Journal of Electronics & Information Technology, 2024, 46(10): 4017–4023. doi: 10.11999/JEIT230879.
    [9]
    SHIRVANIMOGHADDAM M, MOHAMMADI M S, ABBAS R, et al. Short block-length codes for ultra-reliable low latency communications[J]. IEEE Communications Magazine, 2019, 57(2): 130–137. doi: 10.1109/MCOM.2018.1800181.
    [10]
    WANG Yiwen, WANG Qianfan, LIANG Jifan, et al. Representative OSD with local constraints of CA-polar codes[J]. Chinese Journal of Electronics, 2025, 34(4): 1111–1119. doi: 10.23919/cje.2024.00.220.
    [11]
    王千帆, 郭延庚, 宋林琦, 等. 基于跳过机制的低复杂度顺序统计译码算法[J]. 电子与信息学报, 2025, 47(11): 4275–4284. doi: 10.11999/JEIT250447.

    WANG Qianfan, GUO Yangeng, SONG Linqi, et al. Low-complexity ordered statistic decoding algorithm based on skipping mechanisms[J]. Journal of Electronics & Information Technology, 2025, 47(11): 4275–4284. doi: 10.11999/JEIT250447.
    [12]
    王骥, 李子龙, 肖健, 等. 基于低复杂度加法网络的非正交多址接入短报文多用户检测算法研究[J]. 电子与信息学报, 2024, 46(6): 2409–2417. doi: 10.11999/JEIT231186.

    WANG Ji, LI Zilong, XIAO Jian, et al. Research on multi-user detection algorithm for non-orthogonal multiple access short message based on low complexity adder network[J]. Journal of Electronics & Information Technology, 2024, 46(6): 2409–2417. doi: 10.11999/JEIT231186.
    [13]
    WANG Qianfan, GUO Kongjing, and MA Xiao. Block Markov superposition transmission of LDPC codes[J]. Journal of Information and Intelligence, 2023, 1(2): 115–133. doi: 10.1016/j.jiixd.2023.05.001.
    [14]
    WANG Qianfan, CHEN Li, and MA Xiao. A new HARQ scheme for 5G systems via interleaved superposition retransmission[J]. China Communications, 2023, 20(4): 1–11. doi: 10.23919/JCC.fa.2022-0670.202304.
    [15]
    ZHANG Zhijun, NIU Kai, DAI Jincheng, et al. Polar-slotted ALOHA over slot erasure channel[J]. IEEE Transactions on Vehicular Technology, 2023, 72(1): 760–771. doi: 10.1109/TVT.2022.3204321.
    [16]
    ZENG Hanxin, XIE Zhaopeng, CHEN Pingping, et al. Expectation propagation detection with physical network coding for massive MIMO systems[J]. IEEE Signal Processing Letters, 2024, 31: 41–45. doi: 10.1109/LSP.2023.3341342.
    [17]
    LIEW S C, LU Lu, and ZHANG Shengli. A Primer on Physical-Layer Network Coding[M]. Cham: Springer, 2015: 1–202. doi: 10.1007/978-3-031-79269-4.
    [18]
    CHEN Pingping, XIE Zhaopeng, FANG Yi, et al. Physical-layer network coding: An efficient technique for wireless communications[J]. IEEE Network, 2020, 34(2): 270–276. doi: 10.1109/MNET.001.1900289.
    [19]
    YU Xu, CHEN Cui, and QING Guo. Prioritized random access based on compute-and-forward[J]. China Communications, 2025, 22(4): 254–267. doi: 10.23919/JCC.fa.2024-0412.202504.
    [20]
    BAO Jianrong, ZHANG Wei, LIU Chao, et al. Selective soft-message-forward cooperation with threshold decision detection in two-way physical-layer network-coded MIMO IoT systems[J]. IEEE Internet of Things Journal, 2025, 12(7): 8587–8598. doi: 10.1109/JIOT.2024.3501354.
    [21]
    MANSOUR L and HICHAM M. Comparative analysis of physical layer network coding-based random access techniques in WSN communications[C]. The 14th International Conference on Intelligent Systems: Theories and Applications (SITA), Casablanca, Morocco, 2023: 1–6. doi: 10.1109/SITA60746.2023.10373740.
    [22]
    YANG Tao, REN Wencheng, and YU Fangtao. Design of coded slotted ALOHA operated with q-ary physical-layer network coding[C]. 2023-IEEE International Conference on Communications (ICC), Rome, Italy, 2023: 5328–5333. doi: 10.1109/ICC45041.2023.10278882.
    [23]
    QIU Yuping, XIE Zhaopeng, KANG Peng, et al. Polar-coded gaussian multiple-access channels with physical-layer network coding[J]. IEEE Transactions on Vehicular Technology, 2024, 73(6): 9083–9087. doi: 10.1109/TVT.2024.3352980.
    [24]
    ALAAELDIN M, ALSUSA E, AL-JARRAH M, et al. Generalized BER performance analysis for SIC-based uplink NOMA[J]. IEEE Open Journal of the Communications Society, 2025, 6: 1246–1265. doi: 10.1109/OJCOMS.2025.3539185.
    [25]
    YANG Tao, YU Fangtao, LIU Rongke, et al. Lattice-code multiple access: Architecture and efficient algorithms[J]. IEEE Transactions on Vehicular Technology, 2025, 74(8): 12465–12479. doi: 10.1109/TVT.2025.3553918.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Figures(5)

    Article Metrics

    Article views (311) PDF downloads(3) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return