English
Related papers

Related papers: Performance-Complexity Analysis for MAC ML-based D…

200 papers

The fundamental diversity-multiplexing tradeoff (DMT) of the quasi-static fading, symmetric $2$-user MIMO interference channel (IC) with channel state information at the transmitters (CSIT) and a short term average power constraint is…

Information Theory · Computer Science 2010-06-08 Sanjay Karmakar , Mahesh K. Varanasi

In this paper, we develop achievability schemes for symmetric $K$-user interference channels with a rate-limited feedback from each receiver to the corresponding transmitter. We study this problem under two different channel models: the…

Information Theory · Computer Science 2017-08-04 Mehdi Ashraphijuo , Vaneet Aggarwal , Xiaodong Wang

We consider the problem of designing a low-complexity decoder for antipodal uniquely decodable (UD) /errorless code sets for overloaded synchronous code-division multiple access (CDMA) systems, where the number of signals Kamax is the…

Signal Processing · Electrical Eng. & Systems 2022-05-11 Michel Kulhandjian , Claude D'Amours , Hovannes Kulhandjian , Halim Yanikomeroglu , Dimitris A. Pados , Gurgen Khachatrian

The joint detection uses Kalman filtering (KF) to estimate the prior probability of control outputs to assist channel decoding. In this paper, we regard the joint detection as maximum a posteriori (MAP) decoding and derive the lower and…

Information Theory · Computer Science 2026-01-13 Jinnan Piao , Dong Li , Zhibo Li , Ming Yang , Xueting Yu , Jincheng Dai

Approximate capacity regions are established for a class of interfering multiple access channels consisting of two multiple-access channels (MACs), each with an arbitrary number of transmitters, with one transmitter in each MAC causing…

Information Theory · Computer Science 2018-09-05 Yimin Pang , Mahesh K. Varanasi

For the multiuser multiple-input multiple-output (MIMO) downlink channel, the users feedback their channel state information (CSI) to help the base station (BS) schedule users and improve the system sum rate. However, this incurs a large…

Information Theory · Computer Science 2011-03-22 Jin-Hao Li , Hsuan-Jung Su , Yu-Lun Tsai

The capacity region of the Finite-State Multiple Access Channel (FS-MAC) with feedback that may be an arbitrary time-invariant function of the channel output samples is considered. We characterize both an inner and an outer bound for this…

Information Theory · Computer Science 2009-11-23 Haim Permuter , Tsachy Weissman

Consider the problem of a multi-user multiple access channel. While several multi-user coding techniques exist, in practical scenarios, not all users can be scheduled simultaneously. Thus, a key problem is which users to schedule in a given…

Information Theory · Computer Science 2015-07-14 Ori Shmuel , Asaf Cohen , Omer Gurewitz

We study communication over multiple access channels (MAC) where one of the users is possibly adversarial. When all users are non-adversarial, we want their messages to be decoded reliably. When an adversary is present, we consider two…

Information Theory · Computer Science 2019-04-29 Neha Sangwan , Mayank Bakshi , Bikash Kumar Dey , Vinod M. Prabhakaran

Computational complexity is critical when deploying deep learning-based speech denoising models for on-device applications. Most prior research focused on optimizing model architectures to meet specific computational cost constraints, often…

Audio and Speech Processing · Electrical Eng. & Systems 2023-09-15 Hangting Chen , Jianwei Yu , Chao Weng

Long-context decoding in LLMs is IO-bound: each token re-reads an ever-growing KV cache. Prior accelerations cut bytes via compression, which lowers fidelity, or selection/eviction, which restricts what remains accessible, and both can…

Machine Learning · Computer Science 2026-04-02 Jinghan Yao , Sam Adé Jacobs , Walid Krichene , Masahiro Tanaka , Dhabaleswar K Panda

Consider the problem of a Multiple-Input Multiple-Output (MIMO) Multiple-Access Channel (MAC) at the limit of large number of users. Clearly, in practical scenarios, only a small subset of the users can be scheduled to utilize the channel…

Information Theory · Computer Science 2018-01-16 Joseph Kampeas , Asaf Cohen , Omer Gurewitz

We consider the problem of shared randomness-assisted multiple access channel (MAC) simulation for product inputs and characterize the one-shot communication cost region via almost-matching inner and outer bounds in terms of the smooth…

Information Theory · Computer Science 2026-03-26 Aditya Nema , Sreejith Sreekumar , Mario Berta

A unified framework to obtain all known lower bounds (random coding, typical random coding and expurgated bound) on the reliability function of a point-to-point discrete memoryless channel (DMC) is presented. By using a similar idea for a…

Information Theory · Computer Science 2010-10-08 Ali Nazari , Achilleas Anastasopoulos , S. Sandeep Pradhan

This paper considers the forward error correction (FEC) code design for approaching the capacity of a dynamic multiple access channel (MAC) where both the number of users and their respective signal powers keep constantly changing,…

Information Theory · Computer Science 2019-07-22 Xiaojie Wang , Sebastian Cammerer , Stephan ten Brink

This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with…

Information Theory · Computer Science 2016-11-18 Jonathan Scarlett , Alfonso Martinez , Albert Guillén i Fàbregas

We investigate how to exploit intermittent feedback for interference management. Focusing on the two-user linear deterministic interference channel, we completely characterize the capacity region. We find that the characterization only…

Information Theory · Computer Science 2016-11-17 Can Karakus , I-Hsiang Wang , Suhas Diggavi

Link adaptation is a crucial part of many modern communications systems, allowing the system to adapt the transmission and reception strategies to changes in channel conditions. One of the fundamental components of the link adaptation…

Information Theory · Computer Science 2009-09-08 Oded Redlich , Doron Ezri , Dov Wulich

In network MIMO systems, channel state information is required at the transmitter side to multiplex users in the spatial domain. Since perfect channel knowledge is difficult to obtain in practice, \emph{limited feedback} is a widely…

Information Theory · Computer Science 2012-07-07 Yong Cheng , Vincent K. N. Lau , Yi Long

Secured opportunistic Medium Access Control (MAC) and complexity reduction in channel estimation are proposed in the Cross layer design Cognitive Radio Networks deploying the secured dynamic channel allocation from the endorsed channel…

Networking and Internet Architecture · Computer Science 2012-03-19 Niraj Shakhakarmi