IEEE Transactions on Information Theory

Filter Results

Displaying Results 1 - 25 of 42

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

Publication Year: 2011, Page(s): C2
| |PDF (140 KB)
• Two-Dimensional Maximum-Likelihood Sequence Detection Is NP Hard

Publication Year: 2011, Page(s):7661 - 7670
Cited by:  Papers (7)
| |PDF (273 KB) | HTML

A 2-D version of the classical maximum-likelihood sequence detection (MLSD) problem is considered for a binary antipodal signal that is corrupted by linear intersymbol interference (ISI) and then passed through a memoryless channel. For 1-D signals and fixed ISI, this detection problem is well-known to be solved using the Viterbi algorithm in time complexity that is linear in the sequence length. ... View full abstract»

• Time and Energy Complexity of Function Computation Over Networks

Publication Year: 2011, Page(s):7671 - 7684
Cited by:  Papers (12)
| |PDF (964 KB) | HTML

This paper considers the following network computation problem: n nodes are placed on a √n × √n grid, each node is connected to every other node within distance r(n) of itself, and it is assigned an arbitrary input bit. Nodes communicate with their neighbors and a designated sink node computes a function f of the input bits, where f is either... View full abstract»

• The Ergodic Capacity of Phase-Fading Interference Networks

Publication Year: 2011, Page(s):7685 - 7694
Cited by:  Papers (22)
| |PDF (285 KB) | HTML

We identify the role of equal strength interference links as bottlenecks on the ergodic sum capacity of a K user phase-fading interference network, i.e., an interference network where the fading process is restricted primarily to independent and uniform phase variations while the channel magnitudes are held fixed across time. It is shown that even though there are K(K-1) cross... View full abstract»

• Energy Efficiency of Decode-and-Forward for Wideband Wireless Multicasting

Publication Year: 2011, Page(s):7695 - 7713
Cited by:  Papers (2)
| |PDF (4072 KB) | HTML

In this paper, we study the minimum energy per bit required for communicating a message to all the destination nodes in a wireless network. The physical layer is modeled as an additive white Gaussian noise (AWGN) channel affected by circularly symmetric fading. The fading coefficients are known at neither transmitters nor receivers. We provide an information-theoretic lower bound on the energy req... View full abstract»

• Rate-Constrained Wireless Networks With Fading Channels: Interference-Limited and Noise-Limited Regimes

Publication Year: 2011, Page(s):7714 - 7732
Cited by:  Papers (4)
| |PDF (798 KB) | HTML

A network of n wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power P or remain silent. The objective is to maximize the number of active links such that each active link can transmit with a constant rate λ. In a Rayleigh fading environment, an upper bound is derived that shows the n... View full abstract»

• Nested Lattice Codes for Gaussian Relay Networks With Interference

Publication Year: 2011, Page(s):7733 - 7745
Cited by:  Papers (41)
| |PDF (499 KB) | HTML

In this paper, we consider a class of single-source multicast relay networks. We assume that all outgoing channels of a node in the network to its neighbors are orthogonal while the incoming signals from its neighbors can interfere with each other. We first focus on Gaussian relay networks with interference and find an achievable rate using a lattice coding scheme. We show that the achievable rate... View full abstract»

• Latency and Capacity Optimal Broadcasting in Wireless Multihop Networks With Arbitrary Number of Sources

Publication Year: 2011, Page(s):7746 - 7758
Cited by:  Papers (2)
| |PDF (713 KB) | HTML

This paper studies the fundamental properties of broadcasting in multihop wireless networks. Previous studies have shown that, as long as broadcast capacity is concerned, asymptotically optimal broadcasting is possible in wireless multihop networks under very general conditions. However, none of the existing work on broadcast capacity has considered latency in message delivery, which is simply ass... View full abstract»

• Network-Level Cooperation for a Multiple-Access Channel Via Dynamic Decode-and-Forward

Publication Year: 2011, Page(s):7759 - 7770
Cited by:  Papers (9)
| |PDF (912 KB) | HTML

