# A Frequency Domain Direct Localization Method Based on Distributed Antenna Sensing

Authors: Gaofeng Zhao; Hao Zheng; Yingying Li; Kehui Zhu; Jianfeng Li
Journal: Wireless Communications and Mobile Computing
 (2021)

---

## Abstract

Traditional two-step passive localization methods need to extract the parameters like the direction of arrival (DOA), time of arrival (TOA), and time difference of arrival (TDOA) from the original data to determine the source position, which causes the poor positioning accuracy due to error accumulation. In this paper, a direct position determination (DPD) method is proposed to improve the positioning accuracy and robustness, which is based on a correlation algorithm. Firstly, the cost function directly related to the location of the source can be established by synthesizing the data received by multiantenna in the frequency domain. Then, the position of the source is estimated by the correlation DPD method to search the monitoring area. Compared to the improved TDOA algorithm and Least Squares DPD algorithm, the proposed method shows better localization accuracy of different SNRs. Finally, based on real measured data, it can be seen that the results of the proposed algorithm are better than the improved TDOA algorithm.


---

## Body

## 1. Introduction

Wireless positioning is an important research direction in the civilian and military fields [1]. There are many wireless positioning algorithms, among which the two-step positioning algorithms are the most concerned. The traditional two-step positioning methods extract measurement parameters such as angles of arrival (AOA), times of arrival (TOA), and time differences of arrival (TDOA) from the received signal, then solve the equations established based on extracted measurement parameters to obtain the target position [2, 3]. In order to improve the positioning accuracy, a TDOA positioning method based on time delay compensation was proposed in [4], which improved the performance of two-step positioning to a certain extent. In [5], considering the synchronization error between transmitter and receiver, a passive location method of the asynchronous receiver based on expectation maximization is proposed. The method significantly improves the positioning performance. In [6], a two-dimensional direction of arrival (DOA) and polarization estimation algorithm for noncircular signals based on multisignal classification (MUSIC) is proposed. The algorithm is mainly applied to three-dimensional millimeter-wave polarized massive multi-input multioutput (MIMO) systems. In [7], a novel system architecture including a reconfigurable intelligent surface (RIS) and multiple autonomous vehicles or a massive multi-input multioutput (MIMO) is considered in vehicle location systems. However, the losses of position information and errors cannot be avoided due to the separation of the parameter solution and target localization for two-step localization methods. Besides, the measurement parameters may not match the corresponding transmitter, and the positioning performance is poor with low SNR [8, 9]. Therefore, it has become an important research topic in the field of wireless positioning to find a method to further improve the positioning accuracy of the target signal source.In [10], a direct location algorithm (Least Squares DPD) based on angle and time delay information is proposed, which firstly proved that the direct positioning accuracy is better than the two-step positioning accuracy. In [11], a multisource direct location method without knowing the number of transmitters is proposed. Different from the traditional two-step positioning, the direct location technology can directly estimate the emitter position without parameter estimation by using the received signal [12]. It avoids the information loss caused by the two-step positioning method and obtains higher positioning accuracy. Besides, the direct location algorithm solves the parameter matching problem in the traditional two-step localization method in the case of multiple sources [13]. Although direct position determination (DPD) does not need to estimate the parameters, we still need to consider which variables are contained in the emitter location information and select the appropriate information type according to the location scene. A direct location method based on time difference of arrival (TDOA) and frequency difference of arrival (FDOA) was proposed in [14–16] by using multiple moving single sensors to intercept the signal of the stationary emitter. Considering the information of TDOA and FDOA, the model between the intercepted signal and the emitter location was established directly, and the direct location was realized by the exhaustive search method. In [17], a multistation direct location method based on TDOA was proposed on the condition that the observation stations and emitters are relatively stationary. A new direct location method using a multiple antenna array (DPD) algorithm was proposed in [18]. This method uses the cross-correlation matrix (CCM) of the received signals to estimate the position of the emitter directly. An algorithm for DPD of multiple fixed transmitters was shown in [19] by using the position information embedded in the angle and Doppler frequency shift. In [20], a direct position estimation (DPE) algorithm for dense multipath channels based on Gaussian approximation is proposed for passive location in a multipath environment. In [21], the influence of Doppler frequency shift on direct location is considered and describes the fluctuation of DPD cost function in NLOS. In [22], the problem of determining the unknown location of a mobile station in a millimeter-wave MIMO system is solved. The exact solution of the maximum likelihood estimation problem is provided, and the basic lower bounds of channel and location parameter estimation uncertainty are derived. In [23], the maximum likelihood (ML) direct position estimation (DPE) problem of the multiantenna receiver in a dynamic multipath environment is studied, and a complexity reduction algorithm based on the pseudo ML method is proposed.With the development of radar and communication technology, the modulated broadband signal has been more and more widely used for its advantages of a large amount of information and strong antijamming ability. However, there are few direct positioning algorithms for broadband signals. In [24], the direct location of wideband signals was firstly considered, and a model for intercepting wideband signals by moving multistations was established. Besides, a direct location cost function based on TDOA and FDOA was established by expanding the application of direct location to broadband signals. In [25], a maximum likelihood direct location method based on TDOA was proposed, which is aimed at the case of an unknown signal. Based on the continuous signal model, the method can effectively locate the wideband or narrowband signal target. In [26], the coherent and incoherent direct localization methods are studied for wideband signals. By using the two preprocessing techniques, broadband processing gain can be improved.In the positioning scene of distributed multiantenna system, a direct positioning method based on the improved MUSIC algorithm is proposed in [27] to solve the joint detection and positioning problem of main transmitters in a cognitive radio network. In [28], based on simulations by applying a distributed antenna system for localization purposes in indoor scenarios, an extensive study was presented. According to [29], based on the perspective of information theory, in the absence of GPS, wireless local area network (WLAN) positioning technology is recognized as one of the preferred positioning technologies. In [30], a novel system architecture was constructed, which is consisting of multiple noncooperative unmanned aerial vehicles (UAVs) and the software-defined Internet of vehicles (SDN-IoV). And two source enumeration methods are proposed in a complex SDN-IoV environment with color noise to locate the positions of vehicles and pedestrians.In this paper, we propose a frequency domain direct position determination method to improve the location accuracy of emitters in distributed multiantenna scenarios. The data receiving model under distributed nodes is established, and the data of each node is fused. The data model after fusion is obtained by accumulating frequency points. Based on the phase information, the cost function is constructed, and the location of the emitter is determined by grid searching in the monitored area. Finally, we examine the performance of the proposed algorithm from two aspects. Through simulations, the algorithm is compared with Least Squares DPD algorithm in [10], DPD EIGEN algorithm in [11], and TDOA improved algorithm in [4]. Then, the performance of the proposed algorithm is further verified by processing the real measured data.The contributions of this paper are summarized as follow:(1)
In this paper, a distributed multiantenna direct location method is proposed. At present, most direct localization methods are mainly aimed at narrow-band signals. The method proposed in this paper can process both narrowband and wideband signals utilizing multifrequency points accumulation(2)
The proposed algorithm was compared with the existing algorithms by simulation, including the TDOA improved algorithm in [4], the LS DPD algorithm in [10], and the DPD EIGEN algorithm in [11]. The results show that the performance of the proposed algorithm has been improved(3)
The proposed algorithm is used to process the measured data, and the result of the target location is obviously better than that of the TDOA improved algorithm


