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

48 years of Allerton conferences 48年的阿勒顿会议

2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2022-09-27 DOI: 10.1109/allerton.2009.5394824

J. Cruz

引用次数: 0

Reduced-dimension multiuser detection 降维多用户检测

2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2011-09-28 DOI: 10.1109/ICC.2012.6364003

Yao Xie, Yonina C. Eldar, A. Goldsmith

引用次数: 8

Linear strategies for the Gaussian MAC with user cooperation 具有用户协作的高斯MAC的线性策略

2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2010-12-01 DOI: 10.1109/ALLERTON.2010.5707025

M. Wigger, A. Sarwate

{"title":"Linear strategies for the Gaussian MAC with user cooperation","authors":"M. Wigger, A. Sarwate","doi":"10.1109/ALLERTON.2010.5707025","DOIUrl":"https://doi.org/10.1109/ALLERTON.2010.5707025","url":null,"abstract":"The capacity region of the two-user additive white Gaussian noise (AWGN) multiple-access channel (MAC) with user cooperation is studied. This channel differs from the classical AWGN MAC in that here each transmitter observes a noisy version of the channel inputs sent by the other transmitter. A new achievable region is presented based on a coding scheme where each transmitter sends a linear combination of these observations and of the codeword it produced to encode its message. For certain choices of the parameters our scheme can be viewed as a scheme where the messages are encoded into stationary processes and where the encoders apply linear time-invariant filters to their observations. The rates achieved by this latter scheme can be expressed in terms of the power spectra of the filters and input processes. For most choices of filters, the optimal input spectra are given by frequency-division and can be found using a water-filling algorithm. It is shown that when the transmitters' observations are very noisy our scheme with general parameters outperforms the best previously known schemes. Moreover, the scheme allows to conclude that user cooperation strictly improves the capacity region, irrespective of how noisy the transmitters' observations are. In contrast, when the observations are almost noise-free, then a scheme previously proposed by Carleial improves on our scheme. It is shown that for symmetric setups—i.e., equal power constraints at the two transmitters and equal variances of the noises corrupting the transmitters' observations—and in the asymptotic regime when the observations become noise-free Carleial's lower bound on the sum-capacity and Tandon and Ulukus's recent upper bound on the sum-capacity are tight in the sense that they both tend to the sum-capacity of the setup with noise-free observations with identical slopes.","PeriodicalId":432801,"journal":{"name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122208986","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 general framework for high-dimensional estimation in the presence of incoherence 不相干存在下高维估计的一般框架

2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2010-12-01 DOI: 10.1109/ALLERTON.2010.5707100

Yuxin Chen, S. Sanghavi

{"title":"A general framework for high-dimensional estimation in the presence of incoherence","authors":"Yuxin Chen, S. Sanghavi","doi":"10.1109/ALLERTON.2010.5707100","DOIUrl":"https://doi.org/10.1109/ALLERTON.2010.5707100","url":null,"abstract":"High-dimensional statistical inference requires the recovery/estimation of a large number of parameters from a possibly much smaller number of samples. A growing body of recent work has established that this is possible provided (a) the signal possesses an appropriate low-dimensional structure, and (b) the sampling is “incoherent”, i.e. does not suppress this structure. Popular structural assumptions include sparsity, block-sparsity, low-rank etc., and popular recovery approaches include regularization via convex penalties, alternating projections, greedy approaches etc. However, in the existing literature, analysis for each combination of structure and method has proceeded on a case by case basis. In this work we provide a unified framework that broadly characterizes when incoherence will enable consistent estimation in the high-dimensional setting. Specifically, we provide general definitions for structure and incoherence, and then establish that incoherence guarantees success in recovery (exactly in the noiseless case, and approximately in noisy case) for two broad classes of methods: (a) appropriate convex regularization, and (b) a new algorithm - Generalized Projections - that we propose. We identify several existing results that are recovered as special cases of each of our results. Our work builds on the recent framework for convex regularizers by Negahban et.al.; in particular one of our results is a characterization, in the presence of incoherence, of a crucial constant they define but do not evaluate in general. Finally, we also extend our framework to the case of multiple superimposed structures, where we define a new inter-structure notions of incoherence - Restricted Orthogonality Property.","PeriodicalId":432801,"journal":{"name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"47 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131460145","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}

引用次数: 5

On secure transmission over parallel relay eavesdropper channel 并行中继窃听信道安全传输研究

2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2010-11-09 DOI: 10.1109/ALLERTON.2010.5706998

Z. Awan, A. Zaidi, L. Vandendorpe

引用次数: 7

Virtual full-duplex wireless communication via rapid on-off-division duplex 虚拟全双工无线通信通过快速开离双工

2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2010-10-13 DOI: 10.1109/ALLERTON.2010.5706936

Dongning Guo, Lei Zhang

{"title":"Virtual full-duplex wireless communication via rapid on-off-division duplex","authors":"Dongning Guo, Lei Zhang","doi":"10.1109/ALLERTON.2010.5706936","DOIUrl":"https://doi.org/10.1109/ALLERTON.2010.5706936","url":null,"abstract":"This paper introduces a novel paradigm for designing the physical and medium access control (MAC) layers of mobile ad hoc or peer-to-peer networks formed by half-duplex radios. A node equipped with such a radio cannot simultaneously transmit and receive useful signals at the same frequency. Unlike in conventional designs, where a node's transmission frames are scheduled away from its reception, each node transmits its signal through a randomly generated on-off duplex mask (or signature) over every frame interval, and receive a signal through each of its own off-slots. This is called rapid on-off-division duplex (RODD). Over the period of a single frame, every node can transmit a message to some or all of its peers, and may simultaneously receive a message from each peer. Thus RODD achieves virtual full-duplex communication using half-duplex radios and can simplify the design of higher layers of a network protocol stack significantly. The throughput of RODD is evaluated under some general settings, which is significantly larger than that of ALOHA. RODD is especially efficient in case the dominant traffic is simultaneous broadcast from nodes to their one-hop peers, such as in spontaneous wireless social networks, emergency situations or on battlefield. Important design issues of peer discovery, distribution of on-off signatures, synchronization and error-control coding are also addressed.","PeriodicalId":432801,"journal":{"name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122814817","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}

引用次数: 42

Providing quality of service via opportunistic splitting using stochastic approximation 通过随机近似的机会分裂提供高质量的服务

2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2010-10-01 DOI: 10.1109/ALLERTON.2010.5706935

V. Joseph, V. Sharma, U. Mukherji

{"title":"Providing quality of service via opportunistic splitting using stochastic approximation","authors":"V. Joseph, V. Sharma, U. Mukherji","doi":"10.1109/ALLERTON.2010.5706935","DOIUrl":"https://doi.org/10.1109/ALLERTON.2010.5706935","url":null,"abstract":"We consider the problem of wireless channel allocation to multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. Each metric sequence can be Markov. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.","PeriodicalId":432801,"journal":{"name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127261688","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 the achievable rates of sources having a group alphabet in a distributed source coding setting 在分布式源编码设置中具有组字母的源的可实现率

2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2010-10-01 DOI: 10.1109/ALLERTON.2010.5706945

K. Vinodh, V. Lalitha, N. Prakash, P. V. Kumar, S. Pradhan

引用次数: 6

List decoding for nested lattices and applications to relay channels 列出用于中继通道的嵌套格和应用程序的解码

2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2010-10-01 DOI: 10.1109/ALLERTON.2010.5707024

Yiwei Song, N. Devroye

引用次数: 23

Bayesian sequential compressed sensing in sparse dynamical systems 稀疏动态系统中的贝叶斯序列压缩感知

2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2010-09-29 DOI: 10.1109/ALLERTON.2010.5707125

D. Sejdinovic, C. Andrieu, R. Piechocki

引用次数: 33