Capacity Region Of Multiple Access Channel Research Articles

Capacity Region of Asynchronous Multiple Access Channels With FTN

This paper derives the capacity region of asynchronous multiple access channel (MAC) with faster-than-Nyquist (FTN) signaling. We first express the capacity region in the frequency domain. Next, we prove that the capacity definition for finite memory MAC can be generalized to infinite memory MAC. The achievable rate region utilizing the finite memory definition in fact achieves the same region calculated in the frequency domain. Our analysis shows that power optimization is necessary to achieve the capacity region for asynchronous MAC and FTN.

Computable limits of optical multiple-access communications

Communication rates over quantum channels can be boosted by entanglement, via superadditivity phenomena or entanglement assistance. Superadditivity refers to the capacity improvement from entangling inputs across multiple channel uses. Nevertheless, when unlimited entanglement assistance is available, the entanglement between channel uses becomes unnecessary -- the entanglement-assisted (EA) capacity of a single-sender and single-receiver channel is additive. We generalize the additivity of EA capacity to general multiple-access channels (MACs) for the total communication rate. Furthermore, for optical communication modelled as phase-insensitive bosonic Gaussian MACs, we prove that the optimal total rate is achieved by Gaussian entanglement and therefore can be efficiently evaluated. To benchmark entanglement's advantage, we propose computable outer bounds for the capacity region without entanglement assistance. Finally, we formulate an EA version of minimum entropy conjecture, which leads to the additivity of the capacity region of phase-insensitive bosonic Gaussian MACs if it is true. The computable limits confirm entanglement's boosts in optical multiple-access communications.

Performance Analysis of Lossy Decode-and-Forward for Non-Orthogonal MARCs

Non-orthogonal transmission is considered to be one of the promising techniques for improving the throughput of the existing and future wireless communication networks. We concentrate on the transmission of both independent and correlated binary sources over a non-orthogonal multiple access relay channel (MARC), which consists of two sources, one relay, and one destination. The lossy decode-and-forward (DF), developed from the conventional DF, is adopted at the relay. Two time slots are required with non-orthogonal transmission over such network setup, while three time slots are required with the conventional orthogonal transmission. We analyze the outage probability of transmission of independent binary sources over the non-orthogonal MARC based on the theorem of multiple access channel (MAC) with a helper, which combines the Slepian-Wolf rate region and the MAC capacity region. For the performance verification, we implement a practical coding-decoding chain, which is applicable to the transmission of both independent and correlated binary sources. Exclusive-OR based multi-user complete decoding is introduced at the relay node, and iterative joint decoding is utilized at the destination by taking into consideration the estimated intra-link error probability and correlation information between the sources. The practical simulation results are well matched with the theoretical analyses.

An Improved Algorithm for Testing the Membership of Gaussian Multiple-Access Channel Capacity Region

In this letter, we investigate the problem of testing the membership of Gaussian multiple-access channel capacity region (GMACR), which involves $2^{N}-1$ inequalities, where $N$ is the number of senders. Given a fixed rate tuple and positive power constraint, we propose a simple but efficient algorithm to test the membership of the GMACR. It is unveiled that the algorithm can be accomplished in $O(N\log _{2}N)$ operations, which is much more efficient than the approach by Zhang et al. , whose complexity bound is larger than $O(N^{5})$ .

Multiple Access Channels With Combined Cooperation and Partial Cribbing

In this paper, the multiple access channel (MAC) with combined cooperation and partial cribbing is studied, and its capacity region is characterized. Cooperation means that each of the two encoders sends a message to the other via a rate-limited link prior to transmission, while partial cribbing means that each of the two encoders obtains a deterministic function of the other encoder’s output with or without delay. Prior work in this field dealt separately with cooperation and partial cribbing, but by combining these two methods, we can achieve significantly higher rates. Surprisingly, the capacity region of the MAC with combined cooperation and partial cribbing can be expressed using only one auxiliary random variable (RV) similar to the capacity regions of the MAC with cooperation and with partially cribbing encoders. The reason is that in an optimal coding scheme, the encoders use both cooperation and partial cribbing to generate a common message between the encoders. Furthermore, the Gaussian MAC with combined one-sided cooperation and quantized cribbing is studied. For this model, an achievability scheme is given. This scheme shows how many cooperation or quantization bits are required to practically achieve the capacity region of the Gaussian MAC with full message cooperation or perfect cribbing. To ratify the main results, two additional models are studied. In both models, only one auxiliary RV is needed. The first is a rate distortion dual setting for the MAC with degraded message set and combined cooperation and cribbing. The second is a state-dependent MAC with cooperation, where the state is known at a partially cribbing encoder and at the decoder. However, there are cases where more than one auxiliary RV is needed, e.g., when the cooperation and the cribbing are not used for the same purposes. The MAC with an action-dependent state is presented, where the action is based on the cooperation but not on the cribbing. Therefore, in this case, more than one auxiliary RV is needed. As a result, when the common information shared by the two encoders is used unevenly by the users in the channel, more than one auxiliary RV is needed to express the capacity region.

Distributed Rate Adaptation and Power Control in Fading Multiple Access Channels