In this paper, we investigate some cross-layer cooperative strategies for cognitive Time-Division Multiple-Access relay channels with bursty arrivals. The proposed schemes adopt an advanced physical (PHY) layer cooperation and an “intelligent” cognitive network-layer cooperation in order to improve the stable throughput region of the system. In contrast to previously reported work, w... View full abstract»

• Multi-Cell MIMO Downlink With Cell Cooperation and Fair Scheduling: A Large-System Limit Analysis

Publication Year: 2011, Page(s):7771 - 7786
Cited by:  Papers (45)  |  Patents (1)
| |PDF (927 KB) | HTML

We consider the downlink of a cellular network with multiple cells and multi-antenna base stations. Our model includes distance-dependent pathloss, arbitrary clusters of cooperating cells, and general “fairness” requirements. Beyond Monte Carlo simulation, no efficient computation method to evaluate the ergodic throughput of such systems has been presented, yet. Furthermore, for syst... View full abstract»

• Channel State Feedback Over the MIMO-MAC

Publication Year: 2011, Page(s):7787 - 7797
Cited by:  Papers (4)
| |PDF (472 KB) | HTML

In order to exploit the full multiplexing gain of multi-antenna multi-user downlink schemes, accurate channel state information at the transmitter (i.e., at the base station) is required. We consider the design of a closed-loop channel state information feedback scheme, where user terminals feed back their channel state information simultaneously to a multi-antenna base station. The underlying inf... View full abstract»

• Network Tomography Based on Additive Metrics

Publication Year: 2011, Page(s):7798 - 7809
Cited by:  Papers (12)
| |PDF (252 KB) | HTML

Network tomography studies the inference of network structure and dynamics based on indirect measurements when direct measurements are unavailable or difficult to collect. In this paper, we design and analyze routing tree topology and link performance inference algorithms for communication networks using tools from phylogenetic inference in evolutionary biology. We develop polynomial-time distance... View full abstract»

• Hardness of Low Delay Network Scheduling

Publication Year: 2011, Page(s):7810 - 7817
Cited by:  Papers (39)
| |PDF (183 KB) | HTML

We consider a communication network and study the problem of designing a high-throughput and low-delay scheduling policy that only requires a polynomial amount of computation at each time step. The well-known maximum weight scheduling policy, proposed by Tassiulas and Ephremides (1992), has favorable performance in terms of throughput and delay but, for general networks, it can be computationally ... View full abstract»

• Accuracy Guarantees for $ell_1$-Recovery

Publication Year: 2011, Page(s):7818 - 7839
Cited by:  Papers (7)
| |PDF (1418 KB) | HTML

We discuss two new methods of recovery of sparse signals from noisy observation based on ℓ1-minimization. While they are closely related to the well-known techniques such as Lasso and Dantzig Selector, these estimators come with efficiently verifiable guaranties of performance. By optimizing these bounds with respect to the method parameters we are able to construct the es... View full abstract»

• On the Error of Estimating the Sparsest Solution of Underdetermined Linear Systems

Publication Year: 2011, Page(s):7840 - 7855
Cited by:  Papers (4)
| |PDF (3849 KB) | HTML

Let A be an n × m matrix with m >; n, and suppose that the underdetermined linear system As = x admits a sparse solution S0 for which ||S0||0 <; 1/2 spark( A). Such a sparse solution is unique due to a well-known uniqueness theorem. Suppose now that we have somehow a solution ŝ as an estimation of s0, and suppose that ŝ is on... View full abstract»

• Unbiased Estimation of a Sparse Vector in White Gaussian Noise

Publication Year: 2011, Page(s):7856 - 7876
Cited by:  Papers (6)
| |PDF (6169 KB) | HTML

The problem studied in this paper is unbiased estimation of a sparse nonrandom vector corrupted by additive white Gaussian noise. It is shown that while there are infinitely many unbiased estimators for this problem, none of them has uniformly minimum variance. Therefore, the focus is placed on locally minimum variance unbiased (LMVU) estimators. Simple closed-form lower and upper bounds on the va... View full abstract»

• Limits on Support Recovery of Sparse Signals via Multiple-Access Communication Techniques

Publication Year: 2011, Page(s):7877 - 7892
Cited by:  Papers (13)
| |PDF (4066 KB) | HTML

In this paper, we consider the problem of exact support recovery of sparse signals via noisy linear measurements. The main focus is finding the sufficient and necessary condition on the number of measurements for support recovery to be reliable. By drawing an analogy between the problem of support recovery and the problem of channel coding over the Gaussian multiple-access channel (MAC), and explo... View full abstract»

• The Geometry of Generalized Binary Search

Publication Year: 2011, Page(s):7893 - 7906
Cited by:  Papers (16)  |  Patents (1)
| |PDF (381 KB) | HTML

This paper investigates the problem of determining a binary-valued function through a sequence of strategically selected queries. The focus is an algorithm called Generalized Binary Search (GBS). GBS is a well-known greedy algorithm for determining a binary-valued function through a sequence of strategically selected queries. At each step, a query is selected that most evenly splits the hypotheses... View full abstract»

• Online Learning of Noisy Data

Publication Year: 2011, Page(s):7907 - 7931
Cited by:  Papers (11)
| |PDF (594 KB) | HTML

We study online learning of linear and kernel-based predictors, when individual examples are corrupted by random noise, and both examples and noise type can be chosen adversarially and change over time. We begin with the setting where some auxiliary information on the noise distribution is provided, and we wish to learn predictors with respect to the squared loss. Depending on the auxiliary inform... View full abstract»

• Analyzing Random Network Coding With Differential Equations and Differential Inclusions

Publication Year: 2011, Page(s):7932 - 7949
Cited by:  Papers (4)
| |PDF (899 KB) | HTML

We develop a framework based on differential equations (DE) and differential inclusions (DI) for analyzing Random Network Coding (RNC) in an arbitrary wireless network. The DEDI framework serves as a powerful numerical and analytical tool to study RNC. For demonstration, we first build a system of DE's with this framework, under the fluid approximation, to model the means of the rank evolution pro... View full abstract»

• Low ML Decoding Complexity STBCs via Codes Over the Klein Group

Publication Year: 2011, Page(s):7950 - 7971
Cited by:  Papers (3)
| |PDF (7117 KB) | HTML

In this paper, we give a new framework for constructing low ML decoding complexity space-time block codes (STBCs) using codes over the Klein group K. Almost all known low ML decoding complexity STBCs can be obtained via this approach. New full-diversity STBCs with low ML decoding complexity and cubic shaping property are constructed, via codes over K, for number of transmit antennas ... View full abstract»

• Maximum Rate of Unitary-Weight, Single-Symbol Decodable STBCs

Publication Year: 2011, Page(s):7972 - 7981
Cited by:  Papers (2)
| |PDF (2630 KB) | HTML

It is well known that the space-time block codes (STBCs) from complex orthogonal designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD). The weight matrices of the square CODs are all unitary and obtainable from the unitary matrix representations of Clifford Algebras when the number of transmit antennas n is a power of 2. The rate of the square CODs for n = 2 View full abstract»

• Explicit Nonadaptive Combinatorial Group Testing Schemes

Publication Year: 2011, Page(s):7982 - 7989
Cited by:  Papers (13)
| |PDF (299 KB) | HTML

Group testing is a long studied problem in combinatorics: A small set of r ill people should be identified out of the whole (n people) by using only queries (tests) of the form “Does set X contain an ill human?” In this paper we provide an explicit construction of a testing scheme which is better (smaller) than any known explicit construction. This scheme has Θ(m... View full abstract»

• Information Sets From Defining Sets in Abelian Codes

Publication Year: 2011, Page(s):7990 - 7999
Cited by:  Papers (7)
| |PDF (260 KB) | HTML

We describe a technique to construct a set of check positions (and hence an information set) for every abelian code solely in terms of its defining set. This generalizes that given by Imai in in the case of binary TDC codes. 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