发布求助
文献互助 智能选刊 最新文献

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)最新文献

筛选
英文 中文
LP decoding meets LP decoding: A connection between channel coding and compressed sensing LP解码与LP解码:信道编码与压缩感知之间的连接
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394826
A. Dimakis, P. Vontobel
{"title":"LP decoding meets LP decoding: A connection between channel coding and compressed sensing","authors":"A. Dimakis, P. Vontobel","doi":"10.1109/ALLERTON.2009.5394826","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394826","url":null,"abstract":"This is a tale of two linear programming decoders, namely channel coding linear programming decoding (CC-LPD) and compressed sensing linear programming decoding (CS-LPD). So far, they have evolved quite independently. The aim of the present paper is to show that there is a tight connection between, on the one hand, CS-LPD based on a zero-one measurement matrix over the reals and, on the other hand, CC-LPD of the binary linear code that is obtained by viewing this measurement matrix as a binary parity-check matrix. This connection allows one to translate performance guarantees from one setup to the other.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128585179","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}
引用次数: 44
Solving low-rank matrix completion problems efficiently 有效求解低秩矩阵补全问题
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394884
D. Goldfarb, Shiqian Ma, Zaiwen Wen
{"title":"Solving low-rank matrix completion problems efficiently","authors":"D. Goldfarb, Shiqian Ma, Zaiwen Wen","doi":"10.1109/ALLERTON.2009.5394884","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394884","url":null,"abstract":"We present several first-order algorithms for solving the low-rank matrix completion problem and the tightest convex relaxation of it obtained by minimizing the nuclear norm instead of the rank of the matrix. Our first algorithm is a fixed point continuation algorithm that incorporates an approximate singular value decomposition procedure (FPCA). FPCA can solve large matrix completion problems efficiently and attains high rates of recoverability. For example, FPCA can recover 1000 by 1000 matrices of rank 50 with a relative error of 10−5 in about 3 minutes by sampling only 20% of the elements. We know of no other method that achieves as good recoverability. Our second algorithm is a row by row method for solving a semidefinite programming reformulation of the nuclear norm matrix completion problem. This method produces highly accurate solutions to fairly large nuclear norm matrix completion problems efficiently. Finally, we introduce an alternating direction approach based on the augmented Lagrangian framework.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129091027","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}
引用次数: 21
Distortion exponent for multiple description coding 多描述编码的失真指数
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394530
Songqing Zhao, Daniela Tuninetti, R. Ansari, D. Schonfeld
{"title":"Distortion exponent for multiple description coding","authors":"Songqing Zhao, Daniela Tuninetti, R. Ansari, D. Schonfeld","doi":"10.1109/ALLERTON.2009.5394530","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394530","url":null,"abstract":"Distortion exponent has been proposed as performance measure to characterize how fast the average distortion decays to zero when the SNR increases to infinity. The distortion exponent for Multiple Description Coding (MDC) has only been investigated for two descriptions and symmetric SNR. In this paper, we consider the case of any number of descriptions and asymmetric SNR. We derive an achievable distortion exponent for MDC with N ≥3 description and an upper bound for the distortion exponent for N =3. Our results are based on an high-SNR approximation which we named noise cancellation method. We also consider a special case of our noise cancellation approximation method which we refer to as equal correlation. For each method, the distortion exponent is obtained as the solution of a linear program. Numerical results verify the validity of our approximation method.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117011577","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}
引用次数: 3
Noisy group testing: An information theoretic perspective 噪声群测试:信息论视角
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394787
George K. Atia, Venkatesh Saligrama
{"title":"Noisy group testing: An information theoretic perspective","authors":"George K. Atia, Venkatesh Saligrama","doi":"10.1109/ALLERTON.2009.5394787","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394787","url":null,"abstract":"The fundamental task of group testing is to recover a small distinguished subset of items from a large group while efficiently reducing the total number of tests (measurements). The key contribution of this paper is in adopting a new information-theoretic perspective on group testing problems. Establishing its connection to Shannon-coding theory, we formulate the group testing problem as a channel coding/decoding problem and derive a unifying result that reduces many of the interesting questions to computation of a mutual information expression. This result is fairly general; it allows us to verify existing bounds for some of the known scenarios and extend the analysis to many new interesting setups including noisy versions of group testing. Among the models we consider are the deterministic noise-free case, approximate reconstruction with bounded distortion, additive measurement noise, and dilution models.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114426279","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}
引用次数: 19
P2P streaming capacity: Survey and recent results P2P流媒体容量:调查和最新结果
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394790
Minghua Chen, M. Chiang, P. Chou, Jin Li, Shao Liu, S. Sengupta
{"title":"P2P streaming capacity: Survey and recent results","authors":"Minghua Chen, M. Chiang, P. Chou, Jin Li, Shao Liu, S. Sengupta","doi":"10.1109/ALLERTON.2009.5394790","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394790","url":null,"abstract":"Peer-to-peer (P2P) systems provide a scalable way to stream content to multiple receivers over the Internet and has become a major type of application traffic. The maximum rate achievable by all receivers is the capacity of a P2P streaming session. We provide a taxonomy of the problem formulations. In each formulation, computing P2P streaming capacity requires the computation of an optimal set of multicast trees, generally with an exponential complexity. We survey the family of constructive, polynomial-time algorithms that can compute P2P streaming capacity and the associated multicast trees, arbitrarily accurately for some of the formulations, and to some approximation factors in other formulations. Performance evaluation using large-scale Internet trace is provided before open problems in this research area are discussed.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114683647","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}
引用次数: 9
Interference alignment via random codes and he capacity of a class of deterministic interference channels 随机码干扰对准与一类确定性干扰信道的容量
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394842
V. Cadambe, S. Jafar
{"title":"Interference alignment via random codes and he capacity of a class of deterministic interference channels","authors":"V. Cadambe, S. Jafar","doi":"10.1109/ALLERTON.2009.5394842","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394842","url":null,"abstract":"We study the capacity of a class of deterministic discrete memoryless interference channels. Recent studies show that, in general, interference alignment is required to achieve capacity in interference channels. While interference alignment in general needs structured coding, we identify two scenarios where random coding achieves capacity and leads to single-letter capacity characterizations in deterministic interference channels. The first scenario is a noisy interference regime, where we show that interference can be aligned with random codes, obviating the need of structured codes. The second scenario is over the many-to-one interference channels where alignment is precluded because the multiple interferers are resolvable at the receiver which faces interference.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127012879","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}
引用次数: 7
Reaching consensus in wireless networks with probabilistic broadcast 利用概率广播在无线网络中达成共识
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394935
T. C. Aysal, A. Sarwate, A. Dimakis
{"title":"Reaching consensus in wireless networks with probabilistic broadcast","authors":"T. C. Aysal, A. Sarwate, A. Dimakis","doi":"10.1109/ALLERTON.2009.5394935","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394935","url":null,"abstract":"Reaching consensus in a network is an important problem in control, estimation, and resource allocation. While many algorithms focus on computing the exact average of the initial values in the network, in some cases it is more important for nodes to reach a consensus quickly. In a distributed system establishing two-way communication may also be difficult or unreliable. In this paper, the effect of the wireless medium on simple consensus protocol is explored. In a wireless environment, a node's transmission is a broadcast to all nodes which can hear it, and due to signal propagation effects, the neighborhood size may change with time. A class of non-sum preserving algorithms involving unidirectional broadcasting is extended to a time-varying connection model. This algorithm converges almost surely and its expected consensus value is the true average. A simple bound is given on the convergence time.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125751332","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}
引用次数: 27
Universal capacity of channels with given rate-distortion in absence of common randomness, and failure of universal source-channel separation 在没有共同随机性的情况下，具有给定速率失真的信道的通用容量，以及通用源信道分离的失败
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394931
Mukul Agarwal, Swastik Kopparty, S. Mitter
{"title":"Universal capacity of channels with given rate-distortion in absence of common randomness, and failure of universal source-channel separation","authors":"Mukul Agarwal, Swastik Kopparty, S. Mitter","doi":"10.1109/ALLERTON.2009.5394931","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394931","url":null,"abstract":"Recently, [3] studied the universal capacity of a set of channels where each channel in the set communicates a random source to within a distortion level D, when the transmitter and receiver have access to common randomness. In this paper, we study the universal capacity for this channel set in the case when there is no access to common randomness. We show that when the distortion level D is positive, the universal capacity is 0. This also leads to the conclusion that universal source-channel separation for rate-distortion as stated in [4], is false.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125080734","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}
引用次数: 0
Graph covers and quadratic minimization 图覆盖和二次最小化
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394484
Nicholas Ruozzi, J. Thaler, S. Tatikonda
{"title":"Graph covers and quadratic minimization","authors":"Nicholas Ruozzi, J. Thaler, S. Tatikonda","doi":"10.1109/ALLERTON.2009.5394484","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394484","url":null,"abstract":"We formulate a new approach to understanding the behavior of the min-sum algorithm by exploiting the properties of graph covers. First, we present a new, natural characterization of scaled diagonally dominant matrices in terms of graph covers; this result motivates our approach because scaled diagonal dominance is a known sufficient condition for the convergence of min-sum in the case of quadratic minimization. We use our understanding of graph covers to characterize the periodic behavior of the min-sum algorithm on a single cycle. Lastly, we explain how to extend the single cycle results to understand the 2-periodic behavior of min-sum for general pairwise MRFs. Some of our techniques apply more broadly, and we believe that by capturing the notion of indistinguishability, graph covers represent a valuable tool for understanding the abilities and limitations of general message-passing algorithms.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123761458","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}
引用次数: 15
Rateless codes for single-server streaming to diverse users 单服务器流到不同用户的无速率代码
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394508
Yao Li, E. Soljanin
{"title":"Rateless codes for single-server streaming to diverse users","authors":"Yao Li, E. Soljanin","doi":"10.1109/ALLERTON.2009.5394508","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394508","url":null,"abstract":"We investigate the performance of rateless codes for single-server streaming to diverse users, assuming that diversity in users is present not only because they have different channel conditions, but also because they demand different amounts of information and have different decoding capabilities. The LT encoding scheme is employed. While some users accept output symbols of all degrees and decode using belief propagation, others only collect degree-1 output symbols and run no decoding algorithm. We propose several performance measures, and optimize the performance of the rateless code used at the server through the design of the code degree distribution. Optimization problems are formulated for the asymptotic regime and solved as linear programming problems. Optimized performance shows great improvement in total bandwidth consumption over using the conventional ideal soliton distribution, or simply sending separately encoded streams to different types of user nodes. Simulation experiments confirm the usability of the optimization results obtained for the asymptotic regime as a guideline for finite-length code design.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121852390","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}
引用次数: 15
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信