# Search-Free Angle, Range, and Velocity Estimation for Monostatic FDA-MIMO

Authors: Zihang Ding; Junwei Xie; Jiaang Ge
Journal: International Journal of Antennas and Propagation
 (2022)

---

## Abstract

The monostatic frequency diverse array multiple-input multiple-output (FDA-MIMO) has attracted much attention recently. However, much research is concentrated on the estimation of angle-range parameters based on the FDA-MIMO radar, and the velocity has not been considered. In this study, we propose a search-free method to estimate these parameters. To overcome the problem of the high computational complexity associated with the searching estimation algorithms, the parallel factor (PARAFAC) decomposition is introduced to estimate the space-time steering vector. Next, we can utilize the least square method to solve the angle, range, and velocity of each target. In addition, the Cramér–Rao bounds (CRBs) of angle, range, and velocity are derived. Besides, the other performance analysis consists of the root mean square error, and complexity is derived. We compare the PARAFAC decomposition algorithm with the estimation of signal parameters via the rotational invariance techniques (ESPRIT) algorithm, and our method owns a superior performance. Finally, the proposed method is verified by simulations and has the ability to achieve greater estimation accuracy than existing algorithms.


---

## Body

## 1. Introduction

Since the frequency diverse array (FDA) was first proposed in 2006, it has attracted much attention [1, 2], and more and more research studies focus on it. The beampattern of the FDA radar is related to both range and angle because of the small offset between transmit array elements [3, 4]. Thus, the FDA radar has the ability to attain additional information in range, and it can provide more ﬂexibility in array signal processing [5, 6].In recent years, a novel radar system called the MIMO radar attains great attention due to its special advantages [7]. Compared with the traditional phased array (PA) radar, MIMO radar brings increased degrees-of-freedoms (DoFs), and many parameter estimation algorithms have been researched in the existing literature [8, 9]. Although the MIMO radar has many obvious advantages, the beampattern of it only depends on the angle rather than both range and angle. Considering this problem, a combination of the FDA radar with MIMO was proposed in [10, 11], and it can form the beampattern which is related to range. FDA-MIMO is used in a variety of applications, including parameter estimation, deceptive jamming suppression [11, 12], target tracking [13, 14], beamspace design [15], and communication system [16].Target multiparameter estimation, which is an important technology in array radar applications. Both angle and range can be estimated simultaneously in the FDA-MIMO radar. Multiple signal classification (MUSIC) and reduce-dimension algorithms were applied to the FDA-MIMO radar in [17, 18]. A maximum likelihood estimator to obtain angle and range parameter estimation has been proposed in [11]. The sparse reconstruction-based algorithm was implemented in angle and range estimation [19]. However, these algorithms with peak-searching need a large amount of complexity, and the complexity increases rapidly as the number of estimated parameters increases. Searching-free estimation algorithms have been used in the FDA-MIMO radar. For example, the estimation of signal parameters via rotational invariance techniques (ESPRIT) has been used to attain the range-angle parameters of target in FDA-MIMO [20–23]. In [24], the real-valued subspace decomposition is used to estimate the angle and range.The parallel factor (PARAFAC) decomposition was considered in the parameter estimation [25, 26] and has superior estimation accuracy and low computational complexity. PARAFAC decomposition was used to estimate the 2-D direction of arrival and frequency for an L-shaped array in [27, 28]. Because of these advantages, the algorithm has been introduced to estimate the angle and range of targets based on the FDA-MIMO radar [29].As for the moving target localization, the information about angle, range, and velocity is crucial. However, the existing estimation methods with FDA-MIMO are only utilized in angle-range estimation, and velocity estimation has not been considered. In this study, a search-free angle-range-velocity estimation algorithm for monostatic FDA-MIMO is proposed. We utilize the PARAFAC decomposition algorithm to estimate the space-time steering vector. Once the steering vector is acquired, angle, range, and velocity can be calculated.The remaining sections are organized as follows: Section2 introduces the data model of FDA-MIMO. The PARAFAC algorithm is used to offer an angle-range-velocity estimation approach for the FDA-MIMO radar in Section 3. Section 4 provides a performance benchmark for the Cramér–Rao Bounds (CRBs), computational complexity, and root mean square errors (RMSE). Simulations and findings are given in Section 5. We conclude this paper in Section 6.The PARAFAC algorithm can significantly reduce computational complexity. Results verify the effectiveness and superiority of our method. The main contributions are summarised as follows:(1)
Based on the conventional FDA-MIMO model, we introduce the Doppler frequency to the data model and expand the dimension of parameter estimation. The angle-range-velocity estimation method of the FDA-MIMO radar is proposed based on the PARAFAC decomposition algorithm.(2)
The CRBs of angle, range, and velocity are derived based on the 3-dimension parameter model of the FDA-MIMO radar.Notation: lower-case (upper-case) bold italic characters stand for vectors (matrices).·T, ·H, and ·† denote the transpose, conjugate transpose, and pseudo-inverse transformation. ⊗and∘ are defined as the Kronecker product and the Khatri–Rao product. diag· is used to build a diagonal matrix when the object is a vector or to extract diagonal elements as a vector when the object is a diagonal matrix. angle· denotes the phase of the complex value.


