English
Related papers

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

200 papers

This paper considers broadcast channels with L antennas at the base station and m single-antenna users, where L and m are typically of the same order. We assume that only partial channel state information is available at the base station…

Information Theory · Computer Science 2008-06-18 Wei Dai , Youjian , Liu , Brian C. Rider , Wen Gao

In this paper, we consider the issue of throughput and packet drop rate (PDR) optimization as two performance metrics for delay sensitive applications in network coded time division duplex (TDD) satellite systems with large round trip times…

Information Theory · Computer Science 2014-08-26 Mohammad Esmaeilzadeh , Neda Aboutorab , Parastoo Sadeghi

In this work we demonstrate how a lack of synchronization can in fact be advantageous in the problem of random access. Specifically, we consider a multiple-access problem over a frame-asynchronous 2-user binary-input adder channel in the…

Information Theory · Computer Science 2023-05-12 Alexander Fengler , Alejandro Lancho , Krishna Narayanan , Yury Polyanskiy

Neural machine translation (NMT) systems typically employ maximum a posteriori (MAP) decoding to select the highest-scoring translation from the distribution mass. However, recent evidence highlights the inadequacy of MAP decoding, often…

Computation and Language · Computer Science 2025-06-06 Di Wu , Yibin Lei , Christof Monz

Minimum Bayes Risk (MBR) decoding optimizes output selection by maximizing the expected utility value of an underlying human distribution. While prior work has shown the effectiveness of MBR decoding through empirical evaluation, few…

Computation and Language · Computer Science 2025-06-23 Yuki Ichihara , Yuu Jinnai , Kaito Ariu , Tetsuro Morimura , Eiji Uchibe

Minimum Bayes-risk (MBR) decoding has recently gained renewed attention in text generation. MBR decoding considers texts sampled from a model as pseudo-references and selects the text with the highest similarity to the others. Therefore,…

Computation and Language · Computer Science 2024-04-02 Atsumoto Ohashi , Ukyo Honda , Tetsuro Morimura , Yuu Jinnai

A mechanism called switched feedback is introduced; under switched feedback, each channel output goes forward to the receiver(s) or back to the transmitter(s) but never both. By studying the capacity of the Multiple-Access Channel (MAC)…

Information Theory · Computer Science 2025-05-01 Oliver Kosut , Michael Langberg , Michelle Effros

Diversity-Multiplexing tradeoff (DMT) is a coarse high SNR approximation of the fundamental tradeoff between data rate and reliability in a slow fading channel. In this paper, we characterize the fundamental DMT of the two user single…

Information Theory · Computer Science 2009-09-08 Adnan Raja , Pramod Viswanath

We introduce a new analysis technique to derive a single-letter upper bound on the mismatch capacity of a stationary, single-user, memoryless channel with a decoding metric $q$. Our bound is obtained by considering a multicast transmission…

Information Theory · Computer Science 2021-03-29 Anelia Somekh-Baruch

We provide a comprehensive performance comparison of soft-output and hard-output demodulators in the context of non-iterative multiple-input multiple-output bit-interleaved coded modulation (MIMO-BICM). Coded bit error rate (BER), widely…

Information Theory · Computer Science 2010-12-07 Peter Fertl , Joakim Jalden , Gerald Matz

Multi-antenna cache-aided wireless networks have been known to suffer from a severe feedback bottleneck, where achieving the maximal Degrees-of-Freedom (DoF) performance required feedback from all served users. These costs matched the…

Information Theory · Computer Science 2020-05-01 Eleftherios Lampiris , Antonio Bazco-Nogueras , Petros Elia

Diversity-multiplexing tradeoff (DMT) presents a compact framework to compare various MIMO systems and channels in terms of the two main advantages they provide (i.e. high data rate and/or low error rate). This tradeoff was characterized…

Information Theory · Computer Science 2016-11-15 Sergey Loyka , George Levin

In this work, a new upper bound for average error probability of a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound can be universally obtained for all discrete memoryless MACs with given input and…

Information Theory · Computer Science 2009-01-09 Ali Nazari , Achilleas Anastasopoulos , S. Sandeep Pradhan

In this paper, we study the problem of user activity detection and large-scale fading coefficient estimation in a random access wireless uplink with a massive MIMO base station with a large number $M$ of antennas and a large number of…

Information Theory · Computer Science 2021-09-22 Alexander Fengler , Saeid Haghighatshoar , Peter Jung , Giuseppe Caire

This paper considers broadcast channels with L antennas at the base station and m single-antenna users, where each user has perfect channel knowledge and the base station obtains channel information through a finite rate feedback. The key…

Information Theory · Computer Science 2007-07-13 Wei Dai , Youjian , Liu , Brian Rider

Resource allocation in the multiple-input multiple-output (MIMO) multiple access channel (MAC) is a fundamental problem in multiuser communications, yet it is increasingly treated as non-convex and computationally intractable. This has…

Signal Processing · Electrical Eng. & Systems 2026-05-06 Muhammad Umer , Muhammad Ahmed Mohsin , Ahsan Bilal , John M. Cioffi

Consider a channel allocation problem over a frequency-selective channel.There are K channels (frequency bands) and N users such that K=bN for some positive integer b. We want to allocate b channels (or resource blocks) to each user. Due to…

Information Theory · Computer Science 2018-11-13 Ilai Bistritz , Amir Leshem

Deterministic identification over K-input multiple-access channels with average input cost constraints is considered. The capacity region for deterministic identification is determined for an average-error criterion, where arbitrarily large…

Information Theory · Computer Science 2023-06-21 Johannes Rosenberger , Abdalla Ibrahim , Christian Deppe , Roberto Ferrara

In this paper, we study efficient codebook design for limited feedback in extremely large-scale multiple-input-multiple-output (XL-MIMO) frequency division duplexing (FDD) systems. It is worth noting that existing codebook designs for…

Information Theory · Computer Science 2026-05-26 Liujia Yao , Changsheng You , Zixuan Huang , Chao Zhou , Zhaohui Yang , Xiaoyang Li

This paper investigates three open problems in random beamforming based communication systems: the scheduling policy with heterogeneous users, the closed form sum rate, and the randomness of multiuser diversity with selective feedback. By…

Information Theory · Computer Science 2016-11-17 Yichao Huang , Bhaskar D. Rao