# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 56

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

Publication Year: 2011, Page(s): C2
| PDF (42 KB)
• ### Dispersion of the Gilbert-Elliott Channel

Publication Year: 2011, Page(s):1829 - 1848
Cited by:  Papers (53)
| | PDF (780 KB) | HTML

Channel dispersion plays a fundamental role in assessing the backoff from capacity due to finite blocklength. This paper analyzes the channel dispersion for a simple channel with memory: the Gilbert-Elliott communication model in which the crossover probability of a binary symmetric channel evolves as a binary symmetric Markov chain, with and without side information at the receiver about the chan... View full abstract»

• ### The Minimal Set of Ingleton Inequalities

Publication Year: 2011, Page(s):1849 - 1864
Cited by:  Papers (8)
| | PDF (330 KB) | HTML

The Ingleton inequalities are the inequality constraints known to be required of representable matroids. For a matroid of <i>n</i> elements, there are 16<i>n</i> Ingleton inequalities. In this paper, we show that many of these inequalities are redundant. We explicitly determine the unique minimal set of Ingleton inequalities, which number on the order of 6<i>n</i&g... View full abstract»

• ### On the Randomness of Independent Experiments

Publication Year: 2011, Page(s):1865 - 1871
Cited by:  Papers (17)
| | PDF (208 KB) | HTML

Smooth entropies characterize basic information-theoretic properties of random variables, such as the number of bits required to store them or the amount of uniform randomness that can be extracted from them (possibly with respect to side information). In this paper, explicit and almost tight bounds on the smooth entropies of n-fold product distributions, Pn, are derived. These bounds are expresse... View full abstract»

• ### Wireless Network Information Flow: A Deterministic Approach

Publication Year: 2011, Page(s):1872 - 1905
Cited by:  Papers (509)  |  Patents (2)
| | PDF (1604 KB) | HTML

In a wireless network with a single source and a single destination and an arbitrary number of relay nodes, what is the maximum rate of information flow achievable? We make progress on this long standing problem through a two-step approach. First, we propose a deterministic channel model which captures the key wireless properties of signal strength, broadcast and superposition. We obtain an exact ... View full abstract»

• ### A Note on Capacity Computation for the Discrete Multiple Access Channel

Publication Year: 2011, Page(s):1906 - 1910
| | PDF (770 KB) | HTML

This paper deals with computation of the capacity region of the discrete memoryless multiple-access channel (MAC), which is equivalent to solving a difficult nonconvex optimization problem. In the literature, it is claimed that for elementary MACs, i.e., MACs for which the size of output alphabet is greater or equal to the sizes of all input alphabets, the Karush-Kuhn-Tucker conditions provide a n... View full abstract»

• ### Fading Multiple Access Relay Channels: Achievable Rates and Opportunistic Scheduling

Publication Year: 2011, Page(s):1911 - 1931
Cited by:  Papers (10)
| | PDF (574 KB) | HTML

The problem of optimal resource allocation is studied for ergodic fading orthogonal multi-access relay channels (MARCs) in which the users (sources) communicate with a destination with the aid of a half-duplex relay that transmits and receives on orthogonal channels. Under the assumption that the instantaneous fading state information is available at all nodes, the maximum sum-rate and the optimal... View full abstract»

• ### Sum Capacity of a Class of Symmetric SIMO Gaussian Interference Channels Within${\cal O}(1)$

Publication Year: 2011, Page(s):1932 - 1958
Cited by:  Papers (18)
| | PDF (671 KB) | HTML

