{"title":"Near-Optimal Quantization for LoS MIMO with QPSK Modulation","authors":"Ahmet Dundar Sezer, Upamanyu Madhow","doi":"10.1109/IEEECONF44664.2019.9048696","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048696","url":null,"abstract":"As signaling bandwidths increase, analog-to-digital conversion becomes a fundamental bottleneck for modern all-digital baseband signal processing architectures. Motivated by emerging millimeter (mm) wave communication systems, we investigate the impact of severe quantization for 2 × 2 and 4×4 line-of-sight (LoS) multi-input and multi-output (MIMO) systems employing QPSK. Unlike prior work on MIMO with low-precision quantization, channel state information is utilized only at the receiver (i.e., transmit precoding is not employed). Rather than designing an optimal quantizer, we focus on quantizers with regular structure, and ask whether high-SNR performance approaches that of an unquantized system. First, we prove for a 2×2 MIMO system that phase-only quantization (attractive because it does not require automatic gain control) is unable to achieve this, but that 2-level amplitude and 8-level phase quantization can achieve the maximum data rate of 4 bits per channel use as SNR gets large. We then show that quantizer design based on conventional minimum mean squared quantization error (MMSQE) criterion performs worse than a quantizer based on equal-probability regions. We show that I/Q quantization with 16 regions per antenna using the equal probability criterion achieves the unquantized benchmark at high SNR, which is a maximum data rate of 8 bits per channel use. We illustrate our investigations via numerical examples.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"32 1","pages":"1015-1020"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88961796","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}
{"title":"MEDA: Multi-output Encoder-Decoder for Spatial Attention in Convolutional Neural Networks","authors":"Huayu Li, A. Razi","doi":"10.1109/IEEECONF44664.2019.9048981","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048981","url":null,"abstract":"Utilizing channel-wise spatial attention mechanisms to emphasize special parts of an input image is an effective method to improve the performance of convolutional neural networks (CNNs). There are multiple effective implementations of attention mechanism. One is adding squeeze-and-excitation (SE) blocks to the CNN structure that selectively emphasize the most informative channels and suppress the relatively less informative channels by taking advantage of channel dependence. Another method is adding convolutional block attention module (CBAM) to implement both channel-wise and spatial attention mechanisms to select important pixels of the feature maps while emphasizing informative channels. In this paper, we propose an encoder-decoder architecture based on the idea of letting the channel-wise and spatial attention blocks share the same latent space representation. Instead of separating the channel-wise and spatial attention modules into two independent parts in CBAM, we combine them into one encoder-decoder architecture with two outputs. To evaluate the performance of the proposed algorithm, we apply it to different CNN architectures and test it on image classification and semantic segmentation. Through comparing the resulting structure equipped with MEDA blocks against other attention module, we show that the proposed method achieves better performance across different test scenarios.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"13 1","pages":"2087-2091"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89029316","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}
Hieu Tran-Dinh, T. Vu, S. Chatzinotas, B. Ottersten
{"title":"Energy-efficient Trajectory Design for UAV-enabled Wireless Communications with Latency Constraints","authors":"Hieu Tran-Dinh, T. Vu, S. Chatzinotas, B. Ottersten","doi":"10.1109/IEEECONF44664.2019.9048942","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048942","url":null,"abstract":"This paper studies a new energy-efficient unmanned aerial vehicle (UAV)-enabled wireless communications, where the UAV acts as a flying base station (BS) to serve the ground users (GUs) within some predetermined latency limitations, e.g., requested timeout (RT). Our goal is to design the UAV trajectory to minimize the total energy consumption while satisfying the RT requirement from every GU, which is accomplished via two consecutive subproblems: traveling time minimization and energy minimization problems. Firstly, we propose two exhaustive search and heuristic algorithms based on the traveling salesman problem with time window (TSPTW) in order to minimize the UAV’s traveling time without violating the GUs’ RT requirements. While the exhaustive algorithm achieves the best performance at a high computation cost, the heuristic algorithm achieves a trade-off between the performance and complexity. Secondly, we minimize the total energy consumption, for a given trajectory, via a joint optimization of the UAV’s velocity along subsequent hops. Finally, numerical results are presented to demonstrate the effectiveness of our proposed algorithms. In particular, it is shown that the proposed solutions outperform the reference in terms of both energy consumption and outage performance.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"5 1","pages":"347-352"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86428176","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}
{"title":"A Hybrid Sensing and Reinforcement Learning Scheduler for Vehicle-to-Vehicle Communications","authors":"T. Şahin, Mate Boban, R. Khalili, A. Wolisz","doi":"10.1109/IEEECONF44664.2019.9048691","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048691","url":null,"abstract":"Vehicle-to-vehicle (V2V) communications performance depends significantly on the approach taken to schedule the radio resources. When the infrastructure is available, so far the best performing V2V scheduling algorithms are based on centralized approach. In case there is no infrastructure, sensing the resources in a distributed manner to determine whether a specific resource is free performs well. We propose a hybrid solution, where a centralized reinforcement learning (RL) algorithm provides a candidate subset of resources, whereas a distributed sensing mechanism, running on each vehicle, makes the final resource selection. We evaluate the performance of the proposed approach in an out-of-coverage setting and show that it outperforms the state-of-the-art algorithms in highly dynamic scenarios by using the best of both worlds: RL agent provides optimized long-term resource allocations, while the distributed sensing handles temporary and unforeseen network conditions that can not be predicted effectively.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"72 1","pages":"1136-1143"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81224549","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}
A. S. Bedi, Alec Koppel, Brian M. Sadler, V. Elvira
{"title":"Compressed Streaming Importance Sampling for Efficient Representations of Localization Distributions","authors":"A. S. Bedi, Alec Koppel, Brian M. Sadler, V. Elvira","doi":"10.1109/IEEECONF44664.2019.9048744","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048744","url":null,"abstract":"Importance sampling (IS) is the standard Monte Carlo tool to compute integrals involving random variables such as their mean or higher-order moments. This procedure permits localizing a source signal corrupted by observation noise whose distribution is arbitrary, in contrast to typical Gaussian assumptions. We note that IS is asymptotically consistent as the number of Monte Carlo samples, and hence Dirac deltas (particles) that parameterize the density estimate, go to infinity. Unfortunately, allowing the number of particles in the density approximation to go to infinity is computationally intractable. Here we present a methodology for only keeping a finite representative subset of particles and their augmented importance weights that is nearly statistically consistent. To do so, we approximate importance sampling in two ways: we (1) replace the deltas by kernels, yielding kernel density estimates; (2) and sequentially project the kernel density estimates onto nearby lower-dimensional subspaces. Theoretically, the asymptotic bias of this scheme is characterized by a compression parameter and the kernel bandwidth, which yields a tunable trade-off between statistical consistency and memory. We then evaluate the validity of the proposed approach for a localization problem in wireless systems, and observed that the proposed algorithm and yields a favorable trade-off between memory and accuracy.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"10 1","pages":"477-481"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81255639","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}
{"title":"Voice Transformation Using Two-Level Dynamic Warping","authors":"Al-Waled Al-Dulaimi, T. Moon, J. Gunther","doi":"10.1109/IEEECONF44664.2019.9048717","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048717","url":null,"abstract":"Voice transformation, for example, from a male speaker to a female speaker, is achieved here using a two-level dynamic warping. An outer warping process, which temporally aligns blocks of speech (dynamic time warp), invokes an inner warping process, which spectrally aligns based on magnitude spectra (dynamic frequency warp). The mapping function produced by the dynamic frequency warp is used to move spectral information from a source speaker to a target speaker. Information obtained by this process is used to train an artificial neural network to produce spectral warping output information based on spectral input data.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"1 1","pages":"143-147"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89668200","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}
K. Ngo, M. Guillaud, Alexis Decurninge, Sheng Yang, Subrata Sarkar, P. Schniter
{"title":"Non-Coherent Multi-User Detection Based on Expectation Propagation","authors":"K. Ngo, M. Guillaud, Alexis Decurninge, Sheng Yang, Subrata Sarkar, P. Schniter","doi":"10.1109/IEEECONF44664.2019.9049073","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9049073","url":null,"abstract":"In this paper, we propose a novel soft-output multi-user detector for non-coherent multiple access with Grassmannian signaling under Rayleigh block fading. Our detector is based on expectation propagation (EP) approximate inference and has polynomial complexity in the number of users. A simplified version of this scheme coincides with a scheme based on soft minimum-mean-square-error (MMSE) estimation and successive interference cancellation (SIC). Both schemes, especially EP, produce accurate approximates of the true posterior. They outperform a baseline decoder based on projecting the received signal onto the subspace orthogonal to the interference in terms of both hard-detected symbol error rate and coded bit error rate.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"30 1","pages":"2092-2096"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86588238","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}
Jarkko Kaleva, Nitin Jonathan Myers, Antti Tölli, R. Heath, Upamanyu Madhow
{"title":"Short Range 3D MIMO mmWave Channel Reconstruction via Geometry-aided AoA Estimation","authors":"Jarkko Kaleva, Nitin Jonathan Myers, Antti Tölli, R. Heath, Upamanyu Madhow","doi":"10.1109/IEEECONF44664.2019.9048890","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048890","url":null,"abstract":"In some millimeter wave (mmWave) applications, such as wearables, the distance between the transceivers is relatively short. Further, the channel has significant angular spread in both azimuth and elevation domains even in line-of-sight (LoS). Under such conditions, hybrid mmWave architectures with multiple analog uniform planar arrays (UPAs) potentially allow spatial multiplexing even in LoS provided that the high rank structure of the channel is captured. The conventional far-field channel estimation methods are not generally suitable for these scenarios and perform poorly. We consider parametrized spatial channel estimation, where the known antenna array geometry is exploited to recover the angle-of-arrivals (AoAs) of the 3D multiple-input multiple-output (MIMO) channel. The channel is then reconstructed using these AoA estimates and the known geometry. We show that conventional maximum a posteriori (MAP) estimation of the channel parameters suffers from high computational complexity and may not be not applicable for low powered devices. To this end, we propose a lower complexity message passing algorithm for short range channel estimation. We show, by numerical examples, that the proposed technique achieves good performance with fewer pilot resources when compared to compressed sensing or antenna specific pilot based channel estimation.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"66 1","pages":"427-431"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85775358","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}
Burak Kakillioglu, Jiyang Wang, Senem Velipasalar, A. Janani, E. Koch
{"title":"3D Sensor-Based UAV Localization for Bridge Inspection","authors":"Burak Kakillioglu, Jiyang Wang, Senem Velipasalar, A. Janani, E. Koch","doi":"10.1109/IEEECONF44664.2019.9048979","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048979","url":null,"abstract":"Autonomous vehicles often benefit from the Global Positioning System (GPS) for navigational guidance as people do with their mobile phones or automobile radios. However, since GPS is not always available or reliable everywhere, autonomous vehicles need more reliable systems to understand where they are and where they should head to. Moreover, even though GPS is reliable, autonomous vehicles usually need extra sensors for more precise position estimation. In this work, we propose a localization method for autonomous Unmanned Aerial Vehicles (UAVs) for infrastructure health monitoring without relying on GPS data. The proposed method only depends on depth image frames from a 3D camera (Structure Sensor) and the 3D map of the structure. Captured 3D scenes are projected onto 2D binary images as templates, and matched with the 2D projection of relevant facade of the structure. Back-projections of matching regions are then used to calculate 3D translation (shift) as estimated position relative to the structure. Our method estimates position for each frame independently from others at a rate of 200Hz. Thus, the error does not accumulate with the traveled distance. The proposed approach provides promising results with mean Euclidean distance error of 13.4 cm and standard deviation of 8.4cm.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"73 1","pages":"1926-1930"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84212839","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}
Stefan L. Sumsky, Taylor Somma, S. Santaniello, Mark Schomer
{"title":"Modularity-Based Detection of Ripples in Scalp EEG","authors":"Stefan L. Sumsky, Taylor Somma, S. Santaniello, Mark Schomer","doi":"10.1109/IEEECONF44664.2019.9048848","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048848","url":null,"abstract":"Ripples (80–250Hz) are promising markers of epileptogenic activity, but the diagnostic value of ripples in scalp EEG remains debated. In this study, we propose an unsupervised, cluster-based method to detect candidate ripples in scalp EEG and sort ripples according to their morphology and information content in the time-frequency domain. We also correlate the presence of ripples to the presence of interictal spikes, which are clinically recognized markers of epileptogenic activity. Our method combines feature-based agglomerative clustering and correlation-based community detection and was tested on scalp EEG from 3 children with epilepsy (age: 10±1 [mean ± SD], 2 male, 1 female). For each patient, one epoch of EEG during wakefulness and one epoch during sleep (stage N2–N3) were considered (wakefulness: 12.57±3.39 min; sleep: 14.68±0.49 min, mean ± SD). The proposed method showed high specificity in detecting ripples while rejecting artifacts and resulted in a minimal set of ripple templates that are consistent across patients and sleep condition. Also, the rate of ripples was higher in EEG channels that presented spikes (0.38±0.07 versus 0.24±0.07 ripples/min [mean ± SD]). Altogether, results indicate that morphology and spectral content of scalp ripples may be patient-independent and specific to the epileptogenic activity, which suggest scalp ripples as viable markers for noninvasive epilepsy diagnosis.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"35 1","pages":"250-253"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82632936","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}