## 2. Data Model

The model of monostatic FDA-MIMO is shown in Figure1. We assume that the transmitters and receivers are from a uniform linear array with an M-element transmit array and an N-element receive array. The frequency of the m-th element can be written as(1)fm=f0+m−1Δf,m=1,2,…,M,where f0 denotes the carrier frequency and Δf denotes the frequency offset. Assume that the FDA-MIMO radar transmits K pulses in the CPI. The k-th transmitted pulse signal of the m-th element can be expressed as(2)gm,kt=EMφmt−k−1Tpej2πfmt,k−1Tp<t<k−1Tp+T,m=1,2…,M,where φmt denotes the transmitted waveform, E is the total transmit energy, and T denotes the pulse duration. According to the signal waveforms transmitted by each transmitting element being orthogonal, they are supposed to satisfy the condition [11].(3)∫τφmtφn∗tej2πm−nΔfdt=0,m≠n,1,m=n.Figure 1
The model of the monostatic FDA-MIMO. (a) Transmit array. (b) Receive array.The signal received by then-th element of the FDA-MIMO radar is based on P targets, and ζp is the complex reflection coefficient of the p-th target. The k-th pulse received signal of the n-th received element can be written as(4)rn,kt=∑p=1P∑m=1Mζpgm,kt−τm,n,kp,τm,n,kp denotes the propagation delay of the p-th p=1,2,…,P target between the m-th transmitted element and the n-th receive element at the k-th k=1,2,…,K pulse which is expressed as(5)τm,n,kp=2rp−dmsinθp−dnsinθp−k−1vpTPc,where c, d denote the light speed and the element spacing, respectively. rp, θp denote the range and angle of the p-th target, respectively. di denotes the distance between the i-th element and the reference element. TP denotes the pulse repetition time (PRF). Under the narrowband assumption, by using (5), (4) can be updated to(6)rn,kt=EM∑p=1P∑m=1Mζpφmt−τ0pej2πfmt−2rp−dmsinθp−dnsinθp−k−1vpTP/c,where τ0p=2rp/c denotes the transmit time between the p-th target and the radar. Through performing matched filtering with φmte−j2πmΔf, the output corresponding to the m-th transmit element, n-th received element, the k-th pulse, and the p-th target can be expressed as [12].(7)rm,n,kp=EMζpej2πk−1vpTP+dmsinθp/λ+dnsinθp/λ−Δfrp/c.Introduce the 3-dimension data model, i.e., in the case of the moving target. Assume that thep-th target has a fixed velocity vp. Rearrange the outputs of matched filters into a MNK×1 vector, and the 3-D vector corresponding to the p-th target is written as [22].(8)yp=ζparθp⊗cvp⊗atθp,rp,where arθp∈ℂN×1, atθp,rp∈ℂM×1, cvp∈ℂK×1 denote the receive steering vector, transmit steering vector, and time steering vector, respectively. Their expressions can be written as(9)arθ=1,ej2πdsinθ/λ,⋯,ej2πN−1dsinθ/λT,(10)atθ,r=1,ej2πdsinθ/λ−2Δfr/c,⋯,ej2πM−1dsinθ/λ−2Δfr/cT,(11)cv=1,ej4πvTp/λ,⋯,ej4πK−1vTp/λT,where λ=c/f0 denotes the wavelength. From (10), the transmit vector is dependent on both the range and angle. It shows that the FDA-MIMO radar has a range of information in the transmitter. Assume that the fast time sample is L, and at the l-th sample, the total signals of P targets can be expressed as(12)Al=Ar∘Atsl,with(13a)At=cv1⊗atθ1,r1,cv2⊗atθ2,r2,⋯,cvP⊗atθP,rP,(13b)Ar=arθ1,arθ2,⋯,arθP,where sl denotes the complex reflection coefficient of P targets at the l-th sample. Through (12), the receive signal matrix Y can be written as(14)Y=Ar∘AtSt+Nt,where St=s1,⋯,sL∈ℂP×L, Nt∈ℂMNK×Ldenote the signal reflection coefficient matrix and the Gaussian white noise matrix with zero mean and covariance matrix σnIMNK. For convenience, define cv⊗atθ,r=αθ,r,v.


