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

Lossy distributed source coding Using Graphs

IEEE COMMUNICATIONS LETTERS 2009年第4期13卷 262-264页

作者： Choi, Suhan Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA

In the letter, lossy distributed source coding using graphs is considered. This corresponds to the source coding part of the graph-based frame [1] for transmission of analog correlated sources over the multiple-access channel (MAC). Consequently, it is shown that a pair of analog correlated sources can be reliably represented into a bipartite graph by allowing certain amount of distortion. An achievable rate-distortion region for this problem is also provided. Therefore, it can be concluded that, for transmission of any (both discrete and continuous) set of correlated sources over MACs, graphs can be used as discrete interface between source coding and the channel coding modules.

关键词： distributed source coding correlated messages random graphs multiple-access channels

来源：评论

学校读者我要写书评

暂无评论

Functional Duality Between distributed source coding with One Distortion Criterion and Semi-Deterministic Broadcast Channel coding in the Case of Correlated Messages

引用

IEEE COMMUNICATIONS LETTERS 2013年第6期17卷 1236-1239页

作者： Choi, Suhan Yun, Ji-Hoon Choi, Kae Won Seoul Natl Univ Sci & Technol SeoulTech Dept Elect & Informat Eng Seoul South Korea Seoul Natl Univ Sci & Technol SeoulTech Dept Comp Sci & Engn Seoul South Korea

In this letter, functional duality between distributed source coding with One Distortion Criterion (DSC-ODC) and correlated messages and Semi-Deterministic Broadcast Channel coding (SD-BCC) with correlated messages is considered. It is shown that under certain conditions, for a given DSC-ODC problem with correlated messages, a functional dual SD-BCC problem with correlated messages can be obtained, and vice versa. In particular, the correlation structure of the messages in the two dual problems are the same. The source distortion measure and the channel cost measure for this duality are also specified.

关键词： Functional duality distributed source coding semi-deterministic broadcast channel coding correlated messages

来源：评论

学校读者我要写书评

暂无评论

A Novel Rate-Adaptive distributed source coding Scheme Using Polar Codes

引用

IEEE COMMUNICATIONS LETTERS 2013年第1期17卷 143-146页

作者： Lv, Xiaoqian Liu, Rongke Wang, Runxin Beihang Univ Sch Elect & Informat Engn Beijing 100191 Peoples R China

In this paper, we propose a rate-adaptive distributed source coding (DSC) scheme for two correlated sources using polar codes. We change the rule of selecting new frozen bits when the decoder requests more information. In our scheme, new frozen bits are chosen according to successive cancellation (SC) decoding instead of Bhattacharyya parameter. On receipt of a new frozen bit, SC decoding will continue from the new bit rather than restart from the first one. The novel scheme eliminates the recalculation of the previously decoded bits while reaching a competitive compression rates compared with alternatives. Furthermore, we derive a method for computing the average compression rates of the schemes in this paper, which match with the simulation results properly. Analysis shows that our novel scheme can reduce the decoding complexity significantly.

关键词： distributed source coding polar codes rate-adaptive feedback channel

来源：评论

学校读者我要写书评

暂无评论

Lattice-Based Robust distributed source coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2019年第3期65卷 1764-1781页

作者： Elzouki, Dania Dumitrescu, Sorina Chen, Jun McMaster Univ Dept Elect & Comp Engn Hamilton ON L8S 4L8 Canada

In this paper, we propose a lattice-based robust distributed source coding system for two correlated sources and provide a detailed performance analysis under the high resolution assumption. It is shown, among other things, that, in the asymptotic regime where: 1) the side distortion approaches 0 and 2) the ratio between the central and side distortions approaches 0, our scheme is capable of achieving the information-theoretic limit of quadratic multiple description coding when the two sources are identical, whereas a variant of the random coding scheme by Chen and Berger with Gaussian codes has a performance loss of 0.5 bits relative to this limit.

关键词： distributed source coding lattice quantization high resolution analysis

来源：评论

学校读者我要写书评

暂无评论

Lattices for distributed source coding: Jointly Gaussian sources and Reconstruction of a Linear Function

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2009年第12期55卷 5628-5651页

作者： Krithivasan, Dinesh Pradhan, S. Sandeep Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA

Consider a pair of correlated Gaussian sources (X-1, X-2). Two separate encoders observe the two components and communicate compressed versions of their observations to a common decoder. The decoder is interested in reconstructing a linear combination of X-1 and X-2 to within a mean-square distortion of D. We obtain an inner bound to the optimal rate-distortion region for this problem. A portion of this inner bound is achieved by a scheme that reconstructs the linear function directly rather than reconstructing the individual components X-1 and X-2 first. This results in a better rate region for certain parameter values. Our coding scheme relies on lattice coding techniques in contrast to more prevalent random coding arguments used to demonstrate achievable rate regions in information theory. We then consider the case of linear reconstruction of K sources and provide an inner bound to the optimal rate-distortion region. Some parts of the inner bound are achieved using the following coding structure: lattice vector quantization followed by "correlated" lattice-structured binning.

关键词： Berger-Tung inner bound distributed source coding function reconstruction lattice codes structured coding

来源：评论

学校读者我要写书评

暂无评论

Lossy distributed source coding Using LDPC Codes

引用

IEEE COMMUNICATIONS LETTERS 2009年第2期13卷 136-138页

作者： Sartipi, Mina Fekri, Faramarz Univ Tennessee Chattanooga Dept Comp Sci & Engn Chattanooga TN 37403 USA Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA

