检索结果-内蒙古大学图书馆

Universal slepian-wolf coding for Individual Sequences

IEEE TRANSACTIONS ON INFORMATION THEORY 2025年第1期71卷 783-796页

作者： Merhav, Neri Tech Israel Inst Technol Viterbi Fac ECE IL-3200003 Haifa Israel

We establish a coding theorem and a matching converse theorem for separate encodings and joint decoding of individual sequences using finite-state machines. The achievable rate region is characterized in terms of the Lempel-Ziv (LZ) complexities, the conditional LZ complexities and the joint LZ complexity of the two source sequences. An important feature that is needed to this end, which may be interesting on its own right, is a certain asymptotic form of a chain rule for LZ complexities, which we establish in this work. The main emphasis in the achievability scheme is on the universal decoder and its properties. We then show that the achievable rate region is universally attainable by a modified version of Draper's universal incremental slepian-wolf (SW) coding scheme, provided that there exists a low-rate reliable feedback link.

关键词： Encoding Complexity theory Decoding Entropy Vectors Automata Source coding Hamming distances Viterbi algorithm Urban areas slepian-wolf coding Lempel-Ziv algorithm Lempel-Ziv complexity finite-state machines universal decoding

来源：评论

学校读者我要写书评

暂无评论

slepian-wolf coding with quantum side information

引用

QUANTUM INFORMATION PROCESSING 2023年第11期22卷 1-23页

作者： Liu, Xiaomin Xi, Zhengjun Fan, Heng Shaanxi Normal Univ Coll Comp Sci Xian 710062 Peoples R China Chinese Acad Sci Inst Phys Beijing 100190 Peoples R China Univ Chinese Acad Sci CAS Ctr Excellence Topol Quantum Computat Beijing 100190 Peoples R China Beijing Acad Quantum Informat Sci Beijing 100193 Peoples R China

In this paper, we consider the classical slepian-wolf coding with quantum side information, corresponding to the compression of two correlated classical parts, using their quantum parts as side information at the decoder. By quantum Feinstein's lemma, we give the achievable rate region. We then extend to the multiple classical-quantum sources case. We also consider the classical slepian-wolf coding with full (local) quantum helper. Using the measure compression theorem, we get the achievable rate region and extend to the multiple classical-quantum sources case.

关键词： slepian-wolf coding Side information Helper Quantum conditional mutual information

来源：评论

学校读者我要写书评

暂无评论

slepian-wolf coding for Broadcasting With Cooperative Base-Stations

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2015年第5期63卷 1850-1866页

作者： Timo, Roy Wigger, Michele Tech Univ Munich D-80333 Munich Germany Telecom ParisTech F-75013 Paris France

We propose a base-station (BS) cooperation model for broadcasting a discrete memoryless source in a cellular or heterogeneous network. The model allows the receivers to use helper BSs to improve network performance, and it permits the receivers to have prior side information about the source. We establish the model's information-theoretic limits in two operational modes: In Mode 1, the helper BSs are given information about the channel codeword transmitted by the main BS, and in Mode 2 they are provided correlated side information about the source. Optimal codes for Mode 1 use hash-and-forward coding at the helper BSs;while, in Mode 2, optimal codes use source codes from Wyner's helper source-coding problem at the helper BSs. We prove the optimality of both approaches by way of a new list-decoding generalisation used in Theorem 6 of Tuncel (2006), and in doing so, show an operational duality between Modes 1 and 2.

关键词： Broadcast channel cellular network hash-and-forward helper basestations list decoding slepian-wolf coding

来源：评论

学校读者我要写书评

暂无评论

LDPC Code Design for Asynchronous slepian-wolf coding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2010年第2期58卷 511-520页

作者： Sun, Zhibin Tian, Chao Chen, Jun Wong, Kon Max McMaster Univ Dept Elect & Comp Engn Hamilton ON Canada AT&T Labs Res Florham Pk NJ USA

We consider asynchronous slepian-wolf coding where the two encoders may not have completely accurate timing information to synchronize their individual block code boundaries, and propose LDPC code design in this scenario. A new information-theoretic coding scheme based on source splitting is provided, which can achieve the entire asynchronous slepian-wolf rate region. Unlike existing methods based on source splitting, the proposed scheme does not require common randomness at the encoder and the decoder, or the construction of super-letter from several individual symbols. We then design LDPC codes based on this new scheme, by applying the recently discovered source-channel code correspondence. Experimental results validate the effectiveness of the proposed method.

