Scheduled System Maintenance
IEEE Xplore is currently undergoing scheduled maintenance.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 41

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

Publication Year: 2007, Page(s): C2
| PDF (38 KB)
• ### Classification With Finite Memory Revisited

Publication Year: 2007, Page(s):4413 - 4421
Cited by:  Papers (3)
| | PDF (271 KB) | HTML

We consider the class of strong-mixing probability laws with positive transitions that are defined on doubly infinite sequences in a finite alphabet A. A device called the classifier (or discriminator) observes a training sequence whose probability law Q is unknown. The classifier's task is to consider a second probability law P and decide whether P = Q, or P and Q are sufficiently different accor... View full abstract»

• ### Sufficient Conditions for Convergence of the Sum–Product Algorithm

Publication Year: 2007, Page(s):4422 - 4437
Cited by:  Papers (75)
| | PDF (517 KB) | HTML

Novel conditions are derived that guarantee convergence of the sum-product algorithm (also known as loopy belief propagation or simply belief propagation (BP)) to a unique fixed point, irrespective of the initial messages, for parallel (synchronous) updates. The computational complexity of the conditions is polynomial in the number of variables. In contrast with previously existing conditions, our... View full abstract»

• ### Information conversion, effective samples, and parameter size

Publication Year: 2007, Page(s):4438 - 4456
Cited by:  Papers (5)
| | PDF (747 KB) | HTML

Consider the relative entropy between a posterior density for a parameter given a sample and a second posterior density for the same parameter, based on a different model and a different data set. Then the relative entropy can be minimized over the second sample to get a virtual sample that would make the second posterior as close as possible to the first in an informational sense. If the first po... View full abstract»

• ### Joint Source–Channel Coding Error Exponent for Discrete Communication Systems With Markovian Memory

Publication Year: 2007, Page(s):4457 - 4472
Cited by:  Papers (6)
| | PDF (681 KB) | HTML

We study the error exponent, EJ, for reliably transmitting a discrete stationary ergodic Markov (SEM) source Q over a discrete channel W with additive SEM noise via a joint source-channel (JSC) code. We first establish an upper bound for EJin terms of the Renyi entropy rates of the source and noise processes. We next investigate the analytical computation of EJby c... View full abstract»

• ### Sum Rate Characterization of Joint Multiple Cell-Site Processing

Publication Year: 2007, Page(s):4473 - 4497
Cited by:  Papers (184)
| | PDF (612 KB) | HTML

The sum-rate capacity of a cellular system model is analyzed, considering the uplink and downlink channels, while addressing both nonfading and flat-fading channels. The focus is on a simple Wyner-like multicell model, where the system cells are arranged on a circle, and the cell sites are located at the boundaries of the cells. For the uplink channel, analytical expressions of the sum-rate capaci... View full abstract»

• ### Capacity Results for Block-Stationary Gaussian Fading Channels With a Peak Power Constraint

Publication Year: 2007, Page(s):4498 - 4520
Cited by:  Papers (9)
| | PDF (520 KB) | HTML

A peak-power-limited single-antenna block-stationary Gaussian fading channel is studied, where neither the transmitter nor the receiver knows the channel state information, but both know the channel statistics. This model subsumes most previously studied Gaussian fading models. The asymptotic channel capacity in the high signal-to-noise ratio (SNR) regime is first computed, and it is shown that th... View full abstract»

• ### Coding Problems for Channels With Partial State Information at the Transmitter

Publication Year: 2007, Page(s):4521 - 4536
Cited by:  Papers (8)
| | PDF (346 KB) | HTML

Channel coding for single-user channels with rate- limited, coded, partial channel state information at the transmitter and full side information (SI) at the receiver is studied. In the first part of the current work, we consider joint source-channel state channel coding. In particular, we deal with lossy transmission of a source, over a cost-constrained state controlled channel where the receiver... View full abstract»

• ### Distance Bounds for an Ensemble of LDPC Convolutional Codes

Publication Year: 2007, Page(s):4537 - 4555
Cited by:  Papers (32)  |  Patents (4)
| | PDF (611 KB) | HTML

