# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 71

Publication Year: 2011, Page(s):C1 - 3170
| |PDF (55 KB)
• ### IEEE Transactions on Information Theory publication information

Publication Year: 2011, Page(s): C2
| |PDF (153 KB)
• ### Operational Duality Between Lossy Compression and Channel Coding

Publication Year: 2011, Page(s):3171 - 3179
Cited by:  Papers (10)
| |PDF (278 KB) | HTML

We explore the duality between lossy compression and channel coding in the operational sense: whether a capacity-achieving encoder-decoder sequence achieves the rate-distortion function of the dual problem when the channel decoder [encoder] is the source compressor [decompressor, resp.], and vice versa. We show that, if used as a lossy compressor, the maximum-likelihood channel decoder of a random... View full abstract»

• ### Analog Matching of Colored Sources to Colored Channels

Publication Year: 2011, Page(s):3180 - 3195
Cited by:  Papers (12)
| |PDF (493 KB) | HTML

Analog (uncoded) transmission provides a simple and robust scheme for communicating a Gaussian source over a Gaussian channel under the mean-squared-error (MSE) distortion measure. Unfortunately, its performance is usually inferior to the all-digital, separation-based source-channel coding solution, which requires exact knowledge of the channel at the encoder. The loss comes from the fact that exc... View full abstract»

• ### Rate–Distortion Function via Minimum Mean Square Error Estimation

Publication Year: 2011, Page(s):3196 - 3206
Cited by:  Papers (1)
| |PDF (270 KB) | HTML

We derive a simple general parametric representation of the rate-distortion function of a memoryless source, where both the rate and the distortion are given by integrals whose integrands include the minimum mean square error (MMSE) of the distortion Δ = d(X, Y) based on the source symbol X, with respect to a certain joint distribution of these two random variabl... View full abstract»

• ### Probability Estimation in the Rare-Events Regime

Publication Year: 2011, Page(s):3207 - 3229
Cited by:  Papers (14)
| |PDF (412 KB) | HTML

We address the problem of estimating the probability of an observed string that is drawn i.i.d. from an unknown distribution. Motivated by models of natural language, we consider the regime in which the length of the observed string and the size of the underlying alphabet are comparably large. In this regime, the maximum likelihood distribution tends to overestimate the probability of the observed... View full abstract»

• ### On Pairs of $f$ -Divergences and Their Joint Range

Publication Year: 2011, Page(s):3230 - 3235
Cited by:  Papers (8)
| |PDF (325 KB) | HTML

We compare two f-divergences and prove that their joint range is the convex hull of the joint range for distributions supported on only two points. The proofs use various methods from topology and convex analysis. View full abstract»

• ### Finding the Maximizers of the Information Divergence From an Exponential Family

Publication Year: 2011, Page(s):3236 - 3247
Cited by:  Papers (5)
| |PDF (291 KB) | HTML

