# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 38

Publication Year: 2009, Page(s): C1
| PDF (49 KB)
• ### IEEE Transactions on Information Theory publication information

Publication Year: 2009, Page(s): C2
| PDF (41 KB)
• ### Finite-Length Scaling for Iteratively Decoded LDPC Ensembles

Publication Year: 2009, Page(s):473 - 498
Cited by:  Papers (47)
| | PDF (1583 KB) | HTML

We investigate the behavior of iteratively decoded low-density parity-check (LDPC) codes over the binary erasure channel in the so-called ldquowaterfall region.rdquo We show that the performance curves in this region follow a simple scaling law. We conjecture that essentially the same scaling behavior applies in a much more general setting and we provide some empirical evidence to support this con... View full abstract»

• ### Noise Enhanced Nonparametric Detection

Publication Year: 2009, Page(s):499 - 506
Cited by:  Papers (22)
| | PDF (550 KB) | HTML

This paper investigates potential improvement of nonparametric detection performance via addition of noise and evaluates the performance of noise modified nonparametric detectors. Detection performance comparisons are made between the original detectors and noise modified detectors. Conditions for improvability as well as the optimum additive noise distributions of the widely used sign detector, t... View full abstract»

• ### Shortening Array Codes and the Perfect $1$-Factorization Conjecture

Publication Year: 2009, Page(s):507 - 513
| | PDF (256 KB) | HTML

The existence of a perfect 1-factorization of the complete graph with n nodes, namely, Kn , for arbitrary even number n, is a 40-year-old open problem in graph theory. So far, two infinite families of perfect 1-factorizations have been shown to exist, namely, the factorizations of Kp+1 and K2 p , where p is an arbitrary prime number (p > 2) . It was s... View full abstract»

• ### Bounds and Constructions of Optimal ($n, 4, 2, 1$) Optical Orthogonal Codes

Publication Year: 2009, Page(s):514 - 523
Cited by:  Papers (21)
| | PDF (399 KB) | HTML

