中文
相关论文

相关论文: Interference Channels with Common Information

200 篇论文

The two-user Multiple Access Channel (MAC) with cooperative encoders and Channel State Information (CSI) is considered where two different scenarios are investigated: A two-user MAC with common message (MACCM) and a two-user MAC with…

信息论 · 计算机科学 2013-02-17 Reza K. Farsani , Farokh Marvasti

Achievable rate regions and outer bounds are derived for three-user interference channels where the transmitters cooperate in a unidirectional manner via a noncausal message-sharing mechanism. The three-user channel facilitates different…

信息论 · 计算机科学 2016-11-17 K. G. Nagananda , Parthajit Mohapatra , Chandra R. Murthy , Shalinee Kishore

In this paper, we present a general formula for the capacity region of a general interference channel with two pairs of users. The formula shows that the capacity region is the union of a family of rectangles, where each rectangle is…

信息论 · 计算机科学 2013-10-08 Xiao Ma , Lei Lin , Chulong Liang , Xiujie Huang , Baoming Bai

We study channel resolvability for the discrete memoryless multiple-access channel with cribbing, i.e., the characterization of the amount of randomness required at the inputs to approximately produce a chosen i.i.d. output distribution…

信息论 · 计算机科学 2018-11-29 Noha Helal , Matthieu Bloch , Aria Nosratinia

The cognitive interference channel is an interference channel in which one transmitter is non-causally provided with the message of the other transmitter. This channel model has been extensively studied in the past years and capacity…

信息论 · 计算机科学 2010-03-24 Stefano Rini , Daniela Tuninetti , Natasha Devroye

An achievable rate region, based on lattice interference alignment, is derived for a class of time-invariant Gaussian interference channels with more than two users. The result is established via a new coding theorem for the two-user…

信息论 · 计算机科学 2011-06-21 Or Ordentlich , Uri Erez

We consider the problem of communicating over a channel for which no mathematical model is specified, and the achievable rates are determined as a function of the channel input and output sequences known a-posteriori, without assuming any…

信息论 · 计算机科学 2012-03-08 Yuval Lomnitz , Meir Feder

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…

信息论 · 计算机科学 2012-02-03 Lei Lin , Xiao Ma , Xiujie Huang , Baoming Bai

Coding for the causal cognitive radio channel, with the cognitive source subjected to a half-duplex constraint, is studied. A discrete memoryless channel model incorporating the half-duplex constraint is presented, and a new achievable rate…

信息论 · 计算机科学 2010-06-07 Debdeep Chatterjee , Tan F. Wong , Ozgur Oyman

An Interference Channel with Generalized Feedback (IFC-GF) is a model for a wireless network where several source-destination pairs compete for the same channel resources, and where the sources have the ability to sense the current channel…

信息论 · 计算机科学 2010-06-10 Echo Yang , Daniela Tuninetti

An achievable rate region is obtained for a primary multiple access network coexisting with a secondary link of one transmitter and a corresponding receiver. The rate region depicts the sum primary rate versus the secondary rate and is…

信息论 · 计算机科学 2015-03-18 John Tadrous , Mohammed Nafie

A single-letter achievable rate region is proposed for the two-receiver discrete memoryless broadcast channel with generalized feedback. The coding strategy involves block-Markov superposition coding, using Marton's coding scheme for the…

信息论 · 计算机科学 2014-02-10 Ramji Venkataramanan , S. Sandeep Pradhan

In this paper, we study the problem of secret communication over a multiple-access channel with a common message. Here, we assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second…

信息论 · 计算机科学 2016-07-13 Hassan Zivari-Fard , Bahareh Akhbari , Mahmoud Ahmadian-Attari , Mohammad Reza Aref

In distributed communication, each transmitter prepares an ensemble of channel codes. To encode a message, a transmitter chooses a channel code individually without sharing the coding choice with other transmitters or with the receiver.…

信息论 · 计算机科学 2018-05-08 Yanru Tang , Faeze Heydaryan , Jie Luo

We consider a basic joint communication and sensing setup comprising a transmitter, a receiver and a sensor. The transmitter sends a codeword to the receiver through a discrete memoryless channel, and the receiver is interested in decoding…

信息论 · 计算机科学 2024-12-09 Han Wu , Hamdi Joudeh

An inner bound to the capacity region of a class of deterministic interference channels with three user pairs is presented. The key idea is to simultaneously decode the combined interference signal and the intended message at each receiver.…

信息论 · 计算机科学 2015-03-13 Bernd Bandemer , Abbas El Gamal

For two-user interference channels, the capacity is known for the case where interference is stronger than the desired signal. Moreover, it is known that if the interference is above a certain level, it does not reduce the capacity at all.…

信息论 · 计算机科学 2012-06-21 Frederic Knabe , Aydin Sezgin

This paper considers the problem of cognitive radios with partial-message information. Here, an interference channel setting is considered where one transmitter (the "cognitive" one) knows the message of the other ("legitimate" user)…

信息论 · 计算机科学 2008-12-31 G. Chung , S. Sridharan , S. Vishwanath , C. S. Hwang

This work presents novel achievable schemes for the 2-user symmetric linear deterministic interference channel with limited-rate transmitter cooperation and perfect secrecy constraints at the receivers. The proposed achievable scheme…

信息论 · 计算机科学 2013-04-04 Parthajit Mohapatra , Chandra R. Murthy

The goal of this paper is to obtain a better knowledge of the achievable data rate over noncoherent Rician fading channel with time and frequency memory. We assume that the average-power as well as the peak-power of the input signal are…

信息论 · 计算机科学 2012-07-13 Jean-Michel Passerieux , Francois-Xavier Socheleau , Christophe Laot