 Research
 Open Access
 Published:
Efficient twodimensional compressive sensing in MIMO radar
EURASIP Journal on Advances in Signal Processing volume 2017, Article number: 23 (2017)
Abstract
Compressive sensing (CS) has been a way to lower sampling rate leading to data reduction for processing in multipleinput multipleoutput (MIMO) radar systems. In this paper, we further reduce the computational complexity of a pulseDoppler collocated MIMO radar by introducing a twodimensional (2D) compressive sensing. To do so, we first introduce a new 2D formulation for the compressed received signals and then we propose a new measurement matrix design for our 2D compressive sensing model that is based on minimizing the coherence of sensing matrix using gradient descent algorithm. The simulation results show that our proposed 2D measurement matrix design using gradient decent algorithm (2DMMDGD) has much lower computational complexity compared to onedimensional (1D) methods while having better performance in comparison with conventional methods such as Gaussian random measurement matrix.
Introduction
Compressive sensing (CS) is a signal processing method for reconstructing a signal that is sparse in a specific domain [1, 2]. In the past two decades, much research in various disciplines such as mathematics, statistics, signal processing, and communication systems has been conducted in CS topic in order to exploit its advantages for a wide range of applications. For example, analogtoinformation conversion [3], remote sensing [4], channel estimation in the communication systems [5], medical imaging [6], and image reconstruction [7] are some of these applications.
In CS, the main goal is to find the sparsest vector s that satisfies an underdetermined system of linear equations y = ΦΨ s, in which the number of variables is much larger than the number of equations, where y is the measurement vector, Φ is the measurement matrix, and Ψ is the basis matrix. It can be formulated in mathematic language as, minimize ‖s‖_{0}, subject to y = ΦΨ s, where ‖ ⋅ ‖_{0} is l _{0}norm and A = ΦΨ is called the sensing matrix. The l _{0}norm calculates the number of nonzero components of a vector. To solve this problem, we need a combinatorial search to find the minimum l _{0}norm, which is an NPhard problem. One of the solutions proposed for this problem is to replace l _{0}norm with l _{1}norm and convert the problem to a convex one. A famous algorithm that minimizes l _{1}norm is basis pursuit (BP) [8].
Some applications of compressive sensing in radar systems have been recently studied in [9–11]. In [12], the direction of arrival (DOA) of the signal is estimated using CS for communication systems. In order to estimate the desired parameters in CS radar, it should be assumed that the number of targets to be found is much smaller than the whole number of radar bins, which is the case in most practical radar applications.
Multipleinput multipleoutput (MIMO) radar systems have received the attention of many researchers in recent years. There are two different types of MIMO radar systems which are categorized according to their antennas configuration. In the first type, the antennas are widely separated from each other relative to their distance to the target [13]. In the second one, which is considered in this paper, the antennas are collocated and located close to each other [14].
In [15], the sparse signal model of MIMO radar is derived using only one incoming pulse. Furthermore, a sparse learning via iterative minimization (SLIM) algorithm is developed and compared to other sparse methods such as iterative adaptive approach (IAA) [16]. The main drawback of SLIM algorithm in [15] is that its computational complexity will be very high for pulseDoppler MIMO radars.
Recently, a new signal model with twodimensional (2D) sparse parameters, called 2D sparse signal model, has been introduced [17, 18], and some algorithms for 2D sparse reconstruction have been proposed [19–24]. Specifically, in [19], the 2D version of IAA is derived in which its computational cost is drastically reduced in comparison with the onedimensional (1D) IAA. The other 2D sparse recovery algorithm is the smoothed L0 (SL0) algorithm that minimizes an approximated l _{0}norm function [20] and has much lower computational complexity than its 1D counterpart. In [21], a 2D sparse signal model for a radar is obtained and solved by 2DSL0 algorithm with acceptable results. Also, 2DSLIM [22], 2D Truncated Newton Interior Point Method (2DTNIPM) [23], and 2D Sparse Bayesian Learning using Laplace Prior (2DSBLLP) [24] have been proposed for pulse Doppler MIMO radars. These papers have demonstrated that the 2D proposed algorithms have much less computational complexity compared to corresponding 1D sparse recovery algorithms.
The main goal of sparsitybased methods for MIMO radar systems ([21–24]) is to achieve accurate estimates for target parameters, whereas in this paper, we mainly focus on the CS MIMO radar problem to reduce the sampling rate lower than the Nyquist criterion by designing a suitable measurement matrix. Therefore, the main difference between our 2D CS MIMO radar signal model and 2D sparse model in [21–24] is that we consider the measurement matrices in our model in which these measurement matrices can be applied on receivers and received pulses, separately.
In [18], a 2D CS signal model has been proposed for inverse synthetic aperture radar (ISAR) imaging radar in which a random subsampling in both range and azimuth dimensions is utilized. Also, a 2D CS image reconstruction algorithm based on iterative gradient projection is derived in [25].
Compressive sensing for MIMO radar systems is proposed and analyzed in [26, 27]. A MIMO radar, which is one of the most practical applications of MIMO systems, transmits some independent waveforms by its transmit antennas and has superior spatial resolution compared to traditional radar systems. CS in MIMO radar has the ability to achieve the same localization performance as the traditional methods while using much lower number of measurements, which is achieved by applying a measurement matrix to the normally measured samples.
In CS, the measurement matrix has a key role in the performance of sparse signal recovery algorithm. Therefore, we can improve the performance of target detection in CS MIMO radar by designing a suitable measurement matrix. The conventional approach for choosing this matrix is a Gaussian random measurement matrix (GRMM) which is not necessarily the best one for CS. According to [28], if the mutual coherence (MC) that is the maximum value of pairwise correlation among the columns of A is small, the sparse signal can be recovered with high probability. Recently, some measurement matrix design methods have been proposed based on minimizing the MC of the sensing matrix [29–31]. Elad [29] designed the measurement matrix based on mutual coherence minimization using a shrinkage operation. DuarteCarvajalino [30] optimized the measurement matrix and basis matrix jointly by a KSVDbased algorithm. However, these methods are adapted for real signals and also have many parameters that should be set properly.
In [31], a gradient descent method is used to minimize the MC of A which is described as the absolute offdiagonal elements of the Gram matrix. It is shown that this method can achieve higher sparse reconstruction performance compared to previous methods. In our paper, we extend this method to a complex CS MIMO radar signal and decrease the computational complexity by proposing a 2D CS MIMO radar signal model. In [32], a method for optimizing the measurement matrix of MIMO radar systems is proposed based on two different criterions; first one is to minimize the summation of coherence of cross columns in the sensing matrix plus maximize the signaltointerference ratio (SCSM + SIR), and the second criterion is to maximize SIR by imposing a special structure on the measurement matrix. However, both methods are suboptimal solutions and may not have acceptable performance in different situations.
In this paper, we introduce a 2D signal model in CS for a collocated MIMO radar with point targets, and then we improve the efficiency of this 2D MIMO radar model by proposing a measurement matrix design using gradient decent algorithm (MMDGD) in which the MC of sensing matrix is minimized. We call the proposed method as 2DMMDGD.
The gradient descent algorithm is popular for very largescale optimization problems due to its simplicity of the implementation and its low computational load. Although our proposed 2DMMDGD method leads to a nonlinear problem and there is no guarantee that we find its global minimum, its performance is always better than GRMM. The reason is that we use GRMM as an initial value of our proposed algorithm; therefore, the designed matrix will have less mutual coherence and consequently better performance compared to its initial value, i.e., GRMM. Simulation results show that our proposed 2DMMDGD performs much better than GRMM, SIR, and SCSM + SIR methods.
The rest of the paper is organized as follows. Sections 2 and 3 describe the 1D and 2D CS signal model of the MIMO Radar, respectively. In Section 4, we propose a measurement matrix design for 1D and 2D CS model using gradient decent algorithm. The computational complexity of the proposed methods is discussed in Section 5. Simulation results are given in section 6. Finally, we have conclusions in section 7.
Notations: Lower case and capital letters in bold denote vectors and matrices. Superscripts (.)^{T}, (.)^{H} denote the transpose and Hermitian transpose of a matrix, respectively. 0 _{ M × N } denotes an M × N matrix with all zero elements and I _{ N } denotes an N × N identity matrix. Also, ‖. ‖_{2} and ‖. ‖_{ F } denote the square and Frobenius norm of a vector/matrix, respectively. The operator ⊗, var(.), and E(.) are the Kronecker product, variance, and expectation of a random variable, respectively.
1DCS signal model of MIMO radar
In this section, we describe the 1D signal model of a CS pulseDoppler MIMO radar. In this model, we assume that one period of Doppler frequencies of targets spans a duration of several received pulses. It means that f _{d} τ ≪ 1, where f _{d} and τ are the Doppler shift frequency and the pulsewidth, respectively. If f _{c} is the carrier frequency, this assumption can be written as f _{r} ≪ B ≪ f _{c}, where f _{ r } is the radar pulse repetition frequency (PRF) and B is the bandwidth of the transmitted signal. Based on this assumption, the Doppler effect on each pulse is simply a phase shift. We assume that Doppler shift frequency is in the interval \( \left[\frac{{f}_{\mathrm{r}}}{2},\frac{f_{\mathrm{r}}}{2}\right) \) and the targets are located behind the maximum unambiguous range. Suppose that the Doppler frequency of interest divided into N _{d} bins:
where d is the Doppler index and d = 1, 2, ⋯, N _{d}. The Doppler phase shift over one pulse period for the dth Doppler bin is obtained as
The transmitted signal samples of all antennas can be put together in a matrix as
where v _{ i } ∈ ℂ^{L × 1}, i = 1, …, M _{t} is the samples of the transmitted signal with length L by the ith antenna (for a total of M _{t} transmit antennas).
Without loss of generality, a uniform linear array for the transmit and receive antenna arrays has been used in our model and simulations in this paper.
Suppose that the number of range bins is N _{r} in the radar surveillance area, then the largest possible delay between the transmit and receive pulses is (N _{r} − 1).
We consider the number of the angle bins of the antenna array to be N _{a} and the angle bins are \( {\left\{{\boldsymbol{\alpha}}_{\boldsymbol{a}}\right\}}_{a=1}^{N_{\mathrm{a}}} \). The transmit and receive antenna array steering vectors of the ath angle bin are shown, respectively, as \( {\boldsymbol{a}}_{\boldsymbol{a}}\in {C}^{M_t\times 1} \), \( {\boldsymbol{b}}_{\boldsymbol{a}}\in {C}^{M_r\times 1}. \)
and
where Δ _{t} and Δ _{r} are the distance between elements of transmit and receive antennas, respectively, and λ _{0} is the signal of transmitting wavelength.
The compressed received signal in the mth antenna returned from the pth transmitted pulse can be arranged in an observation vector, y _{ pm } ∈ ℂ^{M × 1} as follows:
where \( {\boldsymbol{\varphi}}_{pm}\in {\mathrm{\mathbb{C}}}^{M\times \tilde{L}} \) is the measurement matrix applied on the pth pulse and mth receive antenna for p = 1, …, N _{ p } and m = 1, …, M _{ r }, and \( \overset{\sim }{L}= L+{N}_r1 \). The parameters M, N _{p}, and M _{r} are the length of observation vector (compressed observations), the number of pulses, and receive antennas, respectively. It is noted that for compressive sensing scenario, we have \( M<\tilde{L} \).
The vector n _{ pm } = φ _{ pm } e _{ pm } is the additive noise for the mth receive antenna and pth pulse and \( {\boldsymbol{e}}_{pm}\in {\mathrm{\mathbb{C}}}^{\tilde{L}\times 1} \) is the receiver noise with complex Gaussian random distribution, with zero mean and covariance matrix \( {\boldsymbol{I}}_{\tilde{L}} \). As it is noted, the noise covariance matrix n _{ pm } is \( {\boldsymbol{\varphi}}_{pm}{\boldsymbol{\varphi}}_{pm}^H \).
The matrix \( {\boldsymbol{J}}_r\in {\mathrm{\mathbb{C}}}^{\tilde{L}\times L} \) is a timeshift matrix which returns the shifted version of the transmitted signal for the rth range bin. In fact, J _{ r } timeshifts the transmitted signals and extends them up to the maximum received signal duration (by zeropadding) and it is defined as
Parameters {s _{ r,a,d }} (r = 1, …, N _{ r } , a = 1, …, N _{ a } and d = 1, …, N _{ d }) denote the return coefficients from targets in the radar interest area, where s _{ r,a,d } = β _{ k } if the kth target is located at the (r, a, d)th bin and s _{ r,a,d } = 0 otherwise. In general, β _{ k } is a complex number corresponding to the radar cross section of the kth target (k = 1, 2, …, N _{t}), and N _{t} is the number of targets.
Now, the received signal samples from the mth receive antenna returned from the pth transmitted pulse can be written as
where s ∈ ℂ^{N × 1} is a sparse vector which has N _{ t } ≪ N nonzero elements, N = N _{ r } N _{ a } N _{ d }, and \( {\boldsymbol{\psi}}_{p m}={\boldsymbol{\uptheta}}_p^T\otimes {\boldsymbol{H}}_m\in {\mathrm{\mathbb{C}}}^{\tilde{L}\times N} \) is the basis matrix for the mth receiver during the pth pulse, ⊗ is the Kronecker multiplication, and
We can also arrange the observations for all receive antennas for the pth pulse in vector form \( {\boldsymbol{y}}_p\in {\mathrm{\mathbb{C}}}^{M{ M}_r\times 1} \) as
where n _{ p } = T _{ p } e _{ p } is the additive noise of all receivers and \( {\boldsymbol{e}}_p={\left[\begin{array}{ccc}\hfill {\boldsymbol{e}}_{p1}^T\hfill & \hfill \cdots \hfill & \hfill {\boldsymbol{e}}_{p{M}_r}^T\hfill \end{array}\right]}^T{\mathrm{\mathbb{C}}}^{\tilde{L}{M}_r\times 1} \). The matrix T _{ p } is a block diagonal matrix in which the mth block is a measurement matrix used for mth receive antenna and defined as
The matrix Ψ _{ p } in (14) which is the basis matrix for all antennas, and the pth pulse is defined as
For all the pulses, we have
where \( \boldsymbol{\Phi} =\mathrm{blkdiag}\left({\boldsymbol{T}}_1,\ {\boldsymbol{T}}_2, \dots,\ {\boldsymbol{T}}_{N_p}\right)\in {\mathrm{\mathbb{C}}}^{M{M}_r{N}_p\times \tilde{L}{M}_r{N}_p} \) is the measurement matrix which is applied to all observations in order to decrease the number of received signal samples, \( \boldsymbol{\Psi} ={\boldsymbol{\Theta}}^T\otimes \boldsymbol{H}\in {\mathrm{\mathbb{C}}}^{\tilde{L}{M}_r{N}_p\times N} \) is the basis matrix for our pulseDoppler MIMO radar system, \( \boldsymbol{\Theta} =\left[\begin{array}{ccc}\hfill {\boldsymbol{\theta}}_1\hfill & \hfill \cdots \hfill & \hfill {\boldsymbol{\theta}}_{N_P}\hfill \end{array}\right]\in {\mathrm{\mathbb{C}}}^{N_d\times {N}_p} \) is the MIMO radar dictionary matrix containing the Doppler information of targets in different situations, and \( \boldsymbol{n}=\boldsymbol{\Phi} \boldsymbol{e}\in {\mathrm{\mathbb{C}}}^{M{ M}_r{N}_p\times 1} \) is the additive noise of all receivers and pulses after compression, where \( \boldsymbol{e}={\left[\begin{array}{ccc}\hfill {\boldsymbol{e}}_1^T\hfill & \hfill \cdots \hfill & \hfill {\boldsymbol{e}}_{N_p}^T\hfill \end{array}\right]}^T \). The matrix H is defined as
Generally, \( \boldsymbol{H}\in {\mathrm{\mathbb{C}}}^{\tilde{L}{M}_r\times {N}_r{N}_a} \) is the MIMO radar dictionary matrix containing the whole range and angle information of targets. Also, Ψ can be given by:
Our goal in this paper is to design the measurement matrix Φ such that the CS MIMO radar has better performance in target detection compared to conventional approaches.
To optimize Φ, four different cases can be considered:
Case 1 (general case): All subblocks φ _{ pm } (p = 1, …, N _{ p } and m = 1, …, M _{ r }) located in Φ are different with each other, and thus, they are optimized, separately.
Case 2: We assume that the measurement matrix is equal for all receivers,
Therefore, \( {\boldsymbol{T}}_p={\boldsymbol{I}}_{M_r}\otimes {\boldsymbol{\varphi}}_p \), where \( {\boldsymbol{\varphi}}_p\in {\mathbb{C}}^{M\times \tilde{L}} \) is the measurement matrix applied on the pth received pulse, and \( \boldsymbol{\Phi} =\mathrm{blkdiag}\left({\boldsymbol{T}}_1,\ {\boldsymbol{T}}_2, \dots,\ {\boldsymbol{T}}_{N_p}\right)\in {\mathrm{\mathbb{C}}}^{M{M}_r{N}_p\times \tilde{L}{M}_r{N}_p} \).
Case 3: We assume that the measurement matrix is equal for all received pulses,
where \( {\boldsymbol{\varphi}}_m\in {\mathbb{C}}^{M\times \tilde{L}} \) is the measurement matrix applied on the mth receive antenna; therefore, \( \boldsymbol{\Phi} ={\boldsymbol{I}}_{N_p}\otimes \boldsymbol{T} \), where \( \boldsymbol{T}=\mathrm{blkdiag}\left({\boldsymbol{\varphi}}_1,{\boldsymbol{\varphi}}_2,\dots, {\boldsymbol{\varphi}}_{M_r}\right) \).
Case 4: We assume that the measurement matrix is equal for all receivers and pulses,
Therefore, we have \( \boldsymbol{\Phi} ={\boldsymbol{I}}_{N_p}\otimes \boldsymbol{T} \), where \( \boldsymbol{T}={\boldsymbol{I}}_{M_r}\otimes \boldsymbol{\varphi} \), and \( \boldsymbol{\varphi} \in {\mathbb{C}}^{M\times \tilde{L}} \) is the measurement matrix applied on all receivers and pulses.
2DCS signal model of MIMO radar
In this section, we derive the 2DCS signal model for MIMO radar and explain its relationship to the classical 1DCS signal model.
Among all cases discussed in the last section, only case 3 and case 4 can be converted to 2D model. To do so, we arrange the received signals for all pulses into a matrix as
where \( \boldsymbol{S} = \left[\begin{array}{cc}\hfill {\boldsymbol{s}}_1^T\hfill & \hfill {\boldsymbol{s}}_2^T\hfill \end{array}\ \begin{array}{cc}\hfill \dots \hfill & \hfill {\boldsymbol{s}}_{N_d}^T\hfill \end{array}\right] \), N = TΕ, and \( \boldsymbol{E} =\left[\begin{array}{ccc}\hfill {\boldsymbol{e}}_1\hfill & \hfill \cdots \hfill & \hfill {\boldsymbol{e}}_{N_P}\hfill \end{array}\right] \). This equation is the 2D model of CS MIMO radar. We can present the relationship between 1D and 2D sparse signal model for MIMO radars transmitting a trail of pulses by using the following property [33]:
If we apply Eqs. (24) to (23), we rederive the 1D CS model shown in Eq. (17), where we have
and
Also, we can rewrite matrix A as a block matrix whose pmth block is the measurement matrix φ _{ pm } applied on pth received pulse and mth receive antenna multiplied by pmth basis matrix ψ _{ pm }:
Figure 1 shows the block structure of the 2DCS signal model implementation for MIMO radar. As noted before, two dictionary matrices H and Θ are constructed based on potential situations of range, angle and Doppler frequency of targets in MIMO radar surveillance area. Also, the sampling of signal is conducted based on measurement matrix T which is optimized in the following section using gradient descent algorithm.
Measurement matrix design using gradient decent algorithm for CS model
In this section, first we discuss the conditions that a measurement matrix should have, and then we propose a new measurement matrix for CS MIMO radar that is suitable for our 1D and 2D CS models.
The mutual coherence (MC) of sensing matrix A that shows the maximum value of the pairwise correlations of the column vectors of A is defined as follows [28]
where \( {\rho}_{i, j}=\left{\boldsymbol{a}}_i^H{\boldsymbol{a}}_j\right \) and a _{ i } is the ith column of A. The mutual incoherence property (MIP) is one of the best conditions for sparse signal reconstruction [28]. According to the MIP, for a small value of μ(A), the sparse signal can be reconstructed with high probability. In fact, the exact reconstruction of s will be guaranteed if the following inequality holds [29]:
The statistical analysis of MC of sensing matrix is performed in Appendix 1 for the aforementioned four cases. The following results are concluded:
As it is seen, case 1 has the least variance of MC, and therefore, it is expected that it has better performance compared to other cases. On the other hand, case 4 has the biggest variance of MC, and therefore, it is expected that it has the worst performance.
Also, as shown in [34], (28) might not have a good behavior for the case that coherence of cross columns is small. In [29], Elad proposes the average mutual coherence as an alternative criterion because of its lower computational complexity compared to (28). Therefore, the new measurement matrix optimization can be expressed as:
where G is the Gram matrix defined as G = A ^{H} A. Thus, we propose an algorithm to decrease the mutual coherence of A which is determined by minimizing the whole elements of G except the main diagonal elements.
Measurement matrix design for 1DCS model
As mentioned before, among the four cases we discussed, cases 1 and 2 cannot be converted to 2D model. We consider the optimization of these two cases as measurement matrix design for 1DCS model.
Therefore, the following cost function can be defined for our problem:
Thus, the optimization problem is formulated as \( \hat{\boldsymbol{\Phi}}= \arg \underset{\boldsymbol{\Phi}}{ \min } C \).
In our proposed method, first we optimize matrix A using gradient descent algorithm [31], then the measurement matrix Φ is obtained form A by using least square (LS) estimator. In the gradient descent method, the gradient of cost function C needs to be computed with respect to the unknown variable A, denoted as
then, the equation A = A − η ∇ C is updated in an iterative process, where η > 0 is the stepsize that can be fixed or updated iteratively by backtracking line search algorithm [35]. Before the execution of descent algorithm, the columns of matrix A need to be normalized as:
The algorithm can be stopped when the stopping criterion ‖∇ C‖_{ F } ≤ ε for a small and positive constant ε or after a several number of iterations (N _{ GD }).
Case 1
After obtaining A for case 1, the measurement matrix of pth pulse and mth receiver (φ _{ pm }) is given by solving the following linear equation:
where A _{ pm } is defined in (27). From Eqs. (6) to (13), it can be noted that some parts of matrix ψ _{ pm } is filled with 0, and consequently \( {\boldsymbol{\psi}}_{pm}^H{\boldsymbol{\psi}}_{pm} \) tends to be illconditioned. Therefore, the LS estimator which needs to calculate \( {\left({\boldsymbol{\psi}}_{pm}^H{\boldsymbol{\psi}}_{pm}\right)}^{1} \) cannot be exploited, directly. To resolve this problem, we use the economysize singular value decomposition (eSVD) of \( {\boldsymbol{\psi}}_{pm}\in {\mathrm{\mathbb{C}}}^{\tilde{L}\times N} \) given by
where \( {\boldsymbol{U}}_{1, pm}\in {\mathrm{\mathbb{C}}}^{\tilde{L}\times \tilde{L}} \) and D _{1,pm } ∈ ℂ^{N × N} are unitary matrices, and Δ _{1,pm } = diag(λ _{1,pm }, …, λ _{ r,pm }) is the singular values matrix of ψ _{ pm } that λ _{ i,pm } ≠ 0 for i = 1, …, r. In fact, r is the number of nonzero singular values of ψ _{ pm }. The measurement matrix φ _{ pm } can be obtained as follows:
Table 1 shows all the steps of the proposed method for optimizing measurement matrix in case 1.
Case 2
Here, the measurement matrix is equal for all receivers. Therefore, we have redundant data that can be exploited to estimate φ _{ p }.
In this case, we can reshape the equation A _{ p } = T _{ p } Ψ _{ p } to \( {\overset{\sim }{\boldsymbol{A}}}_p={\boldsymbol{\varphi}}_p{\overset{\sim }{\boldsymbol{\Psi}}}_p \), where \( {\overset{\sim }{\boldsymbol{A}}}_p\in {\mathbb{C}}^{M\times N{M}_r} \) is the reshaped form of \( {\boldsymbol{A}}_p\in {\mathbb{C}}^{M{ M}_r\times N} \), and
Now, the eSVD of \( {\overset{\sim }{\boldsymbol{\Psi}}}_p \) is computed, and then φ _{ p } can be obtained similar to (39).
Measurement matrix design for 2DCS model
In our 2Dmodel, we have A = Θ ^{T} ⊗ B, where B = TH. It is demonstrated in Appendix 2 that the MC of A is equal to
According to (41), to optimize measurement matrix T based on minimizing μ(A) with respect to T, it is only needed to minimize μ(B) with respect to T. Therefore, the optimization problem becomes:
By using gradient descent optimization algorithm for cost function \( C={\left\Vert {\boldsymbol{B}}^H\boldsymbol{B}{\boldsymbol{I}}_{N_r{N}_a}\right\Vert}_F^2 \), we can obtain \( \boldsymbol{B}\in {\mathrm{\mathbb{C}}}^{M{ M}_r\times {N}_r{N}_a} \) similar to 1D model.
Case 3
In this case, the measurement matrix is equal for all received pulses. After obtaining B, the measurement matrix of mth receiver (φ _{ m }) is calculated by solving the following linear equation:
where \( \boldsymbol{B}=\left[\begin{array}{c}\hfill {\boldsymbol{B}}_1\hfill \\ {}\hfill \begin{array}{c}\hfill {\boldsymbol{B}}_2\hfill \\ {}\hfill \vdots \hfill \end{array}\hfill \\ {}\hfill {\boldsymbol{B}}_{M_r}\hfill \end{array}\right] \).
Similar to case 1, the eSVD of H _{ m } is computed, and then φ _{ m } is calculated.
Case 4
As noted for case 4, the measurement matrix is equal for all received pulses and receivers, i.e., \( \boldsymbol{T}={\boldsymbol{I}}_{M_r}\otimes \boldsymbol{\varphi} \). Therefore, we can use the redundant data of all receivers in optimization of measurement matrix φ. To do so, the linear equation B = TH should be reshaped to \( \overset{\sim }{\boldsymbol{B}}=\boldsymbol{\varphi} \overset{\sim }{\boldsymbol{H}} \), where \( \overset{\sim }{\boldsymbol{B}}\in {\mathbb{C}}^{M\times {M}_r{N}_r{N}_a} \) is the reshaped form of \( \boldsymbol{B}\in {\mathbb{C}}^{M{ M}_r\times {N}_r{N}_a} \), and
Now, the eSVD of \( \overset{\sim }{\boldsymbol{H}}\in {\mathbb{C}}^{\overset{\sim }{L}\times {M}_r{N}_r{N}_a} \) is computed as follows:
where \( {\boldsymbol{U}}_4\in {\mathrm{\mathbb{C}}}^{\tilde{L}\times \tilde{L}} \) and \( {\boldsymbol{D}}_4\in {\mathrm{\mathbb{C}}}^{M_r{N}_r{N}_a\times {M}_r{N}_r{N}_a} \) are unitary matrices and Δ _{4} = diag(λ ' _{1}, …, λ ' _{ r }) is the singular values matrix of H̃ that λ ' _{ i } ≠ 0 for i = 1, …, r. Also, r is the number of nonzero singular values of H̃. The measurement matrix φ can be given as follows:
Table 2 shows all the steps of the proposed method to optimize measurement matrix in case 4. In this table, b _{ i } is the ith column of B.
Computational complexity comparison
The cases 1 and 2, called 1D proposed MMDGD methods, have almost the same computational complexity because the gradient descent algorithm for calculating matrix A is the same for both cases. Also, the computational complexity of cases 3 and 4, called as 2D proposed MMDGD methods, are almost equal due to the similarity of their gradient descent algorithm. The main computational cost in each iteration of 1D and 2D proposed MMDGD methods belong to matrix product AA ^{H} A and BB ^{H} B, respectively. The complexities of AA ^{H} A and BB ^{H} B are \( O\left({M}^2{M}_r^2{N}_p^2 N\right) \) and \( O\left({M}^2{M}_r^2{N}_r{N}_a\right)= O\left({M}^2{M}_r^2 N/{N}_d\right) \), respectively. Thus, the ratio of 2DMMDGD load over that of its 1D equivalent is \( \frac{1}{N_p^2{N}_d} \).
The complexity of SCSM + SIR method that uses CVX package to optimize measurement matrix is \( O({\overset{\sim }{N}}^3) \), where \( \overset{\sim }{N}={\overset{\sim }{L}}^2 \) [35]. It can be approximated that \( O\left({M}^2{M}_r^2{N}_r{N}_a\right)\ll O({\overset{\sim }{L}}^6) \) due to the facts that \( M\ll \overset{\sim }{L} \), \( {N}_a\approx {N}_r<\overset{\sim }{L} \), and \( {M}_r<\overset{\sim }{L} \) in our application. Therefore, the computational complexity of our proposed 2DMMDGD is much less than the SCSM + SIR method.
The computational complexity of 1D and 2D sparse recovery algorithms are discussed in [22] and [24]. As noted there, the computations of 1D and 2D algorithms for CS are O(MM _{ r } N _{ p } N) and O(MM _{ r } N) + O(MM _{ r } N _{ p } N _{ d }), respectively. Therefore, the ratio of 2D processing load over that of its 1D equivalent is \( \frac{1}{N_p}+\frac{1}{N_a{N}_r} \).
In the next section, CPU time is used as a rough estimate of computational complexity of the algorithms.
Simulation results
For simulation, we consider a pulseDoppler MIMO radar with M _{ t } transmit (TX) and M _{ r } receive (RX) antennas having uniform linear array (ULA) with Δ _{ t } = 2.5λ _{0} and Δ _{ r } = 0.5λ _{0}. The transmitted waveforms are obtained from efficient cyclic algorithm [36] that can produce sequences with very low auto and crosscorrelation sidelobes. We consider the length of sequence L = 32 with unit power. The number of transmit and receive antennas are M _{t} = 3 and M _{r} = 3, respectively. The number of pulses is N _{ p } = 3. The carrier frequency, the pulse bandwidth, and PRF are f _{ c } = 1 GHz, B = 10 MHz, and f _{ r } = 2kHz, respectively. The area under the radar includes N _{ r } = 6 range bins, N _{ d } = 6 Doppler bins, and N _{ a } = 6 angle bins between 0^{°} to 35^{°} with 7^{°} resolution.
We use the 1DSLIM [15] and 2DSLIM [22] algorithms to reconstruct ŝ and Ŝ from the received compressed measurements in (17) and (23). Over 100 independent trials were run. In each trial, the locations of targets are generated randomly following a uniform random distribution.
The signaltonoise ratio (SNR) is defined for each target located at the (r, a, d)th rangeangleDoppler bin and the noise variance σ ^{2} as
The SNRs of all targets are considered equal.
At first, we compare the performance of four cases when the GRMM is used. In fact, GRMM is a complex Gaussian random matrix with zero mean and covariance matrix I. The reconstruction error (\( {\left\Vert \widehat{\boldsymbol{s}}\boldsymbol{s}\right\Vert}_2^2/{\left\Vert \boldsymbol{s}\right\Vert}_2^2 \)) for all cases versus the number of measurements, SNRs, and the number of pulses are shown in Fig. 2a–c, respectively, where ŝ and s are the estimated and true vectors containing the return complex reflection coefficients of targets, respectively. As seen in these figures, cases 1 and 3 have almost the same reconstruction error while outperforming two other cases.
It can be concluded from the simulation results that case 3 is the best choice for MIMO radar under the condition of low SNR, small number of measurements, and pulses. The reason is that the reconstruction error of case 3 is less than that of cases 2 and 4 while it is as small as the reconstruction error of case 1. It should be noted that the computational cost of case 3 is much less than that of case 1 as shown in Section 5.
As depicted in these figures, by increasing the number of measurements, SNRs, and number of pulses, the reconstruction errors of cases 2 and 4 decrease and get close to cases 1 and 3. As a result, under the condition of high SNR, large number of measurement, and pulses, case 4 can be considered for MIMO radar due to its ease of implementation. By the above discussion, one can easily find the effectiveness of our 2D proposed MMDGD methods compared to 1D ones.
The convergence of the gradient descent algorithm is demonstrated for convex and nonconvex problems in [35] and [37, 38], respectively. Here, to show the convergence rate of the proposed method, we define the RMSE of convergence curve as \( {\left\Vert \boldsymbol{B}\left( j+1\right)\boldsymbol{B}(j)\right\Vert}_F^2 \), where j is the iteration index.
Figure 3 shows the convergence curve of this algorithm for our proposed measurement matrix design for 500 Monte Carlo runs. As it is clear, the proposed algorithm can converge after 20 iterations for M = 4 and after 40 iterations for M = 8.
Now, we compare the detection performance of the proposed method with GRMM, SIR, and SCSM + SIR methods using receiver operating characteristic (ROC) curve. Since in the SIR and SCSM + SIR methods, the measurement matrix is designed only for case 4 (because this matrix optimization will be very time consuming for cases 1, 2, and 3 especially in SCSM + SIR), we consider only case 4 for comparison with these two methods.
In ROC curve, the probability of detection (P _{d}) is plotted versus the probability of false alarm (P _{f}). We consider any local maximum of the absolute value of S that is larger than a selected threshold τ _{ i } as a target. Then, we vary the threshold τ _{ i } within an interval [τ _{ L } τ _{ H }] and for each τ _{ i }, we count the number of detected actual or false targets. The empirical probability of detection P _{d} of actual targets and the empirical probability of false alarm P _{f} of false targets for different values of τ _{ i } is obtained by repeating N _{itr} trials of the experiment as:
where n _{ di } is the number of true targets and n _{ fi } is the number of false targets estimated at ith iteration.
Figure 4 shows ROC curve at SNR = 0 and 10 dB, M = 8 and 4, and N _{ t } = 4 with angle bins between 0^{°} to 35^{°} with 7^{°} resolution in CS MIMO radar. As it is obvious, 2DMMDGD has the better performance compared to SIR, SIR + SCSM, and GRMM. The reason is that in the SIR method, only the signaltointerference ratio is maximized and the increase of sparse recovery performance is not considered. On the other hand, in the SCSM + SIR method, to convert its nonconvex problem to a convex one, some approximations are considered that lead to a suboptimal solution, and thus, it may not have acceptable performance in all situations. Furthermore, the performance of our proposed method is always better than GRMM because the designed matrix has less mutual coherency compared to its initial value, i.e., GRMM.
Figure 5 shows ROC curve for angle bins between 0^{°} to 10^{°} with 2^{°} resolution and the same conditions as Fig. 4. As expected, by decreasing the resolution from 7^{°} to 2^{°}, the performance of all methods deteriorate due to the increase in MC. Also, our proposed method has better performance in low SNR and for lower number of measurements compared to other methods.
The reconstruction error versus the SNRs is shown in Fig. 6. As we see in Fig. 6a, the proposed method has better performance compared to other methods for small number of measurements in CS MIMO radar. Also, as depicted in Fig. 6b, our method and SCSM + SIR have nearly the same reconstruction error by increasing the number of measurements while outperforming SIR and GRMM methods.
The second scenario that we considered is the one that the targets fall off the grid points. In this scenario, a random noninteger multiple of the angle resolution and a random noninteger multiple of the Doppler resolution are chosen as the angle and Doppler of each target. For simulation, we consider M = 4, N _{ p } = 5, N _{ d } = N _{ a } = 11, N _{ r } = 6 with a resolution of 7^{°}.
The number of targets for Figs. 7 and 8 are N _{ t } = 4 and N _{ t } = 10, respectively. In these figures, the circles show the targets’ true locations and the estimated amplitudes are shown with colorcoded rectangles in decibel. It is demonstrated that our proposed method are able to capture the targets that fall off the grid points with lower sidelobes compared to other methods.
Figure 9 shows the runtime of measurement matrix design for different methods versus the number of measurements. The experiment is performed in MATLAB 8.1 environment using an Intel Core i7, 2.7 GHz processor with 4 GB of memory, and under Microsoft windows 7 operating system. This figure demonstrates the effectiveness of our proposed 2D method, and it shows clearly that the 2DMMDGD has much lower computational cost compared to the 1D one. Also, as explained in Section 5, SCSM + SIR has more runtime compared to our proposed 2DMMDGD, and also the other methods.
Conclusions
We have introduced a new 1D and 2D CS model for a pulseDoppler collocated MIMO radar. Then, we divided the measurement matrix design into four cases in which the measurement matrices applied to receivers and pulses can be equal or different. The measurement matrix design for all cases was proposed based on minimizing MC of sensing matrix using gradient descent algorithm. Looking at the performance comparison between 1D and 2D methods shows that case 3 can be the algorithm of choice for practical CS MIMO radar systems. The simulation results show that our proposed 2DMMDGD, even in case 4 scenario outperform GRMM, SIR, and SCSM + SIR methods while having much lower computations.
References
 1.