## 2. Signal Model

The system model is shown in Figure1, where an unknown signal source exists in position px,y. There are LL≥4 monitoring stations in the spatial domain that can receive signals, and the positions of each base station are denoted as B1x1,y1,⋯,BLxL,yL. The signal observed by the l‐th(1≤l≤L) base station antenna is given by
(1)ylt=αlst−τl−t0+nlt,1≤l≤L,Figure 1
Multiantenna positioning scene diagram.whereαl is an unknown complex scalar representing channel attenuation.st−τl−t0 is the signal waveform, transmitted at a time t0 and delayed by τl. nlt represents noise. The sampled version of the signal in (1) is given by
(2)ylk=αlsk+nlk,0≤k≤K−1,slk≜st−τl−t0t=kT,ylk≜yltt=kT,nlk≜nltt=kT,where the sampling interval isT and the discrete expressions of signals received by each base station are
(3)y1k=α1s1k+n1k,0≤k≤K−1,⋮yLk=αLsLk+nLk,0≤k≤K−1.


## 3. Improved TDOA Positioning Method

According to the received signals of each antenna in (1), the traditional TDOA method is used to locate the emitter. Taking the signal received by the first base station as the reference signal, the generalized cross-correlation (GCC) algorithm is used to obtain the delay difference τi1,i=2,⋯,L of the received signals between other base stations and the reference base station.However, in engineering,τi1,i=2,⋯,L is usually not an integral multiple of the sampling interval. Due to the limitation of the sampling frequency, there is always a noninteger delay between the most accurate delay difference that can be distinguished by digital sampling and the true time delay difference.To solve this problem, a time delay estimation method based on time delay compensation is proposed in [4]. The main steps of this algorithm are as follows: firstly, a reference signal is selected, and a small delay unit is defined to compensate for the delay of other signals. Then, the delay compensated signal is cross-correlated with the reference signal. Finally, a high precision delay estimation is obtained based on the optimal cross-correlation results.After obtaining the delay difference of each base station relative to the reference base station, the target position can be determined by solving the Chan function. The distance between the base station and the signal source is as follows:(4)Ri=xi−x2+yi−y2,i=1,⋯,L.WhenL=3, there are three base stations participating in positioning, and the position of the radiation source can be obtained according to the Chan algorithm:
(5)xy=x2,1y2,1x3,1y3,1−1×R2,1R3,1∗R1+12R2,12−K2+K1R3,12−K3+K1,where Ki=xi2+yi2,i=1,2,3, xμ,1, and yμ,1 represent the difference between the coordinates of the base station,
(6)xμ,1=xμ−x1,yμ,1=yμ−y1,(7)Rμ,1=Rμ−R1,μ=2,⋯,L,where Rμ,1=xμ−x2+yμ−y2−x1−x2+y1−y2.