## 3. Proposed Algorithm

To estimate the parameters, in general, spatial spectrum search algorithms such as the Capon and MUSIC algorithms can be utilized. However, as the dimension increases, so does the computing complexity. We presented a sequential PARAFAC algorithm in this section to estimate the angle, range, and velocity of objects, respectively.By (12), the new received model can be written as(15)Wx=Y1Y2⋮YN=AtD1ArAtD2Ar⋮AtDNArS+Nx,where Nx=N. DiAr stands for a diagonal matrix constructed out of the i-th row of Ar. Referring to the PARAFAC decomposition model in [30], the received data (15) are denoted as a three-order tensor and can be written as(16)xi,j,e=∑p=1PAti,pArj,pSTe,p+Ni,j,e,where xi,j,k denotes the (i, j, e)-th element of the three-order tensor χ, i=1,…,MK; j=1,…,N; e=1,…,L. YN can be viewed by slicing the three dimension data into a series of slices along the spatial direction. The model of (16) can be written as simultaneous equations along three different dimensions, and two more matrices will be expressed as(17)Wy=ST∘ArAtT=ArD1STArD2Sr⋮ArDLSrAtT+Ny,(18)Wz=At∘STAr=STD1AtSTD2At⋮STDMKAtArT+Nz,where Wy, Wz denote the rearrangement matrices of the three-order tensor and Ny, Nz denote the rearranged noise slices. Wy can be interpreted as a matrix of three-dimensional data slices arranged along the direction of the transmit array, and Wz, Wz can be expressed as a matrix of three-dimensional data slices arranged along the direction of the received array. Both At and Ar are connected with Wx, Wy, Wy, and Wz, Wz.A common algorithm named trilinear alternating least square (TALS) is adopted to solve the PARAFAC effectively [26, 31]. The principle of the TALS algorithm can be expressed as follows:Step.1: set initialization update matrixStep.2: fitting one ofWx, Wx, Wy, Wy, Wz, Wz using the LS algorithm, where the other two matrixes are obtained in the last iterationStep.3: update the other two matrixes by step.2Step.4: repeat Step.2 and Step.3 when the value of cost function is satisfied with the stop condition.The detailed steps of the TALS algorithm are shown as follows:The slice forms of the three-order tensor have been written in (15), (17), and (18). According to (15), the LS fitting ofWx, Wx is(19)fx=minAr,At,STWx−Ar∘AtSF,where ·F denotes the Frobenius norm. The LS estimate S can be expressed as(20)S=Ar∘At†Wx,where Ar, At are previously obtained estimates in the last iteration. The LS fitting of Wy is(21)fy=minAr,At,STWy−ST∘ArAtTF.The update forAtT can be expressed as(22)AtT=ST∘Ar†Wy,where Ar, ST are previously obtained estimates in the last iteration. In the same way, by (18), the LS fitting of Wz is(23)fz=minAr,At,STWz−At∘STArF.The update forAtT, AtT can be written as(24)AtT=At∘ST†Wz,where At, ST are previously obtained estimates in the last iteration, respectively.According to the (20), (22), and (24), ST, ST, At, At, and Ar are calculated with the LS algorithm. The iteration can repeat until the method convergence or reaching the maximum number of iterations.The received and transmitted steering vectors of thep-th target are estimated as a¯rθp, α¯θp,rp,vp. The angle can be estimated first. The phase of the normalization version of a¯rθp can be obtained.(25)g¯rp=−anglea¯rθa¯rθ1,where a¯rθ1 denotes the first element in the string vector a¯rθ. To obtain the angle of targets, we construct a matrix as follows:(26)U1=11⋯102πdλ⋯2N−1πdλT,(27)up=up1up2T.The solution to LS fitting forup is known as up=U1†g¯rp. Then, the angle of the p-th target is expressed as(28)θ¯p=arcsinup2·180π.Secondly, the range of thep-th target is estimated. Obtaining the phase of the normalization version of α¯θp,rp,vp1:M(29)g¯tp=−angleα¯θp,rp,vp1:Mα¯θp,rp,vp1,where α¯θp,rp,vp1:M presents a vector with the first element to the m-th element in α¯θp,rp,vp. Similarly, a matrix will be constructed as follows:(30)U2=11⋯102π⋯2πM−1T,(31)qp=qp1qp2T.The solution to LS fitting forqp is known as qp=U2†g¯tp. The range of the p-th target can be expressed as(32)rp=dsinθp/λ−qp2cΔf.To avoid the unambiguity phase of the range parameter, the constrained range can be given byrmax<c/Δf.Here,θp can be estimated by (28). Finally, the velocity of the p-th target is estimated. The phase of the normalization version of α¯θp,rp,vp1,M+1,⋯,K−1M+1 is attained.(33)g¯vp=−angleα¯θp,rp,vp1,M+1,⋯,K−1M+1α¯θp,rp,vp1,where α¯θp,rp,vp1,M+1,⋯,K−1M+1 denotes a vector with the 1th, (M+1)-th, …, (M(K-1)+1)-th element in α¯θp,rp,vp. Similarly, a matrix will be constructed as follows:(34)U3=11⋯102π⋯2πK−1T,(35)hp=hp1hp2T.The solution to LS fitting forhp can be known as hp=U3†g¯vp, and the velocity can be expressed as(36)vp=hp2λ2TR.


