A user-independent serial interference cancellation based coding scheme for the unsourced random access Gaussian channel

Vem, Avinash; Narayanan, Krishna R.; Cheng, Jun; Chamberland, Jean-François

doi:10.1109/itw.2017.8278023

Cited by 82 publications

(84 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As in [4], [15], [16], we use k = 100, N = 30000 and = 0.05. The results are presented in Fig 1 and compared to [4], [15], [16]. We also plot the random coding bound and the orthogonal MA bound [6], where perfect coordination is assumed a priori.…”

Section: Optimization and Resultsmentioning

confidence: 99%

“…One limitation of the method proposed in [15] is that the AWGN channel is reduced to a modulo-2 AWGN channel. In [4], following [15], Vem et al propose a scheme that allows serial interference cancellation as well as makes full use of the AWGN channel. These modifications further improve their results and get them closer to the maximum achievable rates.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Efficient Grant-Based Scheme for the Massive Random Access Gaussian Channel

Facenda¹,

Silva²

2019

Anais De XXXVII Simpósio Brasileiro De Telecomunicações E Processamento De Sinais

View full text Add to dashboard Cite

This paper investigates the massive random access Gaussian channel with a focus on small payloads.For this problem, grant-based schemes have been regarded as inefficient due to the necessity of large feedbacks and the use of inefficient scheduling request methods. In this paper, a novel grant-based scheme is proposed, which appears to outperform previous methods. The scheme uses Ordentlich and Polyanskiy's grantless method to transmit small coordination indices in order to perform the scheduling request, which allows both the request from the users to be efficient and the feedback to be small. We also present an improvement to the Ordentlich and Polyanskiy's scheme, allowing it to handle collisions of the same message, significantly improving the method for very small messages. Simulation results show that, if a short feedback is allowed, our method requires lower energy per bit than existing practical grantless methods.

show abstract

Section: Optimization and Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

An Efficient Grant-Based Scheme for the Massive Random Access Gaussian Channel

Facenda¹,

Silva²

2019

Anais De XXXVII Simpósio Brasileiro De Telecomunicações E Processamento De Sinais

View full text Add to dashboard Cite

show abstract

“…In this paper, we propose a novel low-complexity solution that outperforms the state-of-the-art in [8]. Our proposed coding scheme is also a substantial enhancement over the scheme in [6]. We list below key features that distinguish our proposed scheme from prior art (details can be found in Section II).…”

Section: A Motivation and Contributionsmentioning

confidence: 99%

“…In contrast, the approach we develop herein avoids the strategy of slottingand-peeling altogether. A key contribution of this paper is to show that, when carefully designed, a single sparse joint Tanner graph that spans across all transmissions can provide substantial improvement in performance over the schemes in [6], [7], [8]. ii.…”

Section: A Motivation and Contributionsmentioning

confidence: 99%

See 1 more Smart Citation

A Joint Graph Based Coding Scheme for the Unsourced Random Access Gaussian Channel

Pradhan

Amalladinne

Vem

et al. 2019

2019 IEEE Global Communications Conference (GLOBECOM)

Self Cite

View full text Add to dashboard Cite

This article introduces a novel communication paradigm for the unsourced, uncoordinated Gaussian multiple access problem. The major components of the envisioned framework are as follows. The encoded bits of every message are partitioned into two groups. The first portion is transmitted using a compressive sensing scheme, whereas the second set of bits is conveyed using a multi-user coding scheme. The compressive sensing portion is key in sidestepping some of the challenges posed by the unsourced aspect of the problem. The information afforded by the compressive sensing is employed to create a sparse random multi-access graph conducive to joint decoding. This construction leverages the lessons learned from traditional IDMA into creating low-complexity schemes for the unsourced setting and its inherent randomness. Under joint message-passing decoding, the proposed scheme offers superior performance compared to existing low-complexity alternatives. Findings are supported by numerical simulations.

show abstract

Random Access for Cellular Systems

et al. 2020

View full text Add to dashboard Cite

Wireless connectivity has become a ubiquitous part of our everyday life. Owing to its very nature, the wireless channel is a shared medium, where simultaneous transmissions from neighboring transceivers operating in the same frequency can interfere with each other. Access to the shared wireless medium needs then to be strictly regulated to ensure efficient utilization of the scarce spectral resources. The admission control process to handle the access of multiple coexisting transmitters over the same wireless channel is typically initiated relying on random access‐related policies, having users send information (control or data packets) in an uncoordinated fashion. The design goal for random access techniques differs in different systems, mainly depending on the catered service. The current fourth‐generation long‐term evolution system is primarily designed to serve cellular broadband users, and hence its random access procedures have been designed to support contention from a limited number of users, with the aim to negotiate and exclusively allocate channel resources to them. Conversely, emerging fifth‐generation new radio is designed to allow the coexistence of multiservice communication. Similarly, systems that are exclusively designed to support machine‐type communication targeting Internet of Things applications, such as SigFox, LoRA, and NB‐IoT, have designed their random access mechanism to serve a large number of low power, low‐cost devices with small payload and intermittent transmissions. On the other hand, indoor wireless local area networks like Wi‐Fi are designed for a decentralized access of several users. Finally, random access techniques like nonorthogonal multiple access and grant‐free transmissions have emerged to support machine‐type communication encompassing both its massive and critical aspects, in line with the increasing importance of such critical services in emerging systems.

show abstract

A user-independent serial interference cancellation based coding scheme for the unsourced random access Gaussian channel

Cited by 82 publications

References 7 publications

An Efficient Grant-Based Scheme for the Massive Random Access Gaussian Channel

An Efficient Grant-Based Scheme for the Massive Random Access Gaussian Channel

A Joint Graph Based Coding Scheme for the Unsourced Random Access Gaussian Channel

Random Access for Cellular Systems

Contact Info

Product

Resources

About