An ensemble of (J, K) -regular low-density parity-check (LDPC) convolutional codes is introduced and existence-type lower bounds on the minimum distance d<sub>L</sub>, of code segments of finite length L and on the free distance d<sub>free</sub> are derived. For sufficiently large constraint lengths v, the distances are shown to grow linearly with v and the ratio d<sub&g... View full abstract»

• ### A Computationally Efficient Multilevel Coding Scheme for ISI Channels

Publication Year: 2007, Page(s):4556 - 4566
Cited by:  Papers (5)
| | PDF (339 KB) | HTML

This paper proposes a multilevel coding scheme with linear mapping for intersymbol interference (ISI) channels and derives a low-complexity receiver structure that can achieve the ISI channel capacity. The transmitter superimposes many layers of independent binary antipodal streams to generate a quadrature amplitude modulation (QAM) or Gaussian-like channel input. The receiver performs multistage ... View full abstract»

• ### Communication Over MIMO Broadcast Channels Using Lattice-Basis Reduction

Publication Year: 2007, Page(s):4567 - 4582
Cited by:  Papers (62)  |  Patents (1)
| | PDF (853 KB) | HTML

A new viewpoint for adopting the lattice reduction in communication over multiple-input multiple-output (MIMO) broadcast channels is introduced. Lattice basis reduction helps us to reduce the average transmitted energy by modifying the region which includes the constellation points. The new viewpoint helps us to generalize the idea of lattice-reduction-aided (LRA) preceding for the case of unequal... View full abstract»

• ### A Graph-Based Framework for Transmission of Correlated Sources Over Multiple-Access Channels

Publication Year: 2007, Page(s):4583 - 4604
Cited by:  Papers (17)
| | PDF (808 KB) | HTML

In this paper, we consider a graph-based framework for transmission of correlated sources over multiple-access channels. It is well known that the separation approach is not optimal for this multiuser communication. Our objective in this work is to reintroduce modularity in this problem using a graph-based discrete interface and to minimize the performance loss as compared to the optimal joint sou... View full abstract»

• ### Gallager Bounds for Noncoherent Decoders in Fading Channels

Publication Year: 2007, Page(s):4605 - 4614
Cited by:  Papers (3)
| | PDF (318 KB) | HTML

Recently, Gallager's bounding techniques have been used to derive tight performance bounds for coded systems in fading channels. Most works in this field have thus far dealt with coherent decoding. This paper develops Gallager bounds for noncoherent systems in fading channels. Unlike coherent decoding, the exact error probability of a noncoherent decoder/detector conditioned on the fading coeffici... View full abstract»

• ### Performance Analysis of High Data Rate MIMO Systems in Frequency-Selective Fading Channels

Publication Year: 2007, Page(s):4615 - 4627
| | PDF (343 KB) | HTML

The performance of multicode direct-sequence spread-spectrum multiple-input multiple-output (MIMO) systems in the presence of frequency-selective fading is evaluated. We derive the asymptotic distribution of the multiple-antenna interference when the processing gain is sufficiently large. The probability of error is derived for the conventional RAKE receiver, and its performance is compared for va... View full abstract»

• ### High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm

Publication Year: 2007, Page(s):4628 - 4639
Cited by:  Papers (63)  |  Patents (12)
| | PDF (498 KB) | HTML

Random access is well motivated and has been widely applied when the network traffic is bursty and the expected throughput is not high. The main reason behind relatively low-throughput expectations is that collided packets are typically discarded. In this paper, we develop a novel protocol exploiting successive interference cancellation (SIC) in a tree algorithm (TA), where collided packets are re... View full abstract»

• ### Gossiping With Multiple Messages

Publication Year: 2007, Page(s):4640 - 4654
Cited by:  Papers (48)
| | PDF (353 KB) | HTML

This paper investigates the dissemination of multiple pieces of information in large networks where users contact each other in a random uncoordinated manner, and users upload one piece per unit time. The underlying motivation is the design and analysis of piece selection protocols for peer-to-peer networks which disseminate files by dividing them into pieces. We first investigate one-sided protoc... View full abstract»

• ### Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit

Publication Year: 2007, Page(s):4655 - 4666
Cited by:  Papers (4119)  |  Patents (39)
| | PDF (936 KB) | HTML