## 4. DPD Algorithm

By performing DFT on (2), we can get
(8)Y1wk=α1Swke−jwkτ1+N1wk,⋮YLwk=αLSwke−jwkτL+NLwk,0≤k≤K−1;wk≜2πkKT,where Ylwk is the frequency domain form of the signal received by the l‐th base station, Swk represents the discrete Fourier transform of the signal sk, and N1wk represents the Fourier transform of the noise corresponding to the l‐th base station.


### 4.1. Traditional DPD Algorithm

According to the frequency domain signal expression of Equation (8), the cost function related to the location of the source is established. By minimizing the cost function related to the location of the source, the least square estimation result of the location of the emitter can be obtained
(9)Qp=∑l=1L∑k=0K−1Ylwk−αlSwke−jwkτl2,where · represents norm operation and the cost function is expressed as the sum of the following items:
(10)Qp=∑l=1LQlp,Qlp≜∑k=1KYlwk−αlSwke−jwkτl2≜∑k=1KYlwk−αlblp2,where blp=Swke−jwkτl, in order to minimize the cost function, the attenuation coefficient αl,m in (10) is estimated and the result is shown in (11).
(11)α^l=blpHblp−1blpHYlwk.For the sake of generality, assume the following(12)blp2=1∀l.Finally, the emitter location is determined by solving the matrix eigenvalue containing the emitter location information.


### 4.2. The Proposed DPD Algorithm