Traditionally, the capacity region of a coherent fading multiple access channel (MAC) is analyzed in two popular contexts. In the first, a centralized system with full channel state information at the transmitters (CSITs) is assumed, and the transmit power and data-rate can be jointly chosen for every fading vector realization. On the other hand, in fast-fading links with distributed CSIT, the lack of full CSI is compensated by performing ergodic averaging over sufficiently many channel realizations. Notice that the distributed CSI may necessitate decentralized power-control for optimal data-transfer. Apart from these two models, the case of slow-fading links and distributed CSIT, though relevant to many systems, has received much less attention. In this paper, a block-fading additive white Gaussian noise MAC with full CSI at the receiver and distributed CSI at the transmitters is considered. The links undergo independent fading, but otherwise have arbitrary fading distributions. The channel statistics and respective long-term average transmit powers are known to all parties. We first consider the case where each encoder has knowledge only of its own link quality, and not of others. For this model, we compute the adaptive capacity region, i.e., the collection of average rate-tuples under blockwise coding/decoding such that the rate-tuple for every fading realization is inside the instantaneous MAC capacity region. The key step in our solution is an optimal rate allocation function for any given set of distributed power control laws at the transmitters. This also allows us to structurally characterize the optimal power control for a wide class of fading models. Further extensions are also proposed for the case where each encoder has additional partial CSI about the other links.

Weak Secrecy in the Multiway Untrusted Relay Channel With Compute-and-Forward

We investigate the problem of secure communications in a Gaussian multiway relay channel applying the compute-and-forward scheme under usage of nested lattice codes. All nodes employ half-duplex operation and can exchange confidential messages only via an untrusted relay. The relay is assumed to be honest but curious, i.e., an eavesdropper that conforms to the system rules and applies the intended relaying scheme. We start with the general case of the single-input multiple-output L-user multiway relay channel and provide an achievable secrecy rate region under a weak secrecy criterion. We show that the securely achievable sum rate is equivalent to the difference between the computation rate and the multiple access channel (MAC) capacity. In particular, we show that all nodes must encode their messages such that the common computation rate tuple falls outside the MAC capacity region of the relay. We provide results for the single-input single-output and the multiple-input single-input L-user multiway relay channel as well as the two-way relay channel. We discuss these results and show the dependence between channel realization and achievable secrecy rate. We further compare our result to available results in the literature for different schemes and show that the proposed scheme operates close to the compute-and-forward rate without secrecy.

Game-theoretic resource allocation and decoding order control in OFDMA based multihop networks

It is well known that the information theoretic multiple access channel capacity region is known to be achieved by successive decoding schemes. In this paper, we study a distributed multiple access scheme in OFDMA-based wireless multihop networks. As a solution, we propose a game-theoretic resource allocation and decoding order control scheme, which is based on iterative multi-unit second price auction. The key concept of the proposed scheme is to update the auction value based on the difference between current and target bidding efficiency. We prove our proposal's convergence and stability through analysis and show its performance using simulation. It achieves around 80% of the full-search-based sum throughput while providing inter-user and inter-subchannel fairness.

Subadditivity of the minimum output entropy and superactivation of the classical capacity of quantum multiple access channels

We study subadditivity of the minimum output entropy ($H_{min}$) of quantum multiple access channels (MACs). We provide an example of violation of the additivity theorem for $H_{min}$ known in classical information theory. Our result is based on a fundamental property of $MACs$ i.e. independence of each sender. The channels used in the example can be constructed explicitly. On the basis of subadditivity of $H_{min}$ we also provide an example of extremal superadditivity (super activation) of the classical capacity region of MACs.

On the MAC-BC duality of multiuser non-regenerative MIMO relay systems

Multiple input multiple output (MIMO) relaying techniques can greatly improve the spectral efficiency and extend network coverage for future wireless systems. This article investigates a multiuser MIMO relay channel, where a base station (BS) with multiple antennas communicates with multiple mobile stations (MS) via a relay station (RS) with multiple antennas. The RS applies linear processing to the received signal and then forwards the processed signal. The dual channel conditions between MIMO relay multiple access channel (MAC) and broadcast channel (BC) are first developed for single-relay scenario with white Gaussian noise. Then the MAC-BC duality for MIMO relay systems is established by proving that the capacity region of MIMO relay MAC is equal to that of dual MIMO relay BC under the same total network transmit power constraint. In addition, the duality is also extended to multi-relay scenario with arbitrary noise. Finally, several simple general numerical examples are provided to better illustrate the effectiveness of the MIMO relay MAC-BC duality.

A General Formula of the Capacity Region for Multiple-Access Channels with Deterministic Feedback

A General Formula of the Capacity Region for Multiple-Access Channels with Deterministic Feedback

Multiterminal Source–Channel Communication Over an Orthogonal Multiple-Access Channel

We consider the problem of multiterminal source-channel communication where a number of distributed and possibly correlated sources are transmitted through an orthogonal multiple access channel to a common destination. We provide a characterization of the optimal tradeoff between the transmission cost Gamma and the distortion vector D as measured against individual sources. Our approach consists of two steps: 1) a multiple-letter characterization of the rate-distortion region of the multiterminal source coding and 2) a source-channel separation theorem ensuring that all achievable pairs of (Gamma, D) can be obtained by combining the rate-distortion region and the orthogonal multiple access channel capacity region. As a corollary, we determine the optimal power and distortion tradeoff in a quadratic Gaussian sensor network under orthogonal multiple access, and show that separate source and channel coding strictly outperforms the uncoded (amplify-forward) transmission, and is in fact optimal in this case. This result is in sharp contrast to the case of nonorthogonal multiple access for which separate source and channel coding is not only suboptimal but also strictly inferior to uncoded transmission.

On the Duality of Gaussian Multiple-Access and Broadcast Channels

We define a duality between Gaussian multiple-access channels (MACs) and Gaussian broadcast channels (BCs). The dual channels we consider have the same channel gains and the same noise power at all receivers. We show that the capacity region of the BC (both constant and fading) can be written in terms of the capacity region of the dual MAC, and vice versa. We can use this result to find the capacity region of the MAC if the capacity region of only the BC is known, and vice versa. For fading channels we show duality under ergodic capacity, but duality also holds for different capacity definitions for fading channels such as outage capacity and minimum-rate capacity. Using duality, many results known for only one of the two channels can be extended to the dual channel as well.