2017 51st Asilomar Conference on Signals, Systems, and Computers最新文献

筛选
英文 中文
State-of-the-art in cache-aided combination networks 最先进的缓存辅助组合网络
2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-29 DOI: 10.1109/ACSSC.2017.8335420
Kai Wan, Daniela Tuninetti, Mingyue Ji, P. Piantanida
{"title":"State-of-the-art in cache-aided combination networks","authors":"Kai Wan, Daniela Tuninetti, Mingyue Ji, P. Piantanida","doi":"10.1109/ACSSC.2017.8335420","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335420","url":null,"abstract":"Caching is an effective approach to smooth out network traffic by storing some content in users' local memories during off-peak hours, which can be used to reduce the required number of transmissions during peak-traffic hours. This paper reviews recent advances on cache-aided relay networks, in particular for combination networks, which has a specific symmetric network topology. Two approaches exist for relay networks with end-user caches, depending on whether the generation of the multicast messages for the delivery phase is independent of the network topology. We review state-of-the-art schemes by categorizing them according to one of these two approaches. We also discuss their optimality (exact or to within a multiplicative factor).","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130109763","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
Analyzing the approximation error of the fast graph Fourier transform 快速图傅里叶变换的近似误差分析
2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-29 DOI: 10.1109/ACSSC.2017.8335133
Luc Le Magoarou, Nicolas Tremblay, R. Gribonval
{"title":"Analyzing the approximation error of the fast graph Fourier transform","authors":"Luc Le Magoarou, Nicolas Tremblay, R. Gribonval","doi":"10.1109/ACSSC.2017.8335133","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335133","url":null,"abstract":"The graph Fourier transform (GFT) is in general dense and requires O(n2) time to compute and O(n2) memory space to store. In this paper, we pursue our previous work on the approximate fast graph Fourier transform (FGFT). The FGFT is computed via a truncated Jacobi algorithm, and is defined as the product of J Givens rotations (very sparse orthogonal matrices). The truncation parameter, J, represents a trade-off between precision of the transform and time of computation (and storage space). We explore further this trade-off and study, on different types of graphs, how is the approximation error distributed along the spectrum.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127403877","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
Adaptive algorithm based on a new hyperbolic sine cost function 基于新的双曲正弦代价函数的自适应算法
2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-29 DOI: 10.1109/ACSSC.2017.8335459
Ahmad Khalifi, Qadri Mayyala, Naveed Iqbal, A. Zerguine, K. Abed-Meraim
{"title":"Adaptive algorithm based on a new hyperbolic sine cost function","authors":"Ahmad Khalifi, Qadri Mayyala, Naveed Iqbal, A. Zerguine, K. Abed-Meraim","doi":"10.1109/ACSSC.2017.8335459","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335459","url":null,"abstract":"This paper introduces a stochastic gradient algorithm, which uses an exclusive hyperbolic sine objective function. The algorithm belongs to the variable step size (VSS) class. The algorithms in this class are shown to be very stable and effective in many applications, e.g., echo-cancellation, equalization, and others. In this algorithm, as opposed to other existing VSS algorithms, only one tuning parameter is needed. Experimental results show that with a sub-optimal selection of the tuning parameter, the algorithm provides very promising results in both stationary and tracking scenarios. Analytic convergence and steady state error performance analysis are provided to demonstrate the excellent performance. Also, an optimal solution, based on the least hyperbolic sine error, is derived to confirm the convergence of the proposed algorithm towards the Wiener solution.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125894357","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
On the relative error of computing complex square roots in floating-point arithmetic 浮点运算中复数平方根计算的相对误差
2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-29 DOI: 10.1109/ACSSC.2017.8335442
C. Jeannerod, J. Muller
{"title":"On the relative error of computing complex square roots in floating-point arithmetic","authors":"C. Jeannerod, J. Muller","doi":"10.1109/ACSSC.2017.8335442","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335442","url":null,"abstract":"We study the accuracy of a classical approach to computing complex square-roots in floating-point arithmetic. Our analyses are done in binary floating-point arithmetic in precision p, and we assume that the (real) arithmetic operations +, —, x, ÷, √ are rounded to nearest, so the unit roundoff is u = 2−p. We show that in the absence of underflow and overflow, the componentwise and normwise relative errors of this approach are at most 7/2u and √37/2u, respectively, and this without having to neglect terms of higher order in u. We then provide some input examples showing that these bounds are reasonably sharp for the three basic binary interchange formats (binary32, binary64, and binary128) of the IEEE 754 standard for floating-point arithmetic.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125162641","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
Time-decentralized DOA estimation for electronic surveillance 电子监视的时间分散DOA估计
2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335528
S. Sirianunpiboon, S. Howard, S. D. Elton
{"title":"Time-decentralized DOA estimation for electronic surveillance","authors":"S. Sirianunpiboon, S. Howard, S. D. Elton","doi":"10.1109/ACSSC.2017.8335528","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335528","url":null,"abstract":"Due to high data rates necessary in multi-channel Electronic Surveillance systems, the full multi-channel data collected on each radar pulse is data compressed to a pulse descriptor word (PDW), which conventionally contains a DOA estimate for the pulse. It is only in down stream processing that the PDWs are clustered into groups identified as originating from single radar. A combined DOA estimate for the radar is conventionally achieved by some form of averaging over the individual pulse DOAs. If one could retain all of the multi-channel IQ data for all of the pulses in a cluster, one could optimally estimate a DOA for the radar using, for example, a maximum likelihood (ML) estimate. In this paper we propose a modification to the initial data compression and subsequent processing which, while adding only a modest amount of data to each PDW, allows estimation of the radar's DOA with performance approaching that which could be achieved by ML estimation using the full multi-channel data records for all the pulses in the cluster. The method is computationally efficient and also allows the optimal beamforming of each pulse without the need to explicitly estimate its DOA.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"50 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":"114979131","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
Intelligent data filtering in constrained IoT systems 受限物联网系统中的智能数据过滤
2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335485
Igor Burago, Davide Callegaro, M. Levorato, Sameer Singh
{"title":"Intelligent data filtering in constrained IoT systems","authors":"Igor Burago, Davide Callegaro, M. Levorato, Sameer Singh","doi":"10.1109/ACSSC.2017.8335485","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335485","url":null,"abstract":"The expansion of complex autonomous sensing and control mechanisms in the Internet-of-Things systems clashes with constraints on computation and wireless communication resources. In this paper, we propose a framework to address this conflict for applications in which resolution using a centralized architecture with a general-purpose compression of observations is not appropriate. Three approaches for distributing observation detection workload between sensing and processing devices are considered for sensor systems within wireless islands. Each of the approaches is formulated for the shared configuration of a sensor-edge system, in which the network structure, observation monitoring problem, and machine learning-based detector implementing it are not modified. For every approach, a high-level strategy for realization of the detector for different assumptions on the relation between its complexity and the system's constraints is considered. In each case, the potential for the constraints' satisfaction is shown to exist and be exploitable via division, approximation, and delegation of the detector's workload to the sensing devices off the edge processor. We present examples of applications that benefit from the proposed approaches.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"50 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":"114662999","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
Two-stage LASSO ADMM signal detection algorithm for large scale MIMO 大规模MIMO的两级LASSO ADMM信号检测算法
2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335641
Anis Elgabli, Ali A. Elghariani, A. Al-Abbasi, M. Bell
{"title":"Two-stage LASSO ADMM signal detection algorithm for large scale MIMO","authors":"Anis Elgabli, Ali A. Elghariani, A. Al-Abbasi, M. Bell","doi":"10.1109/ACSSC.2017.8335641","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335641","url":null,"abstract":"This paper explores the benefit of using some of the machine learning techniques and Big data optimization tools in approximating maximum likelihood (ML) detection of Large Scale MIMO systems. First, large scale MIMO detection problem is formulated as a LASSO (Least Absolute Shrinkage and Selection Operator) optimization problem. Then, Alternating Direction Method of Multipliers (ADMM) is considered in solving this problem. The choice of ADMM is motivated by its ability of solving convex optimization problems by breaking them into smaller sub-problems, each of which are then easier to handle. Further improvement is obtained using two stages of LASSO with interference cancellation from the first stage. The proposed algorithm is investigated at various modulation techniques with different number of antennas. It is also compared with widely used algorithms in this field. Simulation results demonstrate the efficacy of the proposed algorithm for both uncoded and coded cases.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"206 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":"115734388","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}
引用次数: 12
SNR threshold region prediction via singular value decomposition of the Barankin bound kernel 基于Barankin界核奇异值分解的信噪比阈值区域预测
2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335448
John S. Kota, A. Papandreou-Suppappola
{"title":"SNR threshold region prediction via singular value decomposition of the Barankin bound kernel","authors":"John S. Kota, A. Papandreou-Suppappola","doi":"10.1109/ACSSC.2017.8335448","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335448","url":null,"abstract":"Engineers are often interested in characterizing estimator performance for all possible SNR operating points. The Crámer-Rao lower bound (CRLB) is known to provide a tight lower bound on estimator mean-squared error (MSE) under asymptotic conditions associated with high SNR and/or large data lengths. The maximum likelihood estimator (MLE), a compact function, is known to exhibit the so-called threshold phenomenon in non-linear estimation problems. This threshold region is associated with the MLE selecting side-lobes over the main-lobe with high probability. Therefore, it is important to be able to determine the threshold SNR value past which the performance of the MLE rapidly deviates from the CRLB where small changes in SNR can produce large changes in MSE. One approach for predicting the SNR threshold is based on the computation of the Barankin bound (BB) that can provide a tighter bound than the CRLB on estimator performance. In this paper, we propose a threshold prediction algorithm based on the effective rank of the BB kernel matrix computed via singular value decomposition (SVD). We demonstrate the proposed prediction technique for the time-delay, frequency, and angle of arrival sensing problems and compare to other known prediction techniques from the literature.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"100 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":"116994085","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
Leveraging massive MIMO spatial degrees of freedom to reduce random access delay 利用大规模MIMO空间自由度来减少随机访问延迟
2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335719
Fatima Ahsan, A. Sabharwal
{"title":"Leveraging massive MIMO spatial degrees of freedom to reduce random access delay","authors":"Fatima Ahsan, A. Sabharwal","doi":"10.1109/ACSSC.2017.8335719","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335719","url":null,"abstract":"Random access is a crucial building block for nearly all wireless networks, and impacts both the overall spectral efficiency and latency in communication. In this paper, we analytically show that the spatial degrees of freedom, e.g. available in massive MIMO systems, can potentially be leveraged to reduce random access latency. Using one-ring propagation model, we evaluate how the random access collision probability depends on the aperture size of the array and the spread of user's signal Angle-of-Arrivals (AoAs) at the base-station, as a function of the user-density and the number of random access codes. Our numerical evaluation shows that for practically sized large arrays in outdoor environments, a significant reduction in collision probability is possible, which in turn can decrease the random access latency.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"126 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":"117341620","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
Exploring spatial motifs for device-to-device network analysis (DNA) in 5G networks 探索5G网络中设备对设备网络分析(DNA)的空间基元
2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335591
Tengchan Zeng, Omid Semiari, W. Saad
{"title":"Exploring spatial motifs for device-to-device network analysis (DNA) in 5G networks","authors":"Tengchan Zeng, Omid Semiari, W. Saad","doi":"10.1109/ACSSC.2017.8335591","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335591","url":null,"abstract":"Device-to-device (D2D) communication is a promising approach to efficiently disseminate critical or viral information across 5G cellular networks. Reaping the benefits of D2D-enabled networks is contingent upon choosing the optimal dissemination policy and resource allocation strategy subject to resource, topology, and user distribution constraints. In this paper, a resource allocation problem within a single-cell orthogonal frequency division multiple-access (OFDMA) network has been formulated to optimize the system throughput. The problem is cast as a mixed binary integer programming problem, which is challenging to solve. Therefore, in order to obtain a sub-optimal solution, the optimization problem is decomposed into two subproblems: seed selection and subchannel allocation. For the seed selection sub-problem, a novel D2D network analysis (DNA) framework is proposed to explore frequent communication patterns across D2D users, known as spatial motifs, to determine the optimal number of devices which can disseminate contents. Furthermore, to solve the second sub-problem, a heuristic algorithm is introduced. Simulation results show the effectiveness of exploring motifs to design D2D dissemination policies, and show that the proposed algorithm can achieve a performance gain of up to 40% compared with a baseline scheme that selects subchannels randomly.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"51 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":"117346909","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信