## 4. Performance Analysis

### 4.1. Cramér–Rao Bound

We will derive the formula of the Cramér–Rao bounds (CRBs) in this subsection for angle, range, and velocity estimation. Assume that there is just one target and that the reflection coefficient is constant when deriving the CRBs.By (12), the received signal can be written as(37)y=arθ⊗αθ,r,vS+N=bθ,r,vS+N.The unknown parameter vector is(38)ξ=θ,r,vT.The corresponding Fisher information matrix (FIM) can be derived as(39)F=2LRe∂bθ,r,v∂ξTHRn−1∂bθ,r,v∂ξT,where Rn=σ2IMNK×MNK denotes the noise covariance matrix and σ2 and L denote the noise power and the number of snapshots, respectively. The partial derivative can be written as(40)∂bθ,r,v∂ξT=∂bθ,r,v∂θ,∂bθ,r,v∂r,∂bθ,r,v∂v,whose terms can be given by(41a)∂bθ,r,v∂θ=∂arθ∂θ⊗cv⊗∂atθ,r∂θ,(41b)∂bθ,r,v∂r=arθ⊗cv⊗∂atθ,r∂r,(41c)∂bθ,r,v∂v=arθ⊗∂cv∂v⊗atθ,r,with(42a)∂arθ∂θ=j2πdcosθλΛNarθ,(42b)∂atθ,r∂θ=j2πdcosθλΛMatθ,r,(42c)∂atθ,r∂r=−j2πΔfcΛMatθ,r,(42d)∂cv∂v=4πTpλΛKcv,where ΛP=diag0,1,…,P−1. The inverse of the FIM can be expressed as(43)ℚ=F−1.The diagonal elements ofℚ are the CRBs for angle (θ), range (r), and velocity v estimations, respectively.


### 4.2. Complexity Analysis

The main aim is to reduce the complexity of the multiple parameter estimation with no searching estimation algorithm. There is large complexity when the spectral peak searching algorithms are used. The 3D-MUSIC requiresΟnθnrnvMNKMNK−P+MNK−P+2MNK2L+MNK3. The ESPRIT algorithm requires ON2M2K2L+MNK3+2MKN−1P2+2NKM−1P2+3P3+2NMK−1P2.The OMP algorithm requiresONMKnθnrnv+NMKP2+NMKP+P3. The computational complexity of the TALS algorithm for PARAFAC decomposition is Οl3P3+3MNKLP+2P2+PMKL+NL+MKN, where l is the number of iterations. The computational complexity in Equations (26)–(28), Equations (30)–(32), and Equations (30)–(32) is Ο2PM+2PN+2PK.


### 4.3. Root Mean Square Error

To assess the estimation (angle, range, and velocity) performance, the root mean square of error (RMSE) is adopted. The RMSE can be expressed as(44a)RMSEθ=1P∑p=1P1B∑b=1Bθ¯p,b−θp,b2,(44b)RMSEr=1P∑p=1P1B∑b=1Br¯p,b−rp,b2,(44c)RMSEv=1P∑p=1P1B∑b=1Bv¯p,b−vp,b2,where B denotes the number of the Monte Carlo trials.


### 4.4. The Selection of Frequency Offset

According to radar theories, the maximum unambiguous range can be expressed as(45)rup=c2fPRF,where fPRF denotes the PRF of the FDA-MIMO radar.In addition, to avoid the multiple solution of estimated range, the frequency incrementΔf should be satisfied as(46)c2Δf>rmax.The maximum unambiguous velocity can be expressed as(47)vup=λfPRF2.We proposed a selection criterion [11] of frequency offset, and it can be provided as(48)Δf=maxqq+vfPRF,q∈ℕ,s.tv=1NaΔf≤B2Na,B denotes the signal bandwidth, Na=intM−1/2, where intx indicates the smallest integer greater than or equal to x.


## 4.1. Cramér–Rao Bound

We will derive the formula of the Cramér–Rao bounds (CRBs) in this subsection for angle, range, and velocity estimation. Assume that there is just one target and that the reflection coefficient is constant when deriving the CRBs.By (12), the received signal can be written as(37)y=arθ⊗αθ,r,vS+N=bθ,r,vS+N.The unknown parameter vector is(38)ξ=θ,r,vT.The corresponding Fisher information matrix (FIM) can be derived as(39)F=2LRe∂bθ,r,v∂ξTHRn−1∂bθ,r,v∂ξT,where Rn=σ2IMNK×MNK denotes the noise covariance matrix and σ2 and L denote the noise power and the number of snapshots, respectively. The partial derivative can be written as(40)∂bθ,r,v∂ξT=∂bθ,r,v∂θ,∂bθ,r,v∂r,∂bθ,r,v∂v,whose terms can be given by(41a)∂bθ,r,v∂θ=∂arθ∂θ⊗cv⊗∂atθ,r∂θ,(41b)∂bθ,r,v∂r=arθ⊗cv⊗∂atθ,r∂r,(41c)∂bθ,r,v∂v=arθ⊗∂cv∂v⊗atθ,r,with(42a)∂arθ∂θ=j2πdcosθλΛNarθ,(42b)∂atθ,r∂θ=j2πdcosθλΛMatθ,r,(42c)∂atθ,r∂r=−j2πΔfcΛMatθ,r,(42d)∂cv∂v=4πTpλΛKcv,where ΛP=diag0,1,…,P−1. The inverse of the FIM can be expressed as(43)ℚ=F−1.The diagonal elements ofℚ are the CRBs for angle (θ), range (r), and velocity v estimations, respectively.


## 4.2. Complexity Analysis

The main aim is to reduce the complexity of the multiple parameter estimation with no searching estimation algorithm. There is large complexity when the spectral peak searching algorithms are used. The 3D-MUSIC requiresΟnθnrnvMNKMNK−P+MNK−P+2MNK2L+MNK3. The ESPRIT algorithm requires ON2M2K2L+MNK3+2MKN−1P2+2NKM−1P2+3P3+2NMK−1P2.The OMP algorithm requiresONMKnθnrnv+NMKP2+NMKP+P3. The computational complexity of the TALS algorithm for PARAFAC decomposition is Οl3P3+3MNKLP+2P2+PMKL+NL+MKN, where l is the number of iterations. The computational complexity in Equations (26)–(28), Equations (30)–(32), and Equations (30)–(32) is Ο2PM+2PN+2PK.


## 4.3. Root Mean Square Error

To assess the estimation (angle, range, and velocity) performance, the root mean square of error (RMSE) is adopted. The RMSE can be expressed as(44a)RMSEθ=1P∑p=1P1B∑b=1Bθ¯p,b−θp,b2,(44b)RMSEr=1P∑p=1P1B∑b=1Br¯p,b−rp,b2,(44c)RMSEv=1P∑p=1P1B∑b=1Bv¯p,b−vp,b2,where B denotes the number of the Monte Carlo trials.


## 4.4. The Selection of Frequency Offset