关键词： Belief propagation low density parity check codes slepian-wolf coding source splitting

来源：评论

学校读者我要写书评

暂无评论

coding Theorems for Asynchronous slepian-wolf coding Systems

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2020年第8期66卷 4774-4795页

作者： Matsuta, Tetsunao Uyematsu, Tomohiko Tokyo Inst Technol Dept Informat & Commun Engn Tokyo 1528552 Japan

The slepian-wolf (SW) coding system is a source coding system with two encoders and a decoder, where these encoders independently encode source sequences from two correlated sources into codewords, and the decoder reconstructs both source sequences from the codewords. In this paper, we consider the situation in which the SW coding system is asynchronous, i.e., each encoder samples a source sequence with some unknown delay. We assume that delays are unknown but maximum and minimum values of possible delays are known to encoders and the decoder. We also assume that sources are discrete stationary memoryless and the probability mass function (PMF) of the sources is unknown but the system knows that it belongs to a certain set of PMFs. For this asynchronous SW coding system, we clarify the achievable rate region which is the set of rate pairs of encoders such that the decoding error probability vanishes as the blocklength tends to infinity. We show that this region does not always coincide with that of the synchronous SW coding system in which each encoder samples a source sequence without any delay.

关键词： Delays Encoding Decoding Observatories Correlation Meteorology Uncertainty Achievable rate region asynchronous slepian-wolf coding universal coding scheme

来源：评论

学校读者我要写书评

暂无评论

Efficient wavelet-based predictive slepian-wolf coding for hyperspectral imagery

引用

SIGNAL PROCESSING 2006年第11期86卷 3180-3195页

作者： Cheung, Ngai-Man Tang, Caimu Ortega, Antonio Raghavendra, Cauligi S. Univ So Calif Dept Elect Engn Syst Div Los Angeles CA 90089 USA Univ So Calif Dept Comp Sci Los Angeles CA 90089 USA

Hyperspectral imagery is usually highly correlated, in some cases within each spectral band, but in particular across neighboring frequency bands. In this paper, we propose to use distributed source coding (DSC) to exploit this correlation with an eye to a more efficient hardware implementation. The theoretical underpinnings of DSC are laid out in the pioneering work of slepian and wolf, and Wyner and Ziv, which provide bounds on the achievable compression when encoding correlated sources with side information available at the decoder. We apply DSC principles to hyperspectral images by encoding individual images (each image representing a spectral band) under the assumption that these bands are correlated. Using DSC tools allows us to operate in "open loop" at the encoder, so that encoding a band does not require having access to decoded versions of (spectrally) neighboring bands. We first compute the parameters of a linear predictor to estimate the current spectral band from a neighboring one, and estimate the correlation between these two bands (after prediction). Then a wavelet transform is applied and a bit-plane representation is used for the resulting wavelet coefficients. We observe that in typical hyperspectral images, bit-planes of same frequency and significance located in neighboring spectral bands are correlated. We exploit this correlation by using low-density parity-check (LDPC)-based slepian-wolf codes. The code rates are chosen based on the estimated correlation. We demonstrate that set partitioning of wavelet coefficients, such as that introduced in the popular SPIHT algorithm, can be combined with our proposed DSC techniques so that coefficient significance information is sent independently for all spectral bands, while sign and refinement bits can be coded using DSC. Our proposed scheme is appealing for hardware implementation as it is easy to parallelize and has modest memory requirements. In addition to these implementation advantages, our schem

关键词： hyperspectral imagery distributed source coding slepian-wolf coding SPIHT correlation estimation LDPC

来源：评论

学校读者我要写书评

暂无评论

On the Redundancy of slepian-wolf coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2009年第12期55卷 5607-5627页

作者： He, Da-ke Lastras-Montano, Luis A. Yang, En-hui Jagmohan, Ashish Chen, Jun IBM Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

