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

Random channel coding and blind deconvolution 随机信道编码和盲反褶积

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394881

M. Salman Asif, W. Mantzel, J. Romberg

{"title":"Random channel coding and blind deconvolution","authors":"M. Salman Asif, W. Mantzel, J. Romberg","doi":"10.1109/ALLERTON.2009.5394881","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394881","url":null,"abstract":"Blind deconvolution arises naturally when dealing with finite multipath interference on a signal. In this paper we present a new method to protect the signals from the effects of sparse multipath channels — we modulate/encode the signal using random waveforms before transmission and estimate the channel and signal from the observations, without any prior knowledge of the channel other than that it is sparse. The problem can be articulated as follows. The original message x is encoded with an overdetermined m × n (m > n) matrix A whose entries are randomly chosen; the encoded message is given by Ax. The received signal is the convolution of the encoded message with h, the S-sparse impulse response of the channel. We explore three different schemes to recover the message x and the channel h simultaneously. The first scheme recasts the problem as a block l1 optimization program. The second scheme imposes a rank-1 structure on the estimated signal. The third scheme uses nuclear norm as a proxy for rank, to recover the x and h. The simulation results are presented to demonstrate the efficiency of the random coding and proposed recovery schemes.","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":"130136341","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}

引用次数: 36

Multiclass support vector machines for adaptation in MIMO-OFDM wireless systems MIMO-OFDM无线系统自适应的多类支持向量机

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394863

Sungho Yun, C. Caramanis

{"title":"Multiclass support vector machines for adaptation in MIMO-OFDM wireless systems","authors":"Sungho Yun, C. Caramanis","doi":"10.1109/ALLERTON.2009.5394863","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394863","url":null,"abstract":"In MIMO-OFDM systems, by matching transmitter parameters such as modulation order and coding rate, link adaptation can increase the throughput significantly. However, creating a tractable mathematical mapping model from environmental variables to transmitter parameters that allows the latter to be optimized in any sense, presents serious challenginges due to the large number of variables involved, as well as the complexity required in any model with the ability to accurately capture and explain all factors that affect performance. Machine learning algorithms, which make no mathematical assumptions and use only past observations to model the input-output relationship, have recently been explored for adaptation in MIMO-OFDM systems. In this paper we propose a novel machine learning algorithm based on multi-class support vector machines (SVMs). Our algorithm has considerably smaller operational overhead (including storage requirements) and better performance for link adaptation. With IEEE 802.11n simulations we show that our new algorithm outperforms existing machine-learning based algorithms. Moreover, we show that our algorithm is (asymptotically) consistent, in the sense that as the number of training data used increases, our algorithm obtains the performance-optimal classifier.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"19 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":"124467975","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}

引用次数: 20

Performance analysis of MAC protocols in wireless line networks using statistical mechanics 基于统计力学的无线线路网络MAC协议性能分析

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394523

Ka-Hung Hui, Dongning Guo, R. Berry, M. Haenggi

引用次数: 11

Scheduling policies for single-hop networks with heavy-tailed traffic 重尾单跳网络调度策略

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394854

Mihalis G. Markakis, E. Modiano, J. Tsitsiklis

引用次数: 31

Data aggregation in sensor networks: No more a slave to routing 传感器网络中的数据聚合:不再是路由的奴隶

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394505

R. Prakash, Ehsan Nourbakhsh, Kunal Sahu

引用次数: 10

Controlling errors in the process of molecular self-assembly 分子自组装过程中的控制误差

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394927

Ya Meng, N. Kashyap

{"title":"Controlling errors in the process of molecular self-assembly","authors":"Ya Meng, N. Kashyap","doi":"10.1109/ALLERTON.2009.5394927","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394927","url":null,"abstract":"The problem of controlling errors in the process of molecular self-assembly is of central importance in biomolecular computation. The stochastic nature of the self-assembly process leads to assembly errors, i.e., deviations from ideal growth of the assembly. Many different constructions of proofreading tile sets have been proposed in the literature to reduce the effect of such assembly errors. Another major error mechanism affecting the self-assembly process in practice is that of imperfections within the tiles themselves. This source of error has, surprisingly, received little prior attention. In this work, we consider a scenario in which some small proportion of the tiles in a tile set are “malformed”. We study, through simulations, the effect of such malformed tiles on the self-assembly process within the kinetic Tile Assembly Model (kTAM). The simulation results show that some tile set constructions show greater error-resilience in the presence of malformed tiles than others. But, most notably, the snaked proodreading tile set of Chen and Goel fails to form even moderately-sized tile assemblies when malformed tiles are present. We present modifications of the snaked proofreading construction that indicate that it is possible to design tile sets that are not just robust with respect to errors intrinsic to the self-assembly process, but also with respect to malformed tiles.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"47 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":"130841332","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

Supermodular network games 超模块化网络游戏

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394514

V. Manshadi, Ramesh Johari

引用次数: 18

Compressed sensing approach for high throughput carrier screen 高通量载波屏的压缩感知方法

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394904

Yaniv Erlich, N. Shental, Amnon Amir, O. Zuk

引用次数: 17

On the large-deviations optimality of scheduling policies minimizing the drift of a Lyapunov function 最小化Lyapunov函数漂移的调度策略的大偏差最优性

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394895

Xiaojun Lin, V. Venkataramanan

引用次数: 11

LDGM-based codes for successive refinement 基于ldgm的代码进行逐次细化

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394494

Ying Zhang, S. Dumitrescu, Jun Chen, Zhibin Sun

引用次数: 3