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

Dynamic State Aware Adaptive source coding for Networked Control in Cyberphysical Systems

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2017年第11期66卷 10000-10010页

作者： Li, Liang Song, Ju Bin Li, Husheng Univ Tennessee Dept Elect Engn & Comp Sci Knoxville TN 37996 USA Kyung Hee Univ Dept Elect Engn Seoul 02447 South Korea

A source coding (quantization) scheme is studied for the feedback of discrete-time and continuous-state cyber-physical systems (CPSs). It is formulated as a sequential coding optimization problem. The goal is to find a deterministic but adaptive policy, as a series of mappings from the historical information to the quantization strategy. In particular, an optimization problem is formulated, and then solved by the Bellman equation in dynamic programming (DP). To overcome the challenge of continuous state space, a practical solution is proposed by leveraging the approximate DP (ADP). The performance of the proposed strategy is examined for both scalar and vector dynamical systems in two practical applications. It shows that the designed policy can significantly outperform the simple fixed quantization strategies in CPSs and can be applied to the mobile/vehicle communication.

关键词： Cyber-physical systems dynamic programming source coding state estimation

来源：评论

学校读者我要写书评

暂无评论

A SURVEY OF THE THEORY OF source-coding WITH A FIDELITY-CRITERION

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1993年第5期39卷 1473-1490页

作者： KIEFFER, JC UNIV MINNESOTA CONTROL SCI & DYNAM SYST PROGRAM MINNEAPOLIS MN USA

The purpose of this paper is threefold: 1) to acquaint the reader with the types of problems that have been considered in the area of source coding with a fidelity criterion;2) to survey results that have been obtaine... 详细信息

关键词： source coding DATA COMPRESSION RATE DISTORTION THEORY DISTORTION MEASURE FIDELITY CRITERION QUANTIZATION

来源：评论

学校读者我要写书评

暂无评论

source coding with in-Block Memory and Controllable Causal Side Information

Source Coding with in-Block Memory and Controllable Causal S...

引用

IEEE International Symposium on Information Theory Proceedings (ISIT)

作者： Simeone, Osvaldo New Jersey Inst Technol Newark NJ 07102 USA

ISBN: (纸本)9781479904464

The recently proposed set-up of source coding with a side information "vending machine" allows the decoder to select actions in order to control the quality of the side information. The actions can depend on the message received from the encoder and on the previously measured samples of the side information, and are cost constrained. Moreover, the final estimate of the source by the decoder is a function of the encoder's message and depends causally on the side information sequence. Previous work by Permuter and Weissman has characterized the rate-distortioncost function in the special case in which the source and the "vending machine" are memoryless. In this work, motivated by the related channel coding model introduced by Kramer, the ratedistortion- cost function characterization is extended to a model with in-block memory. Various special cases are studied including block-feedforward and side information repeat request models.

关键词： source coding block memory side information "vending machine" feedforward directed mutual information

来源：评论

学校读者我要写书评

暂无评论

source coding with Side Information at the Decoder: Models with Uncertainty, Performance Bounds, and Practical coding Schemes

Source Coding with Side Information at the Decoder: Models w...

引用

International Symposium on Information Theory and its Applications (ISITA)

作者： Dupraz, Elsa Roumy, Aline Kieffer, Michel Univ Paris 11 SUPELEC CNRS LSS F-91192 Gif Sur Yvette France

ISBN: (纸本)9784885522673

We consider the problem of source coding with side information ( SI) at the decoder only, when the joint distribution between the source and the SI is not perfectly known. Four parametric models for this joint distribution are considered, where uncertainty about the distribution is turned into uncertainty about the value of the parameters. More precisely, a prior distribution for the parameters may or may not be available. Moreover, the value of the parameters may either change at every symbol or remain constant for a while. This paper overviews the results on the performance of lossless source coding with SI at the decoder for the four models. The way LDPC-based encoding and decoding schemes should be designed to cope with model uncertainty is provided. Most of the proposed practical schemes perform close to the theoretical limits.

