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

2019 53rd Asilomar Conference on Signals, Systems, and Computers最新文献

筛选
英文 中文
Adaptive Filtering in In-Memory-Based Architectures 基于内存的体系结构中的自适应过滤
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048764
C. Radhakrishnan, Sujan Kumar Gonugondla
{"title":"Adaptive Filtering in In-Memory-Based Architectures","authors":"C. Radhakrishnan, Sujan Kumar Gonugondla","doi":"10.1109/IEEECONF44664.2019.9048764","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048764","url":null,"abstract":"Deep in memory architecture (DIMA) has been proposed as a means to improve energy efficiency and latency over conventional digital architectures. DIMA reads multiple bits per bit-line (BL) in each cycle, and performs mixed-signal processing at the periphery of the bit cell array (BCA). While DIMA provides considerable performance benefits, the multi-row read is a non-linear operation. This work studies the impact of non-linearity and variations on stochastic gradient descent (SGD). The analysis is carried out in the context of LMS adaptive filters. The steady state MSE of the filter remains unaffected while convergence rate depends parameters associated with DIMA read operation. The insights are useful in context of learning systems employing gradient descent techniques.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"105 1","pages":"784-788"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80733086","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
Simultaneous Track and Search Multiple-Channel Multiple-User Receiver (MCMUR) for Joint Radar-Communications Systems 联合雷达通信系统同步跟踪和搜索多通道多用户接收机(MCMUR)
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9049054
A. Chiriyath, C. Richmond, D. Bliss
{"title":"Simultaneous Track and Search Multiple-Channel Multiple-User Receiver (MCMUR) for Joint Radar-Communications Systems","authors":"A. Chiriyath, C. Richmond, D. Bliss","doi":"10.1109/IEEECONF44664.2019.9049054","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9049054","url":null,"abstract":"A multiple-channel multiple-user receiver (MCMUR) exploits both spatial and temporal degrees of freedom to separate radar and communications signals coexisting jointly in the same frequency band, and to cancel interference waveforms. In this paper, we present the simultaneous track and search MCMUR, a novel mode of operation for the multi-antenna joint receiver. We discuss this novel operation of the receiver and present theoretical bounds on the detection and estimation performance of the simultaneous track and search MCMUR. We present a theoretically assessed receiver operating characteristic (ROC) analysis of the MCMUR herein to better understand the performance gains of the MCMUR at false alarm rates that are more informative of an actual radar systems' performance. We also measure the detection and estimation performance of the joint system through the detection and estimation information rates respectively.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"8 1","pages":"544-549"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89849142","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
Correcting Deletions in Probabilistic Non-Binary Segmented Burst Deletion Channels 概率非二值分割突发删除信道中的删除校正
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048839
Chen Yi, J. Kliewer
{"title":"Correcting Deletions in Probabilistic Non-Binary Segmented Burst Deletion Channels","authors":"Chen Yi, J. Kliewer","doi":"10.1109/IEEECONF44664.2019.9048839","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048839","url":null,"abstract":"Consider a burst deletion channel where in a block of L consecutive non-binary symbols at most a single burst deletion of length b symbols exists. Existing schemes for this scenario leverage non-binary de Bruijn sequences to perfectly locate deletions. In contrast, we propose to solely use binary marker patterns in combination with a new soft-decision decoder. In this scheme, deletions are soft located by assigning a posteriori probabilities for the location of every burst deletion event of length of at most b, and replaced by erasures, then the resulting errors are further corrected by an outer channel code. Such a scheme has an advantage over the non-binary scheme as it in general increases the rate compared to an approach based on non-binary de Bruijn sequences, with only a minor loss in performance of locating a deletion error. Also, the proposed scheme provides a better error correction performance than existing schemes for the same code rate.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"33 1","pages":"1349-1353"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82551532","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
A Machine Learning Solution for Beam Tracking in mmWave Systems 毫米波系统中波束跟踪的机器学习解决方案
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048770
Daoud Burghal, Naveed A. Abbasi, A. Molisch
{"title":"A Machine Learning Solution for Beam Tracking in mmWave Systems","authors":"Daoud Burghal, Naveed A. Abbasi, A. Molisch","doi":"10.1109/IEEECONF44664.2019.9048770","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048770","url":null,"abstract":"Utilizing millimeter-wave (mmWave) frequencies for wireless communication in mobile systems is challenging since it requires continuous tracking of the beam direction. Recently, beam tracking techniques based on channel sparsity and/or Kalman filter-based techniques were proposed where the solutions use assumptions regarding the environment and device mobility that may not hold in practical scenarios. In this paper, we explore a machine learning-based approach to track the angle of arrival (AoA) for specific paths in realistic scenarios. In particular, we use a recurrent neural network (R-NN) structure with a modified cost function to track the AoA. We propose methods to train the network in sequential data, and study the performance of our proposed solution in comparison to an extended Kalman filter based solution in a realistic mmWave scenario based on stochastic channel model from the QuaDRiGa framework. Results show that our proposed solution outperforms an extended Kalman filter-based method by reducing the AoA outage probability, and thus reducing the need for frequent beam search.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"19 1","pages":"173-177"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79448240","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}
引用次数: 19
The Local Geometry of Orthogonal Dictionary Learning using L1 Minimization 使用L1最小化的正交字典学习的局部几何
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9049030
Qiuwei Li, Zhihui Zhu, M. Wakin, Gongguo Tang
{"title":"The Local Geometry of Orthogonal Dictionary Learning using L1 Minimization","authors":"Qiuwei Li, Zhihui Zhu, M. Wakin, Gongguo Tang","doi":"10.1109/IEEECONF44664.2019.9049030","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9049030","url":null,"abstract":"Feature learning that extracts concise and general- izable representations for data is one of the central problems in machine learning and signal processing. Sparse dictionary learning, also known as sparse coding, distinguishes from other feature learning techniques in sparsity exploitation, allowing the formulation of nonconvex optimizations that simultaneously uncover a structured dictionary and sparse representations. Despite the popularity of dictionary learning in applications, the landscapes of these optimizations that enable effective learning largely remain a mystery. This work characterizes the local optimization geometry for a simplified version of sparse coding where the L1 norm of the sparse coefficient matrix is minimized subject to orthogonal dictionary constraints. In particular, we show that the ground-truth dictionary and coefficient matrix are locally identifiable under the assumption that the coefficient matrix is sufficiently sparse and the number of training data columns is sufficiently large.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"110 1","pages":"1217-1221"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78377812","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
Spatial Properties of Industrial Wireless Ultra-Reliable Low-Latency Communication MIMO Links 工业无线超可靠低延迟通信MIMO链路的空间特性
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048729
Stefan Zelenbaba, M. Hofer, David Löschenbrand, Georg Kail, Martin Schiefer, T. Zemen
{"title":"Spatial Properties of Industrial Wireless Ultra-Reliable Low-Latency Communication MIMO Links","authors":"Stefan Zelenbaba, M. Hofer, David Löschenbrand, Georg Kail, Martin Schiefer, T. Zemen","doi":"10.1109/IEEECONF44664.2019.9048729","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048729","url":null,"abstract":"We show the results of a measurement campaign done in an industrial hall, and analyse a frequency-selective 2 × 2 multiple-input multiple-output channel. The transmitter is kept static while the receiver moves across a positioning board between line-of-sight and obstructed line-of-sight. We compare capacities, delay spreads and fading patterns of different antenna settings. We observe that higher outage capacity is achieved when using co-polarized rather than cross-polarized dipoles. The settings with higher capacity rates also show lower root-mean-square delay spread values, due to the presence of a strong line-of-sight component. We observe how polarization and antenna alignment influence the fading patterns.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"240 1","pages":"1054-1058"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76749920","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
Practically Constrained Waveform Design for MIMO Radar in the Presence of Multiple Targets 多目标条件下MIMO雷达实际约束波形设计
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048984
Xianxiang Yu, Khaled Alhujaili, G. Cui, V. Monga
{"title":"Practically Constrained Waveform Design for MIMO Radar in the Presence of Multiple Targets","authors":"Xianxiang Yu, Khaled Alhujaili, G. Cui, V. Monga","doi":"10.1109/IEEECONF44664.2019.9048984","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048984","url":null,"abstract":"This paper deals with the joint design of Multiple-Input Multiple-Output (MIMO) radar transmit waveform and receive filter to enhance multiple targets detectability in the presence of signal-dependent (clutter) and independent disturbance. The worst-case Signal-to-Interference-Noise-Ratio (SINR) over multiple targets is explicitly maximized. To ensure hardware compatibility and the coexistence between MIMO radar and other wireless systems, constant modulus and spectral restrictions on the waveform are incorporated in our design. A max-min non-convex optimization problem emerges as a function of the transmit waveform, which we solve via a novel polynomial-time iterative procedure that involves solving a sequence of convex problems with constraints that evolve with every iteration. We provide analytical guarantees of monotonic cost function improvement with proof of convergence to a solution that satisfies the KarushKuhnTucker (KKT) conditions. By simulating challenging practical scenarios, we evaluate the proposed algorithm against the state-of-the-art methods in terms of the achieved SINR value and the computational complexity.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"53 1","pages":"1539-1544"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77125341","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
FedDANE: A Federated Newton-Type Method FedDANE:联邦牛顿型方法
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9049023
Tian Li, Anit Kumar Sahu, M. Zaheer, Maziar Sanjabi, Ameet Talwalkar, Virginia Smith
{"title":"FedDANE: A Federated Newton-Type Method","authors":"Tian Li, Anit Kumar Sahu, M. Zaheer, Maziar Sanjabi, Ameet Talwalkar, Virginia Smith","doi":"10.1109/IEEECONF44664.2019.9049023","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9049023","url":null,"abstract":"Federated learning aims to jointly learn statistical models over massively distributed remote devices. In this work, we propose FedDANE, an optimization method that we adapt from DANE [8], [9], a method for classical distributed optimization, to handle the practical constraints of federated learning. We provide convergence guarantees for this method when learning over both convex and non-convex functions. Despite encouraging theoretical results, we find that the method has underwhelming performance empirically. In particular, through empirical simulations on both synthetic and real-world datasets, FedDANE consistently underperforms baselines of FedAvg [7] and FedProx [4] in realistic federated settings. We identify low device participation and statistical device heterogeneity as two underlying causes of this underwhelming performance, and conclude by suggesting several directions of future work.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"25 1","pages":"1227-1231"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77423778","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}
引用次数: 108
Optimal replay-based channel simulation via dithering methods 基于抖动方法的最优重播信道仿真
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9049034
Sijung Yang, A. Singer
{"title":"Optimal replay-based channel simulation via dithering methods","authors":"Sijung Yang, A. Singer","doi":"10.1109/IEEECONF44664.2019.9049034","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9049034","url":null,"abstract":"We investigate replay-based channel simulation methods that reuse data collected from expensive field experiments through the use of dither within the standard communication pipeline. While traditional playback simulations rely on accurate channel models and their estimates, the method proposed here reduces the effect of channel estimation errors and unmodeled effects by exploiting similarities between different input signals. A notion of optimality of the proposed scheme will be discussed from the perspective of a related estimation problem. Finally, the proposed scheme is tested both numerically and experimentally with field data collected from MACE 10 experiments.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"3 1","pages":"957-963"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74123129","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
A 2.5d Yolo-Based Fusion Algorithm for 3d Localization Of Cells 基于2.5d yolo的细胞三维定位融合算法
2019 53rd Asilomar Conference on Signals, Systems, and Computers Pub Date : 2019-11-01 DOI: 10.1109/IEEECONF44664.2019.9048710
A. Ziabari, Derek C. Rose, Matthew R. Eicholtz, D. Solecki, A. Shirinifard
{"title":"A 2.5d Yolo-Based Fusion Algorithm for 3d Localization Of Cells","authors":"A. Ziabari, Derek C. Rose, Matthew R. Eicholtz, D. Solecki, A. Shirinifard","doi":"10.1109/IEEECONF44664.2019.9048710","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048710","url":null,"abstract":"Advances in microscopy techniques such as lattice-light-sheet, confocal, two-photon, and electron microscopy have enabled the visualization of 3D image volumes of tightly packed cells, extracellular structures in tissues, organelles, and subcellular components inside cells. These images sampled by 2D projections are often not accurately interpreted even by human experts. As a use case we focus on 3D image volumes of tightly packed nuclei in brain tissue. Due to out-of-plane excitation and low resolution in the z-axis, non-overlapping cells appear as overlapping 3D volumes and make detecting individual cells challenging. On the other hand, running 3D detection algorithms is computationally expensive and infeasible for large datasets. In addition, most existing 3D algorithms are designed to extract 3D objects by identifying the depth in the 2D images. In this work, we propose a YOLO-based 2.5D fusion algorithm for 3D localization of individual cells in densely packed volumes of nuclei. The proposed method fuses 2D detection of nuclei in sagittal, coronal, and axial planes and predicts six coordinates of the 3D bounding cubes around the detected 3D cells. Promising results were obtained on multiple examples of synthetic dense volumes of nuclei imitating confocal microscopy experimental datasets.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"37 1","pages":"2185-2190"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74178709","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
首页 上一页
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学术官方微信