English
Related papers

Related papers: Gaussian Intersymbol Interference Channels With Mi…

200 papers

In the transmission of digital data at a relatively high rate over a particular band limited channel, it is normally necessary to employ an equalizer at the receiver in order to correct the signal distortion introduced by the channel .ISI…

Information Theory · Computer Science 2014-03-18 Laith Awda Kadhim , Salih Mohammed , Osamah Saad

In this paper, we investigate the sum-capacity of the two-user Gaussian interference channel with Gaussian superposition coding and successive decoding. We first examine an approximate deterministic formulation of the problem, and introduce…

Information Theory · Computer Science 2011-03-30 Yue Zhao , Chee Wei Tan , A. Salman Avestimehr , Suhas N. Diggavi , Gregory J. Pottie

Intersymbol Interference (ISI) has a detrimental impact on any Molecular Communication via Diffusion (MCvD) system. Also, the receiver noise can severely degrade the MCvD channel performance. However, the channel codes proposed in the…

Information Theory · Computer Science 2025-02-28 Tamoghno Nath , Krishna Gopal Benerjee , Adrish Banerjee

A rateless transmission architecture is developed for communication over Gaussian intersymbol interference channels, based on the concept of super-Nyquist (SNQ) signaling. In such systems, the signaling rate is chosen significantly higher…

Information Theory · Computer Science 2019-11-20 Uri Erez , Gregory W. Wornell

Channel memory and inter-symbol interference (ISI) are harmful factors in diffusion-based molecular communication (DBMC) between bionanosensors. To tackle these problems, this paper proposes a lightweight ISI-mitigating coding scheme to…

Information Theory · Computer Science 2023-05-24 Dongliang Jing , Andrew W. Eckford

It is well known that for Gaussian channels, a nearest neighbor decoding rule, which seeks the minimum Euclidean distance between a codeword and the received channel output vector, is the maximum likelihood solution and hence…

Information Theory · Computer Science 2022-05-09 Yizhu Wang , Wenyi Zhang

This letter produces a family of rate-compatible protograph-based LDPC codes approaching the independent and uniformly distributed (i.u.d.) capacity of inter-symbol interference (ISI) channels. This problem is highly nontrivial due to the…

Information Theory · Computer Science 2013-06-26 Thuy Van Nguyen , Aria Nosratinia , Dariush Divsalar

Through refined asymptotic analysis based on the normal approximation, we study how higher-order coding performance depends on the mean power as well as on finer statistics of the input power. We introduce a multifaceted power model in…

Information Theory · Computer Science 2026-05-13 Adeel Mahmood , Aaron B. Wagner

In this paper, we investigate the achievable rate of a diffusive Molecular Communication (MC) channel with fully absorbing receiver, which counts particles absorbed along each symbol interval and resets the counter at every interval…

Information Theory · Computer Science 2023-06-08 Fardad Vakilipoor , Luca Barletta , Stefano Bregni , Maurizio Magarini

This paper considers the achievability and converse bounds on the maximal channel coding rate at a given blocklength and error probability over AWGN channels. The problem stems from covert communication with Gaussian codewords. By…

Information Theory · Computer Science 2021-01-01 Xinchun Yu , Shuangqin Wei , Yuan Luo

This paper studies the achievable rate region of the two-user single-input-single-output (SISO) Gaussian interference channel, when the improper Gaussian signaling is applied. Under the assumption that the interference is treated as…

Information Theory · Computer Science 2012-05-10 Yong Zeng , Cenk M. Yetis , Erry Gunawan , Yong Liang Guan , Rui Zhang

We consider the discrete-time intersymbol interference (ISI) channel model, with additive Gaussian noise and fixed i.i.d. inputs. In this setting, we investigate the expression put forth by Shamai and Laroia as a conjectured lower bound for…

Information Theory · Computer Science 2014-01-08 Yair Carmon , Shlomo Shamai

This paper is about deriving lower bounds on the error exponents for the two-user interference channel under the random coding regime for several ensembles. Specifically, we first analyze the standard random coding ensemble, where the…

Information Theory · Computer Science 2017-06-22 Wasim Huleihel , Neri Merhav

We investigate whether uncoded schemes are optimal for Gaussian sources on multiuser Gaussian channels. Particularly, we consider two problems: the first is to send correlated Gaussian sources on a Gaussian broadcast channel where each…

Information Theory · Computer Science 2017-03-02 Chao Tian , Jun Chen , Suhas Diggavi , Shlomo Shamai

We consider the problem of coding over the multi-user Interference Channel (IC). It is well-known that aligning the interfering signals results in improved achievable rates in certain setups involving more than two users. We argue that in…

Information Theory · Computer Science 2016-02-18 F. Shirani , S. S. Pradhan

An approach is established for maximizing the Lower bound on the Mismatch capacity (hereafter abbreviated as LM rate), a key performance bound in mismatched decoding, by optimizing the channel input probability distribution. Under a fixed…

Information Theory · Computer Science 2024-05-02 Lingyi Chen , Shitong Wu , Xinwei Li , Huihui Wu , Hao Wu , Wenyi Zhang

This paper studies the achievable rates of Gaussian interference channels with additive white Gaussian noise (AWGN), when improper or circularly asymmetric complex Gaussian signaling is applied. For the Gaussian multiple-input…

Information Theory · Computer Science 2016-11-18 Yong Zeng , Cenk M. Yetis , Erry Gunawan , Yong Liang Guan , Rui Zhang

Motivated by the growing application of wireless multi-access networks with stringent delay constraints, we investigate the Gaussian multiple access channel (MAC) in the finite blocklength regime. Building upon information spectrum…

Information Theory · Computer Science 2013-09-11 Ebrahim MolavianJazi , J. Nicholas Laneman

We study the capacity of discrete memoryless many-to-one interference channels, i.e., K user interference channels where only one receiver faces interference. For a class of many-to-one interference channels, we identify a noisy…

Information Theory · Computer Science 2009-12-17 Viveck R. Cadambe , Syed A. Jafar

Communication over a random-parameter quantum channel when the decoder is required to reconstruct the parameter sequence is considered. We study scenarios that include either strictly-causal, causal, or non-causal channel side information…

Information Theory · Computer Science 2021-09-28 Uzi Pereg