Related papers: Near-Optimal Coding for Many-user Multiple Access …
In the massive machine-type communication (mMTC) scenario, a large number of devices with sporadic traffic need to access the network on limited radio resources. While grant-free random access has emerged as a promising mechanism for…
To relieve the stress on channel estimation and decoding complexity in cell-free massive multiple-input multiple-output (MIMO) systems, user grouping problem is investigated in this paper, where access points (APs) based on time-division…
We consider the capacity region of a $K$-user multiple access channel (MAC) with energy harvesting transmitters. Each user stores and schedules the randomly arriving energy using an energy buffer. Users can also perform energy cooperation…
This paper proposes a coding framework for capacity-region-achieving sparse regression (SR) codes over MIMO multiple-access channels (MIMO-MAC), where a single SR code is used for each user at the transmitter. With random semi-unitary…
This paper considers an unlicensed multiple-access channel (MAC) that coexists with a licensed point-to-point user, following the underlay cognitive radio paradigm. We assume that every transceiver except the secondary base station has one…
This paper studies a two-user state-dependent Gaussian multiple-access channel (MAC) with state noncausally known at one encoder. Two scenarios are considered: i) each user wishes to communicate an independent message to the common…
It has been recently shown by Lapidoth and Steinberg that strictly causal state information can be beneficial in multiple access channels (MACs). Specifically, it was proved that the capacity region of a two-user MAC with independent…
This paper considers a simple on-off random multiple access channel, where n users communicate simultaneously to a single receiver over m degrees of freedom. Each user transmits with probability lambda, where typically lambda n < m << n,…
This paper provides a numerical framework for computing the achievable rate region of memoryless multiple access channel (MAC) with a continuous alphabet from data. In particular, we use recent results on variational lower bounds on mutual…
We consider a single-antenna Gaussian multiple-access channel (MAC) with a multiple-antenna amplify-and-forward (AF) relay, where, contrary to many previous works, also the direct links between transmitters and receiver are taken into…
We study the energy performance of random linear network coding for time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data…
In this paper, we study the decentralized parallel multiple access channel (MAC) when transmitters selfishly maximize their individual spectral efficiency by selecting a single channel to transmit. More specifically, we investigate the set…
This paper investigates practical 5G strategies for power-balanced non-orthogonal multiple access (NOMA). By allowing multiple users to share the same time and frequency, NOMA can scale up the number of served users and increase spectral…
In this paper, we investigate the design of linear precoders for the multiple-input multiple-output (MIMO) multiple access channel (MAC). We assume that statistical channel state information (CSI) is available at the transmitters and…
This article considers the massive MIMO unsourced random access problem on a quasi-static Rayleigh fading channel. Given a fixed message length and a prescribed number of channel uses, the objective is to construct a coding scheme that…
Due to the short and bursty incoming messages, channel access activities in a wireless random access system are often fractional. The lack of frequent data support consequently makes it difficult for the receiver to estimate and track the…
We study a multiple-input multiple-output (MIMO) multiple access channel (MAC) from several multi-antenna transmitters to a multi-antenna receiver. The fading channels between the transmitters and the receiver are modeled by random…
Recent investigations have shown sum capacity results within a constant bit-gap for several channel models, e.g. the two-user Gaussian interference channel (G-IC), k-user G-IC or the Gaussian X-channel. This has motivated investigations of…
In this paper, we study the problem of secret communication over a Compound Multiple Access Channel (MAC). In this channel, we assume that one of the transmitted messages is confidential that is only decoded by its corresponding receiver…
We studied power splitting-based simultaneous wireless information and power transfer (PS-SWIPT) in multiple access channels (MAC), considering the decoding cost and non-linear energy harvesting (EH) constraints at the receiving nodes to…