# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 51

Publication Year: 2010, Page(s):C1 - C4
| |PDF (50 KB)
• ### IEEE Transactions on Information Theory publication information

Publication Year: 2010, Page(s): C2
| |PDF (42 KB)
• ### On Information Divergence Measures and a Unified Typicality

Publication Year: 2010, Page(s):5893 - 5905
Cited by:  Papers (9)
| |PDF (285 KB) | HTML

Strong typicality, which is more powerful for theorem proving than weak typicality, can be applied to finite alphabets only, while weak typicality can be applied to countable alphabets. In this paper, the relation between typicality and information divergence measures is discussed. The new definition of information divergence measure in this paper leads to the definition of a unified typicality fo... View full abstract»

• ### The Interplay Between Entropy and Variational Distance

Publication Year: 2010, Page(s):5906 - 5929
Cited by:  Papers (24)
| |PDF (497 KB) | HTML

The relation between the Shannon entropy and variational distance, two fundamental and frequently-used quantities in information theory, is studied in this paper by means of certain bounds on the entropy difference between two probability distributions in terms of the variational distance between them and their alphabet sizes. We also show how to find the distribution achieving the minimum (or max... View full abstract»

• ### On the Interplay Between Conditional Entropy and Error Probability

Publication Year: 2010, Page(s):5930 - 5942
Cited by:  Papers (36)
| |PDF (335 KB) | HTML

Fano's inequality relates the error probability of guessing a finitely-valued random variable X given another random variable Y and the conditional entropy of X given Y. It is not necessarily tight when the marginal distribution of X is fixed. This paper gives a tight upper bound on the conditional entropy of X given Y in terms of the error probabil... View full abstract»

• ### Bounds for General Transmission Systems

Publication Year: 2010, Page(s):5943 - 5944
| |PDF (75 KB) | HTML

We show that the codebook of every general transmission system can also be regarded as a classical code in a natural way. Consequently, using the Hamming metric, bounds on the cardinality of the codebooks of transmission systems can be obtained directly from classical coding theory. View full abstract»

• ### On Multipath Fading Channels at High SNR

Publication Year: 2010, Page(s):5945 - 5957
Cited by:  Papers (10)
| |PDF (274 KB) | HTML

A noncoherent multipath fading channel is considered, where neither the transmitter nor the receiver is cognizant of the realization of the path gains, but both are cognizant of their statistics. It is shown that if the delay spread is large in the sense that the variances of the path gains decay exponentially or slower, then capacity is bounded in the signal-to-noise ratio (SNR). For such channel... View full abstract»

• ### Capacity Theorems for Discrete, Finite-State Broadcast Channels With Feedback and Unidirectional Receiver Cooperation

Publication Year: 2010, Page(s):5958 - 5983
Cited by:  Papers (8)
| |PDF (681 KB) | HTML

In this paper, we consider the discrete, time-varying broadcast channel (BC) with memory under the assumption that the channel states belong to a set of finite cardinality. We study the achievable rates in several scenarios of feedback and full unidirectional receiver cooperation. In particular, we focus on two scenarios: the first scenario is the general finite-state broadcast channel (FSBC) wher... View full abstract»

• ### Interference Channels With Correlated Receiver Side Information

Publication Year: 2010, Page(s):5984 - 5998
Cited by:  Papers (7)  |  Patents (1)
| |PDF (382 KB) | HTML

The problem of joint source-channel coding in transmitting independent sources over interference channels with correlated receiver side information is studied. When each receiver has side information correlated with its own desired source, it is shown that source-channel separation is optimal. When each receiver has side information correlated with the interfering source, sufficient conditions for... View full abstract»

• ### Linear Universal Decoding for Compound Channels

Publication Year: 2010, Page(s):5999 - 6013
Cited by:  Papers (10)
| |PDF (327 KB) | HTML

Over discrete memoryless channels (DMC), linear decoders (maximizing additive metrics) afford several nice properties. In particular, if suitable encoders are employed, the use of decoding algorithms with manageable complexities is permitted. For a compound DMC, decoders that perform well without the channel's knowledge are required in order to achieve capacity. Several such decoders have been stu... View full abstract»

• ### New Hybrid Digital/Analog Schemes for Transmission of a Gaussian Source Over a Gaussian Channel

Publication Year: 2010, Page(s):6014 - 6019
Cited by:  Papers (19)
| |PDF (184 KB) | HTML

Two new schemes are proposed for transmitting a Gaussian source over a Gaussian channel. These schemes directly generalize previous results of Bross and Puri A scaled version of either the source itself or the quantization error is superimposed on the digital information, and thus serves as effective channel state information (CSI) unknown to the receiver. It is shown that for any power allocation... View full abstract»

• ### Information Theoretic Bounds for Distributed Computation Over Networks of Point-to-Point Channels

Publication Year: 2010, Page(s):6020 - 6039
Cited by:  Papers (19)
| |PDF (365 KB) | HTML

A network of nodes communicate via point-to-point memoryless independent noisy channels. Each node has some real-valued initial measurement or message. The goal of each of the nodes is to acquire an estimate of a given function of all the initial measurements in the network. As the main contribution of this paper, a lower bound on computation time is derived. This bound must be satisfied by any al... View full abstract»

• ### Degrees of Freedom of the $K$ User $M times N$ MIMO Interference Channel

Publication Year: 2010, Page(s):6040 - 6057
Cited by:  Papers (268)
| |PDF (487 KB) | HTML

We provide inner bound and outer bound for the total number of degrees of freedom of the K user multiple-input multiple-output (MIMO) Gaussian interference channel with M antennas at each transmitter and N antennas at each receiver if the channel coefficients are time-varying and drawn from a continuous distribution. The bounds are tight when the ratio [(max(M,N)... View full abstract»

• ### Wideband Fading Channels With Feedback

Publication Year: 2010, Page(s):6058 - 6065
Cited by:  Papers (30)
| |PDF (260 KB) | HTML

The Rayleigh flat fading channel at low SNR is considered. With full channel state information (CSI) at the transmitter and receiver, its capacity is shown to be essentially SNR log(1SNR) nats/symbol, as SNR goes to zero. In fact, this rate can be achieved with a just one bit of CSI at the transmitter (per fading realization) and with no receiver CSI. The capacity for the case of noisy transmitter... View full abstract»

• ### Capacity Bounds for Wireless Optical Intensity Channels With Gaussian Noise

Publication Year: 2010, Page(s):6066 - 6077
Cited by:  Papers (48)
| |PDF (721 KB) | HTML

Lower and upper bounds on the capacity of wireless optical intensity pulse amplitude modulation channels under nonnegativity and average optical power constraints are derived. A lower bound is derived based on source entropy maximization over a family of discrete nonuniform distributions with equally spaced mass points. A closed form for the maxentropic discrete input distribution is provided. Com... View full abstract»

• ### Diversity-Multiplexing Tradeoff Analysis for OFDM Systems With Subcarrier Grouping, Linear Precoding, and Linear Detection

Publication Year: 2010, Page(s):6078 - 6096
Cited by:  Papers (6)
| |PDF (1019 KB) | HTML

We consider the use of linear constellation precoding and linear detection in a multicarrier OFDM system with multiple receive antennas to obtain improved performance over multipath fading channels at a low complexity. We split the full set of subcarriers into smaller groups and spread the data symbols assigned to each group via precoding matrices. We adopt the diversity-multiplexing tradeoff (DMT... View full abstract»

• ### Outage Behavior of Slow Fading Channels With Power Control Using Partial and Erroneous CSIT

Publication Year: 2010, Page(s):6097 - 6102
Cited by:  Papers (9)
| |PDF (181 KB) | HTML

This work investigates high-SNR outage behavior of slow fading channels with quantized feedback and partial power control, when feedback indices are error-prone. We propose a quantizer structure with continuous Voronoi regions and derive its optimality conditions using probability analysis. Our design involves construction of a novel bit-mapping scheme. The optimized power control codebook resembl... View full abstract»

• ### Optimization of Training and Feedback Overhead for Beamforming Over Block Fading Channels

Publication Year: 2010, Page(s):6103 - 6115
Cited by:  Papers (34)
| |PDF (794 KB) | HTML

We examine the capacity of beamforming over a single-user, multiantenna link taking into account the overhead due to channel estimation and limited feedback of channel state information. Multi-input-single-output (MISO) and multi-input-multi-output (MIMO) channels are considered subject to block Rayleigh fading. Each coherence block contains L symbols, and is spanned by T training symbols, B feedb... View full abstract»

• ### Limited-Rate Channel State Feedback for Multicarrier Block Fading Channels

Publication Year: 2010, Page(s):6116 - 6132
Cited by:  Papers (8)
| |PDF (986 KB) | HTML

The capacity of a fading channel can be substantially increased by feeding back channel state information from the receiver to the transmitter. If the feedback rate is limited, what state information to feed back and how to encode it are important questions. This paper studies power loading in a multicarrier system using no more than one bit of feedback per subchannel. The subchannels can be corre... View full abstract»

• ### A Random Search Framework for Convergence Analysis of Distributed Beamforming With Feedback

Publication Year: 2010, Page(s):6133 - 6141
Cited by:  Papers (19)
| |PDF (435 KB) | HTML

The focus of this work is on the analysis of transmit beamforming schemes with a low-rate feedback link in wireless sensor/relay networks, where nodes in the network need to implement beamforming in a distributed manner. Specifically, the problem of distributed phase alignment is considered, where neither the transmitters nor the receiver has perfect channel state information, but there is a low-r... View full abstract»

• ### Multiple Multicasts With the Help of a Relay

Publication Year: 2010, Page(s):6142 - 6158
Cited by:  Papers (21)
| |PDF (415 KB) | HTML

The problem of simultaneous multicasting of multiple messages with the help of a relay terminal is considered. In particular, a model is studied in which a relay station simultaneously assists two transmitters in multicasting their independent messages to two receivers. The relay may also have an independent message of its own to multicast. As a first step to address this general model, referred t... View full abstract»

• ### Buffer Asymptotics for Coding Over Networks

Publication Year: 2010, Page(s):6159 - 6181
Cited by:  Papers (2)  |  Patents (1)
| |PDF (645 KB) | HTML

Traditionally, network buffer resources have been used at routers to queue transient packets to prevent packet drops. In contrast, we propose a scheme for large multihop networks where intermediate routers have no buffers for queueing transient packets. In the proposed scheme, network storage resources (memory) are used only at source and destination nodes to encode/decode packets using random lin... View full abstract»

• ### Distributed Random Access Algorithm: Scheduling and Congestion Control

Publication Year: 2010, Page(s):6182 - 6207
Cited by:  Papers (55)
| |PDF (528 KB) | HTML

This paper provides proofs of the rate stability, Harris recurrence, and ε-optimality of carrier sense multiple access (CSMA) algorithms where the random access (or backoff) parameter of each node is adjusted dynamically. These algorithms require only local information and they are easy to implement. The setup is a network of wireless nodes with a fixed conflict graph that identifies pairs ... View full abstract»

• ### Location-Aided Fast Distributed Consensus in Wireless Networks

Publication Year: 2010, Page(s):6208 - 6227
Cited by:  Papers (18)
| |PDF (1069 KB) | HTML

Existing works on distributed consensus explore linear iterations based on reversible Markov chains, which contribute to the slow convergence of the algorithms. It has been observed that by overcoming the diffusive behavior of reversible chains, certain nonreversible chains lifted from reversible ones mix substantially faster than the original chains. In this paper, the idea of Markov chain liftin... View full abstract»

• ### GADIA: A Greedy Asynchronous Distributed Interference Avoidance Algorithm

Publication Year: 2010, Page(s):6228 - 6252
Cited by:  Papers (42)
| |PDF (606 KB) | HTML

In this paper, the problem of distributed dynamic frequency allocation is considered for a canonical communication network, which spans several networks such as cognitive radio networks and digital subscriber lines (DSLs). A greedy asynchronous distributed interference avoidance (GADIA) algorithm for horizontal spectrum sharing has been proposed that achieves performance close to that of a central... View full abstract»

## Aims & Scope

IEEE Transactions on Information Theory publishes papers concerned with the transmission, processing, and utilization of information.

Full Aims & Scope

## Meet Our Editors

Editor-in-Chief
Prakash Narayan

Department of Electrical and Computer Engineering