7 research outputs found
Compound Conditional Source Coding, Slepian-Wolf List Decoding, and Applications to Media Coding
We introduce a novel source coding problem, compound conditional source coding. We describe how a number of media coding problems can be cast into this framework. We develop the achievable rate region for this problem and error exponent results. We show that the reliability function of compound conditional source coding is at least as large as the list-decoding error exponent of Slepian-Wolf coding, which we develop in addition. A message of the paper is that a number of media coding scenarios where distributed source coding techniques are being used are more exactly stated as compound conditional problems. This insight can lead to improved system performance, as we demonstrate for error exponents
Lossless data compression with polar codes
Ankara : The Department of Electrical and Electronics Engineering and the Graduate School of Engineering and Science of Bilkent University, 2013.Thesis (Master's) -- Bilkent University, 2013.Includes bibliographical references leaves 60-62.In this study, lossless polar compression schemes are proposed for finite source
alphabets in the noiseless setting. In the first part, lossless polar source coding
scheme for binary memoryless sources introduced by Arıkan is extended to general
prime-size alphabets. In addition to the conventional successive cancellation
decoding (SC-D), successive cancellation list decoding (SCL-D) is utilized for improved
performance at practical block-lengths. For code construction, greedy approximation
method for density evolution, proposed by Tal and Vardy, is adapted
to non-binary alphabets. In the second part, a variable-length, zero-error polar
compression scheme for prime-size alphabets based on the work of Cronie and Korada
is developed. It is shown numerically that this scheme provides rates close
to minimum source coding rate at practical block-lengths under SC-D, while
achieving the minimum source coding rate asymptotically in the block-length.
For improved performance at practical block-lengths, a scheme based on SCL-D
is developed. The proposed schemes are generalized to arbitrary finite source
alphabets by using a multi-level approach. For practical applications, robustness
of the zero-error source coding scheme with respect to uncertainty in source distribution
is investigated. Based on this robustness investigation, it is shown that
a class of prebuilt information sets can be used at practical block-lengths instead
of constructing a specific information set for every source distribution. Since the
compression schemes proposed in this thesis are not universal, probability distribution
of a source must be known at the receiver for reconstruction. In the
presence of source uncertainty, this requires the transmitter to inform the receiver
about the source distribution. As a solution to this problem, a sequential quantization
with scaling algorithm is proposed to transmit the probability distribution
of the source together with the compressed word in an efficient way.Çaycı, SemihM.S
Transmission and Storage Rates for Sequential Massive Random Access
This paper introduces a new source coding paradigm called Sequential Massive Random Access (SMRA). In SMRA, a set of correlated sources is encoded once for all and stored on a server, and clients want to successively access to only a subset of the sources. Since the number of simultaneous clients can be huge, the server is only allowed to extract a bitstream from the stored data: no re-encoding can be performed before the transmission of the specific client's request. In this paper, we formally define the SMRA framework and introduce both storage and transmission rates to characterize the performance of SMRA. We derive achievable transmission and storage rates for lossless source coding of i.i.d. and non i.i.d. sources, and transmission and storage rates-distortion regions for Gaussian sources. We also show two practical implementations of SMRA systems based on rate-compatible LDPC codes. Both theoretical and experimental results demonstrate that SMRA systems can reach the same transmission rates as in traditional point to point source coding schemes, while having a reasonable overhead in terms of storage rate. These results constitute a breakthrough for many recent data transmission applications in which different parts of the data are requested by the clients