Tensor Decomposition Bounds for TBM-Based Massive Access

Tensor-based modulation (TBM) has been proposed in the context of unsourced random access for massive uplink communication. In this modulation, transmitters encode data as rank-1 tensor, with factors from a discrete vector constellation. This construction allows to split the multi-user receiver into a user separation step based on a low-rank tensor decomposition, and independent single-user demappers. In this paper, we analyze the limits of the tensor decomposition using Cramér-Rao bounds, providing bounds on the accuracy of the estimated factors. These bounds are shown by simulation to be tight at high SNR. We introduce an approximate perturbation model for the output of the tensor decomposition, which facilitates the computation of the log-likelihood ratios (LLR) of the transmitted bits, and provides an approximate achievable bound for the finite-length error probability. Combining TBM with classical forward error correction coding schemes such as polar codes, we use the approximate LLR to derive soft decoders showing a gain over hard decoders at low SNR.

[1]  Zbynek Koldovský,et al.  Cramér-Rao-Induced Bounds for CANDECOMP/PARAFAC Tensor Decomposition , 2012, IEEE Transactions on Signal Processing.

[2]  Yury Polyanskiy,et al.  Energy efficient random access for the quasi-static fading MAC , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[3]  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..

[4]  Nikos D. Sidiropoulos,et al.  Cramer-Rao lower bounds for low-rank decomposition of multidimensional arrays , 2001, IEEE Trans. Signal Process..

[5]  Alexis Decurninge,et al.  Tensor-Based Modulation for Unsourced Massive Random Access , 2021, IEEE Wireless Communications Letters.

[6]  Alexis Decurninge,et al.  Cube-Split: A Structured Grassmannian Constellation for Non-Coherent SIMO Communications , 2019, IEEE Transactions on Wireless Communications.

[7]  Yury Polyanskiy,et al.  A perspective on massive random-access , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[8]  Surya Ganguli,et al.  Statistical mechanics of low-rank tensor decomposition , 2018, NeurIPS.

[9]  G. Caire,et al.  Grant-Free Massive Random Access With a Massive MIMO Receiver , 2019, 2019 53rd Asilomar Conference on Signals, Systems, and Computers.

[10]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[11]  Giuseppe Caire,et al.  SPARCs for Unsourced Random Access , 2019, IEEE Transactions on Information Theory.

[12]  Wei Yu,et al.  Sparse Activity Detection for Massive Connectivity , 2018, IEEE Transactions on Signal Processing.

[13]  Yonina C. Eldar,et al.  On the Constrained CramÉr–Rao Bound With a Singular Fisher Information Matrix , 2009, IEEE Signal Processing Letters.

[14]  Giuseppe Caire,et al.  Pilot-Based Unsourced Random Access with a Massive MIMO Receiver, MRC and Polar Codes , 2020, ArXiv.