2017 51st Asilomar Conference on Signals, Systems, and Computers最新文献_第10页

Zero-forcing precoding using generalized inverses for G.fast DSL systems 基于广义逆的G.fast DSL系统强制零预编码

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335652

Andreas Barthelme, M. Joham, Rainer Strobel, W. Utschick

引用次数: 1

An efficient software implementation of correctly rounded operations extending FMA: A + b + c and a × b + c × d 一个有效的软件实现正确四舍五入运算扩展FMA: A + b + c和A × b + c × d

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335379

C. Lauter

引用次数: 0

Frequency invariant beamforming for arbitrary planar arrays 任意平面阵列的频率不变波束形成

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335527

A. Medda, Arjun Patel

引用次数: 1

Fast and compact Kronecker-structured dictionary learning for classification and representation 快速和紧凑的克罗内克结构字典学习分类和表示

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335166

Ishan Jindal, M. Nokleby

引用次数: 2

Algorithms for asynchronous coded caching 异步编码缓存算法

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335419

H. Ghasemi, A. Ramamoorthy

{"title":"Algorithms for asynchronous coded caching","authors":"H. Ghasemi, A. Ramamoorthy","doi":"10.1109/ACSSC.2017.8335419","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335419","url":null,"abstract":"The original formulation of the coded caching problem assumes that the file requests from the users are synchronized, i.e., they arrive at the server at the same time. Several subsequent contributions work under the same assumption. Furthermore, the majority of prior work does not consider a scenario where users have deadlines. In our previous work we formulated the asynchronous coded caching problem where user requests arrive at different times. Furthermore, the users have specified deadlines. We proposed a linear program for obtaining its optimal solution. However, the size of the LP (number of constraints and variables) grows rather quickly with the number of users and cache sizes. In this work, we explore a dual decomposition based approach for solving the LP under consideration. We demonstrate that the dual function can be evaluated by equivalently solving a number of minimum cost network flow algorithms. Minimum cost network flow algorithms have been the subject of much investigation and current solvers routinely solve instances with millions of nodes in minutes. Our proposed approach leverages these fast solvers and allows us to solve several large scale instances of the asynchronous coded caching problem with manageable time and memory complexity.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130658013","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

Multiscale network analysis through tail-greedy bottom-up approximation, with applications in neuroscience 基于尾贪婪自底向上近似的多尺度网络分析，在神经科学中的应用

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335617

Xinyu Kang, P. Fryzlewicz, C. Chu, M. Kramer, E. Kolaczyk

引用次数: 0

Identifying coverage holes: Where to densify? 识别覆盖漏洞:在哪里密集?

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335588

Rebal Jurdi, J. Andrews, David Parsons, R. Heath

{"title":"Identifying coverage holes: Where to densify?","authors":"Rebal Jurdi, J. Andrews, David Parsons, R. Heath","doi":"10.1109/ACSSC.2017.8335588","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335588","url":null,"abstract":"We develop a methodology to identify coverage holes in cellular markets, given demographic and socio-economic information of the population, detailed knowledge of the current macro-cellular infrastructure, and the spectrum capabilities of a cellular operator. Coverage holes are defined as areas where users contending for macro BS resources outnumber those who eventually get serviced with minimum acceptable average rates. We develop a method that begins with filtering out users who connect to the Internet through Wi-Fi or to their data networks through small cell BSs. Since the rate observed by a user is a function of their own SINR as well as that of other connected users, we generate an SINR heat map and use a fair scheduling algorithm that allows us to determine the effective load on a BS as a number of users. By comparing the cell load to the number of users with acceptable rates, we obtain a coverage map that identifies holes that should be targeted by further densification. We observe that more cells will be in major deficit ten years from now, with up to 25% of an operator's cells requiring more than four additional micro cell BSs to fill the gap. Finally, we give a list of extensions of this work.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131048903","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

Beyond consensus and synchrony in decentralized online optimization using saddle point method 鞍点法在分散在线优化中的超越共识与同步

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335186

A. S. Bedi, Alec Koppel, K. Rajawat

{"title":"Beyond consensus and synchrony in decentralized online optimization using saddle point method","authors":"A. S. Bedi, Alec Koppel, K. Rajawat","doi":"10.1109/ACSSC.2017.8335186","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335186","url":null,"abstract":"We consider online learning problems in multiagent systems comprised of distinct subsets of agents operating without a common time-scale. Each individual in the network is charged with minimizing the global regret, which is a sum of the instantaneous sub-optimality of each agent's actions with respect to a fixed global clairvoyant actor with access to all costs across the network for all time up to a time-horizon T. Since agents are not assumed to be of the same type, the hypothesis that all agents seek a common action is violated, and thus we instead introduce a notion of network discrepancy as a measure of how well agents coordinate their behavior while retaining distinct local behavior. Moreover, agents are not assumed to receive the sequentially arriving costs on a common time index, and thus seek to learn in an asynchronous manner. A variant of the Arrow-Hurwicz saddle point algorithm is proposed to control the growth of global regret and network discrepancy. This algorithm uses Lagrange multipliers to penalize the discrepancies between agents and leads to an implementation that relies on local operations and exchange of variables between neighbors. Decisions made with this method lead to regret whose order is O(√T) and network discrepancy O(T3/4). Empirical evaluation is conducted on an asynchronously operating sensor network estimating a spatially correlated random field.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130184605","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}

引用次数: 7

Dimension spreading for coherent opportunistic communications 连贯机会通信的维度扩展

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335703

Jordi Borras, Josep Font-Segura, J. Riba, G. Vázquez

引用次数: 7

Feature based order recognition of continuous-phase FSK using principal component analysis 基于主成分分析的连续相位FSK序列特征识别

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335157

Ambaw B. Ambaw, M. Doroslovački

{"title":"Feature based order recognition of continuous-phase FSK using principal component analysis","authors":"Ambaw B. Ambaw, M. Doroslovački","doi":"10.1109/ACSSC.2017.8335157","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335157","url":null,"abstract":"Principal component analysis (PCA) is a technique that performs a linear transformation on the input space to align directions of maximum variation with the directions of the axises. In this paper, we study the feasibility of principal component analysis based order recognition of continuous phase FSK. The approximate entropy (ApEn) of the received signal, ApEn of the phase of the received signal, and ApEn of the instantaneous frequency of the received signal are used as a set of distinguishing features. The work aims in devising an unsupervised learning algorithm under noisy, carrier frequency offset and fast fading channel conditions. The instantaneous frequency is shaped by using root raised cosine pulses. Performance of principal component based method is compared to stacked autoencoder (SAE) based approach which is more computationally complex technique that can model relatively complicated relationships and non-linearities. For fair comparison both the PCA and SAE based methods use approximate entropy features. The benefit of employing PCA is that after PCA transformations the computation cost can really be decreased a lot. Also in both methods, no a priori information is required about carrier phase, symbol rate and carrier amplitude. The PCA based method shows higher accuracy than the SAE method.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126423887","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