Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach
|
|
- Silas Harper
- 5 years ago
- Views:
Transcription
1 Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach Athina P. Petropulu Department of Electrical and Computer Engineering Rutgers, the State University of New Jersey Acknowledgments Shunqiao Sun, D. Kalogerias, W. Bajwa, Rutgers University Office of Naval Research Grant ONR-N National Science Foundation ECCS December 11, 2014 A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
2 Motivation There is increasing interest in networked radars that are inexpensive and enable reliable surveillance. Unfortunately, these requirements are competing in nature. In a networked radar the processing can be done at a fusion center, which collects the measurements of all receive antennas. Reliable surveillance requires collection, communication and fusion of vast amounts of data from various antennas, which is a bandwidth and power intensive task. The communication with the fusion center could occur via a wireless link (radar on a wireless sensor network). MIMO radars have received considerable recent attention as they can achieve superior resolution. The talk presents new results on networked MIMO radars that rely on advanced signal processing, and in particular, sparse sensing and matrix completion, in order to achieve an optimal tradeoff between reliability and cost (bandwidth, power). These techniques will enable the radar to meet the same operational objectives with traditional MIMO radars while involving significantly fewer samples, be robust, and operate on mobile platforms. A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
3 Phased Array Radars A phased array radar is composed of many closely spaced antennas all antennas transmit the same waveform is capable of cohering and steering the transmit energy A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
4 MIMO Radars Multiple input multiple output (MIMO) radar employs colocated TX/RX antennas or widely separated TX/RX antennas; uses multiple waveforms: Independent waveforms omnidirectional beampattern Correlated waveforms desired beampattern [Xu et. al. 2006, Li et. al. 2007, Li et. al. 2008] [Fisher et. al. 2004, Lehmann et. al. 2006, Haimovich et. al. 2008] A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
5 Matrix Completion [Candes & Recht, 2009],[Candes & Tao, 2010],[Candes & Plan, 2010] Matrix completion is done by solving a relaxed nuclear norm optimization problem min X s.t. P Ω (X) = P Ω (M) (1) where where Ω is the set of indices of observed entries with cardinality m, and the observation operation is defined as { [M]ij, (i, j) Ω [Y] ij = 0, otherwise (2) A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
6 Matrix Completion [Candes & Recht, 2009],[Candes & Tao, 2010],[Candes & Plan, 2010] Matrix completion is done by solving a relaxed nuclear norm optimization problem min X s.t. P Ω (X) = P Ω (M) (1) where where Ω is the set of indices of observed entries with cardinality m, and the observation operation is defined as { [M]ij, (i, j) Ω [Y] ij = 0, otherwise For noisy observations: [Y] ij = [M] ij + [E] ij, (i, j) Ω (2) min X s.t. P Ω (X Y) F δ, (3) A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
7 Matrix Coherence and Recovery Guarantee Definition Let U be a subspace of C n 1 of dimension r that is spanned by the set of orthogonal vectors {u i C n 1 } i=1,...,r, P U the orthogonal projection onto U, i.e., P U = u i u H i, 1 i r and e i the standard basis vector whose i-th element is 1. The coherence of U is defined as U (i) : i th row of U µ (U) = n1 r n1 r [ ] max P U e i 2 1, n1 1 i n 1 r U (i) max 2 ; U = [u 1,..., u r ] (4) 1 i n 1 Consider the compact SVD of M, i.e., M = r k=1 ρ k u k vk H = UΛV H Matrix M has coherence with parameters µ 0 and µ 1 if (A0) max (µ (U), µ (V )) µ 0 for some positive µ 0. (A1) The maximum element of u i vi H is bounded by µ 1 r/(n1n 2) in absolute 1 i r A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
8 Matrix Coherence and Recovery Guarantee, Continued Suppose that matrix M C n1 n2 satisfies (A0) and (A1). The following lemma gives a probabilistic bound for the number of entries, m, needed to estimate M. Theorem [Candès & Recht 2009] Suppose that we observe m entries of the rank r matrix M C n1 n2, with matrix coordinates sampled uniformly at random. Let n = max{n 1, n 2 }. There exist constants C and c such that if { m C max µ 2 1, µ 1/2 0 µ 1, µ 0 n 1/4} nrβ log n for some β > 2, the minimizer of the nuclear norm problem is unique and equal to M with probability at least 1 cn β. For r µ 1 0 n1/5 the bound can be improved to m Cµ 0 n 6/5 rβ log n, without affecting the probability of success. A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
9 Generic Assumptions for Colocated MIMO Radar Transmission antennas transmit narrowband and orthogonal waveforms, that is, 1 T p c λ, (5) where T p R, λ R and c m/s denotes the waveform duration, the communication wavelength and the speed of light, respectively. The target reflection coefficients {β i C} i N + (K is the number of targets in K the far field) remain constant during a number of pulses Q. The delay spread in the received signals is smaller that the temporal support of each waveform T p. The Doppler spread of the received signals is much smaller than the bandwidth of the pulse, that is, 2ϑ i λ 1 T p, i N + K (6) where ϑ i R denotes the speed of the respective target. A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
10 MIMO Radar with Matric Completion (MC-MIMO) orthogonal transmit waveforms, K targets M 1 M 1 r r Matched filterbank 1 M t Receivers d r Matched filterbank 1 M t Matched filterbank 1 M t Fusion center Y= 1 1 M t M r A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
11 MC-MIMO Radar (2) [Kalogerias, Petropulu, IEEE TSP 2014, GLOBALSIP 2013], [Sun, Bajwa, Petropulu, IEEE AES 2014, IEEE ICASSP 2013] It can be shown that the fully observed version of the data matrix formulated at the fusion center can be expressed as Y + Z C Mr Mt, (7) where Z is an interference/observation noise matrix that may also describe model mismatch due to weak correlations among the transmit waveforms and X r DX T t, (8) where X r C Mr K (respectively for X t C Mt K ) constitutes an alternant matrix defined as γ0 0 γ1 0 γ 0 K 1 γ0 1 γ1 1 γ 1 K 1 X r K, (9) CMr Mr 1 Mr 1 Mr 1 γ0 γ1 γk 1... A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
12 MC-MIMO Radar (3)...with The sets γ l k e j2πrt r (l)t (θ k ), (l, k) N Mr 1 N K 1 (10) r r (l) 1 λ [x l r yl r ] T R 2 1, l N Mr 1 and (11) [ ] cos (θk ) T (θ k ) R 2 1, k N sin (θ k ) K 1. (12) { [x r l y r l ]T } l N Mr 1 and {θ k } k NK 1 contain the 2-dimensional antenna coordinates of the reception array and the target angles, respectively, λ R ++ denotes the carrier wavelength, and D C K K is a non-zero diagonal matrix whose elements depend on the target reflection properties and the speeds. For the simplest ULA case, [ x r(t) l y r(t) l and X r and X t degenerate to Vandermonde matrices. ] T [ 0 ldr(t) ] T, l NMr(t) 1. (13) A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
13 MC-MIMO Radar: Sampling Scheme I Sparse Sensing is implemented through the following Random Matched Filter Bank (RMFB) architecture. Random Switch Unit * # xl "! 1! d! max x l,1! x l$ % LPF * # xl $ "% 2 $!% d! max x l,2! * # xl "! M t! d! max x l, Mt! Simple power saving Bernoulli switching with selection probability p. RMFBs are implemented in receiver, constructing the Bernoulli subsampled version of, P ( ). Matrix Completion is applied for the stable recovery of. The recovered matrix is fed into standard array processing methods (e.g. MUSIC) for extracting target information. A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
14 MC-MIMO Radar: Sampling Scheme I [Kalogerias, Petropulu, IEEE TSP 2014, GLOBALSIP 2013], [Sun, Bajwa, Petropulu, IEEE AES 2014, IEEE ICASSP 2013] M 1 M 1 r r Matched filterbank 1 M t Receivers d r Matched filterbank 1 M t Matched filterbank 1 M t Fusion center Y= 1 1 M r M t A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
15 MC-MIMO Radar: Sampling Scheme I Coherence bounds - Simulations results M t = M r =40, M t =10 M t =40 M r =40, M t =40 M t =80 M r =10, M t = max(µ(u),µ(v)) max(µ(u),µ(v)) Mr θ Scheme I, K = 2 targets: (a) the average max (µ (U), µ (V )) of Z MF q as function of number of transmit and receive antennas, and for θ = 5 ; (b) the average max (µ (U), µ (V )) of Z MF q as function of DOA separation. A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
16 MC-MIMO Radar: Sampling Scheme I DOA resolution - Simulations results Scheme I: DOA resolution. The parameter are set as M r = M t = 20, p 1 = 0.5 and SNR = 10, 25dB. A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
17 Recoverability & Performance Guarantees: Scheme I [Kalogerias & Petropulu, 2013, 2014] Useful results: Theorem [Wolkowicz 1980] Let M C N N be a matrix with real eigenvalues. Define Then, it is true that τ tr (M) N τ s N 1 λ min (M) τ τ + and s 2 tr ( M 2) τ 2. (14) N s N 1 and (15) s N 1 λ max (M) τ + s N 1. (16) Further, equality holds on the left (right) of (15) if and only if equality holds on the left (right) of (16) if and only if the N 1 largest (smallest) eigenvalues are equal. A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
18 Recoverability & Performance Guarantees: Scheme I (2) We can show that if = X r DX T t C Mr Mt, M r M µ (U) λ min (X H and µ (V ) ( t ). r X r ) λ min X H t X t For a ULA, the elements of X H t X t (respectively for X H r X r ) are of the form δ i,j e j2πm(αt i αt j ), (i, j) NK 1 N K 1. (17) M t 1 m=0 The trace of X H t X t is M t K. A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
19 Recoverability & Performance Guarantees: Scheme I (3) tr ( (X H t X t ) 2) = K 1 k 1=0 Mt 2 + K 1 k 1=0 K 1 φ k 2=0 k 1 k 2 KM 2 t + K (K 1) β ξt (M t ). K 1 Mt 2 sin 2 ( ( )) πm t α t + k1 α t k 2 sin 2 ( π ( )) α t k 2=0 k 1 αk t 2 k 1 k 2 ( 2 M t α t k1 αk t ) K 1 2 k 1= M2 t + (K 1) M=4 M=5 M=6 sup x [ξ t, 1 2] φ 2 M t (x) α r k d r sin (θ k ) λ ξ t : smallest α t i α t j folded in[0, 1 2 ] φ 2 M (x) x A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
20 Recoverability & Performance Guarantees: Scheme I (4) Theorem (Brief Version) (Coherence for ULAs) Consider a Uniform Linear Array (ULA) transmission - reception pair and assume that the set of target angles {θ k } k NK 1 consists of almost surely distinct members. Then, for any fixed M t and M r, as long as the associated matrix obeys the assumptions A0 and A1 with M i K min i {t,r} β ξi (M i ), (18) M i µ 0 max i {t,r} M i (K 1) β ξi (M i ) and µ1 µ0 K. In the above β ξi (M i ) denotes a constant dependent on M i. ξ i, i {t, r}, mostly depends on the pairwise differences sin (θ i ) sin (θ j ), (i, j) N K 1 N K 1, i j. A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
21 Conclusions We have investigated the problem of reducing the volume of data typically required for accurate target detection and estimation in colocated MIMO radars. We have presented a sparse sensing scheme for information acquisition, leading to the natural formulation of a low rank matrix completion problem, which can be efficiently solved using convex optimization. Numerical simulations have justified the effectiveness of our approach. We have presented theoretical results, guaranteeing near optimal performance of the respective matrix completion problem, for the case where ULAs are employed for transmission and reception. A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
22 Relevant Publications D. Kalogerias and A. Petropulu, Matrix Completion in Colocated MIMO Radar: Recoverability, Bounds & Theoretical Guarantees, IEEE Transactions on Signal Processing, Volume 62, Issue: 2, Page(s): , S. Sun, W. Bajwa and A. Petropulu, MIMO-MC Radar: A MIMO Radar Approach Based on Matrix Completion, IEEE Trans. on Aerospace and Electronic Systems, under review in S. Sun, A. P. Petropulu and W. U. Bajwa, High-resolution networked MIMO radar based on sub-nyquist observations, Signal Processing with Adaptive Sparse Structured Representations Workshop (SPARSE), EPFL, Lausanne, Switzerland, July 8-11, item S. Sun, A. P. Petropulu and W. U. Bajwa, Target estimation in colocated MIMO radar via matrix completion, in Proc. of International Conference on Acoustics, Speech, and Signal Processing (ICASSP), Vancouver, Canada, May 26-31, A. P. Petropulu (Rutgers) Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach December 11, / 22
MIMO-MC Radar: A MIMO Radar Approach Based on Matrix Completion
I. INTRODUCTION MIMO-MC Radar: A MIMO Radar Approach Based on Matrix Completion SHUNQIAO SUN, Student Member, IEEE WAHEED U. BAJWA, Senior Member, IEEE ATHINA P. PETROPULU, Fellow, IEEE Rutgers, The State
More informationECE 8201: Low-dimensional Signal Models for High-dimensional Data Analysis
ECE 8201: Low-dimensional Signal Models for High-dimensional Data Analysis Lecture 7: Matrix completion Yuejie Chi The Ohio State University Page 1 Reference Guaranteed Minimum-Rank Solutions of Linear
More informationPerformance Analysis for Strong Interference Remove of Fast Moving Target in Linear Array Antenna
Performance Analysis for Strong Interference Remove of Fast Moving Target in Linear Array Antenna Kwan Hyeong Lee Dept. Electriacal Electronic & Communicaton, Daejin University, 1007 Ho Guk ro, Pochen,Gyeonggi,
More informationOptimal Time Division Multiplexing Schemes for DOA Estimation of a Moving Target Using a Colocated MIMO Radar
Optimal Division Multiplexing Schemes for DOA Estimation of a Moving Target Using a Colocated MIMO Radar Kilian Rambach, Markus Vogel and Bin Yang Institute of Signal Processing and System Theory University
More informationACCORDING to Shannon s sampling theorem, an analog
554 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL 59, NO 2, FEBRUARY 2011 Segmented Compressed Sampling for Analog-to-Information Conversion: Method and Performance Analysis Omid Taheri, Student Member,
More informationCombining Sparsity with Physically-Meaningful Constraints in Sparse Parameter Estimation
UIUC CSL Mar. 24 Combining Sparsity with Physically-Meaningful Constraints in Sparse Parameter Estimation Yuejie Chi Department of ECE and BMI Ohio State University Joint work with Yuxin Chen (Stanford).
More informationIterative Algorithms for Radar Signal Processing
Iterative Algorithms for Radar Signal Processing Dib Samira*, Barkat Mourad**, Grimes Morad*, Ghemit Amal* and amel Sara* *Department of electronics engineering, University of Jijel, Algeria **Department
More informationLecture 7 MIMO Communica2ons
Wireless Communications Lecture 7 MIMO Communica2ons Prof. Chun-Hung Liu Dept. of Electrical and Computer Engineering National Chiao Tung University Fall 2014 1 Outline MIMO Communications (Chapter 10
More informationSupport recovery in compressive sensing for estimation of Direction-Of-Arrival
Support recovery in compressive sensing for estimation of Direction-Of-Arrival Zhiyuan Weng and Xin Wang Department of Electrical and Computer Engineering Stony Brook University Abstract In the estimation
More informationLecture 5: Antenna Diversity and MIMO Capacity Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH
: Antenna Diversity and Theoretical Foundations of Wireless Communications Wednesday, May 4, 206 9:00-2:00, Conference Room SIP Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication
More informationNew Coherence and RIP Analysis for Weak. Orthogonal Matching Pursuit
New Coherence and RIP Analysis for Wea 1 Orthogonal Matching Pursuit Mingrui Yang, Member, IEEE, and Fran de Hoog arxiv:1405.3354v1 [cs.it] 14 May 2014 Abstract In this paper we define a new coherence
More informationRandom Access Sensor Networks: Field Reconstruction From Incomplete Data
Random Access Sensor Networks: Field Reconstruction From Incomplete Data Fatemeh Fazel Northeastern University Boston, MA Email: fazel@ece.neu.edu Maryam Fazel University of Washington Seattle, WA Email:
More informationML ESTIMATION AND CRB FOR NARROWBAND AR SIGNALS ON A SENSOR ARRAY
2014 IEEE International Conference on Acoustic, Speech and Signal Processing ICASSP ML ESTIMATION AND CRB FOR NARROWBAND AR SIGNALS ON A SENSOR ARRAY Langford B White School of Electrical and Electronic
More informationOPTIMAL ADAPTIVE TRANSMIT BEAMFORMING FOR COGNITIVE MIMO SONAR IN A SHALLOW WATER WAVEGUIDE
OPTIMAL ADAPTIVE TRANSMIT BEAMFORMING FOR COGNITIVE MIMO SONAR IN A SHALLOW WATER WAVEGUIDE Nathan Sharaga School of EE Tel-Aviv University Tel-Aviv, Israel natyshr@gmail.com Joseph Tabrikian Dept. of
More informationCoprime Coarray Interpolation for DOA Estimation via Nuclear Norm Minimization
Coprime Coarray Interpolation for DOA Estimation via Nuclear Norm Minimization Chun-Lin Liu 1 P. P. Vaidyanathan 2 Piya Pal 3 1,2 Dept. of Electrical Engineering, MC 136-93 California Institute of Technology,
More informationAnalysis of Robust PCA via Local Incoherence
Analysis of Robust PCA via Local Incoherence Huishuai Zhang Department of EECS Syracuse University Syracuse, NY 3244 hzhan23@syr.edu Yi Zhou Department of EECS Syracuse University Syracuse, NY 3244 yzhou35@syr.edu
More informationSimultaneous Sparsity
Simultaneous Sparsity Joel A. Tropp Anna C. Gilbert Martin J. Strauss {jtropp annacg martinjs}@umich.edu Department of Mathematics The University of Michigan 1 Simple Sparse Approximation Work in the d-dimensional,
More informationDOA Estimation of Uncorrelated and Coherent Signals in Multipath Environment Using ULA Antennas
DOA Estimation of Uncorrelated and Coherent Signals in Multipath Environment Using ULA Antennas U.Somalatha 1 T.V.S.Gowtham Prasad 2 T. Ravi Kumar Naidu PG Student, Dept. of ECE, SVEC, Tirupati, Andhra
More informationA Root-MUSIC-Like Direction Finding Method for Cyclostationary Signals
EURASIP Journal on Applied Signal Processing 25:1, 69 73 c 25 Hindawi Publishing Corporation A Root-MUSIC-Like Direction Finding Method for Cyclostationary Signals Pascal Chargé LESIA, DGEI, INSA Toulouse,
More informationA New High-Resolution and Stable MV-SVD Algorithm for Coherent Signals Detection
Progress In Electromagnetics Research M, Vol. 35, 163 171, 2014 A New High-Resolution and Stable MV-SVD Algorithm for Coherent Signals Detection Basma Eldosouky, Amr H. Hussein *, and Salah Khamis Abstract
More informationAdaptive beamforming for uniform linear arrays with unknown mutual coupling. IEEE Antennas and Wireless Propagation Letters.
Title Adaptive beamforming for uniform linear arrays with unknown mutual coupling Author(s) Liao, B; Chan, SC Citation IEEE Antennas And Wireless Propagation Letters, 2012, v. 11, p. 464-467 Issued Date
More informationApplications of Robust Optimization in Signal Processing: Beamforming and Power Control Fall 2012
Applications of Robust Optimization in Signal Processing: Beamforg and Power Control Fall 2012 Instructor: Farid Alizadeh Scribe: Shunqiao Sun 12/09/2012 1 Overview In this presentation, we study the applications
More informationResearch Article Robust STAP for MIMO Radar Based on Direct Data Domain Approach
Hindawi International Journal of Antennas and Propagation Volume 217, Article ID 696713, 9 pages https://doi.org/1.1155/217/696713 Research Article Robust STAP for MIMO Radar Based on Direct Data Domain
More informationVirtual Array Processing for Active Radar and Sonar Sensing
SCHARF AND PEZESHKI: VIRTUAL ARRAY PROCESSING FOR ACTIVE SENSING Virtual Array Processing for Active Radar and Sonar Sensing Louis L. Scharf and Ali Pezeshki Abstract In this paper, we describe how an
More informationRobust Principal Component Analysis
ELE 538B: Mathematics of High-Dimensional Data Robust Principal Component Analysis Yuxin Chen Princeton University, Fall 2018 Disentangling sparse and low-rank matrices Suppose we are given a matrix M
More informationNew Cramér-Rao Bound Expressions for Coprime and Other Sparse Arrays
New Cramér-Rao Bound Expressions for Coprime and Other Sparse Arrays Chun-Lin Liu 1 P. P. Vaidyanathan 2 1,2 Dept. of Electrical Engineering, MC 136-93 California Institute of Technology, Pasadena, CA
More informationROBUST BLIND SPIKES DECONVOLUTION. Yuejie Chi. Department of ECE and Department of BMI The Ohio State University, Columbus, Ohio 43210
ROBUST BLIND SPIKES DECONVOLUTION Yuejie Chi Department of ECE and Department of BMI The Ohio State University, Columbus, Ohio 4 ABSTRACT Blind spikes deconvolution, or blind super-resolution, deals with
More informationADAPTIVE ANTENNAS. SPATIAL BF
ADAPTIVE ANTENNAS SPATIAL BF 1 1-Spatial reference BF -Spatial reference beamforming may not use of embedded training sequences. Instead, the directions of arrival (DoA) of the impinging waves are used
More informationRobust Adaptive Beamforming via Estimating Steering Vector Based on Semidefinite Relaxation
Robust Adaptive Beamforg via Estimating Steering Vector Based on Semidefinite Relaxation Arash Khabbazibasmenj, Sergiy A. Vorobyov, and Aboulnasr Hassanien Dept. of Electrical and Computer Engineering
More informationAnalog-to-Information Conversion
Analog-to-Information Conversion Sergiy A. Vorobyov Dept. Signal Processing and Acoustics, Aalto University February 2013 Winter School on Compressed Sensing, Ruka 1/55 Outline 1 Compressed Sampling (CS)
More informationCompressed Sensing Using Reed- Solomon and Q-Ary LDPC Codes
Compressed Sensing Using Reed- Solomon and Q-Ary LDPC Codes Item Type text; Proceedings Authors Jagiello, Kristin M. Publisher International Foundation for Telemetering Journal International Telemetering
More informationCovariance Sketching via Quadratic Sampling
Covariance Sketching via Quadratic Sampling Yuejie Chi Department of ECE and BMI The Ohio State University Tsinghua University June 2015 Page 1 Acknowledgement Thanks to my academic collaborators on some
More informationFourier Methods in Array Processing
Cambridge, Massachusetts! Fourier Methods in Array Processing Petros Boufounos MERL 2/8/23 Array Processing Problem Sources Sensors MERL 2/8/23 A number of sensors are sensing a scene. A number of sources
More informationMIMO Radar Space-Time Adaptive Processing Using Prolate Spheroidal Wave Functions
1 MIMO Radar Space-Time Adaptive Processing Using Prolate Spheroidal Wave Functions Chun-Yang Chen and P. P. Vaidyanathan, Fellow, IEEE Abstract In the traditional transmitting beamforming radar system,
More informationIEEE copyright notice
IEEE copyright notice Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for
More informationMulti-stage convex relaxation approach for low-rank structured PSD matrix recovery
Multi-stage convex relaxation approach for low-rank structured PSD matrix recovery Department of Mathematics & Risk Management Institute National University of Singapore (Based on a joint work with Shujun
More informationRoot-MUSIC Time Delay Estimation Based on Propagator Method Bin Ba, Yun Long Wang, Na E Zheng & Han Ying Hu
International Conference on Automation, Mechanical Control and Computational Engineering (AMCCE 15) Root-MUSIC ime Delay Estimation Based on ropagator Method Bin Ba, Yun Long Wang, Na E Zheng & an Ying
More informationMULTIPLE-CHANNEL DETECTION IN ACTIVE SENSING. Kaitlyn Beaudet and Douglas Cochran
MULTIPLE-CHANNEL DETECTION IN ACTIVE SENSING Kaitlyn Beaudet and Douglas Cochran School of Electrical, Computer and Energy Engineering Arizona State University, Tempe AZ 85287-576 USA ABSTRACT The problem
More informationRecovery of Low Rank and Jointly Sparse. Matrices with Two Sampling Matrices
Recovery of Low Rank and Jointly Sparse 1 Matrices with Two Sampling Matrices Sampurna Biswas, Hema K. Achanta, Mathews Jacob, Soura Dasgupta, and Raghuraman Mudumbai Abstract We provide a two-step approach
More informationSingle-Stage Transmit Beamforming Design for MIMO Radar
Single-Stage Transmit Beamforming Design for MIMO Radar Mojtaba Soltanalian* a, Heng Hu b, and Petre Stoica a a Dept. of Information Technology, Uppsala University, Uppsala, Sweden b School of Electronic
More informationTHE estimation of covariance matrices is a crucial component
1 A Subspace Method for Array Covariance Matrix Estimation Mostafa Rahmani and George K. Atia, Member, IEEE, arxiv:1411.0622v1 [cs.na] 20 Oct 2014 Abstract This paper introduces a subspace method for the
More informationECE G: Special Topics in Signal Processing: Sparsity, Structure, and Inference
ECE 18-898G: Special Topics in Signal Processing: Sparsity, Structure, and Inference Low-rank matrix recovery via convex relaxations Yuejie Chi Department of Electrical and Computer Engineering Spring
More informationDOPPLER RESILIENT GOLAY COMPLEMENTARY PAIRS FOR RADAR
DOPPLER RESILIENT GOLAY COMPLEMENTARY PAIRS FOR RADAR Ali Pezeshki 1, Robert Calderbank 1, Stephen D. Howard 2, and William Moran 3 1 Princeton University, Princeton, NJ 8544, USA 2 DSTO, Edinburgh 51,
More informationMaximum Achievable Diversity for MIMO-OFDM Systems with Arbitrary. Spatial Correlation
Maximum Achievable Diversity for MIMO-OFDM Systems with Arbitrary Spatial Correlation Ahmed K Sadek, Weifeng Su, and K J Ray Liu Department of Electrical and Computer Engineering, and Institute for Systems
More informationApplication of Tensor and Matrix Completion on Environmental Sensing Data
Application of Tensor and Matrix Completion on Environmental Sensing Data Michalis Giannopoulos 1,, Sofia Savvaki 1,, Grigorios Tsagkatakis 1, and Panagiotis Tsakalides 1, 1- Institute of Computer Science
More informationCo-prime Arrays with Reduced Sensors (CARS) for Direction-of-Arrival Estimation
Co-prime Arrays with Reduced Sensors (CARS) for Direction-of-Arrival Estimation Mingyang Chen 1,LuGan and Wenwu Wang 1 1 Department of Electrical and Electronic Engineering, University of Surrey, U.K.
More informationHIGH RESOLUTION DOA ESTIMATION IN FULLY COHERENT ENVIRONMENTS. S. N. Shahi, M. Emadi, and K. Sadeghi Sharif University of Technology Iran
Progress In Electromagnetics Research C, Vol. 5, 35 48, 28 HIGH RESOLUTION DOA ESTIMATION IN FULLY COHERENT ENVIRONMENTS S. N. Shahi, M. Emadi, and K. Sadeghi Sharif University of Technology Iran Abstract
More informationSparse Parameter Estimation: Compressed Sensing meets Matrix Pencil
Sparse Parameter Estimation: Compressed Sensing meets Matrix Pencil Yuejie Chi Departments of ECE and BMI The Ohio State University Colorado School of Mines December 9, 24 Page Acknowledgement Joint work
More informationCompressive Sensing and Beyond
Compressive Sensing and Beyond Sohail Bahmani Gerorgia Tech. Signal Processing Compressed Sensing Signal Models Classics: bandlimited The Sampling Theorem Any signal with bandwidth B can be recovered
More informationTwo-Dimensional Sparse Arrays with Hole-Free Coarray and Reduced Mutual Coupling
Two-Dimensional Sparse Arrays with Hole-Free Coarray and Reduced Mutual Coupling Chun-Lin Liu and P. P. Vaidyanathan Dept. of Electrical Engineering, 136-93 California Institute of Technology, Pasadena,
More informationDOA Estimation of Quasi-Stationary Signals Using a Partly-Calibrated Uniform Linear Array with Fewer Sensors than Sources
Progress In Electromagnetics Research M, Vol. 63, 185 193, 218 DOA Estimation of Quasi-Stationary Signals Using a Partly-Calibrated Uniform Linear Array with Fewer Sensors than Sources Kai-Chieh Hsu and
More informationJoint Direction-of-Arrival and Order Estimation in Compressed Sensing using Angles between Subspaces
Aalborg Universitet Joint Direction-of-Arrival and Order Estimation in Compressed Sensing using Angles between Subspaces Christensen, Mads Græsbøll; Nielsen, Jesper Kjær Published in: I E E E / S P Workshop
More informationEstimation of the Optimum Rotational Parameter for the Fractional Fourier Transform Using Domain Decomposition
Estimation of the Optimum Rotational Parameter for the Fractional Fourier Transform Using Domain Decomposition Seema Sud 1 1 The Aerospace Corporation, 4851 Stonecroft Blvd. Chantilly, VA 20151 Abstract
More informationEXTENSION OF NESTED ARRAYS WITH THE FOURTH-ORDER DIFFERENCE CO-ARRAY ENHANCEMENT
EXTENSION OF NESTED ARRAYS WITH THE FOURTH-ORDER DIFFERENCE CO-ARRAY ENHANCEMENT Qing Shen,2, Wei Liu 2, Wei Cui, Siliang Wu School of Information and Electronics, Beijing Institute of Technology Beijing,
More informationRandom Coding for Fast Forward Modeling
Random Coding for Fast Forward Modeling Justin Romberg with William Mantzel, Salman Asif, Karim Sabra, Ramesh Neelamani Georgia Tech, School of ECE Workshop on Sparsity and Computation June 11, 2010 Bonn,
More informationMAXIMUM A POSTERIORI ESTIMATION OF SIGNAL RANK. PO Box 1500, Edinburgh 5111, Australia. Arizona State University, Tempe AZ USA
MAXIMUM A POSTERIORI ESTIMATION OF SIGNAL RANK Songsri Sirianunpiboon Stephen D. Howard, Douglas Cochran 2 Defence Science Technology Organisation PO Box 500, Edinburgh 5, Australia 2 School of Mathematical
More informationELE 538B: Sparsity, Structure and Inference. Super-Resolution. Yuxin Chen Princeton University, Spring 2017
ELE 538B: Sparsity, Structure and Inference Super-Resolution Yuxin Chen Princeton University, Spring 2017 Outline Classical methods for parameter estimation Polynomial method: Prony s method Subspace method:
More informationLecture Notes 5: Multiresolution Analysis
Optimization-based data analysis Fall 2017 Lecture Notes 5: Multiresolution Analysis 1 Frames A frame is a generalization of an orthonormal basis. The inner products between the vectors in a frame and
More informationPerformance Analysis of an Adaptive Algorithm for DOA Estimation
Performance Analysis of an Adaptive Algorithm for DOA Estimation Assimakis K. Leros and Vassilios C. Moussas Abstract This paper presents an adaptive approach to the problem of estimating the direction
More informationCompressed Sensing and Robust Recovery of Low Rank Matrices
Compressed Sensing and Robust Recovery of Low Rank Matrices M. Fazel, E. Candès, B. Recht, P. Parrilo Electrical Engineering, University of Washington Applied and Computational Mathematics Dept., Caltech
More informationSensitivity Considerations in Compressed Sensing
Sensitivity Considerations in Compressed Sensing Louis L. Scharf, 1 Edwin K. P. Chong, 1,2 Ali Pezeshki, 2 and J. Rockey Luo 2 1 Department of Mathematics, Colorado State University Fort Collins, CO 8523,
More informationExact Joint Sparse Frequency Recovery via Optimization Methods
IEEE TRANSACTIONS ON SIGNAL PROCESSING Exact Joint Sparse Frequency Recovery via Optimization Methods Zai Yang, Member, IEEE, and Lihua Xie, Fellow, IEEE arxiv:45.6585v [cs.it] 3 May 6 Abstract Frequency
More informationSolving Corrupted Quadratic Equations, Provably
Solving Corrupted Quadratic Equations, Provably Yuejie Chi London Workshop on Sparse Signal Processing September 206 Acknowledgement Joint work with Yuanxin Li (OSU), Huishuai Zhuang (Syracuse) and Yingbin
More informationLow-rank Matrix Completion with Noisy Observations: a Quantitative Comparison
Low-rank Matrix Completion with Noisy Observations: a Quantitative Comparison Raghunandan H. Keshavan, Andrea Montanari and Sewoong Oh Electrical Engineering and Statistics Department Stanford University,
More informationReconstruction from Anisotropic Random Measurements
Reconstruction from Anisotropic Random Measurements Mark Rudelson and Shuheng Zhou The University of Michigan, Ann Arbor Coding, Complexity, and Sparsity Workshop, 013 Ann Arbor, Michigan August 7, 013
More informationArray Signal Processing Algorithms for Beamforming and Direction Finding
Array Signal Processing Algorithms for Beamforming and Direction Finding This thesis is submitted in partial fulfilment of the requirements for Doctor of Philosophy (Ph.D.) Lei Wang Communications Research
More informationSIGNALS with sparse representations can be recovered
IEEE SIGNAL PROCESSING LETTERS, VOL. 22, NO. 9, SEPTEMBER 2015 1497 Cramér Rao Bound for Sparse Signals Fitting the Low-Rank Model with Small Number of Parameters Mahdi Shaghaghi, Student Member, IEEE,
More informationMatrix Completion for Structured Observations
Matrix Completion for Structured Observations Denali Molitor Department of Mathematics University of California, Los ngeles Los ngeles, C 90095, US Email: dmolitor@math.ucla.edu Deanna Needell Department
More informationSelf-Calibration and Biconvex Compressive Sensing
Self-Calibration and Biconvex Compressive Sensing Shuyang Ling Department of Mathematics, UC Davis July 12, 2017 Shuyang Ling (UC Davis) SIAM Annual Meeting, 2017, Pittsburgh July 12, 2017 1 / 22 Acknowledgements
More informationPerformance Analysis for Sparse Support Recovery
Performance Analysis for Sparse Support Recovery Gongguo Tang and Arye Nehorai ESE, Washington University April 21st 2009 Gongguo Tang and Arye Nehorai (Institute) Performance Analysis for Sparse Support
More informationLow-Rank Matrix Recovery
ELE 538B: Mathematics of High-Dimensional Data Low-Rank Matrix Recovery Yuxin Chen Princeton University, Fall 2018 Outline Motivation Problem setup Nuclear norm minimization RIP and low-rank matrix recovery
More informationImproved Unitary Root-MUSIC for DOA Estimation Based on Pseudo-Noise Resampling
140 IEEE SIGNAL PROCESSING LETTERS, VOL. 21, NO. 2, FEBRUARY 2014 Improved Unitary Root-MUSIC for DOA Estimation Based on Pseudo-Noise Resampling Cheng Qian, Lei Huang, and H. C. So Abstract A novel pseudo-noise
More informationMultidimensional Sparse Fourier Transform Based on the Fourier Projection-Slice Theorem
Multidimensional Sparse Fourier Transform Based on the Fourier Projection-Slice Theorem Shaogang Wang, Student Member, IEEE, Vishal M. Patel, Senior Member, IEEE, and Athina Petropulu, Fellow, IEEE 2 3
More informationRobust Subspace DOA Estimation for Wireless Communications
Robust Subspace DOA Estimation for Wireless Communications Samuli Visuri Hannu Oja ¾ Visa Koivunen Laboratory of Signal Processing Computer Technology Helsinki Univ. of Technology P.O. Box 3, FIN-25 HUT
More informationCOMPLEX CONSTRAINED CRB AND ITS APPLICATION TO SEMI-BLIND MIMO AND OFDM CHANNEL ESTIMATION. Aditya K. Jagannatham and Bhaskar D.
COMPLEX CONSTRAINED CRB AND ITS APPLICATION TO SEMI-BLIND MIMO AND OFDM CHANNEL ESTIMATION Aditya K Jagannatham and Bhaskar D Rao University of California, SanDiego 9500 Gilman Drive, La Jolla, CA 92093-0407
More informationSampling considerations for modal analysis with damping
Sampling considerations for modal analysis with damping Jae Young Park, a Michael B Wakin, b and Anna C Gilbert c a University of Michigan, 3 Beal Ave, Ann Arbor, MI 489 USA b Colorado School of Mines,
More informationRobust Beamforming via Matrix Completion
Robust Beamforming via Matrix Comletion Shunqiao Sun and Athina P. Petroulu Deartment of Electrical and Comuter Engineering Rutgers, the State University of Ne Jersey Piscataay, Ne Jersey 8854-858 Email:
More informationSPARSE signal representations have gained popularity in recent
6958 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 10, OCTOBER 2011 Blind Compressed Sensing Sivan Gleichman and Yonina C. Eldar, Senior Member, IEEE Abstract The fundamental principle underlying
More informationRandom projections. 1 Introduction. 2 Dimensionality reduction. Lecture notes 5 February 29, 2016
Lecture notes 5 February 9, 016 1 Introduction Random projections Random projections are a useful tool in the analysis and processing of high-dimensional data. We will analyze two applications that use
More informationExact Low-rank Matrix Recovery via Nonconvex M p -Minimization
Exact Low-rank Matrix Recovery via Nonconvex M p -Minimization Lingchen Kong and Naihua Xiu Department of Applied Mathematics, Beijing Jiaotong University, Beijing, 100044, People s Republic of China E-mail:
More information926 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 53, NO. 3, MARCH Monica Nicoli, Member, IEEE, and Umberto Spagnolini, Senior Member, IEEE (1)
926 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 53, NO. 3, MARCH 2005 Reduced-Rank Channel Estimation for Time-Slotted Mobile Communication Systems Monica Nicoli, Member, IEEE, and Umberto Spagnolini,
More informationRapid, Robust, and Reliable Blind Deconvolution via Nonconvex Optimization
Rapid, Robust, and Reliable Blind Deconvolution via Nonconvex Optimization Shuyang Ling Department of Mathematics, UC Davis Oct.18th, 2016 Shuyang Ling (UC Davis) 16w5136, Oaxaca, Mexico Oct.18th, 2016
More informationTensor MUSIC in Multidimensional Sparse Arrays
Tensor MUSIC in Multidimensional Sparse Arrays Chun-Lin Liu 1 and P. P. Vaidyanathan 2 Dept. of Electrical Engineering, MC 136-93 California Institute of Technology, Pasadena, CA 91125, USA cl.liu@caltech.edu
More informationThe Optimality of Beamforming: A Unified View
The Optimality of Beamforming: A Unified View Sudhir Srinivasa and Syed Ali Jafar Electrical Engineering and Computer Science University of California Irvine, Irvine, CA 92697-2625 Email: sudhirs@uciedu,
More informationSFT-BASED DOA DETECTION ON CO-PRIME ARRAY
SFT-BASED DOA DETECTION ON CO-PRIME ARRAY BY GUANJIE HUANG A thesis submitted to the Graduate School New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements
More informationDesign of Spectrally Shaped Binary Sequences via Randomized Convex Relaxations
Design of Spectrally Shaped Binary Sequences via Randomized Convex Relaxations Dian Mo Department of Electrical and Computer Engineering University of Massachusetts Amherst, MA 3 mo@umass.edu Marco F.
More informationSolving Underdetermined Linear Equations and Overdetermined Quadratic Equations (using Convex Programming)
Solving Underdetermined Linear Equations and Overdetermined Quadratic Equations (using Convex Programming) Justin Romberg Georgia Tech, ECE Caltech ROM-GR Workshop June 7, 2013 Pasadena, California Linear
More informationBlind Deconvolution Using Convex Programming. Jiaming Cao
Blind Deconvolution Using Convex Programming Jiaming Cao Problem Statement The basic problem Consider that the received signal is the circular convolution of two vectors w and x, both of length L. How
More informationDESIGN AND ANALYSIS OF MULTI-COSET ARRAYS
DESIGN AND ANALYSIS OF MULTI-COSET ARRAYS James D. Krieger?, Yuval Kochman, and Gregory W. Wornell?? Dept. EECS, Massachusetts Institute of Technology, Cambridge, MA 39, USA School of CSE, Hebrew University
More informationSound Source Tracking Using Microphone Arrays
Sound Source Tracking Using Microphone Arrays WANG PENG and WEE SER Center for Signal Processing School of Electrical & Electronic Engineering Nanayang Technological Univerisy SINGAPORE, 639798 Abstract:
More informationAn Extended Frank-Wolfe Method, with Application to Low-Rank Matrix Completion
An Extended Frank-Wolfe Method, with Application to Low-Rank Matrix Completion Robert M. Freund, MIT joint with Paul Grigas (UC Berkeley) and Rahul Mazumder (MIT) CDC, December 2016 1 Outline of Topics
More informationRecovering any low-rank matrix, provably
Recovering any low-rank matrix, provably Rachel Ward University of Texas at Austin October, 2014 Joint work with Yudong Chen (U.C. Berkeley), Srinadh Bhojanapalli and Sujay Sanghavi (U.T. Austin) Matrix
More informationResponse Vector Constrained Robust LCMV. Beamforming Based on Semidefinite Programming
1.119/TSP.215.246221, IEEE Transactions on Signal Processing Response Vector Constrained Robust LCMV 1 Beamforming Based on Semidefinite Programming Jingwei Xu, Guisheng Liao, Member, IEEE, Shengqi Zhu,
More informationCompressed Statistical Testing and Application to Radar
Compressed Statistical Testing and Application to Radar Hsieh-Chung Chen, H. T. Kung, and Michael C. Wicks Harvard University, Cambridge, MA, USA University of Dayton, Dayton, OH, USA Abstract We present
More informationCompressed Sensing and Affine Rank Minimization Under Restricted Isometry
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 61, NO. 13, JULY 1, 2013 3279 Compressed Sensing Affine Rank Minimization Under Restricted Isometry T. Tony Cai Anru Zhang Abstract This paper establishes new
More informationA Robust Event-Triggered Consensus Strategy for Linear Multi-Agent Systems with Uncertain Network Topology
A Robust Event-Triggered Consensus Strategy for Linear Multi-Agent Systems with Uncertain Network Topology Amir Amini, Amir Asif, Arash Mohammadi Electrical and Computer Engineering,, Montreal, Canada.
More informationCoherent imaging without phases
Coherent imaging without phases Miguel Moscoso Joint work with Alexei Novikov Chrysoula Tsogka and George Papanicolaou Waves and Imaging in Random Media, September 2017 Outline 1 The phase retrieval problem
More informationMatrix completion: Fundamental limits and efficient algorithms. Sewoong Oh Stanford University
Matrix completion: Fundamental limits and efficient algorithms Sewoong Oh Stanford University 1 / 35 Low-rank matrix completion Low-rank Data Matrix Sparse Sampled Matrix Complete the matrix from small
More informationJoint Azimuth, Elevation and Time of Arrival Estimation of 3-D Point Sources
ISCCSP 8, Malta, -4 March 8 93 Joint Azimuth, Elevation and Time of Arrival Estimation of 3-D Point Sources Insaf Jaafar Route de Raoued Km 35, 83 El Ghazela, Ariana, Tunisia Email: insafjaafar@infcomrnutn
More informationPolynomial Root-MUSIC Algorithm for Efficient Broadband Direction Of Arrival Estimation
Polynomial Root-MUSIC Algorithm for Efficient Broadband Direction Of Arrival Estimation William Coventry, Carmine Clemente, and John Soraghan University of Strathclyde, CESIP, EEE, 204, George Street,
More information