Tensor-Based Modulation for Unsourced Massive Random Access

Decurninge, Alexis; Land, Ingmar; Guillaud, Maxime

doi:10.48550/arxiv.2006.06797

Cited by 3 publications

(5 citation statements)

References 14 publications

(38 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the problem at hand, we could create A in a similar manner. Yet, inspecting (11) and ( 14), we gather that r (t) 1 and r (t) 2 are employed separately within the denoiser. It therefore suffices to produce these sub-vectors independently.…”

Section: A Implementation Detailsmentioning

confidence: 99%

Multi-Class Unsourced Random Access via Coded Demixing

Amalladinne¹,

Hao²,

Rini³

et al. 2021

Preprint

View full text Add to dashboard Cite

Unsourced random access (URA) is a recently proposed communication paradigm attuned to machine-driven data transfers. In the original URA formulation, all the active devices share the same number of bits per packet. The scenario where several classes of devices transmit concurrently has so far received little attention. An initial solution to this problem takes the form of group successive interference cancellation, where codewords from a class of devices with more resources are recovered first, followed by the decoding of the remaining messages. This article introduces a joint iterative decoding approach rooted in approximate message passing. This framework has a concatenated coding structure borrowed from the singleclass coded compressed sensing and admits a solution that offers performance improvement at little added computational complexity. Our findings point to new connections between multiclass URA and compressive demixing. The performance of the envisioned algorithm is validated through numerical simulations.

show abstract

Section: A Implementation Detailsmentioning

confidence: 99%

Multi-Class Unsourced Random Access via Coded Demixing

Amalladinne¹,

Hao²,

Rini³

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…The curves obtained by using formula (26) for the channel estimation error provide a rough but usable approximation which gets worse as K a grows close to n p . For comparison we add the reported values of the tensor-based-modulation (TBM) approach [27], with tensor signature (8,5,5,4,4) and an outer BCH code, although the values have been obtained with the higher value P e = 0.1. For M = 50 the results pilot based scheme and TBM show a similar shape, although the TBM approach achieves better results for K a ≥ 400.…”

Section: Simulationsmentioning

confidence: 99%

“…If all of the colliding messages would result in an error, this would lead to a per-user error probability of 0.016 on average. This can be incorporated into the above analysis by subtracting this values from the target error probability p e in the normal approximation (27). Nonetheless, if a list decoder is used as a single-user decoder, it is possible to recover both of the colliding messages as demonstrated in Figure 2.…”

Section: E Collisionsmentioning

confidence: 99%

“…Unfortunately, the covariance-based AD algorithm in [24] has a run-time complexity that scales with n 2 , which makes it unfeasible to use at n 300. Alternative algorithms based on hybrid-GAMP [26] and tensor-based modulation [27] have shown an excellent performance at large coherence block-length at which the covariance-based approach was no longer feasible.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Pilot-Based Unsourced Random Access with a Massive MIMO Receiver in the Quasi-Static Fading Regime

Fengler¹,

Jung²,

Caire³

2020

Preprint

View full text Add to dashboard Cite

In this work we treat the unsourced random access problem on a Rayleigh block-fading AWGN channel with multiple receive antennas. Specifically, we consider the slowly fading scenario where the coherence block-length is large compared to the number of active users and the message can be transmitted in one coherence block.Unsourced random access refers to a form of grant-free random access where users are considered to be a-priori indistinguishable and the receiver recovers a list of transmitted messages up to permutation. In this work we show that, when the coherence block length is large enough, a conventional approach based on the transmission of nonorthogonal pilot sequences with subsequent channel estimation and Maximum-Ratio-Combining (MRC) provides a simple energy-efficient solution whose performance can be well approximated in closed form. For the finite blocklength simulations we use a randomly sub-sampled DFT matrix as pilot matrix, a low-complexity approximate message passing algorithm for activity detection and a state-of-the-art polar code as single-user error correction code with a successive-cancellation-list decoder. These simulations prove the scalability of the presented approach and the quality of the analysis.

show abstract

“…Over the last few years, there has been great interest in developing efficient low-complexity schemes for the unsourced random access channel [3,2,4,5,6,7,8,9,10,11,12,13,14,15]. A natural approach for this setup is for all users to transmit codewords from the same codebook.…”

Section: Introductionmentioning

confidence: 99%

On Compressed Sensing of Binary Signals for the Unsourced Random Access Channel

Romanov,

Ordentlich

2021

Preprint

View full text Add to dashboard Cite

Motivated by applications in unsourced random access, this paper develops a novel scheme for the problem of compressed sensing of binary signals. In this problem, the goal is to design a sensing matrix A and a recovery algorithm, such that the sparse binary vector x can be recovered reliably from the measurements y = Ax + σz, where z is additive white Gaussian noise. We propose to design A as a parity check matrix of a low-density parity-check code (LDPC), and to recover x from the measurements y using a Markov chain Monte Carlo algorithm, which runs relatively fast due to the sparse structure of A. The performance of our scheme is comparable to state-of-the-art schemes, which use dense sensing matrices, while enjoying the advantages of using a sparse sensing matrix.

show abstract

Tensor-Based Modulation for Unsourced Massive Random Access

Cited by 3 publications

References 14 publications

Multi-Class Unsourced Random Access via Coded Demixing

Multi-Class Unsourced Random Access via Coded Demixing

Pilot-Based Unsourced Random Access with a Massive MIMO Receiver in the Quasi-Static Fading Regime

On Compressed Sensing of Binary Signals for the Unsourced Random Access Channel

Contact Info

Product

Resources

About