Xunmeng Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xunmeng Wu has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Zai Yang
School of Mathematics and Statistics, Xian Jiaotong University, Xian, China
13 shared publications - Zongben Xu
Xi’an Jiaotong University
7 shared publications - Zhiqiang Wei
School of Mathematics and Statistics, Xian Jiaotong University, Xian, China
3 shared publications Zongben Xu
School of Mathematics and Statistics, Xi’an Jiaotong University, Xi’an 710049, China
3 shared publicationsJian-Feng Cai
1 shared publicationJuntao You
1 shared publication
Latest Publications
- 17 April 2026
- Published by Elsevier
- p. 91-118
Spectral compressed sensing via structured matrix optimization
- 17 April 2026
- Published by Elsevier
- p. 91-118
Spectral compressed sensing via structured matrix optimization
- 9 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Signal Processing
- Vol. 19 (6) , 1026-1041
Reweighted Atomic Norm Minimization for Line Spectral Estimation With One-Bit Samples
Quantization is one of the key processes in the operation of an analog-to-digital converter. Among various quantization schemes, one-bit quantization has received widespread attention due to its low hardware complexity and energy consumption. In this paper, we investigate the line spectral estimation problem with one-bit samples. We propose a gridless sparse optimization algorithm by finding the sparsest candidate signal consistent with the one-bit samples. In particular, a new logdet sparsity metric is proposed inspired by the recent Hankel Toeplitz model characterizing the atomic ℓ0 norm. A nonconvex optimization algorithm is presented, which effectively performs reweighted atomic norm minimization (RAM) and iteratively promotes signal sparsity, termed one-bit RAM. An alternating direction method of multipliers algorithm is further proposed to accelerate the computation of one-bit RAM. The behavior of the Cramer-Rao bound is also theoretically analyzed. Numerical ´ results are provided to demonstrate the superior performance of the proposed method compared to the state of the art.
- 9 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Signal Processing
- Vol. 19 (6) , 1026-1041
Reweighted Atomic Norm Minimization for Line Spectral Estimation With One-Bit Samples
Quantization is one of the key processes in the operation of an analog-to-digital converter. Among various quantization schemes, one-bit quantization has received widespread attention due to its low hardware complexity and energy consumption. In this paper, we investigate the line spectral estimation problem with one-bit samples. We propose a gridless sparse optimization algorithm by finding the sparsest candidate signal consistent with the one-bit samples. In particular, a new logdet sparsity metric is proposed inspired by the recent Hankel Toeplitz model characterizing the atomic ℓ0 norm. A nonconvex optimization algorithm is presented, which effectively performs reweighted atomic norm minimization (RAM) and iteratively promotes signal sparsity, termed one-bit RAM. An alternating direction method of multipliers algorithm is further proposed to accelerate the computation of one-bit RAM. The behavior of the Cramer-Rao bound is also theoretically analyzed. Numerical ´ results are provided to demonstrate the superior performance of the proposed method compared to the state of the art.
- Open Access
Low-Complexity Algorithms for Multichannel Spectral Super-Resolution
This paper studies the problem of multichannel spectral super-resolution with either constant amplitude (CA) or not. We propose two optimization problems based on low-rank Hankel-Toeplitz matrix factorization. The two problems effectively leverage the multichannel and CA structures, while also enabling the design of low-complexity gradient descent algorithms for their solutions. Extensive simulations show the superior performance of the proposed algorithms.
Open AccessLow-Complexity Algorithms for Multichannel Spectral Super-Resolution
This paper studies the problem of multichannel spectral super-resolution with either constant amplitude (CA) or not. We propose two optimization problems based on low-rank Hankel-Toeplitz matrix factorization. The two problems effectively leverage the multichannel and CA structures, while also enabling the design of low-complexity gradient descent algorithms for their solutions. Extensive simulations show the superior performance of the proposed algorithms.
- 3 September 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 45 (3) , 1643-1668
Multichannel Frequency Estimation with Constant Amplitude via Convex Structured Low-Rank Approximation
We study the problem of estimating the frequencies of several complex sinusoids with constant amplitude (CA) (also called constant modulus) from multichannel signals of their superposition. To exploit the CA property for frequency estimation in the framework of atomic norm minimization (ANM), we introduce multiple positive-semidenite block matrices composed of Hankel and Toeplitz submatrices and formulate the ANM problem as a convex structured low-rank approximation (SLRA) problem. The proposed SLRA is a semidenite programming and has substantial differences from existing such formulations without using the CA property. The proposed approach is termed as SLRA-based ANM for CA frequency estimation (SACA). We provide theoretical guarantees and extensive simulations that validate the advantages of SACA.
- 3 September 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 45 (3) , 1643-1668
Multichannel Frequency Estimation with Constant Amplitude via Convex Structured Low-Rank Approximation
We study the problem of estimating the frequencies of several complex sinusoids with constant amplitude (CA) (also called constant modulus) from multichannel signals of their superposition. To exploit the CA property for frequency estimation in the framework of atomic norm minimization (ANM), we introduce multiple positive-semidenite block matrices composed of Hankel and Toeplitz submatrices and formulate the ANM problem as a convex structured low-rank approximation (SLRA) problem. The proposed SLRA is a semidenite programming and has substantial differences from existing such formulations without using the CA property. The proposed approach is termed as SLRA-based ANM for CA frequency estimation (SACA). We provide theoretical guarantees and extensive simulations that validate the advantages of SACA.
- 8 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 72 (1053587X) , 5659-5674
COFFEE: Covariance Fitting and Focusing for Wideband Direction-of-Arrival Estimation
This paper focuses on the problem of direction-of-arrival (DOA) estimation for multiple wideband source signals using a uniform linear array under the frequency bin model. We propose a c ovariance f itting and f ocusing-based e stimation m e thod, abbreviated as COFFEE. In particular, we develop a covariance fitting criterion for wideband DOA estimation and formulate a corresponding bilevel optimization problem by introducing focusing operations on covariance matrices. The bilevel optimization problem comprises an upper-level problem for covariance fitting and a lower-level one for the focusing matrices. We show that the upper-level problem can be cast as a rank-constrained semidefinite programming (SDP) and the lower-level problem has closed-form solutions. To solve the rank-constrained SDP, we develop an alternating direction method of multipliers algorithm, in which both subproblems are solved in closed form. We further propose an alternating iterative algorithm to solve the overall bilevel optimization problem. Extensive numerical results demonstrate that COFFEE outperforms state-of-the-art algorithms in terms of accuracy and resolution.
- 8 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 72 (1053587X) , 5659-5674
COFFEE: Covariance Fitting and Focusing for Wideband Direction-of-Arrival Estimation
This paper focuses on the problem of direction-of-arrival (DOA) estimation for multiple wideband source signals using a uniform linear array under the frequency bin model. We propose a c ovariance f itting and f ocusing-based e stimation m e thod, abbreviated as COFFEE. In particular, we develop a covariance fitting criterion for wideband DOA estimation and formulate a corresponding bilevel optimization problem by introducing focusing operations on covariance matrices. The bilevel optimization problem comprises an upper-level problem for covariance fitting and a lower-level one for the focusing matrices. We show that the upper-level problem can be cast as a rank-constrained semidefinite programming (SDP) and the lower-level problem has closed-form solutions. To solve the rank-constrained SDP, we develop an alternating direction method of multipliers algorithm, in which both subproblems are solved in closed form. We further propose an alternating iterative algorithm to solve the overall bilevel optimization problem. Extensive numerical results demonstrate that COFFEE outperforms state-of-the-art algorithms in terms of accuracy and resolution.
- 9 July 2024
- Published by Springer Nature in Science China Mathematics
- Vol. 67 (10) , 2409-2432
New low-rank optimization model and algorithms for spectral compressed sensing
- 9 July 2024
- Published by Springer Nature in Science China Mathematics
- Vol. 67 (10) , 2409-2432
New low-rank optimization model and algorithms for spectral compressed sensing
- Open Access
Multichannel Frequency Estimation with Constant Amplitude via Convex Structured Low-Rank Approximation
We study the problem of estimating the frequencies of several complex sinusoids with constant amplitude (CA) (also called constant modulus) from multichannel signals of their superposition. To exploit the CA property for frequency estimation in the framework of atomic norm minimization (ANM), we introduce multiple positive-semidefinite block matrices composed of Hankel and Toeplitz submatrices and formulate the ANM problem as a convex structured low-rank approximation (SLRA) problem. The proposed SLRA is a semidefinite programming and has substantial differences from existing such formulations without using the CA property. The proposed approach is termed as SLRA-based ANM for CA frequency estimation (SACA). We provide theoretical guarantees and extensive simulations that validate the advantages of SACA.
Open AccessMultichannel Frequency Estimation with Constant Amplitude via Convex Structured Low-Rank Approximation
We study the problem of estimating the frequencies of several complex sinusoids with constant amplitude (CA) (also called constant modulus) from multichannel signals of their superposition. To exploit the CA property for frequency estimation in the framework of atomic norm minimization (ANM), we introduce multiple positive-semidefinite block matrices composed of Hankel and Toeplitz submatrices and formulate the ANM problem as a convex structured low-rank approximation (SLRA) problem. The proposed SLRA is a semidefinite programming and has substantial differences from existing such formulations without using the CA property. The proposed approach is termed as SLRA-based ANM for CA frequency estimation (SACA). We provide theoretical guarantees and extensive simulations that validate the advantages of SACA.
- 1 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 71 (1053587X) , 3242-3256
Multichannel Frequency Estimation in Challenging Scenarios via Structured Matrix Embedding and Recovery (StruMER)
Multichannel frequency estimation with incomplete data and miscellaneous noises arises in array signal processing, modal analysis, wireless communications, and so on. In this paper, we consider maximum-likelihood(-like) optimization methods for frequency estimation in which proper objective functions are adopted subject to observed data patterns and noise types. We propose a universal signal-domain approach to solve the optimization problems by embedding the noiseless multichannel signal of interest into a series of low-rank positive-semidefinite block matrices of Hankel and Toeplitz submatrices and formulating the original parameter-domain optimization problems as equivalent structured matrix recovery problems. The alternating direction method of multipliers (ADMM) is applied to solve the resulting matrix recovery problems in which both subproblems of ADMM are solved in (nearly) closed form. The proposed approach is termed as structured matrix embedding and recovery (StruMER). Extensive numerical simulations are provided to demonstrate that StruMER has improved threshold performances in various challenging scenarios, e.g., limited data, low signal-to-noise ratio, impulsive noise, and closely spaced frequencies, as compared with state-of-the-art methods.
- 1 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 71 (1053587X) , 3242-3256
Multichannel Frequency Estimation in Challenging Scenarios via Structured Matrix Embedding and Recovery (StruMER)
Multichannel frequency estimation with incomplete data and miscellaneous noises arises in array signal processing, modal analysis, wireless communications, and so on. In this paper, we consider maximum-likelihood(-like) optimization methods for frequency estimation in which proper objective functions are adopted subject to observed data patterns and noise types. We propose a universal signal-domain approach to solve the optimization problems by embedding the noiseless multichannel signal of interest into a series of low-rank positive-semidefinite block matrices of Hankel and Toeplitz submatrices and formulating the original parameter-domain optimization problems as equivalent structured matrix recovery problems. The alternating direction method of multipliers (ADMM) is applied to solve the resulting matrix recovery problems in which both subproblems of ADMM are solved in (nearly) closed form. The proposed approach is termed as structured matrix embedding and recovery (StruMER). Extensive numerical simulations are provided to demonstrate that StruMER has improved threshold performances in various challenging scenarios, e.g., limited data, low signal-to-noise ratio, impulsive noise, and closely spaced frequencies, as compared with state-of-the-art methods.
- 22 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (4) , 3117-3130
Direction-of-Arrival Estimation for Constant Modulus Signals Using a Structured Matrix Recovery Technique
This paper addresses the problem of direction-of-arrival (DOA) estimation for constant modulus (CM) source signals using a uniform or sparse linear array. Existing methods typically exploit either the Vandermonde structure of the steering matrix or the CM structure of source signals only. In this paper, we propose a structured ma trix recovery technique (SMART) for CM DOA estimation via fully exploiting the two structures. In particular, we reformulate the highly nonconvex CM DOA estimation problems in the noiseless and noisy cases as equivalent rank-constrained Hankel-Toeplitz matrix recovery problems, in which the Vandermonde structure is captured by a series of Hankel-Toeplitz block matrices, of which the number equals the number of snapshots, and the CM structure is guaranteed by letting the block matrices share a same Toeplitz submatrix. The alternating direction method of multipliers (ADMM) is applied to solve the resulting rank-constrained problems and the DOAs are uniquely retrieved from the numerical solution. Extensive simulations are carried out to corroborate our analysis and confirm that the proposed SMART outperforms state-of-the-art algorithms in terms of the maximum number of locatable sources and statistical efficiency.
- 22 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (4) , 3117-3130
Direction-of-Arrival Estimation for Constant Modulus Signals Using a Structured Matrix Recovery Technique
This paper addresses the problem of direction-of-arrival (DOA) estimation for constant modulus (CM) source signals using a uniform or sparse linear array. Existing methods typically exploit either the Vandermonde structure of the steering matrix or the CM structure of source signals only. In this paper, we propose a structured ma trix recovery technique (SMART) for CM DOA estimation via fully exploiting the two structures. In particular, we reformulate the highly nonconvex CM DOA estimation problems in the noiseless and noisy cases as equivalent rank-constrained Hankel-Toeplitz matrix recovery problems, in which the Vandermonde structure is captured by a series of Hankel-Toeplitz block matrices, of which the number equals the number of snapshots, and the CM structure is guaranteed by letting the block matrices share a same Toeplitz submatrix. The alternating direction method of multipliers (ADMM) is applied to solve the resulting rank-constrained problems and the DOAs are uniquely retrieved from the numerical solution. Extensive simulations are carried out to corroborate our analysis and confirm that the proposed SMART outperforms state-of-the-art algorithms in terms of the maximum number of locatable sources and statistical efficiency.
- Open Access
Direction-of-Arrival Estimation for Constant Modulus Signals Using a Structured Matrix Recovery Technique
This paper addresses the problem of direction-of-arrival (DOA) estimation for constant modulus (CM) source signals using a uniform or sparse linear array. Existing methods typically exploit either the Vandermonde structure of the steering matrix or the CM structure of source signals only. In this paper, we propose a structured matrix recovery technique (SMART) for CM DOA estimation via fully exploiting the two structures. In particular, we reformulate the highly nonconvex CM DOA estimation problems in the noiseless and noisy cases as equivalent rank-constrained Hankel-Toeplitz matrix recovery problems, in which the Vandermonde structure is captured by a series of Hankel-Toeplitz block matrices, of which the number equals the number of snapshots, and the CM structure is guaranteed by letting the block matrices share a same Toeplitz submatrix. The alternating direction method of multipliers (ADMM) is applied to solve the resulting rank-constrained problems and the DOAs are uniquely retrieved from the numerical solution. Extensive simulations are carried out to corroborate our analysis and confirm that the proposed SMART outperforms state-of-the-art algorithms in terms of the maximum number of locatable sources and statistical efficiency.
Open AccessDirection-of-Arrival Estimation for Constant Modulus Signals Using a Structured Matrix Recovery Technique
This paper addresses the problem of direction-of-arrival (DOA) estimation for constant modulus (CM) source signals using a uniform or sparse linear array. Existing methods typically exploit either the Vandermonde structure of the steering matrix or the CM structure of source signals only. In this paper, we propose a structured matrix recovery technique (SMART) for CM DOA estimation via fully exploiting the two structures. In particular, we reformulate the highly nonconvex CM DOA estimation problems in the noiseless and noisy cases as equivalent rank-constrained Hankel-Toeplitz matrix recovery problems, in which the Vandermonde structure is captured by a series of Hankel-Toeplitz block matrices, of which the number equals the number of snapshots, and the CM structure is guaranteed by letting the block matrices share a same Toeplitz submatrix. The alternating direction method of multipliers (ADMM) is applied to solve the resulting rank-constrained problems and the DOAs are uniquely retrieved from the numerical solution. Extensive simulations are carried out to corroborate our analysis and confirm that the proposed SMART outperforms state-of-the-art algorithms in terms of the maximum number of locatable sources and statistical efficiency.