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

LDPCA Code Construction for Slepian-Wolf coding

IEEE COMMUNICATIONS LETTERS 2011年第10期15卷 1100-1103页

作者： Micallef, Jeffrey J. Farrugia, Reuben A. Debono, Carl J. Univ Malta Dept Commun & Comp Engn Msida Malta

Error correcting codes used for distributed source coding (DSC) generally assume a random distribution of errors. However, in certain DSC applications, prediction of the error distribution is possible and thus this assumption fails, resulting in a sub-optimal performance. This letter considers the construction of rate-adaptive Low-Density Parity-Check (LDPC) codes where the edges of the variable nodes receiving unreliable information are distributed evenly among all the check nodes. Simulation results show that the proposed codes can reduce the gap to the theoretical bounds by up to 56% compared to traditional codes.

关键词： distributed source coding rate-adaptive LDPC codes Slepian-Wolf theorem

来源：评论

学校读者我要写书评

暂无评论

Analysis on crossover probability estimation using LDPC syndrome

引用

Science China(Information Sciences) 2011年第9期54卷 1895-1904页

作者： FANG Yong College of Information Engineering,Northwest A&F University,Yangling 712100,China 1. College of Information Engineering Northwest A&F University Yangling 712100 China

Correlation estimation is a critical issue that impacts the application of Slepian-Wolf coding (SWC) in *** online correlation estimation is a type of newly-appearing approaches,in which the decoder estimates the virtual correlation channel between two correlated sources using both side information and the compressed SWC bitstream of the *** the compressed SWC bitstream usually contains partial information of the source,the emergence of dynamic online correlation estimation is helpful to solving the problem of correlation estimation in the SWC and further makes the SWC ***,the SWC is usually implemented by LDPC *** this case,the SWC bitstream is just the LDPC syndrome of the *** has been revealed that there are residual redundancies in LDPC syndromes,which can be used to estimate the crossover probability between two correlated binary ***,this algorithm has not been well justified *** paper makes use of the central limit theorem (CLT) to establish a mathematic model for analyzing the performance of this ***,for irregular LDPC codes,the optimization of weight vectors is discussed in *** experimental results are provided to validate the analysis.

关键词： distributed source coding Slepian-Wolf coding LDPC syndrome correlation estimation

来源：评论

学校读者我要写书评

暂无评论

IMPROVING THE VISUAL PERFORMANCE OF S/DISCUS

IMPROVING THE VISUAL PERFORMANCE OF S/DISCUS

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Dominguez-Conde, Gabriel Kundur, Deepa Univ Vigo Signal Theory & Commun Dept Vigo 36310 Spain Texas A&M Univ Dept Elect & Comp Engn College Stn TX 77843 USA

ISBN: (纸本)9781612843490

Wireless multimedia sensor networks (WMSNs) emerge as a solution in wireless unattended video surveillance scenarios. The G-E-M methodology was recently introduced by Czarlinska et al. to address the problem providing protection to visual wireless surveillance systems in the presence of another hostile sensing system. This work builds upon the G-E-M framework by introducing pre- and post-processing stages that reduce decoding errors and visual noise as well as allowing the effective control of bitrate.

关键词： Keyless security distributed source coding low-complexity video coding wireless multimedia sensor networks Slepian-Wolf coding

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE International Conference on Communications (ICC)

作者： Tan, Chong Zou, Junni Wang, Min Xiong, Hongkai Shanghai Univ Dept Commun Engn Shanghai 200072 Peoples R China Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China

ISBN: (纸本)9781612842332

This paper studies the problem of correlated data gathering in wireless sensor networks. For a maximum network utility, an efficient data capture and transmission framework is proposed for correlated sources, where localized S-W source coding, network coding based flow control and opportunistic routing are jointly optimized. To increase the throughput and guarantee the decodability simultaneously, a dynamic network coding strategy is proposed, with which the intermediate node can easily decide whether to make a combination among the incoming flows. Also, an opportunistic routing approach is presented, which adopts a new metric (minimum congestion price) for forwarding node selection and results in a maximum utility benefit for the sensor nodes. Through the Lagrange dual and gradient approach, a fully distributed algorithm is represented. And the convergence and performance are validated by the numerical results.

关键词： wireless sensor network correlated data gathering distributed source coding network coding opportunistic routing

来源：评论

学校读者我要写书评

暂无评论

distributed COMPRESSION OF ZEROTREES OF WAVELET COEFFICIENTS

DISTRIBUTED COMPRESSION OF ZEROTREES OF WAVELET COEFFICIENTS

引用

18th IEEE International Conference on Image Processing (ICIP)

作者： Wang, Yige Rane, Shantanu Boufounos, Petros Vetro, Anthony Mitsubishi Elect Res Labs Cambridge MA 02139 USA

ISBN: (纸本)9781457713033

A distributed coding algorithm is presented for compression of wavelet-transformed data. Data structures based on zerotrees are exploited for efficient compression of the significance map of wavelet coefficients. The coefficients are scanned in two stages, with a significance pass and refinement pass, similar to the SPIHT algorithm. The bits resulting from these passes are Slepian-Wolf coded using an LDPC syndrome code selected from a bank of available codes. A key realization is that, for each bitplane of the wavelet coefficients, the significance pass of the source data can be synchronized with that of the side information. This allows distributed compression of the significance pass. This is substantially different from previous mixed approaches in which the refinement pass was Slepian-Wolf coded, but the significance pass was coded independently. Rate-distortion results are presented for images from the ALOS AVNIR-2 multispectral dataset and compared against those obtained with SPIHT and JPEG2000.

关键词： distributed source coding Wavelets LDPC codes Zerotrees

来源：评论

学校读者我要写书评

暂无评论

distributed COMPRESSION: OVERVIEW OF CURRENT AND EMERGING MULTIMEDIA APPLICATIONS

DISTRIBUTED COMPRESSION: OVERVIEW OF CURRENT AND EMERGING MU...

引用

18th IEEE International Conference on Image Processing (ICIP)

作者： Stankovic, Lina Stankovic, Vladimir Cheng, Samuel Univ Strathclyde Dept Elect & Elect Engn Glasgow G1 1XW Lanark Scotland Univ Oklahoma Sch Elect & Comp Engn Tulsa OK 74135 USA

ISBN: (纸本)9781457713033

distributed compression or distributed source coding (DSC) refers to separate compression and joint decompression of multiple correlated sources. Though theoretical foundations were set almost forty years ago, driven by applications such as wireless video surveillance and wireless multimedia communications, DSC has become and still is a very active research area with interest from both academia and industry. While the first decade of this century has seen massive progress in code designs and achievable bounds, recent work is focussed on applications and solving practical DSC limitations such as large codeword size, accurate correlation estimation, etc. The goal of this paper is to provide an overview of the exciting trends and novel applications such as security, remote sensing, wireless data gathering of correlated data, biomedical imaging and infotainment, that DSC makes possible.

关键词： distributed source coding distributed video coding source compression

来源：评论

学校读者我要写书评

暂无评论

Robust distributed source Coder Design by Deterministic Annealing

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2010年第2期58卷 859-868页

作者： Saxena, Ankur Nayak, Jayanth Rose, Kenneth Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA Mayachitra Inc Santa Barbara CA 93111 USA

This paper considers the design of efficient quantizers for a robust distributed source coding system. The information is encoded at independent terminals and transmitted across separate channels, any of which may fail. The scenario subsumes a wide range of source and source-channel coding/quantization problems, including multiple descriptions and distributed source coding. Greedy descent methods depend heavily on initialization, and the presence of abundant (high density of) "poor" local optima on the cost surface strongly motivates the use of a global design algorithm. We propose a deterministic annealing approach for the design of all components of a generic robust distributed source coding system. Our approach avoids many poor local optima, is independent of initialization, and does not make any simplifying assumption on the underlying source distribution. Simulation results demonstrate a wide spread in the performance of greedy Lloyd-based algorithms, and considerable gains are achieved by using the proposed deterministic annealing approach.

关键词： Deterministic annealing distributed source coding sensor networks

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE International Conference on Communications Workshops

作者： Chong Tan Junni Zou Min Wang Hongkai Xiong Dept. of Commun. Eng. Shanghai Univ. Shanghai China

ISBN: (纸本)9781612842325

This paper studies the problem of correlated data gathering in wireless sensor networks. For a maximum network utility, a efficient data capture and transmission framework is proposed for correlated sources, where localized S-W source coding, network coding based flow control and opportunistic routing are jointly optimized. To increase the throughput and guarantee the decodability simultaneously, a dynamic network coding strategy is proposed, with which the intermediate node can easily decide whether to make a combination among the incoming flows. Also, an opportunistic routing approach is presented, which adopts a new metric (minimum congestion price) for forwarding node selection and results in a maximum utility benefit for the sensor nodes. Through the Lagrange dual and gradient approach, a fully distributed algorithm is represented. And the convergence and performance are validated by the numerical results.

关键词： Wireless sensor network Correlated data gathering distributed source coding Network coding Opportunistic routing Data Collection Methods Wireless sensor networks dynamic network Network routing intermediate node Data capture distributed algorithms flow control Network coding Congestion pricing

来源：评论

学校读者我要写书评

暂无评论

Rate-adaptive codes for distributed source coding

引用

SIGNAL PROCESSING 2006年第11期86卷 3123-3130页

作者： Varodayan, David Aaron, Anne Girod, Bernd Stanford Univ Dept Elect Engn Informat Syst Lab Stanford CA 94305 USA

source coding with correlated decoder side information is considered. We impose the practical constraint that the encoder be unaware of even the statistical dependencies between source and side information. Two classes of rate-adaptive distributed source codes, both based on low-density parity-check (LDPC) codes, are developed and their design is studied. Specific realizations are shown to be better than alternatives of linear encoding and decoding complexity. The proposed rate-adaptive LDPC accumulate (LDPCA) codes and sum LDPC accumulate (SLDPCA) codes (of length 6336 bits) perform within 10% and 5% of the Slepian-Wolf bound in the moderate and high rate regimes, respectively. (c) 2006 Elsevier B.V. All rights reserved.

关键词： distributed source coding Slepian-Wolf theorem side information LDPC codes iterative decoding algorithms

来源：评论

学校读者我要写书评

暂无评论

Separating distributed source coding from network coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2006年第6期52卷 2785-2795页

作者： Ramamoorthy, Aditya Jain, Kamal Chou, Philip A. Effros, Michelle Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90095 USA CALTECH Dept Elect Engn Pasadena CA 91125 USA

This correspondence considers the problem of distributed source coding of multiple sources over a network with multiple receivers. Each receiver seeks to reconstruct all of the original sources. The work by Ho et al. 2004 demonstrates that random network coding can solve this problem at the potentially high cost of jointly decoding the source and the network code. Motivated by complexity considerations we consider the performance of separate source and network codes. Previous work by Effros et al. 2003 demonstrates the failure of separation between source and network codes for nonmulticast networks. We demonstrate that failure for multicast networks. We study networks with capacity constraints on edges. It is shown that the problem with two sources and two receivers is always separable. Counterexamples are presented for other cases.

关键词： distributed source coding multicast network coding separation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：