DL Donoho, Compressed sensing. IEEE Trans Inf Theory 52(4), 1289–1306 (2006)
 2.
EJ Candes, MB Wakin, An introduction to compressive sampling (a sensing/sampling paradigm that goes against the common knowledge in data acquisition). IEEE Signal Process Mag. 25(2), 21–30 (2008)
 3.
M Mishali, Y Eldar, Blind multiband signal reconstruction: compressed sensing for analog signals. IEEE Trans Signal Process. 57(30), 993–1009 (2009)
 4.
J Ma, FX Le Dimet, Deblurring from highly incomplete measurements for remote sensing. IEEE Trans Geosci Remote Sens. 47(3), 792–802 (2009)
 5.
SF Cotter, BD Rao, Sparse channel estimation via matching pursuit with application to equalization. IEEE Trans Commun. 50(3), 374–377 (2002)
 6.
J Trzasko, A Manduca, E Borisch, Highly under sampled magnetic resonance image reconstruction via homotopic ell0minimization. IEEE Trans Med Imaging 28(1), 106–121 (2009)
 7.
J Romberg, Imaging via compressive sampling (introduction to compressive sampling and recovery via convex programming). IEEE Signal Process Mag. 25(2), 14–20 (2008)
 8.
S Chen, D Donoho, M Saunders, Atomic decomposition by basis pursuit. SIAM J Sci Comput. 20, 33–61 (1998)
 9.