This paper investigates maximizers of the information divergence from an exponential family ε. It is shown that the rI -projection of a maximizer P to ε is a convex combination of P and a probability measure P- with disjoint support and the same value of the sufficient statistics A. This observation can be used to transform the original problem of maximizing D(·∥... View full abstract»

• ### Interpretations of Directed Information in Portfolio Theory, Data Compression, and Hypothesis Testing

Publication Year: 2011, Page(s):3248 - 3259
Cited by:  Papers (45)
| |PDF (281 KB) | HTML

We investigate the role of directed information in portfolio theory, data compression, and statistics with causality constraints. In particular, we show that directed information is an upper bound on the increment in growth rates of optimal portfolios in a stock market due to causal side information. This upper bound is tight for gambling in a horse race, which is an extreme case of stock markets.... View full abstract»

• ### The Discrete-Time Poisson Channel at Low Input Powers

Publication Year: 2011, Page(s):3260 - 3272
Cited by:  Papers (20)
| |PDF (292 KB) | HTML

The asymptotic capacity at low input powers of an average-power limited or an average- and peak-power limited discrete-time Poisson channel is considered. For a Poisson channel whose dark current is zero or decays to zero linearly with its average input power ε, capacity scales like ε log 1/ε for small ε. For a Poisson channel whose dark curr... View full abstract»

• ### Latent Capacity Region: A Case Study on Symmetric Broadcast With Common Messages

Publication Year: 2011, Page(s):3273 - 3285
Cited by:  Papers (11)
| |PDF (3969 KB) | HTML

We consider the problem of broadcast with common messages, and focus on the case that the common message rate RA, i.e., the rate of the message intended for all the receivers in the set A, is the same for all the set A of the same cardinality. Instead of attempting to characterize the capacity region of general broadcast channels, we only consider the structure of the capacity... View full abstract»

• ### On the Degrees of Freedom of Finite State Compound Wireless Networks

Publication Year: 2011, Page(s):3286 - 3308
Cited by:  Papers (38)
| |PDF (510 KB) | HTML

We explore the degrees of freedom (DoF) of three classes of finite state compound wireless networks in this paper. First, we study the multiple-input single-output (MISO) finite state compound broadcast channel (BC) with arbitrary number of users and antennas at the transmitter. In prior work, Weingarten have found inner and outer bounds on the DoF with 2 users. The bounds have a different charact... View full abstract»

• ### A Distributed Numerical Approach to Interference Alignment and Applications to Wireless Interference Networks

Publication Year: 2011, Page(s):3309 - 3322
Cited by:  Papers (516)
| |PDF (624 KB) | HTML

Recent results establish the optimality of interference alignment to approach the Shannon capacity of interference networks at high SNR. However, the extent to which interference can be aligned over a finite number of signalling dimensions remains unknown. Another important concern for interference alignment schemes is the requirement of global channel knowledge. In this work, we provide examples ... View full abstract»

• ### Interference Alignment for Secrecy

Publication Year: 2011, Page(s):3323 - 3332
Cited by:  Papers (95)
| |PDF (236 KB) | HTML

This paper studies the frequency/time selective K-user Gaussian interference channel with secrecy constraints. Two distinct models, namely the interference channel with confidential messages and the interference channel with an external eavesdropper, are analyzed. The key difference between the two models is the lack of channel state information (CSI) of the external eavesdropper. Using int... View full abstract»

• ### Communication by Energy Modulation: The Additive Exponential Noise Channel

Publication Year: 2011, Page(s):3333 - 3351
Cited by:  Papers (7)
| |PDF (618 KB) | HTML

Communication across an additive exponential noise (AEN) channel is studied. The AEN channel is derived from a continuous-time Gaussian channel by assuming decoherence between the signal and noise components. Decoherence renders impossible the use of the complex amplitude and information is transmitted by modulating the signal energy. The AEN channel is shown to perform closely - in terms of chann... View full abstract»

• ### Bits About the Channel: Multiround Protocols for Two-Way Fading Channels

Publication Year: 2011, Page(s):3352 - 3370
Cited by:  Papers (9)
| |PDF (427 KB) | HTML

Most communication systems use some form of feedback, often related to channel state information. In this paper, we study diversity multiplexing tradeoff for both frequency division duplex (FDD) and time division duplex (TDD) systems, when both receiver and transmitter knowledge about the channel is noisy and potentially mismatched. For FDD systems, we first extend the achievable tradeoff region f... View full abstract»

• ### On Optimal Power Control for Delay-Constrained Communication Over Fading Channels

Publication Year: 2011, Page(s):3371 - 3389
Cited by:  Papers (7)
| |PDF (1396 KB) | HTML

In this paper, the problem of optimal power control for delay-constrained communication over fading channels is studied. The objective is to find a power control law that optimizes the link layer performance, specifically, minimizes delay bound violation probability (or equivalently, the packet drop probability), subject to constraints on average power, arrival rate and delay bound. The transmissi... View full abstract»

• ### A Generalization of Nash Bargaining and Proportional Fairness to Log-Convex Utility Sets With Power Constraints

Publication Year: 2011, Page(s):3390 - 3404
Cited by:  Papers (12)
| |PDF (362 KB) | HTML

Many solutions and concepts in resource allocation and game theory rely on the assumption of a convex utility set. In this paper, we show that the less restrictive assumption of a logarithmic “hidden” convexity is sometimes sufficient. We consider the problems of Nash bargaining and proportional fairness, which are closely related. We extend the Nash bargaining framework to a broader... View full abstract»

• ### Theoretical Analysis on Bit Error Rate of VSG CDMA in Nakagami Fading

Publication Year: 2011, Page(s):3405 - 3410
Cited by:  Papers (4)
| |PDF (268 KB) | HTML

In this paper, an efficient analytical technique for bit error rate (BER) of variable spreading gain code division multiple access (VSG CDMA) in Nakagami fading is introduced. Based on the accurate improve Gaussian approximation (IGA) technique, a new BER expression is derived in a closed form. Validated by Monte Carlo simulation, the proposed expression is used to accurately investigate the impac... View full abstract»

• ### On the Symbol Error Probability of Regular Polytopes

Publication Year: 2011, Page(s):3411 - 3415
Cited by:  Papers (6)
| |PDF (387 KB) | HTML

An exact expression is derived for the symbol error probability when the vertices of the four-dimensional 24-cell are used for digital transmission in Gaussian noise. Corresponding expressions for other regular convex polytopes are summarized. Numerically stable versions of these error probabilities are also obtained. View full abstract»

• ### Large-System Analysis of Multiuser Detection With an Unknown Number of Users: A High-SNR Approach

Publication Year: 2011, Page(s):3416 - 3428
Cited by:  Papers (3)  |  Patents (1)
| |PDF (436 KB) | HTML

We analyze multiuser detection under the assumption that the number of users accessing the channel is unknown by the receiver. In this environment, users' activity must be estimated along with any other parameters such as data, power, and location. Our main goal is to determine the performance loss caused by the need for estimating the identities of active users, which are not known a priori. To p... View full abstract»

• ### Coset Codes for Compound Multiple Access Channels With Common Information

Publication Year: 2011, Page(s):3429 - 3448
| |PDF (822 KB) | HTML

Code construction is considered for arbitrary discrete memoryless compound multiple access channels (MACs) with common information. This class of channels includes MACs with/without common messages or with partially cooperating encoders. A construction method of code ensembles based on coset codes is proposed for these channels. Assuming joint maximum likelihood decoding, the performance of the pr... View full abstract»

• ### Common Rate Support in Multi-Antenna Downlink Channels Using Semi-Orthogonal User Selection

Publication Year: 2011, Page(s):3449 - 3461
Cited by:  Papers (4)
| |PDF (922 KB) | HTML

We consider a flat fading multiantenna downlink system with a large number of users where the objective is to deliver equal rates to nonoutage users with a low complexity. We show that in the limit of a large number of users, a zero-forcing beamforming strategy combined with a low complexity user grouping algorithm based on a semi-orthogonal user selection achieves asymptotically optimal performan... View full abstract»

• ### Slepian–Wolf Coding Over Cooperative Relay Networks

Publication Year: 2011, Page(s):3462 - 3482
Cited by:  Papers (33)
| |PDF (6320 KB) | HTML

This paper deals with the problem of multicasting a set of discrete memoryless correlated sources (DMCS) over a cooperative relay network. Necessary conditions with cut-set interpretation are presented. A Joint source-Wyner-Ziv encoding/sliding window decoding scheme is proposed, in which decoding at each receiver is done with respect to an ordered partition of other nodes. For each ordered partit... View full abstract»

• ### Iterative Soft Joint Detection Algorithm for OFDM Systems

Publication Year: 2011, Page(s):3483 - 3492
Cited by:  Papers (1)
| |PDF (292 KB) | HTML

In this paper, a novel iterative soft joint detection algorithm for orthogonal frequency division multiplexing (OFDM) systems is proposed. Without the need of channel estimation, it directly generates the a posteriori probabilities (APPs) of data symbols by very efficient computation. With the increase of iterations, the proposed algorithm gradually achieves near-optimal performance, while its com... 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