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

筛选
英文 中文
A restricted isometry property for structurally-subsampled unitary matrices 结构次抽样酉矩阵的限制等距性质
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394883
W. Bajwa, A. Sayeed, R. Nowak
{"title":"A restricted isometry property for structurally-subsampled unitary matrices","authors":"W. Bajwa, A. Sayeed, R. Nowak","doi":"10.1109/ALLERTON.2009.5394883","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394883","url":null,"abstract":"Subsampled (or partial) Fourier matrices were originally introduced in the compressive sensing literature by Candès et al. Later, in papers by Candès and Tao and Rudelson and Vershynin, it was shown that (random) subsampling of the rows of many other classes of unitary matrices also yield effective sensing matrices. The key requirement is that the rows of U, the unitary matrix, must be highly incoherent with the basis in which the signal is sparse. In this paper, we consider acquisition systems that — despite sensing sparse signals in an incoherent domain — cannot randomly subsample rows from U. We consider a general class of systems in which the sensing matrix corresponds to subsampling of the rows of matrices of the form Φ = RU (instead of U), where R is typically a low-rank matrix whose structure reflects the physical/technological constraints of the acquisition system. We use the term “structurally-subsampled unitary matrices” to describe such sensing matrices. We investigate the restricted isometry property of a particular class of structurally-subsampled unitary matrices that arise naturally in application areas such as multiple-antenna channel estimation and sub-nyquist sampling. In addition, we discuss an immediate application of this work in the area of wireless channel estimation, where the main results of this paper can be applied to the estimation of multiple-antenna orthogonal frequency division multiplexing channels that have sparse impulse responses.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"21 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":"130460669","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}
引用次数: 26
On systematic design of universally capacity approaching rate-compatible sequences of LDPC code ensembles over binary-input output-symmetric memoryless channels 二进制输入输出对称无记忆信道上LDPC码集普遍容量接近速率兼容序列的系统设计
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394793
H. Saeedi, H. Pishro-Nik, A. Banihashemi
{"title":"On systematic design of universally capacity approaching rate-compatible sequences of LDPC code ensembles over binary-input output-symmetric memoryless channels","authors":"H. Saeedi, H. Pishro-Nik, A. Banihashemi","doi":"10.1109/ALLERTON.2009.5394793","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394793","url":null,"abstract":"Despite tremendous amount of research on the design of Low-Density Parity-Check (LDPC) codes with belief propagation decoding over different types of Binary-Input Output-Symmetric Memoryless (BIOSM) channels, most results on this topic are based on numerical methods and optimization which do not provide much insight into the design process. In particular, systematic design of provably capacity achieving sequences of LDPC code ensembles over the general class of BIOSM channels, has remained a fundamental open problem. For the case of the Binary Erasure channel, explicit construction of capacity achieving sequences have been proposed based on a property called the flatness condition. In this paper, we propose a systematic method to design universally capacity approaching rate-compatible LDPC code ensemble sequences over BIOSM channels. This is achieved by interpreting the flatness condition over the BEC, as a Successive Maximization (SM) principle that is generalized to other BIOSM channels to design a sequence of capacity approaching ensembles called the parent sequence. The SM principle is then applied to each ensemble within the parent sequence, this time to design rate-compatible puncturing schemes. As part of our results, we extend the stability condition which was previously derived for degree-2 variable nodes to other variable node degrees as well as to the case of rate-compatible codes. Consequently, we rigorously prove that using the SM principle, one is able to design universally capacity achieving rate-compatible LDPC code ensemble sequences over the BEC. Unlike the previous results on such schemes over the BEC in the literature, the proposed SM approach is naturally extendable to other BIOSM channels. The performance of the rate-compatible schemes designed based on our systematic method is comparable to those designed by optimization.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"7 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":"125379009","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}
引用次数: 2
Neighbor discovery in mobile ad hoc networks using an abstract MAC layer 基于抽象MAC层的移动自组网邻居发现
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394502
Alejandro Cornejo, N. Lynch, Saira Viqar, J. Welch
{"title":"Neighbor discovery in mobile ad hoc networks using an abstract MAC layer","authors":"Alejandro Cornejo, N. Lynch, Saira Viqar, J. Welch","doi":"10.1109/ALLERTON.2009.5394502","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394502","url":null,"abstract":"We explore the problem of neighbor discovery in a mobile ad hoc network environment. We describe a protocol for learning about neighboring nodes in such an environment. The protocol is used for establishing and tearing down communication links with neighboring nodes as they move from one region of the network to another. The protocol is implemented on top of the abstract MAC layer service presented in [4], which provides reliable message delivery within the local neighborhood and also provides the sender with an acknowledgment when all neighboring nodes have received a message. There is an upper bound, guaranteed by the abstract MAC layer service, on the worst case delay that a message can experience before it is received or acknowledged. We determine the time complexity of the neighbor discovery protocol in terms of the bounded delays provided by the underlying abstract MAC layer.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"75 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":"125447321","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}
引用次数: 28
Auction-based dynamic spectrum trading market — Spectrum allocation and profit sharing 基于拍卖的动态频谱交易市场——频谱分配和利润分享
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394770
Sung Hyun Chun, R. La
{"title":"Auction-based dynamic spectrum trading market — Spectrum allocation and profit sharing","authors":"Sung Hyun Chun, R. La","doi":"10.1109/ALLERTON.2009.5394770","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394770","url":null,"abstract":"We study the problem of designing a new trading market for dynamic spectrum sharing when there are multiple sellers and multiple buyers. First, we study the interaction among homogeneous buyers of spectrum as a noncooperative game and show the existence of a symmetric mixed-strategy Nash equilibrium (SMSNE). Second, we assume that the sellers employ an optimal mechanism, called the generalized Branco's mechanism, and prove that there exists an incentive for risk neutral sellers of the spectrum to cooperate in order to maximize their expected profits at the SMSNEs of buyers' noncooperative game. Third, we model the interaction among the sellers as a cooperative game and demonstrate that the core of the cooperative game is nonempty. This indicates that there exists a way for the sellers to share the profits in a such manner that no subset of sellers will deviate from cooperating with the remaining sellers. Finally, we propose a profit sharing scheme that can achieve any payoff vector in the nonempty core of the cooperative game while satisfying two desirable properties.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"2 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":"125462482","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
Performance analysis of support recovery with joint sparsity constraints 联合稀疏约束下支架回收性能分析
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394809
Gongguo Tang, A. Nehorai
{"title":"Performance analysis of support recovery with joint sparsity constraints","authors":"Gongguo Tang, A. Nehorai","doi":"10.1109/ALLERTON.2009.5394809","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394809","url":null,"abstract":"In this paper, we analyze the performance of estimating the common support for jointly sparse signals based on their projections onto lower-dimensional space. We formulate support recovery as a multiple-hypothesis testing problem and derive both upper and lower bounds on the probability of error for general measurement matrices, by using Cher-noff bound and Fano's inequality, respectively. When applied to Gaussian measurement ensembles, these bounds give necessary and sufficient conditions to guarantee a vanishing probability of error for majority realizations of the measurement matrix. Our results offer surprising insights into sparse signal reconstruction based on their projections. For example, as far as support recovery is concerned, the well-known bound in compressive sensing is generally not sufficient if the Gaussian ensemble is used. Our study provides an alternative performance measure, one that is natural and important in practice, for signal recovery in com-pressive sensing as well as other application areas taking advantage of signal sparsity.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"32 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":"125546658","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}
引用次数: 2
Algebraic lattice alignment for K-user interference channels k用户干扰信道的代数点阵对准
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394845
A. Jafarian, J. Jose, S. Vishwanath
{"title":"Algebraic lattice alignment for K-user interference channels","authors":"A. Jafarian, J. Jose, S. Vishwanath","doi":"10.1109/ALLERTON.2009.5394845","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394845","url":null,"abstract":"This paper develops a new achievable region for the K-user symmetric interference channel using algebraic interference alignment. Our scheme uses lattice codebooks to transform the interference channel into an equivalent noiseless discrete-alphabet additive interference channel. Subsequently, algebraic alignment schemes are used to characterize the achievable rates for this channel.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"6 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":"123316880","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}
引用次数: 14
Conditions for a unique non-negative solution to an underdetermined system 欠定系统唯一非负解的条件
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394815
Meng Wang, A. Tang
{"title":"Conditions for a unique non-negative solution to an underdetermined system","authors":"Meng Wang, A. Tang","doi":"10.1109/ALLERTON.2009.5394815","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394815","url":null,"abstract":"This paper investigates conditions for an underdeter-mined linear system to have a unique nonnegative solution. A necessary condition is derived which requires the measurement matrix to have a row-span intersecting the positive orthant. For systems that satisfy this necessary condition, we provide equivalent characterizations for having a unique nonnegative solution. These conditions generalize existing ones to the cases where the measurement matrix may have different column sums. Focusing on binary measurement matrices especially ones that are adjacency matrices of expander graphs, we obtain an explicit threshold. Any nonnegative solution that is sparser than the threshold is the unique nonnegative solution. Compared with previous ones, this result is not only more general as it does not require constant degree condition, but also stronger as the threshold is larger even for cases with constant degree.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"9 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":"126346951","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}
引用次数: 31
A note on information-theoretic secret key exchange over wireless channels 无线信道上的信息论密钥交换
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394934
M. Zafer, D. Agrawal, M. Srivatsa
{"title":"A note on information-theoretic secret key exchange over wireless channels","authors":"M. Zafer, D. Agrawal, M. Srivatsa","doi":"10.1109/ALLERTON.2009.5394934","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394934","url":null,"abstract":"For wireless channels, a number of information-theoretic secret key exchange protocols have been proposed and analyzed for their efficiency in the literature. We contend that for such protocols in a realistic adversarial model that includes an active adversary, average number of message-bits that need to be exchanged to obtain one-bit of secret key is an important performance metric, which has been previously overlooked in the literature. Using this insight, we analytically study a recently popular class of information-theoretic secret key exchange protocols that is based on wireless channel fading. We obtain analytical results for specific cases and provide fundamental insights into the competitive performance of this class of information-theoretic secret key exchange protocols.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"158 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":"122976543","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
Information rates of the noncoherent frequency selective fading channel 非相干频率选择性衰落信道的信息速率
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394493
Jing Huang, S. Venkatraman, K. Padmanabhan, O. Collins
{"title":"Information rates of the noncoherent frequency selective fading channel","authors":"Jing Huang, S. Venkatraman, K. Padmanabhan, O. Collins","doi":"10.1109/ALLERTON.2009.5394493","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394493","url":null,"abstract":"This paper examines ways of improving channel estimation using successive decoding for the time varying frequency selective fading channel in a point to point wireless communication system. The channel state information (CSI) is not known a priori at either the transmitter or the receiver. The paper first presents the conventional pilot-symbol aided channel estimation (PACE) scheme and then the sequential successive decoding scheme. The conventional PACE scheme involves a big loss in achievable rates, while the sequential successive decoding scheme has a large delay. Finally, these two schemes are compared with three interleaved pilot schemes, in which interleaved codewords are decoded successively. These interleaved pilot schemes have significantly reduced delays, but still maintain good achievable rates.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"51 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":"126794082","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
A locally encodable and decodable compressed data structure 一种可本地编码和可解码的压缩数据结构
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394919
V. Chandar, D. Shah, G. Wornell
{"title":"A locally encodable and decodable compressed data structure","authors":"V. Chandar, D. Shah, G. Wornell","doi":"10.1109/ALLERTON.2009.5394919","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394919","url":null,"abstract":"In a variety of applications, ranging from highspeed networks to massive databases, there is a need to maintain histograms and other statistics in a streaming manner. Motivated by such applications, we establish the existence of efficient source codes that are both locally encodable and locally decodable. Our solution is an explicit construction in the form of a (randomized) data structure for storing N integers. The construction uses multi-layered sparse graph codes based on Ramanujan graphs, and has the following properties: (a) the structure utilizes minimal possible space, and (b) the value of any of the integers can be read or updated in near constant time (on average and with high probability). By contrast, data structures proposed in the context of streaming algorithms and compressed sensing in recent years (e.g., various sketches) support local encodability, but not local decodability; and those known as succinct data structures are locally decodable, but not locally encodable.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"29 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":"121380840","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}
引用次数: 14
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学术官方微信