In this paper, a sparse Kronecker-product (SKP) coding scheme is proposed for unsourced multiple access. Specifically, the data of each active user is encoded as the Kronecker product of two component codewords with one being sparse and the other being forward-error-correction (FEC) coded. At the receiver, an iterative decoding algorithm is developed, consisting of matrix factorization for the decomposition of the Kronecker product and soft-in soft-out decoding for the component sparse code and the FEC code. The cyclic redundancy check (CRC) aided interference cancellation technique is further incorporated for performance improvement. Numerical results show that the proposed scheme outperforms the state-of-the-art counterparts, and approaches the random coding bound within a gap of only 0.1 dB at the code length of 30000 when the number of active users is less than 75, and the error rate can be made very small even if the number of active users is relatively large.
翻译:在本文中,为无源多重存取提出了稀疏的克朗(Kronecker)产品编码方案。具体地说,每个活跃用户的数据被编码为Kronecker产品,由两个组件编码器组成,两个组件的编码器十分稀少,另一个是前方-eror-corrion(FEC)编码。在接收器中,开发了一个迭代解码算法,包括克伦克尔产品分解的矩阵化系数,以及组件稀释代码和FEC代码的软进软解码。循环冗余检查(CRC)辅助干扰取消技术被进一步纳入到功能改进中。数字结果显示,拟议的方案优于最先进的对应方,在活动用户数量小于75人时,在3000代号长度仅为0.1 dB的空隙内使用随机编码,而误差率可以非常小,即使活跃用户的数量相对较多,也能够使误率变得非常低。