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

IEEE Workshop on Multimedia Signal Processing

作者： Wei Liu Wenjun Zeng Computer Science Department University of Missouri Columbia Columbia USA

In this paper we propose a bit-plane based, scalable distributed source coding (DSC) scheme for non-binary correlated sources. In the source coding part of DSC, the symbols are quantized and the quantization indices are converted into binary forms using Gray codes. The channel coding part encodes each bit-plane independently using turbo codes. The turbo decoder that works in binary domain is facilitated by an outer loop that captures the symbol-domain correlation. Simulation results show that, in asymmetric DSC of joint Gaussian sources, the overall system performance is greatly improved by using Gray codes. It is also demonstrated that progressive transmission is well supported

关键词： source coding Reflective binary codes Decoding Turbo codes Wireless sensor networks Channel coding Parity check codes Quantization Computer science System performance

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Joint source-channel coding as an element of a QoS framework for '4G' wireless multimedia

引用

COMPUTER COMMUNICATIONS 2004年第8期27卷 762-779页

作者： Guillemot, C Christ, P Inst Natl Rech Informat & Automat IRISA F-35042 Rennes France Univ Stuttgart Ctr Comp D-70550 Stuttgart Germany

The development of 'Beyond 3G'-B3G-or '4G' networks and applications, with all-IP based ubiquitous and seamless service provisioning across heterogeneous infrastructures, presents a number of challenges beyond existing capabilities conceived so far by the IETF for Mobile IP and by the ITU for Third Generation networks. Management, signaling and transport functions must evolve from different link layer technologies, uniformly and end-to-end, to the packet switched IP-network layer. Global mobility throughout all network types requires capability for seamless handover between different administrative and technology domains, extending at the same time the present edge mobility concept to ad-hoc networks and to mobile networks. Having at least identified, if not solved, these important problems, the technical key challenge for this B3G or '4G' world remains to provide IP-based audio and video communications at the same or at least comparable 'carrier class' and bandwidth efficiency as the corresponding circuit-switched subsystems of 3G and 2G. In the IETF, some elements to achieve this goal have been identified and are under discussion: situated between link and IP layers, the Robust Header Compression (ROHC) framework addresses the problems of spectrum and bandwidth scarcity and of bit errors characterizing wireless links. The fact that, for some applications, erroneous packet payloads can be valuable and better to cope with than lost ones, has inspired the introduction of the UDP-lite transport protocol. Assuming ROHC, UDP-lite and an appropriate inter- or cross-layer signaling mechanism in action, this paper is going to elaborate and incorporate the joint source and channel coding-JSCC-paradigm into a complete QoS framework for 4G mobile wireless multimedia communications. (C) 2004 Elsevier B.V. All rights reserved.

关键词： multimedia wireless communication Internet communications compression source coding source-channel coding Robust Header compression

来源：评论

学校读者我要写书评

暂无评论

Fixed rate universal lossy source coding for memoryless sources and rates of convergence

Fixed rate universal lossy source coding for memoryless sour...

引用

IEEE International Symposium on Information Theory

作者： T. Linder G. Lugosi K. Zeger Department of Telecommunications Technical University of Budapest Budapest Hungary Department of Mathematics Faculty of Elect. Engineering Technical University of Budapest Budapest Hungary Coordinated Science Laboratory Department of Elect. and Comp. Engineering University of Illinois Urbana IL USA

A fixed rate universal lossy source coding scheme is introduced for i.i.d. sources. It is shown that as the sample size n grows the per letter distortion obtained using this universal quantizer converges to Shannon's distortion-rate function D(R) in expectation at a rate O(log n/n) for finite alphabet sources and O(/spl radic/(log n/n)) both in expectation and almost surely for bounded real valued sources.< >

关键词： source coding Convergence Mathematics Laboratories Performance loss Distortion measurement Probability

来源：评论

学校读者我要写书评

暂无评论

Universal fixed-to-variable source coding in the finite blocklength regime

Universal fixed-to-variable source coding in the finite bloc...

引用

IEEE International Symposium on Information Theory

作者： Oliver Kosut Lalitha Sankar Department of Electrical Computer and Energy Engineering Arizona State University Tempe AZ USA

A universal source coding problem is considered in the finite blocklength regime for stationary memoryless sources. A new coding scheme is presented that encodes based on the type class size and the empirical support set of the sequence. It is shown that there is no loss in dispersion relative to the case when the source distribution is known. A new bound is obtained on the third order asymptotic coding rate. Numerical results are presented for finite blocklengths comparing the proposed coding scheme with a variety of coding schemes including Lempel-Ziv.

关键词： Entropy Approximation methods source coding Channel coding Redundancy

来源：评论

学校读者我要写书评

暂无评论

Nonparametric distributed sequential detection via universal source coding

Nonparametric distributed sequential detection via universal...

引用

Information Theory and Applications Workshop, ITA

作者： Jithin K. Sreedharan Vinod Sharma Department of Electrical Communication Engineering Indian Institute of Science Bangalore India