R Baraniuk, P Steeghs, Compressive radar imaging, in Process. Radar Conf, 2007, pp. 128–133
 10.
AC Gurbuz, JH McClellan, WR Scott, Compressive sensing for GPR imaging. in Proc. IEEE, 41st Asilomar Conf. Signals, Syst. Computer, Pacific Grove, CA, 2007, pp. 2223–2227.
 11.
M Herman, T Strohmer, Compressed sensing radar. in Proc. IEEE Int. Conf. IEEE, Acoustic Speech Signal Process., Las Vegas, NV, 2008, pp. 2617–2620
 12.
AC Gurbuz, JH McClellan, V Cevher, A compressive beamforming method. in Proc. IEEE Int. Conf. Acoustic Speech Signal Process, Las Vegas, NV, 2008, pp. 26172620
 13.
AM Haimovich, RS Blum, LJ Cimini, MIMO radar with widely separated antennas. IEEE Signal Process Mag. 25(1), 116–129 (2008)
 14.
P Stoica, J Li, MIMO radar with collocated antennas. IEEE Signal Process Mag. 24(5), 106–114 (2007)
 15.
X Tan, W Roberts, J Li, P Stoica, Sparse learning via iterative minimization with application to MIMO radar imaging. IEEE Trans Signal Process. 59(3), 1088–1101 (2011)
 16.
T Yardibi, J Li, P Stoica, M Xue, AB Baggeroer, Source localization and sensing: a nonparametric iterative adaptive approach based on weighted least squares. IEEE Trans Aerosp Electron Syst. 46, 425–443 (2010)
 17.
M JabbarianJahromi, MH Kahaei, Twodimensional sparse solution for bistatic MIMO radars in presence of jammers. 22nd Iranian Conference on Electrical Engineering (ICEE), pp. 1755–1759. IEEE, Tehran (2014)
 18.
Q Hou, Y Liu, Z Chen, Sh Su, Sparse radar imaging using 2D compressed sensing. Proc. SPIE 9252, Millimetre Wave and Terahertz Sensors and Technology VII, Oct. 2014, 9252.
 19.
M JabbarianJahromi, MH Kahaei, Twodimensional iterative adaptive approach for a sparse matrix solution. IET Electron Lett 50(1), 45–47 (2014)
 20.
A Ghaffari, M BabaieZadeh, C Jutten, Sparse decomposition of two dimensional signals. in IEEE International Conf. on Acoustics, Speech and Signal Process., ICASSP 2009, pp. 3157–3160. IEEE, Taipei (2009)
 21.
HM Hyder, K Mahata, RangeDoppler imaging via sparse representation, in IEEE Radar Conf. (RADAR), 2011, pp. 486–491
 22.
