English
Related papers

Related papers: Successive Integer-Forcing and its Sum-Rate Optima…

200 papers

The performance of spatial multiplexing systems with linear minimum-mean-squared-error receivers is investigated in ad hoc networks. It is shown that single-stream transmission is preferable over multi-stream transmission, due to the weaker…

Information Theory · Computer Science 2010-03-17 Raymond H. Y. Louie , Matthew R. McKay , Nihar Jindal , Iain B. Collings

Implicit Neural Representation (INR) has emerged as an effective method for unsupervised image denoising. However, INR models are typically overparameterized; consequently, these models are prone to overfitting during learning, resulting in…

Computer Vision and Pattern Recognition · Computer Science 2024-01-04 Zipei Yan , Zhengji Liu , Jizhou Li

A generalization of the problem of writing on dirty paper is considered in which one transmitter sends a common message to multiple receivers. Each receiver experiences on its link an additive interference (in addition to the additive…

Information Theory · Computer Science 2007-07-13 Ashish Khisti , Uri Erez , Amos Lapidoth , Gregory Wornell

This paper considers the multiple-input-single-output interference channel (MISO-IC) with interference decoding capability (IDC), so that the interference signal can be decoded and subtracted from the received signal. On the MISO-IC with…

Information Theory · Computer Science 2011-07-05 Z. K. M. Ho , D. Gesbert , E. Jorswieck , R. Mochaourab

In the relay based telecommunications with $K$ relays between the source and destination, $K+1$ time or frequency slots are required for a single frame transmission. However, without the relays, only one time or frequency slot is used for a…

Information Theory · Computer Science 2016-10-17 Mohammad Lari

Transformer-based encoder-decoder models produce a fused token-wise representation after every encoder layer. We investigate the effects of allowing the encoder to preserve and explore alternative hypotheses, combined at the end of the…

Computation and Language · Computer Science 2021-07-23 Mikhail Burtsev , Anna Rumshisky

To efficiently factorize high-dimensional distributed representations to the constituent atomic vectors, one can exploit the compute-in-superposition capabilities of vector-symbolic architectures (VSA). Such factorizers however suffer from…

Machine Learning · Computer Science 2024-12-03 Geethan Karunaratne , Michael Hersche , Abu Sebastian , Abbas Rahimi

Overfitting is one of the most critical challenges in deep neural networks, and there are various types of regularization methods to improve generalization performance. Injecting noises to hidden units during training, e.g., dropout, is…

Machine Learning · Computer Science 2017-11-10 Hyeonwoo Noh , Tackgeun You , Jonghwan Mun , Bohyung Han

Polar codes provably achieve the capacity of a wide array of channels under successive decoding. This assumes infinite precision arithmetic. Given the successive nature of the decoding algorithm, one might worry about the sensitivity of the…

Information Theory · Computer Science 2012-09-21 S. Hamed Hassani , Rudiger Urbanke

Multiple transmit antennas in a downlink channel can provide tremendous capacity (i.e. multiplexing) gains, even when receivers have only single antennas. However, receiver and transmitter channel state information is generally required. In…

Information Theory · Computer Science 2011-11-09 Nihar Jindal

In this paper, we propose a novel method to compute the feedback capacity of channels with memory using reinforcement learning (RL). In RL, one seeks to maximize cumulative rewards collected in a sequential decision-making environment. This…

Information Theory · Computer Science 2020-01-28 Ziv Aharoni , Oron Sabag , Haim Henry Permuter

The paper investigates the problem of maximizing expected sum throughput in a fading multiple access cognitive radio network when secondary user (SU) transmitters have energy harvesting capability, and perform cooperative spectrum sensing.…

Information Theory · Computer Science 2016-02-23 Sinchan Biswas , Amirpasha Shirazinia , Subhrakanti Dey

Modern language models are trained almost exclusively on token sequences produced by a fixed tokenizer, an external lossless compressor often over UTF-8 byte sequences, thereby coupling the model to that compressor. This work introduces…

Computation and Language · Computer Science 2026-05-15 Lin Zheng , Xinyu Li , Qian Liu , Xiachong Feng , Lingpeng Kong

In this paper, we consider dynamic precoder/decorrelator optimization for multimedia streaming in MIMO interference networks. We propose a truly cross-layer framework in the sense that the optimization objective is the application level…

Information Theory · Computer Science 2015-06-18 Fan Zhang , Vincent K. N. Lau

Transformers have achieved great success in effectively processing sequential data such as text. Their architecture consisting of several attention and feedforward blocks can model relations between elements of a sequence in parallel…

Machine Learning · Computer Science 2025-02-20 Jaemu Heo , Eldor Fozilov , Hyunmin Song , Taehwan Kim

In this paper, we consider the precoder design for an under-loaded or critically loaded downlink multi-user multiple-input multiple-output (MU-MIMO) communication system. We propose novel precoding and decoding schemes which enhance system…

Information Theory · Computer Science 2022-05-03 Aravindh Krishnamoorthy , Robert Schober

The most efficient receiver-driven multicast congestion control protocols use dynamic channels. This means that each group has a cyclic rate variation with a continuously decreasing phase. Despite promising results in terms of fairness,…

Networking and Internet Architecture · Computer Science 2010-04-28 Vincent Lucas , Jean-Jacques Pansiot , Dominique Grad , Benoît Hilt

We develop a model for a noisy communication channel in which the noise affecting consecutive transmissions is correlated. This model is motivated by fluctuating birefringence of fiber optic links. We analyze the role of entanglement of the…

Quantum Physics · Physics 2009-11-10 Jonathan Ball , Andrzej Dragan , Konrad Banaszek

Communication in the presence of bounded timing asynchronism which is known to the receiver but cannot be easily compensated is studied. Examples of such situations include point-to-point communication over inter-symbol interference (ISI)…

Information Theory · Computer Science 2014-11-18 Ping-Chung Wang , Yu-Chih Huang , Krishna R. Narayanan

On a fading channel with no channel state information at the receiver, calculating true log-likelihood ratios (LLR) is complicated. Existing work assume that the power of the additive noise is known and use the expected value of the fading…

Information Theory · Computer Science 2012-04-17 Raman Yazdani , Masoud Ardakani