We consider nonparametric or universal sequential hypothesis testing when the distribution under the null hypothesis is fully known but the alternate hypothesis corresponds to some other unknown distribution. These algorithms are primarily motivated from spectrum sensing in Cognitive Radios and intruder detection in wireless sensor networks. We use easily implementable universal lossless source codes to propose simple algorithms for such a setup. The algorithms are first proposed for discrete alphabet. Their performance and asymptotic properties are studied theoretically. Later these are extended to continuous alphabets. Their performance with two well known universal source codes, Lempel-Ziv code and KT-estimator with Arithmetic Encoder are compared. These algorithms are also compared with the tests using various other nonparametric estimators. Finally a decentralized version utilizing spatial diversity is also proposed and analysed.

关键词： Entropy Testing Kernel source coding Zinc Sections Redundancy

来源：评论

学校读者我要写书评

暂无评论

Information integrity in lossy source coding with side information

Information integrity in lossy source coding with side infor...

引用

Annual Allerton Conference on Communication, Control, and Computing

作者： Eric Graves Tan F. Wong Army Research Lab Adelphi MD U.S.A. Department of Electrical and Computer Engineering University of Florida Gainesville FL U.S.A.

ISBN: (纸本)9781479980109

In this paper we investigate how to achieve information integrity in two common models of source coding with side information. We first look at the classical Wyner-Ziv problem, where the side information is available only to the decoder, with an adversary whom may arbitrarily change the “bin” index sent to the decoder. Interestingly, it is easy to show that standard Wyner-Ziv coding suffices to guarantee no adversary attack strategy may achieve arbitrarily small probability of fooling the decoder if the side information is correlated with the source. Subsequently, we consider the case where the side information is available also at the encoder, and hence joint source encoding can be performed. Here we show the result of Wyner-Ziv problem also extends to joint encoding without needing the side information to be correlated with the source. Moreover, no loss in the optimal compression rate is incurred in order to guarantee information integrity in either case.

关键词： Decoding Indexes source coding Random variables Zinc Rate-distortion

来源：评论

学校读者我要写书评

暂无评论

On the network-wide gain of memory-assisted source coding

On the network-wide gain of memory-assisted source coding

引用

IEEE (first ITW conference of the year) Information Theory Workshop (ITW)

作者： Mohsen Sardari Ahmad Beirami Faramarz Fekri School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta GA USA

Several studies have identified a significant amount of redundancy in the network traffic. For example, it is demonstrated that there is a great amount of redundancy within the content of a server over time. This redundancy can be leveraged to reduce the network flow by the deployment of memory units in the network. The question that arises is whether or not the deployment of memory can result in a fundamental improvement in the performance of the network. In this paper, we answer this question affirmatively by first establishing the fundamental gains of memory-assisted source compression and then applying the technique to a network. Specifically, we investigate the gain of memory-assisted compression in random network graphs consisted of a single source and several randomly selected memory units. We find a threshold value for the number of memories deployed in a random graph and show that if the number of memories exceeds the threshold we observe network-wide reduction in the traffic.

关键词： source coding Redundancy Servers Context Erbium Conferences

来源：评论

学校读者我要写书评

暂无评论

An optimal distributed and adaptive source coding strategy using rate-compatible punctured convolutional codes

An optimal distributed and adaptive source coding strategy u...

引用

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

作者： Jing Li H. Alqamzi Department of Electrical and Computer Engineering Lehigh University Bethlehem PA USA

A novel scheme exploiting rate-compatible punctured convolutional (RCPC) codes is proposed for distributed and adaptive source coding. The proposed scheme is based on the SF-ISF approach in (Z. Tu et al., Eurasip J. Appl. SigPro. - Special Iss. on Turbo Proc.). It is simple, general, flexible, and provenly optimal. For the class of RCPC codes that are obtained from puncturing the parity bits of a recursive systematic convolutional (RSC) mother code, it is shown that an "optimal" codec exists where a single source encoder and a single source decoder can accomodate a set of different compression rates efficiently.

关键词： source coding Convolutional codes Convolution Decoding Channel coding Codecs Signal processing Power generation economics Materials science and technology Hardware

来源：评论

学校读者我要写书评

暂无评论

Discrete utterance recognition based upon source coding techniques

Discrete utterance recognition based upon source coding tech...

引用

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

作者： A. Buzo H. Martinez C. Rivera Facultad de Ingeniería University Nac. Aut. de México Mexico Instituto de Investigaciones Eléctricas

A speaker-independent isolated word recognition system is described which is based on some techniques and results from rate-distortion speech coders. The recognition system can be viewed as a minimum distortion or nearest-neighbor system where the distortion measure is defined between an observed sequence of frames of speech and a reference pattern. The patterns are sequences of sets of LPC models. Every one of the sets of each pattern consist of a collection of LPC models that "best" reproduces a given frame of a word from a training sequence. The Itakura Saito distortion measure is used to design the system (or selection of the patterns) and for the decision step.

关键词： source coding Distortion measurement Speech enhancement Speech coding Dictionaries Encoding Linear predictive coding Costs Noise measurement Digital filters

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：