M JabbarianJahromi, MH Kahaei, Twodimensional SLIM with application to pulse Doppler MIMO radars. EURASIP J Adv Signal Process. 69, 45–47 (2015)
 23.
M JabbarianJahromi, MH Kahaei, Complex twodimensional TNIPM for l_{1} normbased sparse optimization to collocated MIMO radar. IEEJ Trans Electr Electron Eng. 11(2), 228–235 (2016)
 24.
M JabbarianJahromi, N Shahbazi, MH Kahaei, A Abbasfar, Fast twodimensional sparse Bayesian learning with application to pulse Doppler multipleinputmultipleoutput radars, in IET Radar, Sonar & Navigation, 2015, pp. 1–10
 25.
G Chen, D Li, J Zhang, Iterative gradient projection algorithm for twodimensional compressive sensing sparse image reconstruction. Elsevier Signal Process. 104, 15–26 (2014)
 26.
Y Yu, AP Petropulu, HV Poor, MIMO radar using compressive sampling. IEEE J Selected Signal Process. 4(1), 146–163 (2010)
 27.
T Strohmer, B Friedlander, Compressed sensing for MIMO radar—algorithms and performance. in Proc. IEEE, 43^{rd} Asilomar Conf. Signals, Syst. Computer, Pacific Grove, CA, 2009, pp. 464–468
 28.
