# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 34

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

Publication Year: 2007, Page(s): C2
| PDF (38 KB)
• ### Universal Filtering Via Prediction

Publication Year: 2007, Page(s):1253 - 1264
Cited by:  Papers (15)
| | PDF (399 KB) | HTML

We consider the filtering problem, where a finite-alphabet individual sequence is corrupted by a discrete memoryless channel, and the goal is to causally estimate each sequence component based on the past and present noisy observations. We establish a correspondence between the filtering problem and the problem of prediction of individual sequences which leads to the following result: Given an arb... View full abstract»

• ### Denoising and Filtering Under the Probability of Excess Loss Criterion

Publication Year: 2007, Page(s):1265 - 1281
Cited by:  Papers (1)
| | PDF (625 KB) | HTML

Subclasses of finite alphabet denoising and filtering (causal denoising) schemes are compared. Performance is measured by the normalized cumulative loss (a.k.a. distortion), as measured by a single-letter loss function. We aim to minimize the probability that the normalized cumulative loss exceeds a given threshold. We call this quantity the probability of excess loss. Specifically, we consider a ... View full abstract»

• ### A Simple Signal Processing Architecture for Instantaneous Radar Polarimetry

Publication Year: 2007, Page(s):1282 - 1289
Cited by:  Papers (34)
| | PDF (211 KB) | HTML

This paper describes a new radar primitive that enables instantaneous radar polarimetry at essentially no increase in signal processing complexity. This primitive coordinates transmission of distinct waveforms on orthogonal polarizations and applies a unitary matched filter bank on receive. This avoids the information loss inherent in single-channel matched filters. A further advantage of this sch... View full abstract»

• ### MIMO Channels in the Low-SNR Regime: Communication Rate, Error Exponent, and Signal Peakiness

Publication Year: 2007, Page(s):1290 - 1309
Cited by:  Papers (4)
| | PDF (511 KB) | HTML

We consider multiple-input multiple-output (MIMO) fading channels and characterize the reliability function in the low signal-to-noise (SNR) regime as a function of the number of transmit and receive antennas. For the case when the fading matrix H has independent entries, we show that the number of transmit antennas plays a key role in reducing the peakiness in the input signal required to achieve... View full abstract»

• ### Asymptotic Behavior of Error Exponents in the Wideband Regime

Publication Year: 2007, Page(s):1310 - 1325
Cited by:  Papers (3)
| | PDF (406 KB) | HTML

In this paper, we investigate the fundamental tradeoff between rate and bandwidth when a constraint is imposed on the error exponent. Specifically, we consider both additive white Gaussian noise (AWGN) and Rayleigh-fading channels where the input symbols are assumed to have a peak constraint. For the AWGN channel model, the optimal values of R<sub>z</sub>(0) and R<sub>z</sub&g... View full abstract»

• ### Capacity and Random-Coding Exponents for Channel Coding With Side Information

Publication Year: 2007, Page(s):1326 - 1347
Cited by:  Papers (23)
| | PDF (763 KB) | HTML

Capacity formulas and random-coding exponents are derived for a generalized family of Gel'fand-Pinsker coding problems. These exponents yield asymptotic upper bounds on the achievable log probability of error. In our model, information is to be reliably transmitted through a noisy channel with finite input and output alphabets and random state sequence, and the channel is selected by a hypothetica... View full abstract»

• ### Capacity Theorems for the &ldquo;Z&rdquo; Channel

Publication Year: 2007, Page(s):1348 - 1365
Cited by:  Papers (33)
| | PDF (461 KB) | HTML

We consider the two-user "Z" channel (ZC), where there are two senders and two receivers. One of the senders transmits information to its intended receiver (without interfering with the unintended receiver), while the other sender transmits information to both receivers. The complete characterization of the discrete memoryless ZC remains unknown to date. For the Gaussian ZC, the capacity has only ... View full abstract»

• ### Hard Fairness Versus Proportional Fairness in Wireless Communications: The Single-Cell Case

Publication Year: 2007, Page(s):1366 - 1385
Cited by:  Papers (70)  |  Patents (2)
| | PDF (705 KB) | HTML