According to radar theories, the maximum unambiguous range can be expressed as(45)rup=c2fPRF,where fPRF denotes the PRF of the FDA-MIMO radar.In addition, to avoid the multiple solution of estimated range, the frequency incrementΔf should be satisfied as(46)c2Δf>rmax.The maximum unambiguous velocity can be expressed as(47)vup=λfPRF2.We proposed a selection criterion [11] of frequency offset, and it can be provided as(48)Δf=maxqq+vfPRF,q∈ℕ,s.tv=1NaΔf≤B2Na,B denotes the signal bandwidth, Na=intM−1/2, where intx indicates the smallest integer greater than or equal to x.


## 5. Simulation Result

B=500 Monte Carlo trials are used to evaluate the accuracy of the proposed method. The simulation parameters of a monostatic FDA-MIMO radar are shown in Table 1.Table 1
The simulation parameters of the FDA-MIMO radar.
ParametersValuesTransmit elements9Receive elements8Element spacingHalf-waveformNumber of snapshots256Number of coherent pulses7Carrier frequency6×109HzFrequency increment3KHzWe assume that there areP=2 uncorrelated sources located at θ1,r1=25°,5km, θ2,r2=35°,20km. The normalized Doppler shifts are fd1=0.1, fd2=0.2, and the corresponding velocities are v1=100m/s and v2=200m/s, v2=200m/s.Set the value of the SNR as 5 dB. The proposed method's scatter estimate results are shown in Figure2. The proposed method is capable of accurately estimating angles, ranges, and velocities. The estimation results are close to the actual scenario.Figure 2
Scatter estimation results of the proposed algorithm. (a) The angle and range estimation result, (b) the range and velocity estimation result, and (c) the angle and velocity estimation result.
(a)(b)(c)Figure3 shows the RMSEθ, RMSEr, RMSEv comparisons of different methods such as MUSIC, ESPRIT, and Orthogonal Matching Pursuit (OMP) algorithms versus SNR. We can find that the proposed method attains a superior angle, range, and velocity estimation performance to other algorithms. In addition, the range estimation accuracy is close to the CRB by the proposed method.Figure 3
RMSEs and CRB versus SNR for parameter estimation (a) the angle, (b) the range, and (c) the velocity.
(a)(b)(c)To evaluate the estimation performance of different number of snapshots, we calculate the RMSE of different estimation algorithms in different number of snapshots with a fixed SNR = 5, and the result is shown in Figure4. In Figures 4(a)–4(c), we can find that the RMSEs of the angle, range, and velocity are slightly decreasing versus the increasing number of snapshots.Figure 4
The RMSE versus the number of snapshots. (a) The angle, (b) the range, and (c) the velocity.
(a)(b)(c)The computational complexity is compared among PARAFAC, ESPRIT, and 3D-MUSIC in Figure5. The simulation parameters are set as follows: P=2, l=30, the number of searching grids corresponding to the angle, range, and velocity is nθ=300, nr=1000, and nv=100, respectively. According to the results, the proposed algorithm and the ESPRIT algorithm have much lower complexity than the 3D-MUSIC. Figures 5(a) and 5(b) show the complexity versus the number of transmit and receive elements, and we can find that the complexities of 3D-MUSIC and ESPRIT are rising faster than PARAFAC. In Figure 5(c), the complexity versus the number of snapshots has no significant change. Figure 5(d) shows the complexity versus the number of targets, and we can find that the complexity of the proposed algorithm increases versus the number of targets, and the number of targets has a small impact on 3D-MUSIC and ESPRIT.Figure 5
The computational complexity among different algorithms. (a) Complexity versus the number of transmit elements, (b) complexity versus the number of receive elements, (c) complexity versus the number of snapshots, and (d) complexity versus the number of targets.
(a)(b)(c)(d)


## 6. Conclusion

The angle and range estimation based on the FDA-MIMO radar has attracted much attention. However, the velocity of the moving target cannot be estimated directly. In this paper, the information in the angle-range-velocity domains is combined. We concentrate on the angle, range, and velocity estimation with search-free algorithms for monostatic FDA-MIMO. The PARAFAC algorithm is used to estimate the steering vectors, and we can calculate the angle, range, and velocity of the targets from the estimated steering vectors. Because of the velocity, the dimension of the steering vector is greatly improved, which leads to an increase in computational complexity. Both theoretical analysis and simulations indicate that the PARAFAC algorithm has much lower complexity than the 3D-MUSIC algorithm. The proposed algorithm can attain a higher estimation accuracy than ESPRIT, MUSIC, and OMP. [32–36].



---

*Source: 8363100-2022-08-24.xml*