The delay is related to the signal positionpx,y. Suppose the propagation velocity of the electromagnetic wave is c, the expression of τlp is (13), which is related to px,y.
(13)τl=x−xl2+y−yl2cτlp≜τl.According to the frequency domain signal expression obtained in (8), all the monitoring data are synthesized
(14)Ywk=Y1wkY2wk⋮YLwk=e−jwkτ1pα1e−jwkτ2pα2⋮e−jwkτLpαLSwk+N1wkN2wk⋮NLwk=Φαawk,pSwk+Nwk,where Φα=diagα1,⋯,αL∈ℂL×L is a diagonal matrix containing all attenuation coefficients. awk,p∈ℂL×1 is the delay factor vector corresponding to different monitoring positions, and its expression is shown in
(15)awk,p=e−jwkτ1pe−jwkτ2p⋮e−jwkτLp.Then, the cost function directly related to the positionpx,y is established as
(16)maxp∑k=1KYHwkΦαawk,p.The correlation lies in the phase compensation;Φαis a real number and independent of the frequency point. So the cost function can be modified as follows:
(17)maxp∑k=1KYHwkawk,p.Then, a series of spatial grid points are obtained by grid division of the monitoring area. Based on the correlation DPD method, the cost function after signal synthesis can be solved. According to (17), the grid point that meets the requirements can be obtained, which is the location of the target interference source.The main steps of the algorithm are as follows:Step 1.
Signal input: the signal received by each node is transformed by DFT, and the frequency domain data of each node is fused to form a signal matrixYwk∈ℂL×1 as the input of the algorithm.Step 2.
Simplified signal matrix: considering that the algorithm is only related to the phase information of the signal, the attenuation coefficient matrix in the signal matrix can be removed, and the signal matrix related to phase can be obtained by simplification.Step 3.
The phase information is used to estimate the source position: the area to be monitored is gridded. According to the cost function of (17), the most relevant grid point that is corresponding to the estimated source location can be found.


### 4.3. Algorithm Analysis

In this paper, the direct source location algorithm belongs to the correlation algorithm, which mainly uses the phase information in the signal. When the monitoring area is large and there are many grid areas, the delay factor vectorsawk,p in (17) will generate phase ambiguity. It is assumed that there are M grid points in the monitoring area, and the phases formed by two grid points m1 and m2 at the l‐th base station are as follows: φl,m1=wk⋅τlpm1 andφl,m2=wk⋅τlpm2. When φl,m2=φl,m1+r⋅2π,r≠0,r∈Ζ, we can obtain
(18)ejφl,m2=ejφl,m1+r⋅2π=ejφl,m1⋅ejr⋅2π=ejφl,m1⋅cosr⋅2π+jsinr⋅2π=ejφl,m1.It can be seen from (18) that different grid points in the monitoring area may have the same delay factor for the same monitoring measurement, which will affect the positioning accuracy of relevant algorithms. The fuzzy positioning diagram is shown in Figure 2.Figure 2
Fuzzy location diagram for one node.As can be seen from Figure2, for a base station, the same delay factor may correspond to multiple different locations.As shown in Figure3, for multiple base stations, the possible fuzzy location points of each base station are different, but the real source points are the same. At the same time, the false position points of different frequency points are also different, so combining the data of multiple base stations can reduce the influence of some phase ambiguity on positioning and improve the accuracy of positioning.Figure 3
Schematic diagram of the reduced monitoring area.


### 4.4. Cramer-Rao Bound

The positioning performance of the algorithm will be compared with that of the CRB for the model (Equation (14)), which are comprised in the parameter vector ρ∈ℂ2K+1×1(19)ρ=s1rT,s1cT,⋯,sKrT,sKcT,pT,where skrT and skcT are the real and imaginary part of the source signals and pT=x;y is the source position to be estimated. The CRB is given by the inverse Fisher Information Matrix (FIM), i.e.,
(20)Eρ‐ρ^ρ‐ρ∧T≥J−1ρ.With(21)Jρ=E∂LY;ρ∂ρ∂LY;ρ∂ρT,where L is the log-likelihood function as a function of the collection of all data Y=Y1,⋯,YK∈ℂL×K:
(22)LY;ρ=−KLlnπσn2−1σn2∑k=1KYk−Ask2.In this log-likelihood function,A=awk,p∈ℂL×1. According to [31], the CRB is as follows:
(23)CRBp=σn22∑k=1KReSkHDHPA⊥DSk−1,with PA⊥=IL−AAHA−1AH∈ℂL×L, D=∂A/∂x,∂A/∂y∈ℂL×2L, and Sk=I2⊗s∈kℂ2L×2.


### 4.5. Complexity Analysis

For the proposed method, its computational complexity isOL2T2+LK, and T is the number of grids searched on coordinates x and y. The complexity of the improved TDOA positioning method is OL2J+K+3L−1Klog2K+L−1K2+7L−12, where J is the number of cross-correlation. The complexity of LS_DPD algorithm and DPD_EIGEN algorithm is OKT2+T4 and OKT2+6KL2+LT2+KL, respectively.


