2008 Information Theory and Applications Workshop最新文献_第3页

Achievable rate region and optimality of multi-hop wireless 802.11-scheduled networks 多跳无线802.11计划网络的可达速率区域和最优性

2008 Information Theory and Applications Workshop Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601059

A. Jindal, K. Psounis

引用次数: 14

Localization and identification in networks using robust identifying codes 基于鲁棒识别码的网络定位与识别

2008 Information Theory and Applications Workshop Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601043

Moshe Laifenfeld

引用次数: 4

Optimal causal quantization of Markov Sources with distortion constraints 带失真约束的马尔可夫源的最优因果量化

2008 Information Theory and Applications Workshop Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601015

S. Yuksel, T. Başar, S. Meyn

{"title":"Optimal causal quantization of Markov Sources with distortion constraints","authors":"S. Yuksel, T. Başar, S. Meyn","doi":"10.1109/ITA.2008.4601015","DOIUrl":"https://doi.org/10.1109/ITA.2008.4601015","url":null,"abstract":"For Markov sources, the structure of optimal causal encoders minimizing the total communication rate subject to a mean-square distortion constraint is studied. The class of sources considered lives in a continuous alphabet, and the encoder is allowed to be variable-rate. Both the finite-horizon and the infinite-horizon problems are considered. In the finite-horizon case, the problem is non-convex, whereas in the infinite-horizon case the problem can be convexified under certain assumptions. For a finite horizon problem, the optimal deterministic causal encoder for a kth-order Markov source uses only the most recent k source symbols and the information available at the receiver, whereas the optimal causal coder for a memoryless source is memoryless. For the infinite-horizon problem, a convex-analytic approach is adopted. Randomized stationary quantizers are suboptimal in the absence of common randomness between the encoder and the decoder. If there is common randomness, the optimal quantizer requires the randomization of at most two deterministic quantizers. In the absence of common randomness, the optimal quantizer is non-stationary and a recurrence-based time-sharing of two deterministic quantizers is optimal. A linear source driven by Gaussian noise is considered. If the process is stable, innovation coding is almost optimal at high-rates, whereas if the source is unstable, then even a high-rate time-invariant innovation coding scheme leads to an unstable estimation process.","PeriodicalId":345196,"journal":{"name":"2008 Information Theory and Applications Workshop","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134400782","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 11

Cellular systems with multicell processing and conferencing links between mobile stations 在移动站之间具有多小区处理和会议连接的蜂窝系统

2008 Information Theory and Applications Workshop Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601074

O. Simeone, O. Somekh, G. Kramer, H. Poor, S. Shamai

引用次数: 2

Bayesian network structure learning using factorized NML universal models 使用因式NML通用模型的贝叶斯网络结构学习

2008 Information Theory and Applications Workshop Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601061

Teemu Roos, T. Silander, P. Kontkanen, P. Myllymäki

引用次数: 39

A note on convergence rate of constrained capacity estimation algorithms over ISI channels ISI信道上受限容量估计算法的收敛速度

2008 Information Theory and Applications Workshop Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601026

T. Duman, Junshan Zhang

引用次数: 2

Algorithms and bounds for sensing capacity and compressed sensing with applications to learning graphical models 感知能力和压缩感知的算法和边界及其在学习图形模型中的应用

2008 Information Theory and Applications Workshop Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601065

S. Aeron, Manqi Zhao, Venkatesh Saligrama

引用次数: 6

Source coding and transmission under common knowledge constraints 常识约束下的源编码与传输

2008 Information Theory and Applications Workshop Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601078

Yossef Steinberg

{"title":"Source coding and transmission under common knowledge constraints","authors":"Yossef Steinberg","doi":"10.1109/ITA.2008.4601078","DOIUrl":"https://doi.org/10.1109/ITA.2008.4601078","url":null,"abstract":"This work studies problems of source coding under the requirement that the encoder can produce an exact copy of the compressed source constructed by the decoder. This requirement, termed here as a common knowledge constraint, is satisfied automatically in rate-distortion theory for single sources. However, in the common formulation of problems of lossy source coding with side information at the decoder (the Wyner-Ziv problem), distributed source coding, and joint source-channel coding for networks, the destination can exploit the information it receives in a manner that cannot be exactly reproduced at the sender side. Some applications, like the transmission of sensitive medical information, may require that both sides - the sender and the receiver - will share a common version of the compressed data, for the purpose of future discussions or consulting. The purpose of this work is to study the implications of common knowledge constraints on the achievable rates in scenarios of lossy source coding. A single letter characterization of the rate distortion function is developed, for the problem of source coding with side information at the decoder, under a common knowledge constraint. Implications of this constraint on problems of joint source channel coding for the degraded broadcast channel are studied. Specifically, it is shown that in this setup, a scheme based on separation achieves optimal distortions.","PeriodicalId":345196,"journal":{"name":"2008 Information Theory and Applications Workshop","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116233162","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

The price of certainty: iterative decoding from a total power perspective 确定性的代价:从总功率角度进行迭代解码

2008 Information Theory and Applications Workshop Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601064

A. Sahai, P. Grover

{"title":"The price of certainty: iterative decoding from a total power perspective","authors":"A. Sahai, P. Grover","doi":"10.1109/ITA.2008.4601064","DOIUrl":"https://doi.org/10.1109/ITA.2008.4601064","url":null,"abstract":"The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the power consumption small. Traditionally, explicit power-dependent (idealized) models for the communication channel are used to study the transmit power required. The resulting dasiawaterfallpsila curves convey the revolutionary idea that unboundedly low probabilities of bit-error are attainable using only finite transmit power. However, it has long been observed that the decoder complexity, and hence the total power consumption, goes up when attempting to use codes that operate close to the waterfall curve. This paper explores this theme by using explicit models for computation and power consumption at the decoder. To get a lower bound, an ASIC-oriented model is given that allows for extreme parallelism in implementation. The decoder architecture is in the spirit of iterative decoding for sparse-graph codes, but is further idealized in that it allows for more computational power than is currently known to be implementable. Generalized sphere-packing arguments are used to derive bounds on the number of decoding iterations needed for any possible code given only the rate and the desired probability of error. The lower bound is plotted to show an unavoidable tradeoff between the average bit-error probability and the total power used in transmission and decoding. In the spirit of conventional waterfall curves, we call these ldquowatersliderdquo curves.","PeriodicalId":345196,"journal":{"name":"2008 Information Theory and Applications Workshop","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128122064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

On sequential analog-to-digital conversion with low-precision components 低精度元件的顺序模数转换

2008 Information Theory and Applications Workshop Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601045

J. Biveroni, Hans-Andrea Loeliger

引用次数: 5