Sciweavers

TIT
2010
154views Education» more  TIT 2010»
13 years 6 months ago
A universal scheme for Wyner-Ziv coding of discrete sources
We consider the Wyner-Ziv (WZ) problem of lossy compression where the decompressor observes a noisy version of the source, whose statistics are unknown. A new family of WZ coding a...
Shirin Jalali, Sergio Verdú, Tsachy Weissma...
TIT
2010
128views Education» more  TIT 2010»
13 years 6 months ago
General classes of performance lower bounds for parameter estimation: part II: Bayesian bounds
In this paper, a new class of Bayesian lower bounds is proposed. Derivation of the proposed class is performed via projection of each entry of the vector-function to be estimated ...
Koby Todros, Joseph Tabrikian
TIT
2010
153views Education» more  TIT 2010»
13 years 6 months ago
On the information rates of the plenoptic function
The plenoptic function (Adelson and Bergen, 91) describes the visual information available to an observer at any point in space and time. Samples of the plenoptic function (POF) a...
Arthur L. da Cunha, Minh N. Do, Martin Vetterli
TIT
2010
82views Education» more  TIT 2010»
13 years 6 months ago
On the hops present in costas permutations
We determine that exponential Welch permutations lead in general to the smallest maximal frequency hops among all Costas permutations, and are also relatively easy to study, as a ...
Konstantinos Drakakis
TIT
2010
104views Education» more  TIT 2010»
13 years 6 months ago
Semiorthogonal space-time block codes
In this paper, a new class of full-diversity, rate-one space
Ngoc-Dung Dào, Chintha Tellambura
TIT
2010
82views Education» more  TIT 2010»
13 years 6 months ago
Average message delivery time for small-world networks in the continuum limit
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
Hazer Inaltekin, Mung Chiang, H. Vincent Poor
TIT
2010
103views Education» more  TIT 2010»
13 years 6 months ago
Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes
The class of low-density parity-check (LDPC) codes is attractive, since such codes can be decoded using practical message-passing algorithms, and their performance is known to app...
Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Ma...
TIT
2010
300views Education» more  TIT 2010»
13 years 6 months ago
Polar codes are optimal for lossy source coding
We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar...
Satish Babu Korada, Rüdiger L. Urbanke
TIT
2010
76views Education» more  TIT 2010»
13 years 6 months ago
Uncertainty principles and vector quantization
Given a frame in Cn which satisfies a form of the uncertainty principle (as introduced by Candes and Tao), it is shown how to quickly convert the frame representation of every vect...
Yurii Lyubarskii, Roman Vershynin
TIT
2010
140views Education» more  TIT 2010»
13 years 6 months ago
Iterative decoding threshold analysis for LDPC convolutional codes
Abstract--An iterative decoding threshold analysis for terminated regular LDPC convolutional (LDPCC) codes is presented. Using density evolution techniques, the convergence behavio...
Michael Lentmaier, Arvind Sridharan, Daniel J. Cos...