This paper demonstrates theoretically and empirically that a greedy algorithm called orthogonal matching pursuit (OMP) can reliably recover a signal with m nonzero entries in dimension d given O(m ln d) random linear measurements of that signal. This is a massive improvement over previous results, which require <i>O</i>(m<sup>2</sup>) measurements. The new results for OMP a... View full abstract»

• ### Analytic Properties and Covariance Functions for a New Class of Generalized Gibbs Random Fields

Publication Year: 2007, Page(s):4667 - 4679
Cited by:  Papers (29)
| | PDF (381 KB) | HTML

Spartan spatial random fields (SSRFs) are generalized Gibbs random fields, equipped with a coarse-graining kernel that acts as a low-pass filter for the fluctuations. SSRFs are defined by means of physically motivated spatial interactions and a small set of free parameters (interaction couplings). This paper focuses on the fluctuation-gradient-curvature (FGC) SSRF model, henceforth referred to as ... View full abstract»

• ### Noise Covariance Properties in Dual-Tree Wavelet Decompositions

Publication Year: 2007, Page(s):4680 - 4700
Cited by:  Papers (20)
| | PDF (882 KB) | HTML

Dual-tree wavelet decompositions have recently gained much popularity, mainly due to their ability to provide an accurate directional analysis of images combined with a reduced redundancy. When the decomposition of a random process is performed-which occurs in particular when an additive noise is corrupting the signal to be analyzed-it is useful to characterize the statistical properties of the du... View full abstract»

• ### Performance Analysis of Linear Modulation Schemes With Generalized Diversity Combining on Rayleigh Fading Channels With Noisy Channel Estimates

Publication Year: 2007, Page(s):4701 - 4727
Cited by:  Papers (40)
| | PDF (1598 KB) | HTML

Generalized diversity combining (GDC), also known as hybrid selection/maximal ratio combining or generalized selection combining, is a low-complexity diversity combining technique by which a fixed subset of a large number of available diversity channels is chosen and then combined using the rules of maximal ratio combining. In this paper, we analyze the performance of GDC on time-correlated Raylei... View full abstract»

• ### Modeling Block Decoding Approaches for the Fast Correlation Attack

Publication Year: 2007, Page(s):4728 - 4737
Cited by:  Papers (10)
| | PDF (247 KB) | HTML

In this paper, a general framework which enables to compare previously proposed block decoding approaches for the fast correlation attack is developed. All attacks are based on decoding using a set of parity check sums of an underlying linear code. The purpose of this paper is twofold: 1) to provide a simple close form estimate about the number of check sums of a particular structure necessary for... View full abstract»

• ### Decoherence-Insensitive Quantum Communication by Optimal$C^{\ast }$-Encoding

Publication Year: 2007, Page(s):4738 - 4749
Cited by:  Papers (19)
| | PDF (295 KB) | HTML

The central issue in this paper is to transmit a quantum state in such a way that after some decoherence occurs, most of the information can be restored by a suitable decoding operation. For this purpose, we incorporate redundancy by mapping a given initial quantum state to a messenger state on a larger dimensional Hilbert space via a C* -algebra embedding. Our noise model for the transmission is ... View full abstract»

• ### Blocking Bounds for Random Channel Selection on Tree Topologies

Publication Year: 2007, Page(s):4750 - 4755
Cited by:  Papers (2)
| | PDF (288 KB) | HTML

Nonloopy network topologies are considered under the limitation that a channel can be utilized only if it is idle at all neighboring sites. Random channel selection is studied under a standard circuit-switched traffic model. Upper and lower bounds for blocking probabilities are determined via an auxiliary network process whose equilibrium distribution admits a computationally convenient form. By w... View full abstract»

• ### On the Linear Complexity and$k$-Error Linear Complexity Over${\BBF }_{p}$of the$d$-ary Sidel'nikov Sequence

Publication Year: 2007, Page(s):4755 - 4761
Cited by:  Papers (6)
| | PDF (285 KB) | HTML

The d-ary Sidel'nikov sequence S = s0, s1... of period q-1 for a prime power q=pmis a frequently analyzed sequence in the literature. Recently, it turned out that the linear complexity over Fpof the d-ary Sidel'nikov sequence is considerably smaller than the period if the sequence element s(q-1)/2mod(q-1)is chosen adequately. In this paper thi... 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