A Tensor-BTD-based Modulation for Massive Unsourced Random Access
暂无分享,去创建一个
Zhenting Luan | Wei Han | Yuchi Wu | Shansuo Liang | Liping Zhang | Bo Bai
[1] Levent Tunçel,et al. Optimization algorithms on matrix manifolds , 2009, Math. Comput..
[2] Jean-Francois Chamberland,et al. Coded Compressed Sensing with Successive Cancellation List Decoding for Unsourced Random Access with Massive MIMO , 2021, ArXiv.
[3] Lieven De Lathauwer,et al. Decompositions of a Higher-Order Tensor in Block Terms - Part II: Definitions and Uniqueness , 2008, SIAM J. Matrix Anal. Appl..
[4] Lieven De Lathauwer,et al. Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-(Lr, Lr, 1) Terms, and a New Generalization , 2013, SIAM J. Optim..
[5] Yury Polyanskiy,et al. Energy efficient random access for the quasi-static fading MAC , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).
[6] Giorgio Ottaviani,et al. An Algorithm For Generic and Low-Rank Specific Identifiability of Complex Tensors , 2014, SIAM J. Matrix Anal. Appl..
[7] Lek-Heng Lim,et al. Schubert Varieties and Distances between Subspaces of Different Dimensions , 2014, SIAM J. Matrix Anal. Appl..
[8] Giuseppe Caire,et al. SPARCs and AMP for Unsourced Random Access , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).
[9] Andrea Zanella,et al. Long-range communications in unlicensed bands: the rising stars in the IoT and smart city scenarios , 2015, IEEE Wireless Communications.
[10] Alexis Decurninge,et al. Tensor-Based Modulation for Unsourced Massive Random Access , 2021, IEEE Wireless Communications Letters.
[11] Alexis Decurninge,et al. Cube-Split: A Structured Grassmannian Constellation for Non-Coherent SIMO Communications , 2019, IEEE Transactions on Wireless Communications.
[12] Yury Polyanskiy,et al. A perspective on massive random-access , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).