In this paper, a tight upper bound on the maximum possible code size of n, 4, 2, 1)-OOCs and some direct and recursive constructions of optimal (n, 4, 2, 1)-OOCs attaining the upper bound are given. As consequences, the following new infinite series of optimal (gn,4,2,1)-OOCs are obtained: i) g isin {1,7,11,19,23,31,35,59,71,79,131,179,191,239,251,271,311,359,379,419,431,439,479,491,499,571,599,63... View full abstract»

• ### On Fast-Decodable Space–Time Block Codes

Publication Year: 2009, Page(s):524 - 530
Cited by:  Papers (127)  |  Patents (6)
| | PDF (446 KB) | HTML

We focus on full-rate, fast-decodable space-time block codes (STBCs) for 2 times 2 and 4times2 multiple-input multiple-output (MIMO) transmission. We first derive conditions and design criteria for reduced-complexity maximum-likelihood (ML) decodable 2times2 STBCs, and we apply them to two families of codes that were recently discovered. Next, we derive a novel reduced-complexity 4times2 STBC, and... View full abstract»

• ### Recursive Space–Time Trellis Codes Using Differential Encoding

Publication Year: 2009, Page(s):531 - 546
Cited by:  Papers (2)
| | PDF (708 KB) | HTML

Differential space-time modulation (DSTM) has been recently proposed by Hughes, and Hochwald and Sweldens when the channel information is not known at the receiver, where the demodulation is in fact the same as the coherent demodulation of space-time block coding by replacing the channel matrix with the previously received signal matrix. On the other hand, the DSTM also needs a recursive memory of... View full abstract»

• ### Space–Time Codes From Structured Lattices

Publication Year: 2009, Page(s):547 - 556
Cited by:  Papers (13)
| | PDF (978 KB) | HTML

We present constructions of space-time (ST) codes based on lattice coset coding. First, we focus on ST code constructions for the short block-length case, i.e., when the block length is equal to or slightly larger than the number of transmit antennas. We present constructions based on dense lattice packings and nested lattice (Voronoi) shaping. Our codes achieve the optimal diversity-multiplexing ... View full abstract»

• ### Generally Explicit Space–Time Codes With Nonvanishing Determinants for Arbitrary Numbers of Transmit Antennas

Publication Year: 2009, Page(s):557 - 563
Cited by:  Papers (2)
| | PDF (245 KB) | HTML

Nonvanishing determinants have emerged as an attractive criterion enabling a space-time code achieve the optimal diversity-multiplexing gains tradeoff. It seems that cyclic division algebras play the most crucial role in designing a space-time code with nonvanishing determinants. In this paper, we explicitly construct space-time codes for arbitrary numbers of transmit antennas that achieve nonvani... View full abstract»

• ### Diversity Product Properties of Lu–Kumar's Space-Time Codes

Publication Year: 2009, Page(s):564 - 568
Cited by:  Papers (2)
| | PDF (135 KB) | HTML

In this paper, we show that the diversity products of the full transmit diversity space-time block codes proposed by Lu-Kumar (we call them Lu-Kumar's codes) with quadratic-amplitude modulation (QAM) constellations are lower bounded by 4. We present a sufficient condition on the minimum Hamming weight of the linear binary full-rank space-time code such that this lower bound is met. We show that th... View full abstract»

• ### Some Designs and Normalized Diversity Product Upper Bounds for Lattice-Based Diagonal and Full-Rate Space–Time Block Codes

Publication Year: 2009, Page(s):569 - 583
Cited by:  Papers (12)
| | PDF (393 KB) | HTML

In this paper, we first present two tight upper bounds for the normalized diversity products (or product distances) of <i>2&nbsp;&times;&nbsp;2</i> diagonal space-time block codes from quadratic extensions on <i>BBQ (</i>i<i>) </i> and <i> BBQ ( mmbzeta<sub>6</sub>)</i>, where i <i>=radic{-1}</i> and <i>mmbze... View full abstract»

• ### Golden Space–Time Block-Coded Modulation

Publication Year: 2009, Page(s):584 - 597
Cited by:  Papers (10)
| | PDF (584 KB) | HTML

In this paper, block-coded modulation is used to design a 2 times 2 multiple-input multiple-output (MIMO) space-time code for slow fading channels. The golden code is chosen as the inner code; the scheme is based on a set partitioning of the golden code using two-sided ideals whose norm is a power of two. In this case, a lower bound for the minimum determinant is given by the minimum Hamming dista... View full abstract»

• ### The Capacity Region of a Class of Semideterministic Interference Channels

Publication Year: 2009, Page(s):598 - 603
Cited by:  Papers (13)
| | PDF (153 KB) | HTML

The capacity region of a class of discrete memoryless interference channels with common information is established. The setup is similar to the class of deterministic interference channels without common information studied by El Gamal and Costa, which was later extended to the class of deterministic interference channels with common information. In this paper, certain conditions that were origina... View full abstract»

• ### Capacity of Cognitive Interference Channels With and Without Secrecy

Publication Year: 2009, Page(s):604 - 619
Cited by:  Papers (82)
| | PDF (462 KB) | HTML

Like the conventional two-user interference channel, the cognitive interference channel consists of two transmitters whose signals interfere at two receivers. It is assumed that there is a common message (message 1) known to both transmitters, and an additional independent message (message 2) known only to the cognitive transmitter (transmitter 2). The cognitive receiver (receiver 2) needs to deco... View full abstract»

• ### Capacity Bounds for the Gaussian Interference Channel

Publication Year: 2009, Page(s):620 - 643
Cited by:  Papers (224)
| | PDF (937 KB) | HTML

The capacity region of the two-user Gaussian interference channel (IC) is studied. Three classes of channels are considered: weak, one-sided, and mixed Gaussian ICs. For the weak Gaussian IC, a new outer bound on the capacity region is obtained that outperforms previously known outer bounds. The sum capacity for a certain range of channel parameters is derived. For this range, it is proved that us... View full abstract»

• ### Finite State Channels With Time-Invariant Deterministic Feedback

Publication Year: 2009, Page(s):644 - 662
Cited by:  Papers (60)
| | PDF (416 KB) | HTML

We consider capacity of discrete-time channels with feedback for the general case where the feedback is a time-invariant deterministic function of the output samples. Under the assumption that the channel states take values in a finite alphabet, we find a sequence of achievable rates and a sequence of upper bounds on the capacity. The achievable rates and the upper bounds are computable for any N,... View full abstract»

• ### Optimization of Information Rate Upper and Lower Bounds for Channels With Memory

Publication Year: 2009, Page(s):663 - 688
Cited by:  Papers (14)
| | PDF (604 KB) | HTML

We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we consider can have a finite number of states, such as partial response channels, or they can have an infinite state space, such as time-varying fading channels. We optimize recently proposed information rate bounds for such... View full abstract»

• ### A New Outer Bound and the Noisy-Interference Sum–Rate Capacity for Gaussian Interference Channels

Publication Year: 2009, Page(s):689 - 699
Cited by:  Papers (236)
| | PDF (699 KB) | HTML

A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-rate capacity for noisy interference as defined in this paper. Specifically, it is shown that if the channel crosstalk coefficient magnitudes lie below thresholds defined by the power constraints then single-user detectio... View full abstract»

• ### Reliable Communication in the Absence of a Common Clock

Publication Year: 2009, Page(s):700 - 712
Cited by:  Papers (6)
| | PDF (279 KB) | HTML

We introduce the continuous time asynchronous channel as a model for time jitter in a communication system with no common clock between the transmitter and the receiver. We have obtained a simple characterization for an optimal zero-error self-synchronizable code for the asynchronous channel. The capacity of this channel is determined by both a combinatorial approach and a probabilistic approach. ... View full abstract»

• ### Ergodic Channel Capacities for the Amplify-and-Forward Half-Duplex Cooperative Systems

Publication Year: 2009, Page(s):713 - 730
Cited by:  Papers (33)
| | PDF (590 KB) | HTML

In this paper, the ergodic channel capacities are established for the amplify-and-forward (AF) half-duplex cooperative systems, which consist of a source node, a destination, and multiple-relay nodes. The relay nodes assist the transmission from the source node to the destination. Since the channel matrices for the cooperative systems involve product of Gaussian random variables, which are no long... View full abstract»

• ### The Effect of Noise Correlation in Amplify-and-Forward Relay Networks

Publication Year: 2009, Page(s):731 - 745
Cited by:  Papers (29)
| | PDF (820 KB) | HTML

In wireless relay networks, noise at the relays can be correlated possibly due to common interference or noise propagation from preceding hops. A parallel relay network with noise correlation is considered in this network. For the relay strategy of amplify and forward (AF), the optimal rate maximizing relay gains when correlation knowledge is available at the relays are determined. Interestingly, ... View full abstract»

• ### High-SNR Analysis of Outage-Limited Communications With Bursty and Delay-Limited Information

Publication Year: 2009, Page(s):746 - 763
Cited by:  Papers (11)
| | PDF (697 KB) | HTML

This work analyzes the high-SNR asymptotic error performance of outage-limited communications with fading, where the number of bits that arrive at the transmitter during any timeslot is random but the delivery of bits at the receiver must adhere to a strict delay limitation. Specifically, bit errors are caused by erroneous decoding at the receiver or violation of the strict delay constraint. Under... View full abstract»

• ### Constrained Capacities for Faster-Than-Nyquist Signaling

Publication Year: 2009, Page(s):764 - 775
Cited by:  Papers (66)  |  Patents (1)
| | PDF (330 KB) | HTML

This paper deals with capacity computations of faster-than-Nyquist (FTN) signaling. It shows that the capacity of FTN is higher than the orthogonal pulse linear modulation capacity for all pulse shapes except the sinc. FTN signals can in fact achieve the ultimate capacity for the signal power spectral density (PSD). The paper lower- and upper-bounds the FTN capacity under the constraint of finite ... View full abstract»

• ### Optimal Constellations for the Low-SNR Noncoherent MIMO Block Rayleigh-Fading Channel

Publication Year: 2009, Page(s):776 - 796
Cited by:  Papers (8)
| | PDF (1306 KB) | HTML

Reliable communication over the discrete-input/continuous-output noncoherent multiple-input multiple-output (MIMO) Rayleigh block-fading channel is considered when the signal-to-noise ratio (SNR) per degree of freedom is low. Two key problems are posed and solved to obtain the optimum discrete input. In both problems, the average and peak power per space-time slot of the input constellation are co... 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