English
Related papers

Related papers: Gaussian Intersymbol Interference Channels With Mi…

200 papers

This paper is concerned with general interference channels characterized by a sequence of transition (conditional) probabilities. We present a general formula for the capacity region of the interference channel with two pairs of users. The…

Information Theory · Computer Science 2012-02-03 Lei Lin , Xiao Ma , Xiujie Huang , Baoming Bai

In this paper, capacity bounds for the two-user Interference Channel (IC) with cooperative receivers via conferencing links of finite capacities is investigated. The capacity results known for this communication scenario are limited to a…

Information Theory · Computer Science 2015-12-17 Reza K. Farsani , Amir K. Khandani

Motivated by applications of biometric identification and content identification systems, we consider the problem of random coding for channels, where each codeword undergoes lossy compression (vector quantization), and where the decoder…

Information Theory · Computer Science 2016-09-29 Neri Merhav

Joint equalization and decoding schemes are described for two-dimensional intersymbol interference (ISI) channels. Equalization is performed using the minimum mean-square-error (MMSE) criterion. Low-density parity-check codes are used for…

Information Theory · Computer Science 2016-11-18 N. Singla , J. A. O'Sullivan

The scaling laws of the achievable communication rates and the corresponding upper bounds of distributed reception in the presence of an interfering signal are investigated. The scheme includes one transmitter communicating to a remote…

Information Theory · Computer Science 2009-12-08 Amichai Sanderovich , Michael Peleg , Shlomo Shamai

In this paper, the role of secret key with finite rate is studied to enhance the secrecy performance of the system when users are operating in interference limited scenarios. To address this problem, a 2-user Gaussian Z-IC with secrecy…

Information Theory · Computer Science 2021-05-20 Somalatha U , Parthajit Mohapatra

It is common practice to collect observations of feature and response pairs from different environments. A natural question is how to identify features that have consistent prediction power across environments. The invariant causal…

Information Theory · Computer Science 2022-07-01 Austin Goddard , Yu Xiang , Ilya Soloveychik

We consider the problem of block-coded communication, where in each block, the channel law belongs to one of two disjoint sets. The decoder is aimed to decode only messages that have undergone a channel from one of the sets, and thus has to…

Information Theory · Computer Science 2015-09-08 Nir Weinberger , Neri Merhav

Integrated sensing and communications (ISAC) is recognized as a key enabling technology for future wireless networks. To shed light on the fundamental performance limits of ISAC systems, this paper studies the deterministic-random tradeoff…

Information Theory · Computer Science 2023-01-05 Fan Liu , Yifeng Xiong , Kai Wan , Tony Xiao Han , Giuseppe Caire

We consider the decoding of bit interleaved coded modulation (BICM) applied to multiband OFDM for practical scenarios where only a noisy (possibly very bad) estimate of the channel is available at the receiver. First, a decoding metric…

Networking and Internet Architecture · Computer Science 2007-08-13 Sajad Sadough , Pablo Piantanida , Pierre Duhamel

Information transmission over channels with transceiver distortion is investigated via generalized mutual information (GMI) under Gaussian input distribution and nearest-neighbor decoding. A canonical transceiver structure in which the…

Information Theory · Computer Science 2016-02-11 Wenyi Zhang

The single-letter characterisation of the entanglement-assisted capacity of a quantum channel is one of the seminal results of quantum information theory. In this paper, we consider a modified communication scenario in which the receiver is…

Quantum Physics · Physics 2024-09-16 Kaiyuan Ji , Bartosz Regula , Mark M. Wilde

Achievable and converse bounds for general channels and mismatched decoding are derived. The direct (achievable) bound is derived using random coding and the analysis is tight up to factor 2. The converse is given in term of the achievable…

Information Theory · Computer Science 2015-01-20 Nir Elkayam , Meir Feder

The optimal rate region for interference networks is characterized when encoding is restricted to random code ensembles with superposition coding and time sharing. A simple simultaneous nonunique decoding rule, under which each receiver…

Information Theory · Computer Science 2016-11-15 Bernd Bandemer , Abbas El Gamal , Young-Han Kim

Inner and outer bounds are established on the capacity region of two-sender, two-receiver interference channels where one transmitter knows both messages. The transmitter with extra knowledge is referred to as being cognitive. The inner…

Information Theory · Computer Science 2007-10-22 I. Maric , A. Goldsmith , G. Kramer , S. Shamai

This paper investigates the fundamental performance limits of the two-user interference channel in the presence of an external eavesdropper. In this setting, we construct an inner bound, to the secrecy capacity region, based on the idea of…

Information Theory · Computer Science 2015-03-13 O. Ozan Koyluoglu , Hesham El Gamal

We study the two-user multiple-input single-output (MISO) Gaussian interference channel where the transmitters have perfect channel state information and employ single-stream beamforming. The receivers are capable of performing successive…

Information Theory · Computer Science 2015-06-11 Johannes Lindblom , Eleftherios Karipidis , Erik G. Larsson

A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…

Information Theory · Computer Science 2016-11-15 Zheng Wang , Jie Luo

We consider a peak-power-limited single-antenna block-stationary Gaussian fading channel where neither the transmitter nor the receiver knows the channel state information, but both know the channel statistics. This model subsumes most…

Information Theory · Computer Science 2016-11-17 Jun Chen , Venugopal V. Veeravalli

We consider the decoding of bit interleaved coded modulation (BICM) applied to both multiband and MIMO OFDM systems for typical scenarios where only a noisy (possibly very bad) estimate of the channel is provided by sending a limited number…

Networking and Internet Architecture · Computer Science 2007-08-13 Sajad Sadough , Pierre Duhamel