نتایج جستجو برای: robust multiterminal source coding

تعداد نتایج: 730332  

2006
Akisato Kimura Tomohiko Uyematsu

We present an information-thoeretical viewpoint for similarity-based retrieval along with index structures. This retrieval system has two stages: pruning data items based on the index structures, and matching surviving data items. The first stage is modeled as the Wyner-Ziv problem, while the second stage is considered as a coding problem where some of the decording results are available as par...

Journal: :EURASIP J. Adv. Sig. Proc. 2013
Te-Lung Kung Keshab K. Parhi

Studies related to the network source coding have addressed rate-distortion analysis in both noiseless and noisy channels. However, to the best of authors’ knowledge, no prior work has studied network source coding in the context of orthogonal frequency division multiplexing (OFDM) systems. In addition, the system performance using network source coding schemes also remains unknown. In this art...

2011
Ram Zamir

At the birth of information theory, Shannon surprised the communication world with the concept of random coding, which he used for proving the ultimate limits of his theory. This powerful tool is, however, nonconstructive. In Shannon’s words: “An attempt to obtain a good approximation to ideal coding by following the method of the proof is generally impractical... related to the difficulty of g...

2014
Thomas A. Courtade Jiantao Jiao Tsachy Weissman

We pose the following extremal conjecture: Let X,Y be jointly Gaussian random variables with linear correlation ρ. For any random variables U, V for which U,X, Y, V form a Markov chain, in that order, we conjecture that: 2−2[I(X;V )+I(Y ;U)] ≥ (1− ρ2)2−2I(U ;V ) + ρ22−2[I(X;U)+I(Y ;V . By letting V be constant, we see that this inequality generalizes a well-known extremal result proved by Ooham...

2006
Aaron B. Wagner Venkat Anantharam

We prove a new outer bound on the rate-distortion region for the multiterminal source-coding problem. This bound subsumes the best outer bound in the literature and improves upon it strictly in some cases. The improved bound enables us to obtain a new, conclusive result for the binary erasure version of the “CEO problem.” The bound recovers many of the converse results that have been establishe...

2002
Jean Cardinal Gilles Van Assche

We study the design of entropy-constrained multiterminal quantizers for coding two correlated continuous sources. Two design algorithms are presented, both optimizing a Lagrangian cost measure involving distortions and information rates.

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه بیرجند - دانشکده مهندسی برق و کامپیوتر 1391

در این پایان نامه اثر علیت بر مسایل ترکیب توام کدینگ منبع و کانال(jscc) برای ارسال ویدیو در در کانال بیسیم بررسی میگردد. ابتدا کارایی روش jscc بر روی کدینگ ویدیو سری h ، h.264 در کانال بی سیم بررسی می شود. در این روش، بر اساس نرخ بیت ارسال و همچنین اطلاعات علّی وضعیت کانال در دسترس فرستندهcsit) causal) که به واسطه فیدبک در دسترس آن قرار می-گیرد. نرخ بیت بهینه به کدینگ منبع و کانال اختصاص داده می...

2002
Bin Yu

In multiterminal estimation the basic theoretical question is to prove the existence of encod ing and decoding schemes that can achieve a certain rate of compression while resulting in a particular statistical estimation e ciency This is by comparison a much less studied eld than multiterminal source coding Essentially only two approaches have been reported Zhang and Berger established an upper...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید