7,564 research outputs found
Writing on Dirty Paper with Resizing and its Application to Quasi-Static Fading Broadcast Channels
This paper studies a variant of the classical problem of ``writing on dirty
paper'' in which the sum of the input and the interference, or dirt, is
multiplied by a random variable that models resizing, known to the decoder but
not to the encoder. The achievable rate of Costa's dirty paper coding (DPC)
scheme is calculated and compared to the case of the decoder's also knowing the
dirt. In the ergodic case, the corresponding rate loss vanishes asymptotically
in the limits of both high and low signal-to-noise ratio (SNR), and is small at
all finite SNR for typical distributions like Rayleigh, Rician, and Nakagami.
In the quasi-static case, the DPC scheme is lossless at all SNR in terms of
outage probability. Quasi-static fading broadcast channels (BC) without
transmit channel state information (CSI) are investigated as an application of
the robustness properties. It is shown that the DPC scheme leads to an outage
achievable rate region that strictly dominates that of time division.Comment: To appear in IEEE International Symposium on Information Theory 200
Joint Wyner-Ziv/Dirty Paper coding by modulo-lattice modulation
The combination of source coding with decoder side-information (Wyner-Ziv
problem) and channel coding with encoder side-information (Gel'fand-Pinsker
problem) can be optimally solved using the separation principle. In this work
we show an alternative scheme for the quadratic-Gaussian case, which merges
source and channel coding. This scheme achieves the optimal performance by a
applying modulo-lattice modulation to the analog source. Thus it saves the
complexity of quantization and channel decoding, and remains with the task of
"shaping" only. Furthermore, for high signal-to-noise ratio (SNR), the scheme
approaches the optimal performance using an SNR-independent encoder, thus it is
robust to unknown SNR at the encoder.Comment: Submitted to IEEE Transactions on Information Theory. Presented in
part in ISIT-2006, Seattle. New version after revie
Wide spread spectrum watermarking with side information and interference cancellation
Nowadays, a popular method used for additive watermarking is wide spread
spectrum. It consists in adding a spread signal into the host document. This
signal is obtained by the sum of a set of carrier vectors, which are modulated
by the bits to be embedded. To extract these embedded bits, weighted
correlations between the watermarked document and the carriers are computed.
Unfortunately, even without any attack, the obtained set of bits can be
corrupted due to the interference with the host signal (host interference) and
also due to the interference with the others carriers (inter-symbols
interference (ISI) due to the non-orthogonality of the carriers). Some recent
watermarking algorithms deal with host interference using side informed
methods, but inter-symbols interference problem is still open. In this paper,
we deal with interference cancellation methods, and we propose to consider ISI
as side information and to integrate it into the host signal. This leads to a
great improvement of extraction performance in term of signal-to-noise ratio
and/or watermark robustness.Comment: 12 pages, 8 figure
Income inequality comparisons with dirty data: the UK and Spain during the 1980s
Inequality comparisons between countries and over time should take into account problems of data imperfection. We examine the contrasting experience of the UK and Spain during the 1980s in terms of the distribution of disposable income. We consider whether the apparent divergence in inequality could be attributable to deficiencies in income data including under-reporting
- …