相关论文: Efficient Scheduling for the Massive Random Access…

It is well known that opportunistic scheduling algorithms are throughput optimal under dynamic channel and network conditions. However, these algorithms achieve a hypothetical rate region which does not take into account the overhead…

Massive MIMO is a promising technology to enable a massive number of Internet of Things nodes to transmit short and sporadic data bursts at low power. In conventional cellular networks, devices use a grant-based random access scheme to…

Grant-free access schemes are candidates to support future massive multiple access applications owing to their capability to reduce control signaling and latency. As a promising class of grant-free schemes, coded random access schemes can…

Contention-based grant-free transmission is very promising for future massive machine-type communication (mMTC). In contention-based transmission, the random pilot collision is a challenging problem. To solve this problem, multiple pilots…

Resource allocation and multiple access schemes are instrumental for the success of communication networks, which facilitate seamless wireless connectivity among a growing population of uncoordinated and non-synchronized users. In this…

The central challenge in massive machine-type communications (mMTC) is to connect a large number of uncoordinated devices through a limited spectrum. The typical mMTC communication pattern is sporadic, with short packets. This could be…

The proliferating number of devices with short payloads as well as low power budget has already driven researchers away from classical grant-based access schemes that are notorious for their large signalling overhead as well as…

In 2017, Polyanskiy [1] showed that the trade-off between power and bandwidth efficiency for massive Gaussian random access is governed by two fundamentally different regimes: low power and high power. For both regimes, tight performance…

Due to the limited number of traditional orthogonal pilots, pilot collision will severely degrade the performance of contention-based grant-free transmission. To alleviate the pilot collision and exploit the spatial degree of freedom as…

A coding scheme is proposed for the memoryless Gaussian broadcast channel with correlated noises and feedback. For all noise correlations other than -1, the gap between the sum-rate the scheme achieves and the full-cooperation bound…

In this paper, we propose a new coding scheme for symmetric Gaussian interference channels with feedback based on the ideas of time-varying coding schemes. The proposed scheme improves the Suh-Tse and Kramer inner bounds of the channel…

Gaussian channels with memory and with noiseless feedback have been widely studied in the information theory literature. However, a coding scheme to achieve the feedback capacity is not available. In this paper, a coding scheme is proposed…

With the continuous growth of machine-type devices (MTDs), it is expected that massive machine-type communication (mMTC) will be the dominant form of traffic in future wireless networks. Applications based on this technology, have…

A high success rate of grant-free random access scheme is proposed to support massive access for machine-to-machine communications in massive multipleinput multiple-output systems. This scheme allows active user equipments (UEs) to transmit…

In this work, we discuss the problem of unsourced random access (URA) over a Gaussian multiple access channel (GMAC). To address the challenges posed by emerging massive machine-type connectivity, URA reframes multiple access as a…

Massive machine-type communications protocols have typically been designed under the assumption that coordination between users requires significant communication overhead and is thus impractical. Recent progress in efficient activity…

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…

We consider the $K\geq 2$-user memoryless Gaussian broadcast channel (BC) with feedback and common message only. We show that linear-feedback schemes with a message point, in the spirit of Schalkwijk & Kailath's scheme for point-to-point…

For information transmission a discrete time channel with independent additive Gaussian noise is used. There is also another channel with independent additive Gaussian noise (the feedback channel), and the transmitter observes without delay…

This paper deals with the problem of massive random access for Gaussian multiple access channel (MAC). We continue to investigate the coding scheme for Gaussian MAC proposed by A. Vem et al in 2017. The proposed scheme consists of four…