2011 Information Theory and Applications Workshop最新文献

Analog-to-digital conversion using unstable filters 使用不稳定滤波器的模数转换

2011 Information Theory and Applications Workshop Pub Date : 2011-04-07 DOI: 10.1109/ITA.2011.5743620

Hans-Andrea Loeliger, Lukas Bolliger, G. Wilckens, J. Biveroni

引用次数: 6

A tractable framework for coverage and outage in heterogeneous cellular networks 异构蜂窝网络中可处理的覆盖和中断框架

2011 Information Theory and Applications Workshop Pub Date : 2011-04-07 DOI: 10.1109/ITA.2011.5743604

Harpreet S. Dhillon, R. Ganti, J. Andrews

引用次数: 101

Deterministic annealing design and analysis of the Noisy MIMO Interference Channel 噪声MIMO干扰信道的确定性退火设计与分析

2011 Information Theory and Applications Workshop Pub Date : 2011-04-07 DOI: 10.1109/ITA.2011.5743630

Francesco Negro, I. Ghauri, D. Slock

{"title":"Deterministic annealing design and analysis of the Noisy MIMO Interference Channel","authors":"Francesco Negro, I. Ghauri, D. Slock","doi":"10.1109/ITA.2011.5743630","DOIUrl":"https://doi.org/10.1109/ITA.2011.5743630","url":null,"abstract":"We consider the Noisy MIMO Interference Channel (IFC) with linear transmitters and receivers and full CSI. The maximization of the Weighted Sum Rate (WSR) or transceiver design for Interference Alignment (IA) lead to cost functions with many local optima. Deterministic annealing is an approach that allows to track the variation of the known solution of one version of the problem into the unknown solution of the desired version by a controlled variation of a parameter called temperature. When the temperature parameter is chosen as inverse SNR (or noise power), the transceiver design for maximum WSR is known at low SNR and can be tracked to any desired SNR, yielding an elegant technique to find the global optimum. The solution includes filter design for the progressive switching on of streams as the SNR increases. For IA on the other hand, IA feasibility is unchanged when the MIMO crosslink channel matrices have a reduced rank equal to the maximum of the number of streams passing through them in forward and dual IFC (this would correspond to LOS channels in the case of single streams). The rank reduction simplifies IA design and feasibility analysis, and allows in particular a counting of the number of IA solutions. By choosing now the temperature parameter to be a scale factor for the remaining channel singular values, the solution for reduced rank channels can be evolved into that for arbitrary channels.","PeriodicalId":326414,"journal":{"name":"2011 Information Theory and Applications Workshop","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122193796","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}

引用次数: 37

Bayesian quickest change detection under energy constraints 能量约束下贝叶斯最快变化检测

2011 Information Theory and Applications Workshop Pub Date : 2011-04-07 DOI: 10.1109/ITA.2011.5743616

T. Banerjee, V. Veeravalli

{"title":"Bayesian quickest change detection under energy constraints","authors":"T. Banerjee, V. Veeravalli","doi":"10.1109/ITA.2011.5743616","DOIUrl":"https://doi.org/10.1109/ITA.2011.5743616","url":null,"abstract":"In the classical version of the Bayesian quickest change detection problem proposed by Shiryaev in the nineteen sixties, there is a sequence of observations whose distribution changes at a random time, and the goal is to minimize the average detection delay, subject to a constraint on the probability of false alarm. We consider this quickest change detection problem with an additional constraint on the average energy consumed in sensing the observations. The optimal algorithm for this problem has a three threshold structure, in contrast to the single threshold Shiryaev test that is optimal for the classical Bayesian quickest change detection problem. We provide an asymptotic analysis of the three threshold policy for the case where the probability of false alarm is small, the average energy consumption is large, and the change event is rare. The analysis yields approximations for the average detection delay, probability of false alarm and average energy consumption, which can be used to optimize the thresholds to achieve desired operating points. The asymptotic analysis also reveals that the three threshold policy can be approximated by a simpler two threshold policy. The advantage of the two threshold policy is that the thresholds can be set directly using constraints on the probability of false alarm and average energy consumption. We provide extensive simulation results that corroborate our analytical findings.","PeriodicalId":326414,"journal":{"name":"2011 Information Theory and Applications Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130647421","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

Interference mitigation via joint detection in a fading environment 在衰落环境下通过联合探测来减少干扰

2011 Information Theory and Applications Workshop Pub Date : 2011-04-07 DOI: 10.1109/ITA.2011.5743587

Jungwon Lee, D. Toumpakaris, Wei Yu

引用次数: 9

Interference neutralization for separated multiuser uplink-downlink with distributed relays 分布式中继分离式多用户上行下行链路的干扰中和

2011 Information Theory and Applications Workshop Pub Date : 2011-04-07 DOI: 10.1109/ITA.2011.5743629

Jinyuan Chen, A. Singh, P. Elia, R. Knopp

引用次数: 14

Constrained Wyner-Ziv source coding 约束Wyner-Ziv源代码

2011 Information Theory and Applications Workshop Pub Date : 2011-04-07 DOI: 10.1109/ITA.2011.5743621

A. Lapidoth, Andreas Malär, M. Wigger

引用次数: 1

Nonlinear turbo equalization using context trees 使用上下文树的非线性涡轮均衡

2011 Information Theory and Applications Workshop Pub Date : 2011-04-07 DOI: 10.1109/ITA.2011.5743608

N. Kalantarova, Kyeongyeon Kim, S. Kozat, A. Singer

引用次数: 0

Saddlepoint approximation of random-coding bounds 随机编码界的鞍点近似

2011 Information Theory and Applications Workshop Pub Date : 2011-04-07 DOI: 10.1109/ITA.2011.5743590

Alfonso Martinez, A. G. Fàbregas

引用次数: 62

A transform approach for analyzing and constructing quasi-cyclic low-density parity-check codes 一种分析和构造准循环低密度奇偶校验码的变换方法

2011 Information Theory and Applications Workshop Pub Date : 2011-04-07 DOI: 10.1109/ITA.2011.5743557

Qiuju Diao, Qin Huang, Shu Lin, K. Abdel-Ghaffar

引用次数: 13