关键词： source coding decoders On-Site Inspections Silicon International System of Units lossless source coding decoding scheme distributed parameter Uncertainty model uncertainty

来源：评论

学校读者我要写书评

暂无评论

Minimum Expected Distortion in Gaussian source coding With Fading Side Information

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2012年第9期58卷 5725-5739页

作者： Ng, Chris T. K. Tian, Chao Goldsmith, Andrea J. Shamai (Shitz), Shlomo Stanford Univ Dept Elect Engn Stanford CA 94305 USA AT&T Labs Res Florham Pk NJ 07932 USA Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

An encoder, subject to a rate constraint, wishes to describe a Gaussian source under squared-error distortion. The decoder, besides receiving the encoder's description, also observes side information consisting of uncompressed source symbol subject to slow fading and noise. The decoder knows the fading realization but the encoder knows only its distribution. The rate-distortion function that simultaneously satisfies the distortion constraints for all fading states was derived by Heegard and Berger. A layered encoding strategy is considered in which each codeword layer targets a given fading state. When the side-information channel has two discrete fading states, the expected distortion is minimized by optimally allocating the encoding rate between the two codeword layers. For multiple fading states, the minimum expected distortion is formulated as the solution of a convex optimization problem with linearly many variables and constraints. Through a limiting process on the primal and dual solutions, it is shown that single-layer rate allocation is optimal when the fading probability density function is continuous and quasiconcave (e.g., Rayleigh, Rician, Nakagami, and log-normal). In particular, under Rayleigh fading, the optimal single codeword layer targets the least favorable state as if the side information was absent.

关键词： Convex optimization distortion minimization fading channel Heegard-Berger rate-distortion function side information source coding

来源：评论

学校读者我要写书评

暂无评论

Explicit Wiretap Channel Codes via source coding, Universal Hashing, and Distribution Approximation, When the Channels' Statistics are Uncertain

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2023年 18卷 117-132页

作者： Chou, Remi A. A. Wichita State Univ Dept Elect Engn & Comp Sci Wichita KS 67260 USA

We consider wiretap channels with uncertainty on the eavesdropper channel under (i) noisy blockwise type II, (ii) compound, or (iii) arbitrarily varying models. We present explicit wiretap codes that can handle these models in a unified manner and only rely on three primitives, namely source coding with side information, universal hashing, and distribution approximation. Our explicit wiretap codes achieve the best known single-letter achievable rates, previously obtained non-constructively, for the models considered. Our results are obtained for strong secrecy, do not require a pre-shared secret between the legitimate users, and do not require any symmetry properties on the channel. An extension of our results to compound main channels is also derived via new capacity-achieving polar coding schemes for compound settings.

关键词： Compound wiretap channel arbitarily varying wiretap channel polar codes source coding universal hashing

来源：评论

学校读者我要写书评

暂无评论

source coding with Conditionally Less Noisy Side Information

Source Coding with Conditionally Less Noisy Side Information

引用

IEEE Information Theory Workshop (ITW)

作者： Timo, Roy Oechtering, Tobias J. Wigger, Michele Univ S Australia Inst Telecommun Res Adelaide SA 5001 Australia Access Linnaeus Ctr KTH Royal Inst Technol Stockholm Sweden Telecom ParisTech Comm & Elect Dept Paris France

ISBN: (纸本)9781467302234;9781467302241

We consider a lossless multi-terminal source coding problem with one transmitter, two receivers and side information. The achievable rate region of the problem is not well understood. In this paper, we characterise the rate region when the side information at one receiver is conditionally less noisy than the side information at the other, given this other receiver's desired source. The conditionally less noisy definition includes degraded side information and a common message as special cases, and it is motivated by the concept of less noisy broadcast channels. The key contribution of the paper is a new converse theorem employing a telescoping identity and the Csiszar sum identity.

关键词： side information source coding Noise Receivers

来源：评论

学校读者我要写书评

暂无评论

source coding with Side Information for Error Free Perfect Secrecy Systems

