2011 Information Theory and Applications Workshop最新文献_第2页

Complex-valued signal processing — essential models, tools and statistics 复值信号处理-基本模型，工具和统计

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

E. Ollila, V. Koivunen, H. Poor

{"title":"Complex-valued signal processing — essential models, tools and statistics","authors":"E. Ollila, V. Koivunen, H. Poor","doi":"10.1109/ITA.2011.5743596","DOIUrl":"https://doi.org/10.1109/ITA.2011.5743596","url":null,"abstract":"Complex-valued signals arise in many diverse fields such as communications, radar, biomedical sciences, physical sciences, and related fields. This paper briefly reviews some important tools, statistics, models and estimators that are useful for handling complex-valued random signals. Over the past four decades, circularity (i.e. invariance of the distribution under multiplication by a unit complex number) or second-order circularity (i.e. uncorrelatedness of the random vector with its complex conjugate) has been a common implicit assumption. Hence in this paper a special emphasis is put on this circularity property, as optimal signal processing methods for circular and non-circular signals are often different and choosing the right type of processing can provide significant performance gains. Topics reviewed in this paper include different types of circularity measures and detectors of circularity, complex elliptical symmetry of random variables, Crame´r-Rao lower bounds on the estimation of complex-valued parameters, optimization of a real-valued cost function with respect to complex-valued parameters using CR-calculus, and complex-valued independent component analysis.","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":"126039654","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}

引用次数: 15

Cyclic and quasi-cyclic LDPC codes: New developments 循环和准循环LDPC码:新进展

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

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

引用次数: 15

Resource allocation for constrained backhaul in picocell networks piccell网络中受限回程的资源分配

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

I. Marić, B. Bostjancic, A. Goldsmith

{"title":"Resource allocation for constrained backhaul in picocell networks","authors":"I. Marić, B. Bostjancic, A. Goldsmith","doi":"10.1109/ITA.2011.5743593","DOIUrl":"https://doi.org/10.1109/ITA.2011.5743593","url":null,"abstract":"Cellular network capacity and coverage can be improved by deployment of low power base stations referred to as picocells. Due to the associated deployment cost, a large number of picocells challenges the traditional approach to backhaul, where each cell has a dedicated backhaul link. This paper considers a more efficient approach, in which the backhaul is provided over a wireless channel shared among picocells. The considered backhaul network consists of multiple connector nodes (CNs) each providing backhaul to a group of picocells. A key problem in this setting is how to efficiently exploit and allocate this limited bandwidth resource among picocells. We consider joint scheduling and power allocation of backhaul transmissions based on limited bandwidth availability. We propose a backhaul scheduling approach based on traffic demands on picocells (i.e., the load of their mobile users), that maximizes the picocell utility. The approach applies to any underlying physical layer transmission scheme. We then investigate the proposed solution for an OFDM system. We first determine optimal power allocation under power and interference constraints for OFDM transmissions from multiple CNs. We then present an algorithm that performs joint scheduling and power allocation for OFDM transmissions in the backhaul channel.","PeriodicalId":326414,"journal":{"name":"2011 Information Theory and Applications Workshop","volume":"25 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":"115007630","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}

引用次数: 41

An algorithm for cooperative data exchange with cost criterion 基于代价准则的协同数据交换算法

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

Damla Ozgul, A. Sprintson

引用次数: 44

Distributed synchronization and medium access in wireless mesh networks 无线网状网络中的分布式同步与介质接入

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

S. Venkateswaran, Sumit Singh, Upamanyu Madhow, R. Mudumbai

{"title":"Distributed synchronization and medium access in wireless mesh networks","authors":"S. Venkateswaran, Sumit Singh, Upamanyu Madhow, R. Mudumbai","doi":"10.1109/ITA.2011.5743592","DOIUrl":"https://doi.org/10.1109/ITA.2011.5743592","url":null,"abstract":"Implicit local coordination of nodes in a wireless network using mechanisms such as Carrier Sense Multiple Access (CSMA) is conceptually attractive and relatively easy to implement, but often leads to performance that is far inferior to what is possible using explicit global coordination strategies such as Time Division Multiplexing (TDM). In this paper, we give two examples showing that appropriately designed implicit coordination strategies that employ learning and memory can provide performance competitive with that obtained using explicit strategies, while requiring minimal overhead. The first example is an algorithm for distributed timing synchronization maintenance using the timing information already present in ongoing communication in the network. The second example is a distributed medium access control protocol that achieves performance close to time division multiplexing (TDM) without requiring explicit resource allocation: nodes lock into communication patterns that have been found to work, with enough randomization to prevent locking into poor schedules. While the general philosophy of exploiting learning and memory in the design of network protocols is of broad applicability, our numerical results emphasize 60 GHz networks with highly directional links: effective coordination is particularly important for such networks, in view of the “deafness” caused by directionality.","PeriodicalId":326414,"journal":{"name":"2011 Information Theory and Applications Workshop","volume":"25 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":"123345025","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

Randomness and dependencies extraction via polarization 通过极化提取随机性和依赖性

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

E. Abbe

引用次数: 30

Learning and sharing in a changing world: Non-Bayesian restless bandit with multiple players 在不断变化的世界中学习和分享:与多个玩家一起的非贝叶斯不安的强盗

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

Haoyang Liu, Keqin Liu, Qing Zhao

引用次数: 27

On the exact bit error probability for Viterbi decoding of convolutional codes 卷积码维特比译码的精确误码概率

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

I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov

引用次数: 5

Extending the power of backpressure to correlated traffic 将反压力的力量扩展到相关流量

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

Jeongho Jeon, A. Ephremides

引用次数: 0

A new class of array codes for memory storage 存储器存储的一类新的数组代码

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

L. A. Lastras-Montaño, P. Meaney, E. Stephens, B. Trager, J. O'Connor, Luiz C. Alves

引用次数: 14