DL Donoho, X Huo, Uncertainty principles and ideal atomic decomposition. IEEE Trans Inform Theory 47(7), 2845–2862 (2001)
 29.
M Elad, Optimized projections for compressed sensing. IEEE Trans Signal Process. 55(12), 5695–5702 (2007)
 30.
JM DuarteCarvajalino, G Sapiro, Learning to sense sparse signals: simultaneous sensing matrix and sparsifying dictionary optimization. IEEE Trans Image Process. 18(7), 1395–1408 (2009)
 31.
V Abolghasemi, S Ferdowsi, B Makkiabadi, S Sanei, On optimization of the measurement matrix for compressive sensing, in Process. European Signal Process. Conf, 2010, pp. 427–431
 32.
Y Yu, AP Petropulu, HV Poor, Measurement matrix design for compressive sensingbased MIMO radar. IEEE Trans Signal Process. 59(11), 5338–5352 (2011)
 33.
A George, F Seber, A Matrix Handbook for Statisticians (Wiley, Hoboken, 2008)
 34.
JA Tropp, Greed is good: algorithmic results for sparse approximation. IEEE Trans Inf Theory 50(10), 2231–2242 (2004)
 35.
S Boyd, L Vandenberghe, Convex Optimization (Cambridge University Press, Cambridge, 2004)
 36.
