{"title":"Robust Source Localization Exploiting Collaborative UAV Network","authors":"Shuimei Zhang, Ammar Ahmed, Yimin D. Zhang","doi":"10.1109/IEEECONF44664.2019.9049002","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9049002","url":null,"abstract":"In this paper, we propose a robust strategy to localize multiple ground sources exploiting a distributed unmanned aerial vehicle (UAV) network in the presence of impulse noise. We achieve robust source localization by using ℓ1-principal component analysis (ℓ1-PCA) based signal subspace estimation at each individual UAV. This approach significantly reduces the signal subspace perturbation compared to the conventional ℓ2-PCA based counterpart. The obtained robust signal subspace estimate is exploited to provide an improved estimate of the noise subspace, which is in turn utilized by the MUSIC algorithm to render coarse source localization at each individual UAV. The source localization information obtained at multiple UAVs is then fused by exploiting group sparsity using the re-weighted ℓ1 minimization. Simulation results demonstrate the effectiveness of the proposed approach.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"17 1","pages":"1437-1441"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73813252","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":"Decentralized Information Filtering Under Skew-Laplace Noise","authors":"J. Vilà‐Valls, F. Vincent, P. Closas","doi":"10.1109/IEEECONF44664.2019.9049032","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9049032","url":null,"abstract":"Localization in large sensor networks requires decentralized computationally efficient filtering solutions. To model challenging indoor propagation conditions, including non-line-of-sight conditions and other channel variations, it may be necessary to consider non-Gaussian distributed errors. In this case, Gaussian filters cannot be considered as is and particle filters do not meet the system requirements on computational cost and/or available memory. In this article we explore decentralized Gaussian information filtering strategies under skew-Laplace errors, exploiting the hierarchically Gaussian formulation of such distribution. An illustrative example is considered to show the performance and support the discussion.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"2 1","pages":"291-295"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75501957","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":"Distributed Sub-gradient Algorithms with Limited Communications","authors":"S. Rini, Milind Rao, A. Goldsmith","doi":"10.1109/IEEECONF44664.2019.9048683","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048683","url":null,"abstract":"We consider the distributed convex optimization scenario in which nodes in a network collectively find the minimum of a function utilizing only local communications and computations. Various sub-gradient algorithms have been developed for this optimization setting for the case in which the global function factorizes as the sum of local functions to be distributed to the nodes in network, including the distributed (i) online gradient descent, (ii) Nesterov gradient descent, and (iii) dual averaging algorithms. Generally speaking, these subgradient algorithms assume that, in each communication round, nodes can exchange messages of size comparable to that of the optimization variable. For many high-dimensional optimization problems, this communication requirement is beyond the capabilities of the communication network supporting the distributed optimization. For this reason, we propose a dimensionality reduction technique based on random projections to adapt these distributed optimization algorithms to networks with communication links of limited capacity. In particular, we analyze the performance of the proposed dimensionality reduction technique for the three algorithms above, i.e. (i)–(iii). Numerical simulations are presented that illustrate the performance of the proposed approach for these three algorithms.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"184 1","pages":"2171-2175"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73939163","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":"Clutter Cancellation in Passive Radar as a Dual Basis Projection","authors":"S. Searle, S. Howard","doi":"10.1109/IEEECONF44664.2019.9048824","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048824","url":null,"abstract":"Algorithms based on the Wiener filter provide effective clutter cancellation in passive radar. However such algorithms are computationally intensive. Recently some Fourier-domain techniques have emerged for efficient clutter cancellation when the illuminator of opportunity uses OFDM modulation. By reinterpreting the Fourier method as an oblique projection of the surveillance return we show that it can be generalised to apply approximately to any modulation type. Efficacy of the method is demonstrated by application to simulated and real data.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"5 1","pages":"123-127"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74579548","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}
Chance Tarver, Liwen Jiang, Aryan Sefidi, Joseph R. Cavallaro
{"title":"Neural Network DPD via Backpropagation through a Neural Network Model of the PA","authors":"Chance Tarver, Liwen Jiang, Aryan Sefidi, Joseph R. Cavallaro","doi":"10.1109/IEEECONF44664.2019.9048910","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048910","url":null,"abstract":"We demonstrate digital predistortion (DPD) using a novel, neural-network (NN) method to combat the nonlinearities in power amplifiers (PAs), which limit the power efficiency of mobile devices, increase the error vector magnitude, and cause inadequate spectral containment. DPD is commonly done with polynomial-based methods that use an indirect-learning architecture (ILA) which can be computationally intensive, especially for mobile devices, and overly sensitive to noise. Our approach using NNs avoids the problems associated with ILAs by first training a NN to model the PA then training a predistorter by backpropagating through the PA NN model. The NN DPD effectively learns the unique PA distortions, which may not easily fit a polynomial-based model, and hence may offer a favorable tradeoff between computation overhead and DPD performance. We demonstrate the performance of our NN method using two different power amplifier systems and investigate the complexity tradeoffs.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"74 1","pages":"358-362"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74956610","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":"Waveform Design for One-Bit Radar Systems Under Uncertain Interference Statistics","authors":"Arindam Bose, A. Ameri, Mojtaba Soltanalian","doi":"10.1109/IEEECONF44664.2019.9048693","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048693","url":null,"abstract":"An important problem in cognitive radar is to enhance the estimation performance of the system by a joint design of its probing signal and receive filter using the a priori information on interference. In such cases, the knowledge of interference statistics (particularly the covariance) plays a vital role in an effective design of the radar waveforms. In most practical scenarios, however, the received signal and interference statistics are available subject to some uncertainty. An extreme manifestation of this practical observation occurs for radars employing one-bit receivers, where only a normalized version of interference covariance matrix can be obtained. In this paper, we formulate a waveform optimization problem and devise an algorithm to design the transmit waveform and the receive filter of one-bit radars given such uncertainties in acquired interference statistics. The effectiveness of the proposed algorithm is corroborated through numerical analysis.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"45 1","pages":"1167-1171"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76479808","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":"Adaptive Beamforming Based on Interference Covariance Matrix Estimation","authors":"Yujie Gu, Yimin D. Zhang","doi":"10.1109/IEEECONF44664.2019.9048699","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048699","url":null,"abstract":"In this paper, we propose a robust adaptive beam-forming algorithm, where the interference-plus-noise covariance matrix is estimated by identifying and removing the desired signal component from the sample covariance matrix. For this purpose, we construct a desired signal subspace and its orthogonal subspace to identify the eigenvector of the sample covariance matrix corresponding to the desired signal. The adaptive beam-former is then designed using the estimated interference-plus-noise covariance matrix and the identified signal eigenvector. Because both are independent of the knowledge of the array geometry, the proposed adaptive beamformer is robust to array model mismatch. Simulation results demonstrate the effectiveness of the proposed robust adaptive beamforming algorithm.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"17 1","pages":"619-623"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85013415","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}
Ryosuke Tanabe, Yuto Ichikawa, Takanori Fujisawa, M. Ikehara
{"title":"Music Source Separation with Generative Adversarial Network and Waveform Averaging","authors":"Ryosuke Tanabe, Yuto Ichikawa, Takanori Fujisawa, M. Ikehara","doi":"10.1109/IEEECONF44664.2019.9048852","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048852","url":null,"abstract":"The task of music source separation is to extract a target sound from mixed sound. A popular approach for this task uses a DNN which learns the relationship of the spectrum of mixed sound and one of separated sound. However, many DNN algorithms does not consider the clearness of the output sound, this tends to produce artifact in the output spectrum. We adopt a generative adversarial network (GAN) to improve the clearness of the separated sound. In addition, we propose data augmentation by pitch-shift. The performance of DNN strongly depends on the quantity of the dataset for train. In other words, the limited kinds of the training datasets gives poor knowledge for the unknown sound sources. Learning the pitch-shifted signal can compensate the kinds of training set and makes the network robust to estimate the sound spectrum with various pitches. Furthermore, we process the pitch-shifted signals and average them to reduce artifacts. This proposal is based on the idea that network once learned can also separate pitch-shifted sound sources not only original one. Compared with the conventional method, our method achieves to obtain well-separated signal with smaller artifacts.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"41 1","pages":"1796-1800"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85139954","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":"Congestion Control Mechanisms in IEEE 802.11p and Sidelink C-V2X","authors":"A. Bazzi","doi":"10.1109/IEEECONF44664.2019.9048738","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048738","url":null,"abstract":"Connected vehicles are expected to play a major role in the next future to improve safety and traffic efficiency on the road and short-range technologies have been defined to enable the direct exchange of information. To this aim, two solutions are currently the subject of a debate that goes beyond the technician, i.e., IEEE 802.11p and sidelink cellular-vehicle-to-anything (C-V2X). Tested and mature for deployment the first, possibly more efficient the second. In both cases, one of the main aspects is the management of channel congestions, which can cause serious packet losses and have a critical impact on the reliability of applications. Congestions can be managed through different approaches, including the control of transmission power, packet generation frequency, and the adopted modulation and coding scheme. Congestion management has been well studied in IEEE 802.11p, with consolidated algorithms included in the standards, whereas it appears somehow as a new topic looking at C-V2X. In this work, a review of the main congestion control mechanisms and a discussion of their applicability and efficiency in the two technologies is provided. This topic is addressed without focusing on specific algorithms and with the aim to provide general guidelines as a starting point for new proposals.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"9 1","pages":"1125-1130"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85197265","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":"Channel Estimation for Massive MIMO: A Semiblind Algorithm Exploiting QAM Structure","authors":"B. Yilmaz, A. Erdogan","doi":"10.1109/IEEECONF44664.2019.9048774","DOIUrl":"https://doi.org/10.1109/IEEECONF44664.2019.9048774","url":null,"abstract":"We introduce a new channel matrix estimation algorithm for Massive MIMO systems to reduce the required pilot symbols. The proposed method is based on Maximum A Posteriori estimation where the density of QAM transmission symbols are approximated with continuous uniform pdf. Under this simplification, joint channel source estimation problem can be posed as an optimization problem whose objective is quadratic in each channel and source symbol matrices, separately. Also, the source symbols are constrained to lie in an ℓ∞-norm ball. The resulting framework serves as the channel estimation counterpart of the recently introduced compressed training based adaptive equalization framework. Numerical examples demonstrate that the proposed approach significantly reduces the required pilot length to achieve desired bit error rate performance.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"35 1","pages":"2077-2081"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85740848","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}