{"title":"MIMO radar using sparse sensing: A weighted sparse Bayesian learning (WSBL) approach","authors":"Ahmed Al Hilli, A. Petropulu","doi":"10.1109/ACSSC.2017.8335141","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335141","url":null,"abstract":"A colocated Multiple-Input Multiple-Output (MIMO) radar system is studied, in which the receive antennas implement sparse sensing and then forward their compressively obtained samples to a fusion center. Assuming sparsely distributed targets in the direction-of-arrival (DOA) space, the fusion center can estimate the targets by formulating and solving a sparse signal recovery problem. In this paper, we propose a weighted Sparse Bayesian Learning (WSBL) approach for target DOA estimation. Using a low resolution estimate of the sparse vector, the proposed approach assigns different weights to different entries of the sparse vector, giving more importance to some entries over others. Subsequently, the weighted sparse signal recovery problem is solved along the lines of the Sparse Bayesian Learning (SBL) framework. The proposed approach shows robustness for increased number of sources, and lower SNR as compared to SBL and the Dantzig selector approach.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"19 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":"128163721","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}
T. Wirth, Matthias Mehlhose, L. Thiele, T. Haustein
{"title":"Proof-of-concept of flexible massive MIMO beamforming at 2.4 GHz","authors":"T. Wirth, Matthias Mehlhose, L. Thiele, T. Haustein","doi":"10.1109/ACSSC.2017.8335512","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335512","url":null,"abstract":"The next wireless communication system will support flexible beamforming and beam-sweeping to realize high capacity demands. This can be achieved with Massive MIMO systems realizing high beamforming gains as well as higher order multi-user multiplexing. Real proof-of-concepts are required to evaluate algorithms and show performance gains. In general, prototyping of M-MIMO systems is challenging, since many transceiver chains have to be calibrated and data streams synchronized. In this paper, we perform measurements in an indoor environment using a real M-MIMO SDR system with 16 active antenna ports. System-level simulations on recorded measurement data highlight downlink throughput results for individual users.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"1081 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":"128286758","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 joint combiner and bit allocation design for massive MIMO using genetic algorithm","authors":"I. Ahmed, H. Sadjadpour, S. Yousefi","doi":"10.1109/ACSSC.2017.8335509","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335509","url":null,"abstract":"In this paper, we derive a closed-form expression for the combiner of a multiple-input-multiple-output (MIMO) receiver equipped with a minimum-mean-square-error (MMSE) estimator. We propose using variable-bit-resolution analog-to-digital converters (ADC) across radio frequency (RF) paths. The combiner designed is a function of the quantization errors across each RF path. Using very low bit resolution ADCs (1–2bits) is a popular approach with massive MIMO receiver architectures to mitigate large power demands. We show that for certain channel conditions, adopting unequal bit resolution ADCs (e.g., between 1 and 4 bits) on different RF chains, along with the proposed combiner, improves the performance of the MIMO receiver in the Mean Squared Error (MSE) sense. The variable-bit-resolution ADCs is still within the power constraint of using equal bit resolution ADCs on all paths (e.g., 2-bits). We propose a genetic algorithm in conjunction with the derived combiner to arrive at an optimal ADC bit allocation framework with significant reduction in computational complexity.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"76 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":"127545553","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":"Geometric description and characterization of time series signals","authors":"L. Crider, D. Cochran","doi":"10.1109/ACSSC.2017.8335364","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335364","url":null,"abstract":"This paper considers time series signals in Rn as samples of an embedded space curve and proceeds to characterize such signals in terms of differential-geometric descriptors of their associated curves. In particular, a method of estimating curvature as a function of arc length is presented. Because arc length is invariant to reparameterization of a space curve, this approach provides a representation of the evolution of the time series that is invariant to local variations in the rate of the time series as well as displacement and rotation of the curve in space. The focus here is on ascertaining structural similarity of time series signals by measuring similarity of their curvatures, though extension to other applications and other geometric descriptors (e.g., torsion) is envisioned.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"108 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":"127959664","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":"Joint design for co-existence of MIMO radar and MIMO communication system","authors":"Junhui Qian, M. Lops, Le Zheng, Xiaodong Wang","doi":"10.1109/ACSSC.2017.8335405","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335405","url":null,"abstract":"The paper studies the scenario in which a multiple-input multiple-output (MIMO) radar coexists with a MIMO wireless communication system in the presence of clutter. The radar space-time transmit code, the radar space-time receive filter, and the communication space-time transmit covariance matrix are jointly optimized. An iterative procedure is developed to maximize the radar output signal to interference plus noise ratio (SINR) under the constraints of the communication rate, the radar waveform similarity and the power of radar and communication. Numerical results highlight the applicability of the proposed method in different scenarios.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"191 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":"126748285","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}
M. Roncken, I. Sutherland, Chris Chen, Yong Hei, W. Hunt, C. Chau, Swetha Mettala Gilla, Hoon Park, Xiaoyu Song, Anping He, Hong Chen
{"title":"How to think about self-timed systems","authors":"M. Roncken, I. Sutherland, Chris Chen, Yong Hei, W. Hunt, C. Chau, Swetha Mettala Gilla, Hoon Park, Xiaoyu Song, Anping He, Hong Chen","doi":"10.1109/ACSSC.2017.8335628","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335628","url":null,"abstract":"Self-timed systems divide nicely into two kinds of components: communication links that transport and store data, and computation joints that apply logic to data. We treat these two types of self-timed components as equally important. Putting communication on a par with computation acknowledges the increasing cost of data transport and storage in terms of energy, time, and area. Our clean separation of data transport and storage from logic simplifies the design and test of self-timed systems. The separation also helps one to grasp how self-timed systems work. We offer this paper in the hope that better understanding of self-timed systems will engage the minds of compiler, formal verification, and test experts.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"26 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":"121448980","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":"Coupled matrix-tensor factorizations — The case of partially shared factors","authors":"L. D. Lathauwer, Eleftherios Kofidis","doi":"10.1109/ACSSC.2017.8335436","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335436","url":null,"abstract":"Coupled matrix-tensor factorizations have proved to be a powerful tool for data fusion problems in a variety of applications. Uniqueness conditions for such coupled decompositions have only recently been reported, demonstrating that coupling through a common factor can ensure uniqueness beyond what is possible when considering separate decompositions. In view of the increasing interest in application scenarios involving more general notions of coupling, we revisit in this paper the uniqueness question for the important case where the factors common to the tensor and the matrix only share some of their columns. Related computational aspects and numerical examples are also discussed.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"34 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":"122188921","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":"Uniquely generated paraunitary-based complementary QAM sequences","authors":"P. Spasojevic, Srdjan Z. Budisin","doi":"10.1109/ACSSC.2017.8335659","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335659","url":null,"abstract":"A Boolean generator for a broad set of standard pairs of complex valued complementary sequences of length 2K is proposed. Binary, M-PSK and QAM sequences can be generated. The Boolean generator is derived from our earlier paraunitary algorithm from 2013 that is based on matrix multiplication. Both algorithms are based on unitary matrices. In contrast to previous Boolean QAM algorithms, which have an additive form, our algorithm has a multiplicative form. Any element of the sequence can be efficiently generated by indexing entries of K unitary matrices using a binary counter. MQum generation algorithm uses exactly M <K QAM unitary matrices each having at least one non-unit-norm entry. Greatest common divisor of Gaussian integers plays a key role in ensuring that the algorithm generates a set of unique sequences and, consequently, in deriving their enumeration formula. Our 1Qum and 2Qum algorithms generate generalized Case I, II and III, as well as, generalized Case IV and V sequences given by Liu et al. in 2013, respectively, in addition to many other sequences. The ratio of the total number to Case I-V sequences grows with the constellation size and the sequence length. As an example, for 1024-QAM and length 1024, our algorithm generates 340% additional sequences.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"2 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":"114144071","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":"Detection and mitigation of pilot spoofing attack","authors":"Jitendra Tugnait","doi":"10.1109/ACSSC.2017.8335643","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335643","url":null,"abstract":"In a time-division duplex (TDD) multiple antenna system, the channel state information (CSI) can be estimated using reverse training. A pilot contamination (spoofing) attack occurs when during the training phase, an adversary (spoofer) also sends identical training (pilot) signal as that of the legitimate receiver. This contaminates channel estimation and alters the legitimate beamforming design, facilitating eavesdropping. A recent approach proposed superimposing a random sequence on the training sequence at the legitimate receiver and then using the minimum description length (MDL) criterion to detect pilot contamination attack. In this paper we augment this approach with joint estimation of both legitimate receiver and eavesdropper channels, and secure beamforming, to mitigate the effects of pilot spoofing. We consider two cases: (i) the spoofer transmits only the pilot signal, (ii) the spoofer also adds a random sequence to its pilot. The proposed mitigation approach is illustrated via simulations.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"20 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120940490","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}
F. Sheikh, Ankit Sharma, O. Andersson, Mehnaz Rahman, Dongmin Yoon, Alexios Balatsoukas-Stimming, D. Dasalukunte, A. Chun
{"title":"Adaptive and multi-mode baseband systems for next generation wireless communication","authors":"F. Sheikh, Ankit Sharma, O. Andersson, Mehnaz Rahman, Dongmin Yoon, Alexios Balatsoukas-Stimming, D. Dasalukunte, A. Chun","doi":"10.1109/ACSSC.2017.8335606","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335606","url":null,"abstract":"System adaptivity has been studied since the mid-60s and recently there has been a surge in interest in self-adaptive systems, especially in the software engineering community, with its main application to cybernetics. In this work, we apply self-adaptivity to multi-mode baseband processing systems for 5G wireless communications to exploit channel characteristics to modify the computation of digital baseband processing subsystems for energy savings. The gains from self-adaptivity are exemplified in the design of lattice reduction aided MIMO detection and extended out to other baseband subsystems such as multi-mode FIR filters, and multi-point FFT computation.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"88 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":"121097164","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}