English
Related papers

Related papers: Capacity Region of Asynchronous Multiple Access Ch…

200 papers

The capacity of the multiple-access channel with any distribution of messages among the transmitting nodes was determined by Han in 1979 and the expression of the capacity region contains a number of rate bounds and that grows exponentially…

Information Theory · Computer Science 2012-02-07 Stefano Rini

The asynchronous capacity region of memoryless multiple-access channels is the union of certain polytopes. It is well-known that vertices of such polytopes may be approached via a technique called successive decoding. It is also known that…

Information Theory · Computer Science 2016-11-17 Ninoslav Marina , Bixio Rimoldi

In this letter, we analyze the performance of covert communications under faster-than-Nyquist (FTN) signaling in the Rayleigh block fading channel. Both Bayesian criterion- and Kullback-Leibler (KL) divergence-based covertness constraints…

Information Theory · Computer Science 2022-01-19 Yuan Li , Yuchen Zhang , Wanyu Xiang , Jianquan Wang , Sa Xiao , Liang Chang , Wanbin Tang

In this paper, we characterize the capacity region for the two-user linear Gaussian compound Multiple Access Channel with common message (MACC) and with intersymbol interference (ISI) under an input power constraint. The region is obtained…

Information Theory · Computer Science 2012-12-19 Mostafa Monemizadeh , Saeed Hajizadeh , Seyed Alireza Seyedin , Ghosheh Abed Hodtani

We consider the communication scenario where multiple cognitive users wish to communicate to the same receiver, in the presence of primary transmission. The cognitive transmitters are assumed to have the side information about the primary…

Information Theory · Computer Science 2007-07-13 Peng Cheng , Guanding Yu , Zhaoyang Zhang , Hsiao-Hwa Chen , Peiliang Qiu

The capacity region of the cooperative two-user Multiple Access Channel (MAC) in Gaussian noise is determined to within a constant gap for both the Full-Duplex (FD) and Half-Duplex (HD) case. The main contributions are: (a) for both FD and…

Information Theory · Computer Science 2016-11-18 Daniela Tuninetti

In this paper, we consider the finite-state multiple access channel (MAC) with partially cooperative encoders and delayed channel state information (CSI). Here partial cooperation refers to the communication between the encoders via…

Information Theory · Computer Science 2016-11-17 Ziv Goldfeld , Haim H. Permuter , Benjamin M. Zaidel

The necessary and sufficient condition of the channel capacity is rigorously formulated for the N-user discrete memoryless multiple-access channel (MAC). The essence of the formulation is to invoke an {\em elementary} MAC where sizes of…

Information Theory · Computer Science 2007-08-09 Yoichiro Watanabe , Koichi Kamoi

This paper studies the optimal points in the capacity region of Gaussian multiple access channels (GMACs) with constant fading, multiple antennas and various power constraints. The points of interest maximize general rate objectives that…

Information Theory · Computer Science 2016-01-15 Daniel Calabuig , Ramy H. Gohary , Halim Yanikomeroglu

We consider multi-hop multiple access (MAC) and broadcast channels (BC) where communication takes place with the assistance of relays that amplify and forward (AF) their received signals. For a two hop parallel AF relay MAC, assuming a sum…

Information Theory · Computer Science 2007-07-13 Syed A. Jafar , Krishna S. Gomadam

Effective capacity, which provides the maximum constant arrival rate that a given service process can support while satisfying statistical delay constraints, is analyzed in a multiuser scenario. In particular, the effective capacity region…

Information Theory · Computer Science 2010-09-17 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

We study a noncoherent multiple-input multiple-output (MIMO) fading multiple-access channel (MAC), where the transmitters and the receiver are aware of the statistics of the fading, but not of its realisation. We analyse the rate region…

Information Theory · Computer Science 2012-01-17 A. Taufiq Asyhari , Tobias Koch , Albert Guillén i Fàbregas

We determine both the random code capacity region and the deterministic code capacity region of the arbitrarily varying multiple access channel (AVMAC) under input and state constraints. As in the single user case, the boundary of the…

Information Theory · Computer Science 2020-07-03 Uzi Pereg , Yossef Steinberg

We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multi-letter characterizations of two different two-dimensional capacity regions. The first region is comprised of the rates at which it…

Quantum Physics · Physics 2011-10-25 Jon Yard , Igor Devetak , Patrick Hayden

The Additive-Multiplicative Matrix Channel (AMMC) was introduced by Silva, Kschischang and K\"otter in 2010 to model data transmission using random linear network coding. The input and output of the channel are $n\times m$ matrices over a…

Information Theory · Computer Science 2025-01-22 Simon R. Blackburn , Jessica Claridge

Faster-than-Nyquist (FTN) signaling aims at improving the spectral efficiency of wireless communication systems by exceeding the boundaries set by the Nyquist-Shannon sampling theorem. 50 years after its first introduction in the scientific…

Signal Processing · Electrical Eng. & Systems 2025-07-30 Bruno De Filippo , Carla Amatetti , Alessandro Vanelli-Coralli

A memoryless state-dependent multiple access channel (MAC) is considered where two transmitters wish to convey a respective message to a receiver while simultaneously estimating the respective channel state via generalized feedback. The…

Information Theory · Computer Science 2019-02-12 Mari Kobayashi , Hassan Hamad , Gerhard Kramer , Giuseppe Caire

Faster-than-Nyquist (FTN) signalling has emerged as a compelling technique for enhancing spectral efficiency in bandwidth-constrained communication systems. By intentionally introducing controlled intersymbol interference (ISI), FTN allows…

Information Theory · Computer Science 2026-05-05 Shubham Paul , Sheetal Kalyani , Nambi Sheshadri , R David Koilpillai

In this paper, we consider a two-user multiple access fading channel under quality-of-service (QoS) constraints. We initially formulate the transmission rates for both transmitters, where the transmitters have arbitrarily distributed input…

Information Theory · Computer Science 2016-08-08 Marwan Hammouda , Sami Akin , Jürgen Peissig

Multiply-accumulation (MAC) is a crucial computing operation in signal processing, numerical simulations, and machine learning. This work presents a scalable, programmable, frequency-domain parallel computing leveraging gigahertz…

Applied Physics · Physics 2024-09-18 Jun Ji , Zichen Xi , Bernadeta R. Srijanto , Ivan I. Kravchenko , Ming Jin , Wenjie Xiong , Linbo Shao