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

Adaptive Slepian-Wolf decoding using particle filtering based belief propagation 基于粒子滤波的信念传播自适应睡眠狼解码

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

Samuel Cheng, Shuang Wang, Lijuan Cui

引用次数: 19

Optimal state estimation in the presence of communication costs and packet drops 存在通信开销和丢包时的最优状态估计

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

G. Lipsa, N. C. Martins

引用次数: 19

Target detection in MIMO radar using Golay complementary sequences in the presence of Doppler 多普勒存在下利用Golay互补序列的MIMO雷达目标检测

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

T. Qureshi, M. Zoltowski, R. Calderbank

引用次数: 6

MIMO wireless communications under statistical queueing constraints 统计排队约束下的MIMO无线通信

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

M. C. Gursoy

{"title":"MIMO wireless communications under statistical queueing constraints","authors":"M. C. Gursoy","doi":"10.1109/ALLERTON.2009.5394864","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394864","url":null,"abstract":"The performance of multiple-input multiple-output wireless systems is investigated in the presence of statistical queueing constraints. Queuing constraints are imposed as limitations on buffer violation probabilities. The performance under such constraints is captured through the effective capacity formulation. A detailed analysis of the effective capacity is carried out in the low-power and wideband regimes. In the low-power analysis, expressions for the first and second derivatives of the effective capacity with respect to SNR at SNR = 0 are obtained under various assumptions on the degree of channel state information at the transmitter. Transmission strategies that are optimal in the sense of achieving the first and second derivatives are identified. It is shown that while the first derivative does not get affected by the presence of queueing constraints, the second derivative gets smaller as the constraints become more stringent. Through the energy efficiency analysis, this is shown to imply that the minimum bit energy requirements do not change with more strict limitations but the wideband slope diminishes. Similar results are obtained in the wideband regime if rich multipath fading is being experienced. On the other hand, sparse multipath fading with bounded number of degrees of freedom is shown to increase the minimum bit energy requirements in the presence of queueing constraints.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"36 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":"130033459","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}

引用次数: 11

Capacity bounds for two-hop interference networks 两跳干扰网络的容量界限

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

Yi Cao, Biao Chen

引用次数: 28

Spectral analysis of dynamically evolving networks with linear preferential attachment 具有线性优先依恋的动态演化网络的谱分析

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

V. Preciado, A. Jadbabaie

引用次数: 1

On detection with partial information in the Gaussian setup 在高斯设置下的部分信息检测

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

Onur Özyesil, M. K. Mihçak, Y. Altug

引用次数: 0

Maximum throughput of clandestine relay 秘密中继的最大吞吐量

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

T. He, L. Tong, A. Swami

{"title":"Maximum throughput of clandestine relay","authors":"T. He, L. Tong, A. Swami","doi":"10.1109/ALLERTON.2009.5394874","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394874","url":null,"abstract":"The maximum throughput of relaying information flows while concealing their presence is studied. The concealment is achieved by embedding transmissions of information flows into truly independent transmission schedules that resemble the normal transmission behaviors without any flow. Such embedding may reduce the throughput for delay-sensitive flows, and the paper provides a quantitative characterization of the level of reduction. Under a strict or average delay constraint, the maximum normalized throughput is measured by the efficiency of the optimal relay algorithms that embed the most flow into given transmission schedules. Exact analytical solutions and closed-form approximations are derived for renewal schedules, verified by simulations on both synthetic traffic and traces. The results reveal general relationships between the clandestine throughput and system parameters including delay constraints, traffic load, and traffic distributions. In particular, the throughput is found to be negatively related to the burstiness of the cover traffic. Moreover, simulations show that the throughputs of renewal traffic with certain power-law interarrival distributions can closely approximate those of actual traces.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"45 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":"126337571","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}

引用次数: 4

Interference alignment with asymmetric complex signaling 非对称复杂信号的干扰对准

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

S. Jafar, V. Cadambe, Chenwei Wang

{"title":"Interference alignment with asymmetric complex signaling","authors":"S. Jafar, V. Cadambe, Chenwei Wang","doi":"10.1109/ALLERTON.2009.5394885","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394885","url":null,"abstract":"It has been conjectured that complex Gaussian interference channels with constant channel coefficients have only one degree-of-freedom (DoF) regardless of the number of users. While several examples are known of constant channels that achieve more than 1 DoF, these special cases only span a subset of measure zero. In other words, for almost all channel coefficient values, it is not known if more than 1 DoF is achievable. In this paper, we settle this conjecture in the negative. We show that at least 1.2 DoF are achievable for all values of complex channel coefficients except for a subset of measure zero. To establish the achievability of 1.2 DoF we introduce the novel idea of asymmetric complex signaling — i.e., the inputs are chosen to be complex but not circularly symmetric. It is shown that unlike Gaussian point-to-point, multiple-access and broadcast channels where circularly symmetric complex Gaussian inputs are optimal, for interference channels optimal inputs are in general asymmetric. In addition, with this idea, we also show that 4/3 DoF can be achieved for 2 user X channel with constant, complex channel coefficients.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"539 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":"127647944","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}

引用次数: 72

Optimal interleaving algorithms for generalized concatenated codes 通用级联码的最优交错算法

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

Hessam Mahdavifar, A. Vardy

引用次数: 1