In this paper, the redundancy of both variable and fixed rate slepian-wolf coding is considered. Given any jointly memoryless source-side information pair {(X-i, Y-i)}(i=1)(infinity) with finite alphabet, the redundancy R-n(epsilon(n)) of variable rate slepian-wolf coding of X-1(n) with decoder only side information Y-1(n) depends on both the block length n and the decoding block error probability subset of(n), and is defined as the difference between the minimum average compression rate of order n variable rate slepian-wolf codes having the decoding block error probability less than or equal to epsilon(n), and the conditional entropy H(X/Y), where H(X/Y) is the conditional entropy rate of the source given the side information. The redundancy of fixed rate slepian-wolf coding of X-1(n) with decoder only side information Y-1(n) is defined similarly and denoted by R-F(n)(epsilon(n)). It is proved that under mild assumptions about epsilon(n), R-F(n)(epsilon(n)) = d(v) root-log epsilon(n)/n + o(root-log epsilon(n)/n) and R-F(n)(epsilon(n)) = d(f) root-log epsilon(n)/n + o(root-log epsilon(n)/n, where d(f) and d(v) are two constants completely determined by the joint distribution of the source-side information pair. Since d(v) is generally smaller than d(f), our results show that variable rate slepian-wolf coding is indeed more efficient than fixed rate slepian-wolf coding.

关键词： Compression rate error probability lossless data compression redundancy side information slepian-wolf coding source coding

来源：评论

学校读者我要写书评

暂无评论

On Syndrome Decoding for slepian-wolf coding Based on Convolutional and Turbo Codes

引用

IEEE COMMUNICATIONS LETTERS 2010年第6期14卷 554-556页

作者： Cappellari, Lorenzo Univ Padua Dept Informat Engn I-35131 Padua Italy

In source coding, either with or without side information at the decoder, the ultimate performance can be achieved by means of random binning. Structured binning into cosets of performing channel codes has been successfully employed in practical applications. In this letter it is formally shown that various convolutional- and turbo-syndrome decoding algorithms proposed in literature lead in fact to the same estimate. An equivalent implementation is also delineated by directly tackling syndrome decoding as a maximum a posteriori probability problem and solving it by means of iterative message-passing. This solution takes advantage of the exact same structures and algorithms used by the conventional channel decoder for the code according to which the syndrome is formed.

关键词： slepian-wolf coding source coding syndrome-based binning turbo codes message-passing

来源：评论

学校读者我要写书评

暂无评论

Improved Finite Blocklength Converses for slepian-wolf coding via Linear Programming

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2019年第4期65卷 2423-2441页

作者： Jose, Sharu Theresa Kulkarni, Ankur A. Indian Inst Technol Syst & Control Engn Grp Mumbai 400076 Maharashtra India

A new finite blocklength converse for the slepian-wolf coding problem, which significantly improves on the best-known converse due to Miyake and Kanaya, is presented. To obtain this converse, an extension of the linear programming (LP)-based framework for finite blocklength point-to-point coding problems is employed. However, a direct application of this framework demands a complicated analysis for the slepian-wolf problem. An analytically simpler approach is presented, wherein LP-based finite blocklength converses for this problem are synthesized from point-to-point lossless source coding problems with perfect side-information at the decoder. New finite blocklength converses for these point-to-point problems are derived by employing the LP-based framework, and the new converse for slepian-wolf coding is obtained by an appropriate combination of these converses.

关键词： slepian-wolf coding finite blocklength converses linear programming duality

来源：评论

学校读者我要写书评

暂无评论

Randomness and Dependencies Extraction via Polarization, With Applications to slepian-wolf coding and Secrecy

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2015年第5期61卷 2388-2398页

作者： Abbe, Emmanuel Ecole Polytech Fed Lausanne Sch Commun & Comp Sci CH-1015 Lausanne Switzerland

The polarization phenomenon for a single source is extended to a framework with multiple correlated sources. It is shown in addition to extracting the randomness of the source, the polar transforms take the original arbitrary dependencies to extremal dependencies. Polar coding schemes for the slepian-wolf (SW) coding problem and for secret key generations are then proposed based on this phenomenon. In particular, secret keys achieving the secrecy capacity and compression schemes achieving the SW capacity region are obtained with a complexity of O(n log(n)).

关键词： Polar codes polarization randomness extraction slepian-wolf coding secret key generation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：