In this paper, we propose a practical scheme for lossy distributed source coding with side information available at the decoder. Our proposed scheme is based on sending parity bits using LDPC codes. We provide the design procedure for the LDPC code that guarantees performance close to the Wyner-Ziv limit for long LDPC codes. Using simulation results, we show that the proposed method performs close to the theoretical limit for even short length codes.

关键词： Wyner-Ziv limit distributed source coding LDPC codes non-uniform code

来源：评论

学校读者我要写书评

暂无评论

The distributed source coding method research based on clustering wireless sensor networks

引用

INTERNATIONAL JOURNAL OF SENSOR NETWORKS 2015年第4期17卷 224-228页

作者： Chen, Jian Han, Xue Southwest Univ Coll Comp & Informat Sci Chongqing 400715 Peoples R China Southwest Univ Coll Software Chongqing 400715 Peoples R China Glass Rubs Chongqing Co Ltd Chongqing 400700 Peoples R China

Specific to the lower power efficiency of node in wireless sensor network (WSN), a residual value coding algorithm is raise for clustering WSNs, which is based on distributed source encoding system. Theoretical analysis and experimental result indicate if this algorithm could be adopted in clustering WSN, then it would reduce the transferred data of node effectively. Thus, the power consumption of network would go down drastically.

关键词： clustering wireless sensor networks WSNs wireless sensor networks distributed source coding routing protocol based on clusters

来源：评论

学校读者我要写书评

暂无评论

Secure distributed source coding with side-information

引用

IEEE COMMUNICATIONS LETTERS 2008年第4期12卷 310-312页

作者： Luh, William Kundur, Deepa Texas A&M Univ Dept Elect & Comp Engn College Stn TX 77843 USA

This letter develops codes for the scenario in which users with correlated messages are to encipher and compress their mess' ages without collaboration and without the use of cryptographic keys or other secret materials. We consider an eavesdropper that has access to an encoded message and in addition, some side-information in the form of uncoded symbols corresponding to the encoded message. Our codes are an extension of distributed source coding using syndromes (DISCUS) with the additional requirement of providing secrecy for the scenario described above. We state a secrecy condition that the subcodes of DISCUS must satisfy, and develop a general encoding algorithm meeting these conditions. We analyze the performance of the proposed code for the case of multiple eavesdropped messages.

关键词： security distributed source coding Reed-Solomon codes

来源：评论

学校读者我要写书评

暂无评论

A Low-Complexity and Adaptive distributed source coding Design for Model Aggregation in distributed Learning

IEEE OPEN JOURNAL OF THE COMMUNICATIONS SOCIETY

引用

IEEE OPEN JOURNAL OF THE COMMUNICATIONS SOCIETY 2022年 3卷 2444-2460页

作者： Zhang, Naifu Tao, Meixia Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China

A major bottleneck in distributed learning is the communication overhead of exchanging intermediate model update parameters between the worker nodes and the parameter server. Recently, it is found that local gradients among different worker nodes are correlated. Therefore, distributed source coding (DSC) can be applied to increase communication efficiency by exploiting such correlation. However, it is highly non-trivial to exploite the gradient correlations in distributed learning due to the unknown and time-varying gradient correlation. In this paper, we first propose a DSC framework, named successive Wyner-Ziv coding, for distributed learning based on quantization and Slepian-Wolf (SW) coding. We prove that the proposed framework can achieve the theoretically minimum communication cost from an information theory perspective. We also propose a low-complexity and adaptive DSC for distributed learning, including a gradient statistics estimator, rate controller, and a log-likelihood ratio (LLR) computer. The gradient statistics estimator estimates the gradient statistics online based only on the quantized gradients at previous iterations, hence it does not introduce extra communication cost. The computation complexity of the rate controller and the LLR computer is reduced to a linear growth in the number of worker nodes by introducing a semi-analytical Monte Carlo simulation. Finally, we design a DSC-based distributed learning process and find that the extra delay introduced by DSC does not scale with the number of worker nodes.

关键词： Distance learning model aggregation distributed source coding Slepian-Wolf coding

来源：评论

学校读者我要写书评

暂无评论

Neural distributed source coding

IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY

引用

IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY 2024年 5卷 493-508页

作者： Whang, Jay Nagle, Alliot Acharya, Anish Kim, Hyeji Dimakis, Alexandros G. Gemini Team Google DeepMind Mountain View CA 94043 USA Univ Texas Austin ECE Dept Austin TX USA

We consider the distributed source coding (DSC) problem concerning the task of encoding an input in the absence of correlated side information that is only available to the decoder. Remarkably, Slepian and Wolf showed in 1973 that an encoder without access to the side information can asymptotically achieve the same compression rate as when the side information is available to it. This seminal result was later extended to lossy compression of distributed sources by Wyner, Ziv, Berger, and Tung. While there is vast prior work on this topic, practical DSC has been limited to synthetic datasets and specific correlation structures. Here we present a framework for lossy DSC that is agnostic to the correlation structure and can scale to high dimensions. Rather than relying on hand-crafted source modeling, our method utilizes a conditional Vector-Quantized Variational auto-encoder (VQ-VAE) to learn the distributed encoder and decoder. We evaluate our method on multiple datasets and show that our method can handle complex correlations and achieves state-of-the-art PSNR.

关键词： distributed source coding Berger-Tung inner bound Slepian-Wolf coding Wynzer-Ziv coding vector-quantized variational auto-encoder

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：