5,357 research outputs found
Polar Codes for Distributed Hierarchical Source Coding
We show that polar codes can be used to achieve the rate-distortion functions
in the problem of hierarchical source coding also known as the successive
refinement problem. We also analyze the distributed version of this problem,
constructing a polar coding scheme that achieves the rate distortion functions
for successive refinement with side information.Comment: 14 page
Separation of Reliability and Secrecy in Rate-Limited Secret-Key Generation
For a discrete or a continuous source model, we study the problem of
secret-key generation with one round of rate-limited public communication
between two legitimate users. Although we do not provide new bounds on the
wiretap secret-key (WSK) capacity for the discrete source model, we use an
alternative achievability scheme that may be useful for practical applications.
As a side result, we conveniently extend known bounds to the case of a
continuous source model. Specifically, we consider a sequential key-generation
strategy, that implements a rate-limited reconciliation step to handle
reliability, followed by a privacy amplification step performed with extractors
to handle secrecy. We prove that such a sequential strategy achieves the best
known bounds for the rate-limited WSK capacity (under the assumption of
degraded sources in the case of two-way communication). However, we show that,
unlike the case of rate-unlimited public communication, achieving the
reconciliation capacity in a sequential strategy does not necessarily lead to
achieving the best known bounds for the WSK capacity. Consequently, reliability
and secrecy can be treated successively but not independently, thereby
exhibiting a limitation of sequential strategies for rate-limited public
communication. Nevertheless, we provide scenarios for which reliability and
secrecy can be treated successively and independently, such as the two-way
rate-limited SK capacity, the one-way rate-limited WSK capacity for degraded
binary symmetric sources, and the one-way rate-limited WSK capacity for
Gaussian degraded sources.Comment: 18 pages, two-column, 9 figures, accepted to IEEE Transactions on
Information Theory; corrected typos; updated references; minor change in
titl
Joint successive correlation estimation and side information refinement in distributed video coding
This paper presents a novel hash-based distributed video coding (DVC) scheme that combines an accurate online correlation channel estimation (CCE) algorithm with an efficient side information refinement strategy, delivering state-of-the-art compression performance. The proposed DVC scheme applies layered bit-plane Wyner-Ziv coding and successively refines the CCE bit-plane-per-bit-plane during decoding. In addition, the side information is successively refined upon decoding of distinct refinement levels, grouping specific frequency bands of the discrete cosine transform. The proposed system not only outperforms the benchmark in DVC but several state-of-the-art side information refinement techniques and CCE methods as well
Distortion Minimization in Gaussian Layered Broadcast Coding with Successive Refinement
A transmitter without channel state information (CSI) wishes to send a
delay-limited Gaussian source over a slowly fading channel. The source is coded
in superimposed layers, with each layer successively refining the description
in the previous one. The receiver decodes the layers that are supported by the
channel realization and reconstructs the source up to a distortion. The
expected distortion is minimized by optimally allocating the transmit power
among the source layers. For two source layers, the allocation is optimal when
power is first assigned to the higher layer up to a power ceiling that depends
only on the channel fading distribution; all remaining power, if any, is
allocated to the lower layer. For convex distortion cost functions with convex
constraints, the minimization is formulated as a convex optimization problem.
In the limit of a continuum of infinite layers, the minimum expected distortion
is given by the solution to a set of linear differential equations in terms of
the density of the fading distribution. As the bandwidth ratio b (channel uses
per source symbol) tends to zero, the power distribution that minimizes
expected distortion converges to the one that maximizes expected capacity.
While expected distortion can be improved by acquiring CSI at the transmitter
(CSIT) or by increasing diversity from the realization of independent fading
paths, at high SNR the performance benefit from diversity exceeds that from
CSIT, especially when b is large.Comment: Accepted for publication in IEEE Transactions on Information Theor
- …