P Stocia, H He, J Li, New algorithms for designing unimodular sequences with good correlation properties. IEEE Trans Signal Process. 57(4), 1415–1425 (2009)
 37.
C Cartis, NIM Gould, PL Toint, On the complexity of steepest descent, Newton’s and regularized Newton’s methods for nonconvex unconstrained optimization. SIAM J Optim. 20(6), 2833–2852 (2010)
 38.
C. D. Sa, K. Olukotun, and C., Global convergence of stochastic gradient descent for some nonconvex matrix problems. Proceedings of the 32nd International Conference on Machine Learning (ICML15), 2015.
Acknowledgements
The authors would like to thank the Referees for the careful revision of the paper.
Authors’ contributions
All the authors have contributed to the study conception and design of algorithms, theoretical analysis and simulations, drafting of manuscript, and critical revision. All authors read and approved the final manuscript.
Authors’ information
Nafiseh Shahbazi received a B.S. degree in 2008 and an M.S. degree in 2008 in Electrical Engineering at Amirkabir University of Technology, Tehran, Iran. She is currently working for a Ph.D. degree in the School of Electrical and Computer Engineering, University of Tehran, from 2011. Her current research interests are in the areas of array signal processing, radar signal processing, and compressive sensing.
Aliazam Abbasfar received a B.Sc. (Highest Honors) and a M.Sc. degree in Electrical Engineering at the University of Tehran, Iran, in 1992 and 1995 and a Ph.D. degree in Electrical Engineering at the University of California Los Angeles (UCLA) in 2005. Between 2001 and 2004, he held a position as a senior design engineer in the areas of communication system design and digital VLSI/ASIC design with various startup companies in California. Upon graduation from the UCLA, he joined Rambus Inc. where he was a Principal Engineer working on highspeed data communications on wireline serial and parallel links. He is currently an Assistant Professor at the University of Tehran.
Mohammad JabbarianJahromi received a Ph.D degree in Electrical Engineering at Iran University of Science and Technology, Tehran, Iran, in 2016. His current research interests are in the areas of array signal processing, radar signal processing, and sparse reconstruction.
Competing interests
The authors declare that they have no competing interests.
Author information
Appendices
Appendix 1
The statistical analysis of MC of sensing matrix A:
In this appendix, we analyze the MC of four cases from a statistical point of view. To do so, we obtain the mean and variance of MC for all cases and then compare their results. Let the components of measurement matrix φ _{ pm } be considered as random variable.
The MC of A is proportional to \( \mu \left(\boldsymbol{A}\right)\propto \underset{i\ne j}{ \max }{\rho}_{i, j} \), where ρ _{ i,j } can be given as:
where
Now, ρ _{ i,j } can be extended as:
where
Since the statistical properties of measurement matrix φ _{ pm } is independent of the number of pulses and antennas, and also it can be approximately independent of (i, j) as shown in [32], we can conclude that the mean and variance of δ _{ pm,ij } for all cases are equal, i.e.,
Therefore, we have
Now, we analyze the variance of MC for all cases.
Variance analysis of MC for case 1:
Due to C _{ p,ij } = 1 and C _{ m,ij } = 1, we have
Variance analysis of MC for case 2:
Due to C _{ p,ij } = 1, and \( \max \left({\left{\displaystyle \sum_m^{M_r}}{C}_m\right}^2\right)={M}_r^2 \), we have
Variance analysis of MC for case 3:
Due to C _{ m,ij } = 1 and \( \max \left({\left{\displaystyle \sum_p^{N_p}}{C}_p\right}^2\right)={N}_p^2 \), we have
Variance analysis of MC for case 4:
Due to \( \max \left({\left{\displaystyle \sum_p^{N_p}}{C}_p\right}^2\right)={N}_p^2 \) and \( \max \left({\left{\displaystyle \sum_m^{M_r}}{C}_m\right}^2\right)={M}_r^2 \), we have
Appendix 2
The relationship between the MC of A, B, and Θ:
Consider the following Kroneker product properties [33]:

