发布求助
文献互助 智能选刊 最新文献

2015 49th Asilomar Conference on Signals, Systems and Computers最新文献

筛选
英文 中文
Effect of clutter on joint radar-communications system performance inner bounds 杂波对联合雷达通信系统性能的影响
2015 49th Asilomar Conference on Signals, Systems and Computers Pub Date : 2015-11-01 DOI: 10.1109/ACSSC.2015.7421368
A. Chiriyath, D. Bliss
{"title":"Effect of clutter on joint radar-communications system performance inner bounds","authors":"A. Chiriyath, D. Bliss","doi":"10.1109/ACSSC.2015.7421368","DOIUrl":"https://doi.org/10.1109/ACSSC.2015.7421368","url":null,"abstract":"We analyze the effects of clutter on inner bounds for the performance of a joint radar-communications system. Radar returns from clutter are often characterized by a randomly fluctuating cross section. Hence, statistical methods must be employed to model the clutter and its cross-section. In this paper we consider two clutter models and analyze their effect on the inner bounds on performance of a joint radar-communications system. Bounds on performance of the joint system are measured in terms of data information rate for communications, and radar estimation information rate for the radar.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123087384","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}
引用次数: 22
Fitting graph models to big data 图模型与大数据的拟合
2015 49th Asilomar Conference on Signals, Systems and Computers Pub Date : 2015-11-01 DOI: 10.1109/ACSSC.2015.7421154
Jonathan Mei, José M. F. Moura
{"title":"Fitting graph models to big data","authors":"Jonathan Mei, José M. F. Moura","doi":"10.1109/ACSSC.2015.7421154","DOIUrl":"https://doi.org/10.1109/ACSSC.2015.7421154","url":null,"abstract":"Many big data applications collect large numbers of time series. A first task in analyzing such data is to find a low- dimensional representation, a graph, which faithfully describes relations among the measured processes and through time. The processes are often affected by a relatively small number of unmeasured trends. This paper presents a computationally tractable algorithm for jointly estimating these trends and underlying weighted, directed graph structure from the collected data. The algorithm is demonstrated on simulated time series datasets.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121816074","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}
引用次数: 2
CRT RSA decryption: Modular exponentiation based solely on Montgomery Multiplication CRT RSA解密:完全基于蒙哥马利乘法的模幂
2015 49th Asilomar Conference on Signals, Systems and Computers Pub Date : 2015-11-01 DOI: 10.1109/ACSSC.2015.7421164
João Carlos Néto, A. Tenca, W. Ruggiero
{"title":"CRT RSA decryption: Modular exponentiation based solely on Montgomery Multiplication","authors":"João Carlos Néto, A. Tenca, W. Ruggiero","doi":"10.1109/ACSSC.2015.7421164","DOIUrl":"https://doi.org/10.1109/ACSSC.2015.7421164","url":null,"abstract":"An innovative hardware design is proposed to perform modular exponentiation using only Montgomery Multiplication for CRT RSA decryption. The same hardware used to perform exponentiation is also used to perform conversions. The proposed algorithm is described and provided a versatile hardware implementation. When compared to the classical sequential Radix-2 MM architecture from which it was derived, the new RSA architecture shows 44% average reduction in the energy consumption. The efficient design proposed is shown through an experimental synthesis with a 90nm CMOS technology. The results are compared with the state-of-art in the RSA 1024-bit implementations using non-RNS solutions.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116790292","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
Jitter invariant incremental principal component pursuit for video background modeling on the TK1 基于TK1的视频背景建模的抖动不变增量主成分追踪
2015 49th Asilomar Conference on Signals, Systems and Computers Pub Date : 2015-11-01 DOI: 10.1109/ACSSC.2015.7421373
Gustavo Silva, P. Rodríguez
{"title":"Jitter invariant incremental principal component pursuit for video background modeling on the TK1","authors":"Gustavo Silva, P. Rodríguez","doi":"10.1109/ACSSC.2015.7421373","DOIUrl":"https://doi.org/10.1109/ACSSC.2015.7421373","url":null,"abstract":"While Principal Component Pursuit (PCP) is currently considered to be the state of the art method for video background modeling, it suffers from a number of limitations, including high computational cost, batch operating mode, and sensitivity to camera jitter. In this work we present a real-time, CUDA-aware C / CUDA C implementation of a novel and fully incremental PCP algorithm for video background modeling that can also deal with rigid transformation jitter. Our implementation has a computational complexity that allows (TK1 platform) a processing frame rate throughput (jittered video) of 2.6 and 0.4 f.p.s. for color videos of 640 × 480 and 1920 × 1088 respectively.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"08 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127142416","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}
引用次数: 8
Sparse sensing for estimation with correlated observations 基于相关观测值估计的稀疏感知
2015 49th Asilomar Conference on Signals, Systems and Computers Pub Date : 2015-11-01 DOI: 10.1109/ACSSC.2015.7421196
S. P. Chepuri, G. Leus
{"title":"Sparse sensing for estimation with correlated observations","authors":"S. P. Chepuri, G. Leus","doi":"10.1109/ACSSC.2015.7421196","DOIUrl":"https://doi.org/10.1109/ACSSC.2015.7421196","url":null,"abstract":"We focus on discrete sparse sensing for non-linear parameter estimation with colored Gaussian observations. In particular, we design offline sparse samplers to reduce the sensing cost as well as to reduce the storage and communications requirements, yet achieving a desired estimation accuracy. We optimize scalar functions of the Cramér-Rao bound matrix, which we use as the inference performance metric to design the sparse samplers of interest via a convex program. The sampler design does not require the actual measurements, however it needs the model parameters to be perfectly known. The proposed approach is illustrated with a sensor placement example.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"122 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125871906","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}
引用次数: 2
Compressed temporal synchronization with opportunistic signals 与机会信号的压缩时间同步
2015 49th Asilomar Conference on Signals, Systems and Computers Pub Date : 2015-11-01 DOI: 10.1109/ACSSC.2015.7421114
M. Ibrahim, F. Roemer, N. Hadaschik, H. Troger, B. Sackenreuter, Norbert Franke, J. Robert, G. D. Galdo
{"title":"Compressed temporal synchronization with opportunistic signals","authors":"M. Ibrahim, F. Roemer, N. Hadaschik, H. Troger, B. Sackenreuter, Norbert Franke, J. Robert, G. D. Galdo","doi":"10.1109/ACSSC.2015.7421114","DOIUrl":"https://doi.org/10.1109/ACSSC.2015.7421114","url":null,"abstract":"In this paper we propose a temporal synchronization method using opportunistic signals for wireless networks. Instead of broadcasting a dedicated broadband signal throughout the network for synchronization, high-bandwidth opportunistic signals already existing in the environment can be used. To avoid the necessity that all the nodes in the network are able to decode the opportunistic reference signal, a central node should receive the reference signal and then sends it again to all other nodes. Using ideas from the compressed sensing (CS) area, the high-bandwidth reference signal to be transmitted can be compressed efficiently before being sent to the other nodes, while still achieving an accurate correlation function compared to the low bandwidth reference signal scenario. In this way, only a low-bandwidth signal needs to be transmitted. Numerical results demonstrate that the proposed compressed technique achieves a similar performance at a much lower cost compared to using the high-bandwidth opportunistic signal directly.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123321540","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}
引用次数: 2
Ultra-high-density EEG: How many bits of resolution do the electrodes need? 超高密度脑电图:电极需要多少位分辨率?
2015 49th Asilomar Conference on Signals, Systems and Computers Pub Date : 2015-11-01 DOI: 10.1109/ACSSC.2015.7421277
P. Grover
{"title":"Ultra-high-density EEG: How many bits of resolution do the electrodes need?","authors":"P. Grover","doi":"10.1109/ACSSC.2015.7421277","DOIUrl":"https://doi.org/10.1109/ACSSC.2015.7421277","url":null,"abstract":"How much resolution do EEG electrodes need? We observe that as a consequence of the decay of EEG's high spatial frequencies, one needs to extract small high spatial frequency signals that are added to large low spatial frequencies. This requires high dynamic range and low noise from the sampling circuitry. Using simplistic spherical-head models, we provide information-theoretic bounds on the number of bits of resolution that the Analog-to-Digital Converters for EEG systems require to extract high spatial frequencies (as a function of the highest spatial frequency recovered), which also specifies the required signal-to-noise ratio (SNR) from these electrodes.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126972490","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
Potential throughput in 3D ultradense cellular networks 三维超密集蜂窝网络的潜在吞吐量
2015 49th Asilomar Conference on Signals, Systems and Computers Pub Date : 2015-11-01 DOI: 10.1109/ACSSC.2015.7421294
Abhishek K. Gupta, Xinchen Zhang, J. Andrews
{"title":"Potential throughput in 3D ultradense cellular networks","authors":"Abhishek K. Gupta, Xinchen Zhang, J. Andrews","doi":"10.1109/ACSSC.2015.7421294","DOIUrl":"https://doi.org/10.1109/ACSSC.2015.7421294","url":null,"abstract":"We consider a three dimensional (3D) ultradense urban cellular network where the base stations (BSs) are stacked vertically as well as extending infinitely in the horizontal plane. We use a dual-slope path-loss model where different path-loss exponents are used for distances less and greater than a corner distance Rc. We derive the scaling laws for coverage probability and potential throughput for 3D case, and prove that if the path- loss exponent α0 for the region inside Rc (termed as close-in region) is less than 3, then the SINR eventually decays to zero. We also show that the potential (i.e. best case) aggregate throughput decays to zero for α0 <; 1.5. We also consider a case where user density is kept fixed and show that potential throughput saturates as BSs becomes ultradense in this case.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115244063","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}
引用次数: 8
Low power design of a word-level finite field multiplier using Reordered Normal Basis 字级有限域乘法器的低功耗设计
2015 49th Asilomar Conference on Signals, Systems and Computers Pub Date : 2015-11-01 DOI: 10.1109/ACSSC.2015.7421165
P. H. Namin, R. Muscedere, M. Ahmadi
{"title":"Low power design of a word-level finite field multiplier using Reordered Normal Basis","authors":"P. H. Namin, R. Muscedere, M. Ahmadi","doi":"10.1109/ACSSC.2015.7421165","DOIUrl":"https://doi.org/10.1109/ACSSC.2015.7421165","url":null,"abstract":"A low power design for a finite field multiplier in F2m using Reordered Normal Basis (RNB) is presented. The main building block of the multiplier has been designed in domino logic. The basic idea is to reduce the contention between the keeper transistor and the pull-down network utilizing a new keeper control design to reduce the power dissipation. Simulation results in 65nm CMOS technology show that the proposed design offers 23.5% less power consumption compared to the previously presented design and 5% less than the static CMOS equivalent using the same basis while preserving the maximum operating speed of the dynamic design with almost no silicon area overhead.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116555229","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}
引用次数: 2
Angle-of-arrival based beamforming for FDD massive MIMO 基于到达角的FDD大规模MIMO波束形成
2015 49th Asilomar Conference on Signals, Systems and Computers Pub Date : 2015-11-01 DOI: 10.1109/ACSSC.2015.7421224
Xing Zhang, John Tadrous, E. Everett, F. Xue, A. Sabharwal
{"title":"Angle-of-arrival based beamforming for FDD massive MIMO","authors":"Xing Zhang, John Tadrous, E. Everett, F. Xue, A. Sabharwal","doi":"10.1109/ACSSC.2015.7421224","DOIUrl":"https://doi.org/10.1109/ACSSC.2015.7421224","url":null,"abstract":"A key challenge in FDD massive MIMO is the large overhead in CSI acquisition for closed-loop MIMO transmission. In this paper, we propose two novel types of angle-of-arrival (AoA) based beamforming schemes that harness the reciprocity of dominant AoA. Both schemes require CSI acquisition overhead that only scales with the number of served mobiles, not the number of base-station antennas. We analyze the performance of the proposed schemes both analytically and numerically. We show that both our proposed schemes lead to sum throughput that scales with the number of base-station antennas, and hybrid beamforming performs close to ideal zero-forcing beamforming.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"275 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122437000","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}
引用次数: 21
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信