Source Coding with Side Information for Error Free Perfect S...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Ho, Siu-Wai Lai, Lifeng Grant, Alex Univ S Australia Inst Telecommun Res Adelaide SA 5001 Australia Worcester Polytech Inst Dept Elect & Comp Engn Worcester MA 01609 USA

ISBN: (纸本)9781479904464

This paper considers source coding problems with the requirements of perfect secrecy and zero error at receivers. In the problems considered in this paper, there is always one transmitter but there can be one or two receivers. Two different scenarios depending on whether the receivers' side information are present at the transmitter or not are considered. By deriving bounds on the probability masses of the cipher-text and the key, the minimum transmission rate and key rate are characterized. Although zero-error capacities are typically difficult to characterize, the perfect secrecy constraint turns out to be the key that simplifies the problems considered in this paper and makes them analytically tractable.

关键词： probability radio receivers radio transmitters source coding

来源：评论

学校读者我要写书评

暂无评论

Reliability in source coding With Side Information

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2012年第8期58卷 5086-5111页

作者： Kelly, Benjamin G. Wagner, Aaron B. Cornell Univ Sch Elect & Comp Engn Ithaca NY 14853 USA

We study error exponents for source coding with side information. Both achievable exponents and converse bounds are obtained for the following two cases: lossless source coding with coded information and lossy source coding with full side information (Wyner-Ziv). These results recover and extend several existing results on source-coding error exponents and are tight in some circumstances. Our bounds have a natural interpretation as a two-player game between nature and the code designer, with nature seeking to minimize the exponent and the code designer seeking to maximize it. In the Wyner-Ziv problem, our analysis exposes a tension in the choice of test channel with the optimal test channel balancing two competing error events. The Gaussian and binary-erasure cases are examined in detail.

关键词： Error exponents side information source coding test channel optimization Wyner-Ziv problem

来源：评论

学校读者我要写书评

暂无评论

The minimax distortion redundancy in noisy source coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2003年第11期49卷 3020-3030页

作者： Dembo, A Weissman, T Stanford Univ Dept Stat Stanford CA 94305 USA Stanford Univ Dept Math Stanford CA 94305 USA Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel Hewlett Packard Labs Palo Alto CA USA

Consider the problem of finite-rate filtering of a discrete memoryless process {X-i}(igreater than or equal to1) based on its noisy observation sequence {Z(i)}(igreater than or equal to1), which is the output of a discrete memoryless channel (DMC) whose input is {X-i}(igreater than or equal to1). When the distribution of the pairs (X-i, Z(i)), P-X,P-Z, is known, and for a given distortion measure, the solution to this problem is well known to be given by classical rate-distortion theory upon the introduction of a modified distortion measure. In this work, we address the case where P-X,P-Z, rather than being completely specified, is only known to belong to some set Lambda. For a fixed encoding rate R, we look at the worst case, over all theta epsilon Lambda, of the difference between the expected distortion of a given scheme which is not allowed to depend on the active source theta epsilon Lambda and the value of the distortion-rate function at R corresponding to the noisy source theta. We study the minimum attainable value achievable by any scheme operating at rate R for this worst case quantity, denoted by D(Lambda, R). Linking this problem and that of source coding under several distortion measures, we prove a coding theorem for the latter problem and apply it to characterize D(Lambda, R) for the case where all members of Lambda share the same noisy marginal. For the case of a general Lambda, we obtain a single-letter characterization of D(Lambda, R) for the finite-alphabet case. This gives, in particular, a necessary and sufficient condition on the set Lambda for the existence of a coding scheme which is universally optimal for all members of Lambda and characterizes the approximation-estimation tradeoff for statistical modeling of noisy source coding problems. Finally, we obtain D(Lambda, R) in closed form for cases where Lambda consists of distributions on the (channel) input-output pair of a Bernoulli source corrupted by a binary-symmetric channel (BSC). In pa

关键词： approximation-estimation tradeoff denoising lossy source coding minimax distortion redundancy noisy sources

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：