if A = Θ ^{T} ⊗ B, then \( {\boldsymbol{a}}_i={\left({\left(\boldsymbol{\Theta} \right)}_d^r\right)}^T\otimes {\left(\boldsymbol{B}\right)}_n^c \), where a _{ i } is the ith column of A, \( {\left(\boldsymbol{\Theta} \right)}_d^r \) is dth row of Θ, and \( {\left(\boldsymbol{B}\right)}_n^c \) is the nth column of matrix B.

\( {\left\Vert {\left({\left(\boldsymbol{\Theta} \right)}_d^r\right)}^T\otimes {\left(\boldsymbol{B}\right)}_n^c\right\Vert}_2={\left\Vert {\left(\boldsymbol{\Theta} \right)}_d^r\right\Vert}_2{\left\Vert {\left(\boldsymbol{B}\right)}_n^c\right\Vert}_2 \)

\( \left\left({\left({\left(\boldsymbol{\Theta} \right)}_d^r\right)}^T\otimes {\left(\boldsymbol{B}\right)}_n^c\left){}^H\right({\left({\left(\boldsymbol{\Theta} \right)}_{d^{\hbox{'}}}^r\right)}^T\otimes {\left(\boldsymbol{B}\right)}_{n^{\hbox{'}}}^c\right)\right=\left{\left({\left(\boldsymbol{\Theta} \right)}_d^r\right)}^H\otimes {\left(\boldsymbol{\Theta} \right)}_{d^{\hbox{'}}}^r\right\left{\left({\left(\boldsymbol{B}\right)}_n^c\right)}^H\otimes {\left(\boldsymbol{B}\right)}_{n^{\hbox{'}}}^c\right \)
Then, the MC of A is obtained as,
where d, d ^{'} = 1, …, N _{ d } and n, n ^{'} = 1, …, N _{ r } N _{ a }. Also, we have i = (d − 1)N _{ r } N _{ a } + n and j = (d ^{'} − 1)N _{ r } N _{ a } + n ^{'}.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Shahbazi, N., Abbasfar, A. & JabbarianJahromi, M. Efficient twodimensional compressive sensing in MIMO radar. EURASIP J. Adv. Signal Process. 2017, 23 (2017) doi:10.1186/s1363401704481
Received
Accepted
Published
DOI
Keywords
 Compressive sensing
 Measurement matrix
 Multipleinput multipleoutput (MIMO) radar
 Sensing matrix
 Twodimensional sparse signal model