TheN+1 user, 1 ×Nsingle-input multiple-output (SIMO) Gaussian interference channel where each transmitter has a single antenna and each receiver hasNantennas is studied. The sum capacity withinO(1) is characterized for the symmetric case where all direct links have the same signal-to-noise ratio (SNR) and all undesired links have the same interference-to-noise ratio (IN... View full abstract»

• ### Performance Analysis of SSMA Communication Systems With Spreading Sequences of Markov Chains: Large Deviations Principle Versus the Central Limit Theorem

Publication Year: 2011, Page(s):1959 - 1967
Cited by:  Papers (4)
| | PDF (254 KB) | HTML

In this paper, we consider asynchronous spread spectrum multiple access (SSMA) communication systems with spreading sequences of Markov chains. We show that, given phase shifts and time delays, the empirical mean of the multiple access interference (MAI) for such systems satisfies the conditional large deviations principle (LDP) with the convex, good rate function. By refinement of the large devia... View full abstract»

• ### Generalized Sequential Slotted Amplify and Forward Strategy in Cooperative Communications

Publication Year: 2011, Page(s):1968 - 1974
Cited by:  Papers (1)
| | PDF (688 KB) | HTML

This paper proposes a generalized sequential slotted amplify and forward (GSSAF) strategy for single-antenna wireless cooperative networks. The diversity and multiplexing tradeoff (DMT) is analyzed. Applications to cooperative multiple relay channels, cooperative broadcast channels (CBC) and cooperative multiple access channels are considered and the DMT upper bound is proven to be achievable for ... View full abstract»

• ### Bounds on Secrecy Capacity Over Correlated Ergodic Fading Channels at High SNR

Publication Year: 2011, Page(s):1975 - 1983
Cited by:  Papers (54)
| | PDF (634 KB) | HTML

We investigate the secrecy capacity of an ergodic fading wiretap channel when the main and eavesdropper channels are correlated. Assuming that the transmitter knows the full channel state information (CSI) (i.e., the channel gains from the transmitter to the legitimate receiver and eavesdropper), we quantify the loss of the secrecy capacity due to the correlation and investigate the asymptotic beh... View full abstract»

• ### Living at the Edge: A Large Deviations Approach to the Outage MIMO Capacity

Publication Year: 2011, Page(s):1984 - 2007
Cited by:  Papers (26)
| | PDF (2969 KB) | HTML

A large deviations approach is introduced, which calculates the probability density and outage probability of the multiple-input multiple-output (MIMO) mutual information, and is valid for large antenna numbersN. In contrast to previous asymptotic methods that only focused on the distribution close to its most probable value, this methodology obtains the full distribution, including its non... View full abstract»

• ### Performance Analysis of ZF and MMSE Equalizers for MIMO Systems: An In-Depth Study of the High SNR Regime

Publication Year: 2011, Page(s):2008 - 2026
Cited by:  Papers (169)
| | PDF (912 KB) | HTML

This paper presents an in-depth analysis of the zero forcing (ZF) and minimum mean squared error (MMSE) equalizers applied to wireless multiinput multioutput (MIMO) systems with no fewer receive than transmit antennas. In spite of much prior work on this subject, we reveal several new and surprising analytical results in terms of output signal-to-noise ratio (SNR), uncoded error and outage probabi... View full abstract»

• ### Diversity-Multiplexing Tradeoff of Double Scattering MIMO Channels

Publication Year: 2011, Page(s):2027 - 2034
Cited by:  Papers (18)
| | PDF (260 KB) | HTML

It is well known that the presence of double scattering degrades the performance of a MIMO channel, in terms of both the multiplexing gain and the diversity gain. In this paper, a closed-form expression of the diversity-multiplexing tradeoff (DMT) of double scattering MIMO channels is obtained. It is shown that, for a channel withnTtransmit antennas,nRreceive an... View full abstract»

• ### Information Rates for Multiantenna Systems With Unknown Fading

Publication Year: 2011, Page(s):2035 - 2049
| | PDF (331 KB) | HTML

This paper presents analytical upper and lower bounds on the information rate of a multiuser Rayleigh fading channel with no channel state information (CSI) at the transmitters or the receivers. These bounds are shown to converge whenever an individual user's data rate is small compared with the bandwidth, e.g., when users can employ CDMA. The amount of spreading required for a given degree of con... View full abstract»

• ### Asymptotic Capacity and Optimal Precoding in MIMO Multi-Hop Relay Networks

Publication Year: 2011, Page(s):2050 - 2069
Cited by:  Papers (42)
| | PDF (762 KB) | HTML

A multihop relaying system is analyzed where data sent by a multi-antenna source is relayed by successive multi-antenna relays until it reaches a multi-antenna destination. Assuming correlated fading at each hop, each relay receives a faded version of the signal from the previous level, performs linear precoding and retransmits it to the next level. Using free probability theory and assuming that ... View full abstract»

• ### Asymptotic Analysis of Amplify and Forward Relaying in a Parallel MIMO Relay Network

Publication Year: 2011, Page(s):2070 - 2082
Cited by:  Papers (16)
| | PDF (645 KB) | HTML

This paper studies the setup of a parallel MIMO relay network in which K relays, each equipped with N antennas, assist in transmitting data between a source and a destination, each equipped with M antennas (M ≤ N), in the half-duplex mode. It is assumed that there is no direct source-destination link and the communication is performed in two hops. An amplify-and-forward relaying scheme called Incr... View full abstract»

• ### The Secrecy Capacity Region of the Gaussian MIMO Multi-Receiver Wiretap Channel

Publication Year: 2011, Page(s):2083 - 2114
Cited by:  Papers (122)
| | PDF (553 KB) | HTML

In this paper, we consider the Gaussian multiple-input multiple-output (MIMO) multi-receiver wiretap channel in which a transmitter wants to have confidential communication with an arbitrary number of users in the presence of an external eavesdropper. We derive the secrecy capacity region of this channel for the most general case. We first show that even for the single-input single-output (SISO) c... View full abstract»

• ### Randomized Resource Allocation in Decentralized Wireless Networks

Publication Year: 2011, Page(s):2115 - 2142
Cited by:  Papers (5)
| | PDF (1176 KB) | HTML

In this paper, we consider a decentralized wireless communication network with a fixed numberuof frequency subbands to be shared amongNtransmitter-receiver pairs. It is assumed that the number of active users is a realization of a random variable with a given probability mass function. Moreover, users are unaware of each other's codebooks and hence, no multiuser detection is possible... View full abstract»

• ### Concavity of the Feasible Signal-to-Noise Ratio Region in Power Control Problems

Publication Year: 2011, Page(s):2143 - 2150
Cited by:  Papers (2)
| | PDF (1075 KB) | HTML

Signal-to-noise (SNR) ratio is commonly regarded as a reliable performance measure for wireless communication systems. Knowledge of fundamental properties of the feasible SNR region can facilitate the performance optimization of multi-user wireless systems. This paper examines the concavity of the feasible SNR region. In particular, it is shown that for systems with only three users, the feasible ... View full abstract»

• ### Many-Sources Large Deviations for Max-Weight Scheduling

Publication Year: 2011, Page(s):2151 - 2168
Cited by:  Papers (1)
| | PDF (1216 KB) | HTML

In this paper, a many-sources large deviations principle (LDP) for the transient workload of a multiqueue single-server system is established where the service rates are chosen from a compact, convex, and coordinate-convex rate region and where the service discipline is the max-weight policy. Under the assumption that the arrival processes satisfy a many-sources LDP, this is accomplished by employ... View full abstract»

• ### Exchange of Limits: Why Iterative Decoding Works

Publication Year: 2011, Page(s):2169 - 2187
Cited by:  Papers (5)
| | PDF (456 KB) | HTML

We consider communication over binary-input memoryless output-symmetric channels using low-density parity-check codes and message-passing decoding. The asymptotic (in the length) performance of such a combination for a fixed number of iterations is given by density evolution. Letting the number of iterations tend to infinity we get the density evolution (DE) threshold, the largest channel paramete... View full abstract»

• ### Graph-Based Decoding in the Presence of ISI

Publication Year: 2011, Page(s):2188 - 2202
Cited by:  Papers (13)
| | PDF (399 KB) | HTML

We propose a new graph representation for ISI channels that can be used for combined equalization and decoding by linear programming (LP) or iterative message-passing (IMP) decoding algorithms. We derive this graph representation by linearizing the ML detection metric, which transforms the equalization problem into a classical decoding problem. We observe that the performance of LP and IMP decodin... View full abstract»

• ### Belief Propagation and LP Relaxation for Weighted Matching in General Graphs

Publication Year: 2011, Page(s):2203 - 2212
Cited by:  Papers (17)
| | PDF (228 KB) | HTML

Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper, we analyze the performance of the max-product form of belief propagation for the weighted matching problem on general graphs. We show that the performance of max-product is exactly characterized by the natural linear programming (LP... 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
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu