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

Canadian Workshop on Information Theory (CWIT)

作者： Madhurima Potluri Suma Chilumuru Sumakanth Kambhampati Kamesh R. Namuduri Wichita State University Wichita KS USA

Recent revolution in sensor networks has resulted in the development of many enabling techniques, one of which being distributed source coding (DSC). DSC allows a low-complexity encoder, shifting the high complexity to the decoder, making this scheme appropriate for sensor networks. In this paper, we have extended the non-binary low-density parity-check (LDPC) codes, developed for channel coding, to be used for distributed source coding of correlated non-binary sources. The system consists of an equiprobable memoryless non-binary source with side information at the decoder. The correlation between the sources is modelled as a virtual channel. The results obtained through simulations demonstrate that for rates 1/2 and 3/4, the non-binary compression scheme performs better the equivalent binary compression scheme. This scheme makes it extremely suitable for sensor networks.

关键词： source coding Parity check codes Channel coding Iterative decoding AWGN Iterative algorithms Bit error rate Message passing Lattices Sparse matrices

来源：评论

学校读者我要写书评

暂无评论

Canonical description for multiterminal source coding

Canonical description for multiterminal source coding

引用

IEEE International Symposium on Information Theory

作者： Soumya Jana Richard Blahut Department of Electrical and Computer Engineering University of Illinois Urbana-Champaign IL USA

ISBN: (纸本)9781424422562

Principles behind lossless and lossy coding are usually considered related, yet distinct. In contrast, we show that the direct statements of the rate-distortion theorem and the lossless coding theorem are consequences of a common distortion-abstracted phenomenon. Significantly, we extend such distortion abstraction to a more general multiterminal framework, and derive a canonical direct theorem that subsumes known results. Further, we show that the converse holds if all but at most one encoded sources are perfectly reconstructed, and, thereby, not only generalize known results but settle open problems such as the single-helper problem. More generally, a canonical sequence of inner bounds approaches the achievable region, and points to a new problem, whose solution, if found, would lead to a desirable computable description.

关键词： Encoding Channel coding source coding Distortion measurement Loss measurement Joints Random variables

来源：评论

学校读者我要写书评

暂无评论

On secure source coding with side information at the encoder

On secure source coding with side information at the encoder

引用

IEEE International Symposium on Information Theory

作者： Yeow-Khiang Chia Kittipong Kittichokechai Modulation and Coding Department Institute for Infocomm Research Singapore ACCESS Linnaeus Center Royal Institute of Technology Sweden

ISBN: (纸本)9781479904440

We consider a secure source coding problem with side informations at the decoder and the eavesdropper. The encoder has a source that it wishes to describe with limited distortion through a rate-limited link to a legitimate decoder. The message sent is also observed by the eavesdropper. The encoder aims to minimize both the distortion incurred by the legitimate decoder; and the information leakage rate at the eavesdropper. When the encoder has access to the side information (S.I.) at the decoder, we characterize the rate-distortion-information leakage rate (R.D.I.) region under a Markov chain assumption and when S.I. at the encoder does not improve the rate-distortion region as compared to the case when S.I. is absent. We then extend our setting to consider the case where the encoder and decoder obtain coded S.I. through a rate-limited helper, and characterize the R.D.I. region for several special cases under logarithmic loss distortion (log-loss). Finally, we consider the case of list or entropy constraints at the decoder and show that the R.D.I. region coincides with R.D.I. region under log-loss.

关键词： Decoding Distortion measurement source coding Rate-distortion Entropy Loss measurement

来源：评论

学校读者我要写书评

暂无评论

Relating source coding and resolvability: A direct approach

Relating source coding and resolvability: A direct approach

引用

IEEE International Symposium on Information Theory

作者： Tomohiko Uyematsu Department of Communications and Integrated Systems Tokyo Institute of Technology Meguro Tokyo Japan

ISBN: (纸本)9781424478903

This paper deals with the resolvability problem for general sources, and establishes a new unified method for the resolvability problem of general sources. Specifically, we introduce Shannon's information measure for fixed length source coding, and show a unified method to present the resolvability in terms of this information quantity. Further, we also represent δ-resolvability of general sources and the strong converse property in terms of Shannon's information measure.

关键词： source coding Entropy Random number generation Probability distribution Paper technology Length measurement Information theory

来源：评论

学校读者我要写书评

暂无评论

Joint source coding and Channel Estimation for Video Transmission Over Wireless LAN

Joint Source Coding and Channel Estimation for Video Transmi...

引用

International Conference on Wireless Communications, Networking and Mobile Computing (WiCom)

作者： Xiaofei Li Zhonghui Mei College of Telecommunication and Information Engineering Nanjing University of Posts and Telecommunications Nanjing China

We propose a mechanism in which the feedback channel state information (CSI) can be sent to the rate control unit for adapting the encoding rate and doing the selective ARQ at the transmitter periodically. We consider a general framework for the real-time transmission of video data over a channel subjected to random burst packet losses. It is an intuitively appealing result that the rate for the encoded video is changed smoothly with the channel capacity when the channel conditions is time-varying, so we can get a proper quality video.

关键词： source coding Channel estimation Wireless LAN Forward error correction Automatic repeat request Decoding Redundancy Timing Educational institutions Transmitters

来源：评论

学校读者我要写书评

暂无评论

A Two-Stage Algorithm to Reduce Encoding Delay of Turbo source coding

A Two-Stage Algorithm to Reduce Encoding Delay of Turbo Sour...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Javad Haghighat David V. Plant Department of Electrical and Computer Engineering McGill University Montreal QUE Canada

Lossless turbo source coding employs an iterative encoding algorithm to search for the smallest codeword length that guarantees zero distortion. Although such encoder achieves promising compression rates, running the iterative algorithm for each individual message block imposes a large delay on the system. To reduce this delay, we propose a two-stage encoding algorithm for turbo source coding. We show that converging to zero distortion after a definite number of iterations, can be predicted from the earlier behavior of the distortion function. This will enable us to produce a quick, and yet sufficiently accurate, estimate of the codeword length in the first encoding stage. In the second stage, we iteratively increase this estimated codeword length until reaching zero distortion. Also, we show that employing an auxiliary distortion measure at the first stage of encoding may allow for better estimates and decrease the delay furthermore. Numerical results show that the proposed algorithm will decrease the encoding delay up to 19%. Although there are previous works in the literature on delay reduction of turbo source coding, those works achieve lower delays by reducing the message block length. However, the proposed algorithm achieves lower delays for the same block length and therefore the actual "per bit" encoding delay is decreased.

关键词： Encoding Delay source coding Iterative decoding Decoding Distortion measurement Image coding

来源：评论

学校读者我要写书评

暂无评论

Cascade and Triangular source coding with causal side information

Cascade and Triangular source coding with causal side inform...

引用

IEEE International Symposium on Information Theory

作者： Yeow-Khiang Chia Tsachy Weissman Department of Electrical Engineering Stanford University USA

ISBN: (纸本)9781457705960

We consider cascade and triangular source coding with side information and causal reconstruction at the end node. When the side information at the source and intermediate nodes are the same, we characterize the rate distortion regions for both the cascade and triangular source coding problems. For the general cascade setting with causal reconstruction at the end node, we characterize the rate region when the sources satisfy a positivity condition, or when a Markov chain holds.

关键词： source coding Markov processes Rate-distortion Random variables Decoding

来源：评论

学校读者我要写书评

暂无评论

Joint source-channel coding of the FS1016 coder LSF parameters: Application of the channel optimized trellis coded vector quantization

引用

ANNALS OF TELECOMMUNICATIONS 2007年第3-4期62卷 426-463页

作者： Bouzid, Merouane USTHB LCPTS Fac Elect & Informat Algiers 16111 Algeria

In this paper we present an optimized trellis coded vector quantization (TCVQ) coding system designed for the effective and robust coding of LSF spectral parameters at low bit rate. The aim of this system, called at the beginning << LSF-OTCVQ Encoder >>, is to achieve a low bit rate transparent quantization of LSF parameters of the US Federal Standard (FS1016) speech coder. Once the effectiveness of our LSF-OTCVQ encoders (with weighted distance) was proven in the case of ideal transmissions over noiseless channel, we were interested after in the improvement of their robustnesses for real transmissions over noisy channel. To implicitly protect the transmission indices of our LSF-OTCVQ coders incorporated in the FS1016, we used a joint source-channel coding carried out by the channel optimized vector quantization (CONQ) method. In the case of transmissions over noisy channel, we will show that our new encoding system, called "COVQ-LSF-OTCVQ Encoder", would be able to contribute significantly in the improvement of the FS1016 performances by ensuring a good coding robustness of its LSF spectral parameters.

关键词： signal theory block quantization treillis coding source coding channel coding background noise system robustness speech coding spectrum line coding circuit low rate digital transmission

来源：评论

学校读者我要写书评

暂无评论

The Dispersion of Lossy source coding

The Dispersion of Lossy Source Coding

引用

Data Compression Conference (DCC)

作者： Amir Ingber Yuval Kochman Department of EE-Systems TAU Tel-Aviv Israel EECS Department MIT Cambridge MA USA

In this work we investigate the behavior of the minimal rate needed in order to guarantee a given probability that the distortion exceeds a prescribed threshold, at some fixed finite quantization block length. We show that the excess coding rate above the rate-distortion function is inversely proportional (to the first order) to the square root of the block length. We give an explicit expression for the proportion constant, which is given by the inverse Q-function of the allowed excess distortion probability, times the square root of a constant, termed the excess distortion dispersion. This result is the dual of a corresponding channel coding result, where the dispersion above is the dual of the channel dispersion. The work treats discrete memoryless sources, as well as the quadratic-Gaussian case.

关键词： Dispersion Rate-distortion Distortion measurement Redundancy Channel coding Resource description framework source coding

来源：评论

学校读者我要写书评

暂无评论

Using Distributed source coding to Secure Fingerprint Biometrics

Using Distributed Source Coding to Secure Fingerprint Biomet...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Stark C. Draper Ashish Khisti Emin Martinian Anthony Vetro Jonathan S. Yedidia Mitsubishi Electric Research Laboratories Inc. Cambridge MA USA

We describe a method to encode fingerprint biometrics securely for use, e.g., in encryption or access control. The system is secure because the stored data does not suffice to recreate the original fingerprint biometric. Therefore, a breach in database security does not lead to the loss of biometric data. At the same time the stored data suffices to validate a probe fingerprint. Our approach is based on the use of distributed source coding techniques implemented with graph-based codes. We present a statistical model of the relationship between the enrollment biometric and the (noisy) biometric measurement taking during authentication. We describe how to validate or reject a candidate biometric probe given the probe and the stored encoded data. We report the effectiveness of our method as tested on a database consisting of 579 data sets, each containing roughly 15 measurements of a single finger. We thereby demonstrate a working secure biometric system for fingerprints.

关键词： source coding Fingerprint recognition Biometrics Probes Databases Cryptography Access control Data security Bioinformatics Authentication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：