## 4.1. Traditional DPD Algorithm

According to the frequency domain signal expression of Equation (8), the cost function related to the location of the source is established. By minimizing the cost function related to the location of the source, the least square estimation result of the location of the emitter can be obtained
(9)Qp=∑l=1L∑k=0K−1Ylwk−αlSwke−jwkτl2,where · represents norm operation and the cost function is expressed as the sum of the following items:
(10)Qp=∑l=1LQlp,Qlp≜∑k=1KYlwk−αlSwke−jwkτl2≜∑k=1KYlwk−αlblp2,where blp=Swke−jwkτl, in order to minimize the cost function, the attenuation coefficient αl,m in (10) is estimated and the result is shown in (11).
(11)α^l=blpHblp−1blpHYlwk.For the sake of generality, assume the following(12)blp2=1∀l.Finally, the emitter location is determined by solving the matrix eigenvalue containing the emitter location information.


## 4.2. The Proposed DPD Algorithm

The delay is related to the signal positionpx,y. Suppose the propagation velocity of the electromagnetic wave is c, the expression of τlp is (13), which is related to px,y.
(13)τl=x−xl2+y−yl2cτlp≜τl.According to the frequency domain signal expression obtained in (8), all the monitoring data are synthesized
(14)Ywk=Y1wkY2wk⋮YLwk=e−jwkτ1pα1e−jwkτ2pα2⋮e−jwkτLpαLSwk+N1wkN2wk⋮NLwk=Φαawk,pSwk+Nwk,where Φα=diagα1,⋯,αL∈ℂL×L is a diagonal matrix containing all attenuation coefficients. awk,p∈ℂL×1 is the delay factor vector corresponding to different monitoring positions, and its expression is shown in
(15)awk,p=e−jwkτ1pe−jwkτ2p⋮e−jwkτLp.Then, the cost function directly related to the positionpx,y is established as
(16)maxp∑k=1KYHwkΦαawk,p.The correlation lies in the phase compensation;Φαis a real number and independent of the frequency point. So the cost function can be modified as follows:
(17)maxp∑k=1KYHwkawk,p.Then, a series of spatial grid points are obtained by grid division of the monitoring area. Based on the correlation DPD method, the cost function after signal synthesis can be solved. According to (17), the grid point that meets the requirements can be obtained, which is the location of the target interference source.The main steps of the algorithm are as follows:Step 1.
Signal input: the signal received by each node is transformed by DFT, and the frequency domain data of each node is fused to form a signal matrixYwk∈ℂL×1 as the input of the algorithm.Step 2.
Simplified signal matrix: considering that the algorithm is only related to the phase information of the signal, the attenuation coefficient matrix in the signal matrix can be removed, and the signal matrix related to phase can be obtained by simplification.Step 3.
The phase information is used to estimate the source position: the area to be monitored is gridded. According to the cost function of (17), the most relevant grid point that is corresponding to the estimated source location can be found.


## 4.3. Algorithm Analysis

In this paper, the direct source location algorithm belongs to the correlation algorithm, which mainly uses the phase information in the signal. When the monitoring area is large and there are many grid areas, the delay factor vectorsawk,p in (17) will generate phase ambiguity. It is assumed that there are M grid points in the monitoring area, and the phases formed by two grid points m1 and m2 at the l‐th base station are as follows: φl,m1=wk⋅τlpm1 andφl,m2=wk⋅τlpm2. When φl,m2=φl,m1+r⋅2π,r≠0,r∈Ζ, we can obtain
(18)ejφl,m2=ejφl,m1+r⋅2π=ejφl,m1⋅ejr⋅2π=ejφl,m1⋅cosr⋅2π+jsinr⋅2π=ejφl,m1.It can be seen from (18) that different grid points in the monitoring area may have the same delay factor for the same monitoring measurement, which will affect the positioning accuracy of relevant algorithms. The fuzzy positioning diagram is shown in Figure 2.Figure 2
Fuzzy location diagram for one node.As can be seen from Figure2, for a base station, the same delay factor may correspond to multiple different locations.As shown in Figure3, for multiple base stations, the possible fuzzy location points of each base station are different, but the real source points are the same. At the same time, the false position points of different frequency points are also different, so combining the data of multiple base stations can reduce the influence of some phase ambiguity on positioning and improve the accuracy of positioning.Figure 3
Schematic diagram of the reduced monitoring area.


## 4.4. Cramer-Rao Bound

The positioning performance of the algorithm will be compared with that of the CRB for the model (Equation (14)), which are comprised in the parameter vector ρ∈ℂ2K+1×1(19)ρ=s1rT,s1cT,⋯,sKrT,sKcT,pT,where skrT and skcT are the real and imaginary part of the source signals and pT=x;y is the source position to be estimated. The CRB is given by the inverse Fisher Information Matrix (FIM), i.e.,
(20)Eρ‐ρ^ρ‐ρ∧T≥J−1ρ.With(21)Jρ=E∂LY;ρ∂ρ∂LY;ρ∂ρT,where L is the log-likelihood function as a function of the collection of all data Y=Y1,⋯,YK∈ℂL×K:
(22)LY;ρ=−KLlnπσn2−1σn2∑k=1KYk−Ask2.In this log-likelihood function,A=awk,p∈ℂL×1. According to [31], the CRB is as follows:
(23)CRBp=σn22∑k=1KReSkHDHPA⊥DSk−1,with PA⊥=IL−AAHA−1AH∈ℂL×L, D=∂A/∂x,∂A/∂y∈ℂL×2L, and Sk=I2⊗s∈kℂ2L×2.


## 4.5. Complexity Analysis

For the proposed method, its computational complexity isOL2T2+LK, and T is the number of grids searched on coordinates x and y. The complexity of the improved TDOA positioning method is OL2J+K+3L−1Klog2K+L−1K2+7L−12, where J is the number of cross-correlation. The complexity of LS_DPD algorithm and DPD_EIGEN algorithm is OKT2+T4 and OKT2+6KL2+LT2+KL, respectively.


## 5. Algorithm Verification

### 5.1. Simulation Results

In this part, root mean square error (RMSE) is employed to verify the performance of the algorithm; the expression of it is(24)RMSE=1M∑m=1Mp∧m−p2,where M is the number of Monte Carlo experiments, p is the true location of the unknown source, and p^m is the estimation result of the source location of the m‐th Monte Carlo experiment.Figure4 shows the localization performance of the algorithm without considering the multipath signal, and the SNR is set to -5 dB. There are four receiving base stations with coordinates of 303,1273.5, 752.5,1101, 681,752.5, and782,468. And the coordinate of the unknown source is 50,85. The simulation results show that the algorithm can effectively estimate the source location with low SNR, and the estimated source location is 40,70. When considering the influence of the multipath effect, the estimated result of the source is 88,78 in Figure 5.Figure 4
Locating result withSNR=−5 dB.Figure 5
Locating result withSNR=−5 dB (under the multipath effect).In order to further verify the performance of the proposed algorithm, we compare the proposed algorithm with the improved TDOA algorithm, Least Squares DPD algorithm, and DPD EIGEN algorithm. After 100 Monte Carlo simulation experiments, the performance comparison results are shown in Figure6. The SNR varies from -10 dB to 15 dB, the signal bandwidth is Bsignal=3×105 Hz, and the signal sampling frequency is 6×107 Hz. There are three receiving base stations with coordinates of 1000,2000, 5000,1000, and 10000,0, and the coordinate of the source is 135,175. It is clear that with the improvement of SNR, the performance of these localization algorithms is getting better. In addition, the performance of the two direct location algorithms is obviously better than that of the improved TDOA algorithm, and the positioning performance of the proposed algorithm is slightly better than that of the traditional direct location algorithm (Least Squares DPD) and DPD EIGEN algorithm.Figure 6
Performance comparison versus SNR of the narrowband signal.All else being equal, the signal bandwidth goes from3×105 Hz to 3×106 Hz. Then, the algorithm is compared with the improved TDOA algorithm, Least Squares DPD algorithm, and DPD EIGEN algorithm. After 100 Monte Carlo simulation experiments, the RMSE results are shown in Figure 7. It can be seen that the performance of the proposed algorithm is better than that of the improved TDOA algorithm, Least Squares DPD algorithm, and DPD EIGEN algorithm.Figure 7
Performance comparison versus SNR of the wideband signal.The signal model in this paper is based on the synchronization of all received signals, and the location information of each node is accurate. However, in practice, due to various factors, the received signals are not always synchronized, and the position measurement information of each node may also have errors [32, 33]. In order to further analyze the performance of the algorithm, simulation experiments are carried out by considering the position error of the node and the synchronization error of the signal. The experimental results are shown in Figures 8 and 9, respectively.Figure 8
Performance comparison when considering node position error.Figure 9
Performance comparison when considering synchronization error.After 100 Monte Carlo tests, the results show that the existence of errors has a certain impact on the performance of the algorithm.


### 5.2. Real Measured Data Processing Results

In order to further verify the effectiveness of the algorithm, the actual measurement data collected in the experiment are processed. As shown in Figure10, the four nodes in the campus are node 1, node 2, node 3, and node 4, and the signals are located in the playground area.Figure 10
Schematic of a distributed positioning system.In the experiment, the signal source transmits a variety of modulation signals with the power of 5 dBm, 10 dBm, and 15 dBm, respectively.Before processing the data, it is necessary to establish a three-dimensional coordinate space corresponding to the longitude, latitude, and height. In this paper, node 1 in Figure11 is used as the reference node to establish a three-dimensional coordinate system. Then, the signal with a power of 15 dBm is processed to determine the position of the signal source. The results are shown in Figure 12, from which we can see the relative coordinates of each node, the real location of the source, and the estimated position.Figure 11
Coordinate chart of the positioning result.Figure 12
Map of positioning results.The measured data are processed by the proposed algorithm and the traditional TDOA algorithm, and the positioning results are compared. The data center frequency is 700 MHz, and the symbol rate is 40 bit/s. The real coordinates of the source are117.6603,49.0477,5. The results of the two algorithms are shown in Table 1. It can be seen that the positioning performance of the algorithm proposed in this paper is closer to the actual coordinates compared with the TDOA improved method.Table 1
Positioning results of algorithm (unit : m).
Signal power5 dBm10 dBm15 dBmTDOA105.2617,80.6879,−81.2269108.4732,77.3191,−54.014496.6336,56.252,−52.1839Proposed DPD131,55,4133,41,6127,49,6Table2 shows the positioning errors of the two algorithms after processing the three different transmitted power signals. It is clear that the proposed DPD method can achieve more accurate positioning results than the TDOA method.Table 2
Positioning error (unit : m).
Signal power5 dBm10 dBm15 dBmTDOA92.766.0163.01Proposed DPD14.617.49.4


## 5.1. Simulation Results

In this part, root mean square error (RMSE) is employed to verify the performance of the algorithm; the expression of it is(24)RMSE=1M∑m=1Mp∧m−p2,where M is the number of Monte Carlo experiments, p is the true location of the unknown source, and p^m is the estimation result of the source location of the m‐th Monte Carlo experiment.Figure4 shows the localization performance of the algorithm without considering the multipath signal, and the SNR is set to -5 dB. There are four receiving base stations with coordinates of 303,1273.5, 752.5,1101, 681,752.5, and782,468. And the coordinate of the unknown source is 50,85. The simulation results show that the algorithm can effectively estimate the source location with low SNR, and the estimated source location is 40,70. When considering the influence of the multipath effect, the estimated result of the source is 88,78 in Figure 5.Figure 4
Locating result withSNR=−5 dB.Figure 5
Locating result withSNR=−5 dB (under the multipath effect).In order to further verify the performance of the proposed algorithm, we compare the proposed algorithm with the improved TDOA algorithm, Least Squares DPD algorithm, and DPD EIGEN algorithm. After 100 Monte Carlo simulation experiments, the performance comparison results are shown in Figure6. The SNR varies from -10 dB to 15 dB, the signal bandwidth is Bsignal=3×105 Hz, and the signal sampling frequency is 6×107 Hz. There are three receiving base stations with coordinates of 1000,2000, 5000,1000, and 10000,0, and the coordinate of the source is 135,175. It is clear that with the improvement of SNR, the performance of these localization algorithms is getting better. In addition, the performance of the two direct location algorithms is obviously better than that of the improved TDOA algorithm, and the positioning performance of the proposed algorithm is slightly better than that of the traditional direct location algorithm (Least Squares DPD) and DPD EIGEN algorithm.Figure 6
Performance comparison versus SNR of the narrowband signal.All else being equal, the signal bandwidth goes from3×105 Hz to 3×106 Hz. Then, the algorithm is compared with the improved TDOA algorithm, Least Squares DPD algorithm, and DPD EIGEN algorithm. After 100 Monte Carlo simulation experiments, the RMSE results are shown in Figure 7. It can be seen that the performance of the proposed algorithm is better than that of the improved TDOA algorithm, Least Squares DPD algorithm, and DPD EIGEN algorithm.Figure 7
Performance comparison versus SNR of the wideband signal.The signal model in this paper is based on the synchronization of all received signals, and the location information of each node is accurate. However, in practice, due to various factors, the received signals are not always synchronized, and the position measurement information of each node may also have errors [32, 33]. In order to further analyze the performance of the algorithm, simulation experiments are carried out by considering the position error of the node and the synchronization error of the signal. The experimental results are shown in Figures 8 and 9, respectively.Figure 8
Performance comparison when considering node position error.Figure 9
Performance comparison when considering synchronization error.After 100 Monte Carlo tests, the results show that the existence of errors has a certain impact on the performance of the algorithm.


## 5.2. Real Measured Data Processing Results

In order to further verify the effectiveness of the algorithm, the actual measurement data collected in the experiment are processed. As shown in Figure10, the four nodes in the campus are node 1, node 2, node 3, and node 4, and the signals are located in the playground area.Figure 10
Schematic of a distributed positioning system.In the experiment, the signal source transmits a variety of modulation signals with the power of 5 dBm, 10 dBm, and 15 dBm, respectively.Before processing the data, it is necessary to establish a three-dimensional coordinate space corresponding to the longitude, latitude, and height. In this paper, node 1 in Figure11 is used as the reference node to establish a three-dimensional coordinate system. Then, the signal with a power of 15 dBm is processed to determine the position of the signal source. The results are shown in Figure 12, from which we can see the relative coordinates of each node, the real location of the source, and the estimated position.Figure 11
Coordinate chart of the positioning result.Figure 12
Map of positioning results.The measured data are processed by the proposed algorithm and the traditional TDOA algorithm, and the positioning results are compared. The data center frequency is 700 MHz, and the symbol rate is 40 bit/s. The real coordinates of the source are117.6603,49.0477,5. The results of the two algorithms are shown in Table 1. It can be seen that the positioning performance of the algorithm proposed in this paper is closer to the actual coordinates compared with the TDOA improved method.Table 1
Positioning results of algorithm (unit : m).
Signal power5 dBm10 dBm15 dBmTDOA105.2617,80.6879,−81.2269108.4732,77.3191,−54.014496.6336,56.252,−52.1839Proposed DPD131,55,4133,41,6127,49,6Table2 shows the positioning errors of the two algorithms after processing the three different transmitted power signals. It is clear that the proposed DPD method can achieve more accurate positioning results than the TDOA method.Table 2
Positioning error (unit : m).
Signal power5 dBm10 dBm15 dBmTDOA92.766.0163.01Proposed DPD14.617.49.4


## 6. Conclusion

DPD algorithm has higher positioning accuracy than the traditional two-step positioning method, but most of the existing direct positioning technologies are aimed at narrow-band signals. Based on the phase information of the signal, a correlation direct location algorithm is proposed for both narrowband and wideband signals. The data fusion model of multimonitoring nodes is established, and the simulation of the algorithm is deployed. Simulation results show that the proposed algorithm has higher positioning accuracy and better performance than the traditional TDOA two-step positioning algorithm, LS DPD algorithm, and DPD EIGEN algorithm. In order to further verify the performance of the algorithm, the signal source is used to simulate the interference signal and transmit the signal in the school playground. After collecting data from four nodes, the algorithm proposed in this paper and the improved TDOA algorithm process the measured data. It can be seen that the proposed algorithm has higher positioning accuracy than the TDOA two-step localization algorithm.



---

*Source: 6616729-2021-06-02.xml*