We consider a wireless communication system formed by a single cell with one base station and K user terminals. User channels are characterized by frequency-selective fading due to small-scale effects, modeled as a set of M parallel block-fading channels, and a frequency-flat distance-dependent path loss. We compare delay-limited systems with variable-rate systems under fairness constraints, in te... View full abstract»

• ### Feedback Quantization Strategies for Multiuser Diversity Systems

Publication Year: 2007, Page(s):1386 - 1400
Cited by:  Papers (15)
| | PDF (823 KB) | HTML

In a system utilizing multiuser diversity, regular feedback of channel-quality predictions to the base station is required for each user. Typically, the measure of channel quality must be quantized at each mobile station before it can be sent back. In this paper, we present two distributed scalar quantization schemes that optimize two different performance criteria: a) the minimization of the prob... View full abstract»

• ### Outage Capacity of the Fading Relay Channel in the Low-SNR Regime

Publication Year: 2007, Page(s):1401 - 1415
Cited by:  Papers (109)  |  Patents (2)
| | PDF (404 KB) | HTML

In slow-fading scenarios, cooperation between nodes can increase the amount of diversity for communication. We study the performance limit in such scenarios by analyzing the outage capacity of slow fading relay channels. Our focus is on the low signal-to-noise ratio (SNR) and low outage probability regime, where the adverse impact of fading is greatest but so are the potential gains from cooperati... View full abstract»

• ### Determining and Approaching Achievable Rates of Binary Intersymbol Interference Channels Using Multistage Decoding

Publication Year: 2007, Page(s):1416 - 1429
Cited by:  Papers (22)
| | PDF (535 KB) | HTML

By examining the achievable rates of a multistage decoding system on stationary ergodic channels, we derive lower bounds on the mutual information rate corresponding to independent and uniformly distributed (i.u.d.) inputs, also referred to as the i.u.d. information rate. For binary intersymbol interference (ISI) channels, we show that these bounds become tight as the number of decoding stages inc... View full abstract»

• ### Using Reed–Muller ${\hbox{RM}}\,(1, m)$ Codes Over Channels With Synchronization and Substitution Errors

Publication Year: 2007, Page(s):1430 - 1443
Cited by:  Papers (6)
| | PDF (369 KB) | HTML

We analyze the performance of a Reed-Muller RM(1,m) code over a channel that, in addition to substitution errors, permits either the repetition of a single bit or the deletion of a single bit; the latter feature is used to model synchronization errors. We first analyze the run-length structure of this code. We enumerate all pairs of codewords that can result in the same sequence after the deletion... View full abstract»

• ### High-Rate Quasi-Cyclic Low-Density Parity-Check Codes Derived From Finite Affine Planes

Publication Year: 2007, Page(s):1444 - 1459
Cited by:  Papers (43)
| | PDF (549 KB) | HTML

This paper shows that several attractive classes of quasi-cyclic (QC) low-density parity-check (LDPC) codes can be obtained from affine planes over finite fields. One class of these consists of duals of one-generator QC codes. Presented here for codes contained in this class are the exact minimum distance and a lower bound on the multiplicity of the minimum-weight codewords. Further, it is shown t... View full abstract»

• ### Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights

Publication Year: 2007, Page(s):1460 - 1478
Cited by:  Papers (9)
| | PDF (1996 KB) | HTML

We present a tree-based construction of low-density parity-check (LDPC) codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a d-regular tree for a fixed number of layers and employing a connection algorithm based on permutations or mutually orthogonal Latin squares to close t... View full abstract»

• ### Construction of Irregular LDPC Codes by Quasi-Cyclic Extension

Publication Year: 2007, Page(s):1479 - 1483
Cited by:  Papers (18)
| | PDF (1187 KB) | HTML

In this correspondence, we propose an approach to construct irregular low-density parity-check (LDPC) codes based on quasi-cyclic extension. When decoded iteratively, the constructed irregular LDPC codes exhibit a relatively low error floor in the high signal-to-noise ratio (SNR) region and are subject to relatively few undetected errors. The LDPC codes constructed based on the proposed scheme rem... View full abstract»

• ### Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity

Publication Year: 2007, Page(s):1484 - 1494
Cited by:  Papers (10)  |  Patents (2)
| | PDF (656 KB) | HTML

The complexity of brute-force encoding of low-density parity-check (LDPC) codes is proportional to the square value of the block length. Richardson and Urbanke have proposed efficient encoding algorithms for LDPC codes. These algorithms permute the parity-check matrix of the code iteratively, such that it becomes approximately lower triangular. We propose a new approach for efficient encoding of L... View full abstract»

• ### Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes

Publication Year: 2007, Page(s):1495 - 1510
Cited by:  Papers (14)
| | PDF (2998 KB) | HTML

The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid for any memoryless, binary-input and output-symmetric communication channel, and their effectiveness is exemplified for various ensembles of turbo-like codes ov... View full abstract»

• ### Results on the Improved Decoding Algorithm for Low-Density Parity-Check Codes Over the Binary Erasure Channel

Publication Year: 2007, Page(s):1510 - 1520
Cited by:  Papers (13)
| | PDF (1200 KB) | HTML

In this correspondence, we first investigate some analytical aspects of the recently proposed improved decoding algorithm for low-density parity-check (LDPC) codes over the binary erasure channel (BEC). We derive a necessary and sufficient condition for the improved decoding algorithm to successfully complete decoding when the decoder is initialized to guess a predetermined number of guesses after... View full abstract»

• ### Rateless Codes With Unequal Error Protection Property

Publication Year: 2007, Page(s):1521 - 1532
Cited by:  Papers (172)
| | PDF (751 KB) | HTML

In this correspondence, a generalization of rateless codes is proposed. The proposed codes provide unequal error protection (UEP). The asymptotic properties of these codes under the iterative decoding are investigated. Moreover, upper and lower bounds on maximum-likelihood (ML) decoding error probabilities of finite-length LT and Raptor codes for both equal and unequal error protection schemes are... View full abstract»

• ### On$Z_{2^k}$-Dual Binary Codes

Publication Year: 2007, Page(s):1532 - 1537
Cited by:  Papers (6)
| | PDF (303 KB) | HTML

A new generalization of the Gray map is introduced. The new generalization Phi:Z2knrarr Z22k-1n is connected with the known generalized Gray map phi in the following way: if we take two dual linear Z2k-codes and construct binary codes from them using the generalizations phi and Phi of the Gray map, then the weight enumerators of the... View full abstract»

• ### Entropy of Bit-Stuffing-Induced Measures for Two-Dimensional Checkerboard Constraints

Publication Year: 2007, Page(s):1537 - 1546
Cited by:  Papers (10)
| | PDF (507 KB) | HTML

A modified bit-stuffing scheme for two-dimensional (2-D) checkerboard constraints is introduced. The entropy of the scheme is determined based on a probability measure defined by the modified bit-stuffing. Entropy results of the scheme are given for 2-D constraints on a binary alphabet. The constraints considered are 2-D RLL(d,infin) for d=2,3 and 4 as well as for the constraint with a minimum 1-n... View full abstract»

• ### Grid Colorings in Steganography

Publication Year: 2007, Page(s):1547 - 1549
Cited by:  Papers (32)
| | PDF (149 KB) | HTML

A proper vertex coloring of a graph is called rainbow if, for each vertex v, all neighbors of v receive distinct colors. A k-regular graph G is called rainbow (or domatically full) if it admits a rainbow (k+1)-coloring. The d-dimensional grid graph G<sub>d</sub> is the graph whose vertices are the points of Zopf<sup>d</sup> and two vertices are adjacent if and only if their... View full abstract»

Publication Year: 2007, Page(s):1549 - 1557
Cited by:  Papers (50)
| | PDF (1069 KB) | HTML

The optimal tradeoff between diversity gain and multiplexing gain for multiple-inputmultiple-output (MIMO) channels has been studied recently under the independent and identically distributed (i.i.d.) Rayleigh-fading assumption. In this correspondence, this result is extended and the optimal tradeoff performance is derived for generalized fading channel conditions, including different fading types... 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