- Research
- Open Access
- Published:

# Performance limit of AOA-based localization using MIMO-OFDM channel state information

*EURASIP Journal on Wireless Communications and Networking*
**volume 2017**, Article number: 141 (2017)

## Abstract

Wireless communication networks are increasingly based on the ubiquitous multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) modulation scheme. Their channel state information is generally obtained each time by a base station receiver as soon as a data packet is successfully received from a mobile device. As it has been shown recently that the MIMO-OFDM channel state information can be used for angle of arrival-based localization, this paper presents a theoretical investigation of the localization performance. The method of computing the Cramer-Rao lower bound, which represents the performance of a minimum variance unbiased estimator, is presented and then used for insightful investigation purposes by means of inspecting the viability of the system requirements and the design properties.

## Introduction

Wireless localization is currently a research topic of primary interest in the field of wireless communications due to providing a large variety of location-based services for increasingly ubiquitous smart mobile devices. For wireless localization, a method requiring hardware of just an existing wireless network is of particular interest, because no extra hardware is required for both the infrastructure and the mobile devices (MDs). Unfortunately, although many studies have investigated wireless localization [1–5], it is not straightforward to apply their results without requiring dedicated hardware or affecting the network protocol structure.

A few localization methods requiring hardware of just an existing wireless network have been proposed in the literature [6–9] and implemented commercially. Most of them [6–8] adopt fingerprint matching as the basic scheme of location determination. In this scheme, prior to the localization operation, algorithm parameters are determined by a training process. The parameters are determined in principle as a representation of the characteristics of the observation data associated with a number of MD reference locations. In the localization operation, the location is determined as a linear combination of the reference locations, based on the observation data and the trained parameters. One major drawback of this scheme is that the training process is usually a costly measurement process. In addition, because the radio wave propagation characteristics that characterize the observation data are sensitive to the environment, the training process will be required every time the environment of the localization region has changed.

We realize that the angle of arrival (AOA) estimation [10, 11] is an interesting study that can be applied for localization. Recently, it has been shown that multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) channel state information (CSI) may be used as the observation data for localization based on AOA [9]. For localization based on AOA, it generally requires that direct radio paths between the MD and the base stations (BSs) are available sufficiently for triangulation. However, using MIMO-OFDM CSI as the observation data for localization based on AOA is of particular interest here, due to the following reasons. AOA-based localization does not require a costly training process. In addition, the MIMO-OFDM technique is currently the top air interface technology prevalently employed for very high-speed wireless networks.

The purpose of this paper is to investigate the performance characteristics of AOA-based localization methods that employ the MIMO-OFDM CSI as the observation data. This may be done by using the Cramer-Rao lower bound (CRLB), which is the variance of the estimation error of a minimum variance unbiased estimator (MVUE), as it has been successfully used to investigate theoretical performance characteristics for a number of related estimation problems [12–14]. In this paper, a method of computing the CRLB in general for the AOA-based localization that uses MIMO-OFDM CSI as the observation data is presented. Numerical results are then obtained for a specific case detailing about the geometry and placement of the BS antenna arrays and the localization region. The results are discussed, respecting the impact of radio propagation characteristics and system infrastructures on the average system performance and providing fundamental insights on the system requirements and design principles.

## System and observation models

Channel frequency response (CFR) for a used OFDM subcarrier is a necessary information for demodulation of data carried by that subcarrier. Conventionally, the transmitter needs to facilitate CFR estimation at the receiver by provision of pilot bits [15]. It is then reasonable to assume that once a receiver can successfully detect the data carried by the used OFDM subcarriers, it can also provide the CFR for the set of used OFDM subcarriers, i.e., the CSI, at no overhead. For localization, the CSI may be obtained, based on either uplink or downlink transmission, for sending to a localization processor. In this paper, we are only interested in localization with processor residing in the network infrastructure to avoid burdening the generally resource-limited MDs. In this case, uplink CSI estimated by a BS receiver may be sent to the processor at low cost via an existing non-radio connection. On the other hand, sending the downlink CSI estimated by a MD receiver to the processor inevitably requires some radio resource that can be costly. Reducing the cost of sending the downlink CSI to the processor may be done with a chunk-based scheme [16–18], where an average magnitude of CFR for a block of contiguous subcarriers is sent instead of the complex values of the CFR of all subcarriers within the block. However, AOA-based localization requires the CFR in complex form [9]. Therefore, strictly following [16–18] may not be appropriate for our problem. In this regard, we consider that a similar chunk-based scheme that sends an average complex CFR for the block instead of the average magnitude may be adopted for AOA-based localization. This is because the average CFR obtained by this scheme is essentially same as that obtained by a conventional subcarrier-based scheme with the same total bandwidth but larger subcarrier spacing. However, this scheme therefore provides CFR with less details along the frequency axis. Accordingly, the processor will perform worse on separating the direct path from reflection paths, leading eventually to lower performance.

As using the uplink CSI for the localization processor residing in the infrastructure is less cumbersome compared with using the downlink CSI, we assume that the location of a MD is determined by processing the CSI obtained by the MIMO-OFDM receivers of all BSs upon successful reception of a data packet from that MD. Assume that each BS employs an array of antennas, with the spacing between them on the order of half wavelength. Then, the CFR for the *q*-th BS respecting the *k*-th subcarrier and *m*-th antenna can be expressed by [9]

where *N*
_{P} is the number of paths in the radio wave propagation model, *Δ* is the OFDM subcarrier spacing, *g*
_{
q,n
} is the complex gain with magnitude representing the strength of the *n*-th path for the *q*-th BS, *t*
_{
q,n
} is the propagation delay associated with the *n*-th path between the MD antenna and the center of the antenna array of the *q*-th BS and subtracted by a constant delay specific to the *q*-th BS, *ϕ*
_{
q,n,m
}, ∀*m* are the phase terms obeying \(\sum _{\forall m}{\phi _{q,n,m}}~=~0\) and sharing a relationship that depends on the *q*-th BS antenna array geometry and the AOA to the array from the *n*-th path, and *w*
_{
q,k,m
} is the estimation error that is assumed to behave as additive white Gaussian noise (AWGN). Assume that the terms in (1) have been sorted in ascending order of *t*
_{
q,n
}, i.e., \(t_{q,n_{1}}~\leq ~t_{q,n_{2}}\) if *n*
_{1} ≤ *n*
_{2}. In addition, it is required that direct path from the MD antenna to the BS antenna array exists as the shortest path. Thus, it is the relationship between *ϕ*
_{
q,0,m
}, ∀*m* that contains the AOA-based location information of the MD.

We have also assumed that the OFDM time synchronizer and provision of the guard interval that houses the cyclic prefix of the OFDM symbol are perfect on their roles. Hence, the following can be deduced in subsequent. First, by perfect provision of the guard interval, the maximum delay spread is not greater than the guard interval length, i.e., \(t_{q,N_{\mathrm {P}}~-~1}~-~t_{q,0}~\leq ~t_{\mathrm {g}}\), where *t*
_{g} is the guard interval length. As a result, letting the *l*-th OFDM symbol excluding cyclic prefix begin arriving at the receiver at time instant *t*
_{d}, we can say that the contribution of the (*l* − 1)-th OFDM symbol arriving at the receiver ends accordingly at time instant *t*
_{d} − *t*
_{m}, where *t*
_{m}≥0 and \(\phantom {\dot {i}\!}t_{\mathrm {m}}~=~t_{\mathrm {g}}~-~(t_{q,N_{\mathrm {P}}~-~1}~-~t_{q,0})\). Then, by perfect time synchronization, the receiver should be able to avoid inter-symbol interference (ISI) by beginning the demodulation of the *l*-th OFDM symbol at *t*
_{0} with *t*
_{d} − *t*
_{m} ≤ *t*
_{0} ≤ *t*
_{d}. Then, by virtue of the cyclic prefix, the orthogonality between the subcarriers is still preserved, and the direct path manifests itself to the synchronized demodulator as having delay of *t*
_{
q,0} = *t*
_{d} − *t*
_{0}. Note that a good practice of OFDM time synchronization is to have *t*
_{0} close to *t*
_{d}. Accordingly, *t*
_{
q,0} is usually a small non-negative number compared with the guard interval length.

## CRLB computation

The computation of CRLB can be based on the following theoretical assumptions. The number of antennas which are included in the array corresponds to *M*
_{
q
} for the *q*-th BS. Then, the observation data from the *q*-th BS may be expressed in a matrix form as

where \(\mathbf {W}_{q,k}= \left [\begin {array}{llll} w_{q,k,1} & w_{q,k,2} & \cdots & w_{q,k,M_{q}} \end {array}\right ]^{\mathrm {T}}\), with (·)^{T} denoting the matrix transpose, \(\mathbf {S}_{q,k}=\mathbf {A}_{q}\mathbf {G}_{q,0}\mathbf {R}_{q,0}^{k}\), and we have used the following notations.

where

Note that **a**
_{
q
}(·) is a vector-valued function that depends on the *q*-th BS antenna array geometry, and *θ*
_{
q,n
} denotes the AOA to the array from the *n*-th radio path. In addition, we have assumed that an AOA can be represented by a single number, and hence, two-dimensional localization is implied.

where *ω*
_{
q,n
} = 2*π*
*t*
_{
q,n
}
*Δ*. Denote the number of involved BSs as *Q*. Then, since *θ*
_{
q,0}, 1 ≤ *q* ≤ *Q* are uniquely determined by the MD location given the geometry and placement of all the BS antenna arrays, we may define the row vector of independent parameters for the observation data as

where *x*
_{0} and *y*
_{0} represent the MD location in a Cartesian coordinate system, and

with \(\Omega _{q}=\left [\omega _{q,\,0} \, \omega _{q,1} \cdots \omega _{q,\,N_{\mathrm {P}}-1}\right ]\), **g**
_{
q
}=[*g*
_{
q, 0}
*g*
_{
q, 1}⋯ \(\left. g_{q,N_{\mathrm {P}}-1}\right ]\), and \(\Theta _{q}=\left [\theta _{q,1} \theta _{q,2} \cdots \theta _{q,N_{\mathrm {P}}-1}\right ]\). For the CRLB computation, we necessarily evaluate the derivative of **S**
_{
q,k
} with respect to each parameter, and we then obtain the following results.

and

Let **S**
_{
k
} denote the column vector of complete observation data for the *k*-th subcarrier:

Also, let \(\mathbf {D}_{q,k}^{(*)}=\left [\begin {array}{lll}\mathbf {D}_{q,k}^{(\Omega)} & \mathbf {D}_{q,k}^{(\mathbf {g})} & \mathbf {D}_{q,k}^{(\Theta)}\end {array}\right ]\), and **E**
_{
k
}=*∂*
**S**
_{
k
}/*∂*
**u**. Thus,

Then, based on [19], the Fisher information matrix for the parameter vector **u** can be computed by

where (·)^{H} denotes the matrix conjugate and transpose, and *σ*
^{2} is the variance of *w*
_{
q,k,m
}. Then, the CRLB for the location error can be computed by

where [**K**]_{
i,j
} denotes the (*i,j*) element of matrix **K**.

## Numerical results

### Assumptions

To gain fundamental insights on the system requirements and design principles, we obtain numerical results specific to the following assumptions.

#### Signal model

The following are assumed for the signal model. An antenna gain of 0 dB is assumed for the MD antenna as well as for each array element of a BS. The variance of *w*
_{
q,k,m
} depends only on the system noise, i.e., *E*[|*H*
_{
q,k,m
} − *w*
_{
q,k,m
}|^{2}]/*E*[|*w*
_{
q,k,m
}|^{2}] equals the average signal-to-noise ratio per OFDM subcarrier. The noise figure of the OFDM receiver is 4 dB. The number of antennas in an antenna array is a constant, i.e., *M*
_{
q
} = *M*,∀*q*. For the OFDM signal, the center frequency is 5.25 GHz, the subcarrier spacing *Δ* follows that employed in [20], i.e., *Δ* = 312.5 kHz, and the set of used subcarrier indexes is {*k*| − *K* ≤ *k* ≤ *K*}, where *K* is an integer controlling the bandwidth. We consider the bandwidth without accounting a guard band, i.e., *B* = (2*K* + 1)*Δ* = (0.625*K* + 0.3125) MHz.

It should be noted that the total bandwidth *B*
_{T} practically allocated for the OFDM system is bigger than *B*. This is because guard bands are necessarily allocated to avoid interference from system of nearby spectrum. The guard bands may be implemented by having blocks of subcarriers with zero amplitudes at both ends of the active spectrum. Hence, *B*
_{T} = (*N*
_{u} + *N*
_{z})*Δ*, where *N*
_{u} is the number of used subcarriers 2*K* + 1, and *N*
_{z} is the number of zero amplitude subcarriers. Then, we may note that while both the guard band and guard interval are necessarily allocated to deal with interference, they necessarily reduce the spectrum efficiency. Assume that the guard interval corresponds to cyclic prefix of *N*
_{c} sample, where the sampling rate is the nominal one for OFDM, i.e., 1/*B*
_{T}. Then, by the proper anticipation of guard band and interval, the average rate of effectively carried information symbols is down-scaled by *N*
_{u}/(*N*
_{u} + *N*
_{z} + *N*
_{c}) as noted in [21].

#### Geometrical models

A linear array with half-wavelength spacing between elements is assumed for each BS antenna array. Accordingly, the following geometrical reference model is applied. Cartesian coordinates (*x*
_{0},*y*
_{0}) and (*x*
_{
q
},*y*
_{
q
}) are used for referring to the location of respectively the MD and the array center of the *q*-th BS. The relation between the two locations is represented as shown in Fig. 1 by a polar coordinate (*r*
_{
q
},*θ*
_{
q,0}). The orientation of an antenna array is represented by the normal looking direction of the array defined as follows. The normal looking direction is determined by first setting the phase shifts of all the antenna elements to be zero and then determining the main radiation direction that is closest to the direction of arrival of the MD. We use *γ*
_{
q
} to represent the normal looking direction for the *q*-th BS, as a counterclockwise angle relative to the *x*-axis. For example, if the placement line of the *q*-th BS antenna array is on the *x*-axis in Fig. 1, *γ*
_{
q
} will be *π*/2. Assuming *r*
_{
q
} is much greater than the spacing between the antenna array elements, then *ϕ*
_{
q,n,m
}, ∀(*q,n,m*) can be approximated by

Thus,

and

The performance results will be obtained by averaging the computed CRLBs over various values of the parameter vector **u**. Figure 2 shows the geometrical assumptions, on which the variation of **u** is based. It shows that the region of interest for localization is a square with area of 400 m^{2}, there is a BS located at each corner, and the normal looking directions of the four arrays are pointed towards the region center.

#### Multipath propagation model

Radio wave propagation is subjected to multipath characteristics, which depend on the environment. In this paper, the multipath characteristics are varied, respecting density of the multipaths and relationship between the powers of direct and reflection paths, for investigation of their impacts on the CRLB performance. In this regard, the following statistical model is employed.

##### The direct path

The direct path parameters for the *q*-th BS consist of only *g*
_{
q,0} and *ω*
_{
q,0}, because *θ*
_{
q,0} can be determined form *x*
_{0} and *y*
_{0}. In this paper, *∠*
*g*
_{
q,0} is drawn from a uniform distribution over [0,2*π*), and |*g*
_{
q,0}| is obtained, based on the free-space path loss model. Assume the variance of *w*
_{
q,k,m
} is *σ*
^{2}=1. Also, recall that the gain of each antenna is 0 dB. Thus,

where *P*
_{t} is the MD transmitted power, *c* is the light speed, *f*
_{c}=5.25E+9 Hz as assumed, *κ* is the Boltzmann constant, and *T*
_{e} is the effective noise temperature of the BS receiver. For the value of *ω*
_{
q,0}, we set *t*
_{
q,0}=0, based on the discussion in Section 2.

##### The reflection paths

In this paper, *∠*
*g*
_{
q,n
} and *θ*
_{
q,n
}, ∀*n*>0 are independently drawn from a uniform distribution over [0,2*π*). In addition, |*g*
_{
q,n
}| and *ω*
_{
q,n
}, *n*>0 are set to obey

and

where *ρ* reflects a constant power-decay condition, and *δ*
^{−1} reflects the multipath density. The magnitude of a reflection path is not modeled to have a random characteristic, as it is treated as a controlled variable of the study. However, as the reflection paths are delayed relative to the direct path and their complex amplitudes have identical and independent random phases, the frequency response over the frequency band of the signal has a random frequency-selective fading characteristic. In this regard, we may note from (1) that the CFR for a specific subcarrier is a summation of independent complex zero mean circularly symmetric random variables. Hence, for large *N*
_{P}, the frequency response over a subcarrier could exhibit frequency flat-fading characteristics with Rayleigh or Rician distribution, the common characteristics in practical radio propagation environments [22]. The Rayleigh distribution could occur when \(|g_{q,0}|^{2}\ll \sum _{n=1}^{N_{\mathrm {P}}-1}|g_{q,n}|^{2}\), which is possible with *ρ*≈1. This is because when *ρ*=1, we have |*g*
_{
q,n
}|=|*g*
_{
q,0}| for all *n*>0 and accordingly the Rician *K* factor [22] is 1/(*N*
_{P}−1)≈0. On the other hand, the Rician distribution could occur when \(|g_{q,0}|^{2}\gg \sum _{n=1}^{N_{\mathrm {P}}-1}|g_{q,n}|^{2}\), which is possible with *ρ*≫1.

### Discussion

The mean square error (MSE) performance results presented here are obtained by averaging the computed CRLBs over various values of the parameter vector **u**. In this regard, the MD is uniformly and randomly located in the 400- m^{2} region, except the locations that are close to the center of an antenna array by less than 1 m. The performance will be presented for *P*
_{t}=−20 dBm, respecting the infrastructure conditions (*B* and *M*) and the radio propagation characteristics (*ρ*, *δ*, and *N*
_{P}). The performance respecting *P*
_{t} is not presented, because it is obvious that the MSE-versus- *P*
_{t} curve in this case is a line with a slope of −10 dB/decade. Note also that a study of the performance respecting geometry may be useful in determining the positions of BS antenna arrays [23]. Such study is beyond the scope of our work, and we believe it merits further investigation.

Figures 3 and 4 show the MSE performance in relation to *B* and *M*, for *δ*=10 ns, *ρ*= 0 dB, and *N*
_{P}=5. Note that changing *M* affects the quantity of observation data and accordingly the number of rows of *E*
_{
k
} that equals *QM*. Also, changing *B* affects the quantity of observation data and accordingly the number of summands in (16) that equals 2*K*+1. In addition, by changing *B*, we must recompute *g*
_{
q,n
},∀(*q,n*), according to (22) and (23), for use in the construction of new *E*
_{
k
}. Figure 3 shows that the MSE may be reduced by increasing *B*, but there is a limit where the MSE cannot be reduced further. According to the figure, that limit is found to be reachable at smaller *B* for larger *M*. That limit is also found to depend on *M*, as the limits for *M*= 2, 4, and 8 are respectively about 0.2094, 0.0201, and 0.0023 m^{2}. Figure 4 shows that the MSE may be reduced by increasing *M*. However, as *M* becomes larger, the MSE always decreases while the importance of *B* becomes lesser, as the MSE limit discussed above is being reached. Hence, the above observations may be summarized as follows. The MSE performance can be generally improved by increasing either *B* or *M*, but increasing *B* can only reduce the MSE to a limit depending on *M*. Increasing *M* alone can push the MSE to the limit, which is also smaller as *M* increases. In addition, with a larger *M*, a smaller *B* would be required for the MSE to approach the limit.

Figure 5 shows the MSE performance in relation to *N*
_{P} and *M*, for *B*= 40 MHz, *δ*=10 ns, and *ρ*= 0 dB, which includes the free-space results (*N*
_{P}=1). Note that changing *N*
_{P} affects the number of parameters for estimation and accordingly the number of columns of *E*
_{
k
} that equals (4*N*
_{P}−1)*Q*+2. Interestingly, it should be first noted that the free-space results in Fig. 5 and the MSE limits in Fig. 3 are same. This suggests that the MSE limit previously discussed corresponds to the performance virtually obtained from free-space channel. Hence, in this paper, we will refer to the free-space channel result as the free-space limit. This limiting characteristic of the MSE is consistent with the following principles. First, note from (1) that the contribution of a particular path is a complex sinusoidal function of *k* with a particular frequency depending on the path delay. In this regard, we should note that direct-path AOA estimation basically requires separating the direct-path contribution from reflection-path contributions, where large *B* is of great help. This is because of that the key difference between the paths is the sinusoidal frequency and that a less ambiguous result on such frequency determination basically requires observing the CFR over a larger range of *k*. Then, once *B* is large enough for perfect path separation, further increasing *B* while retaining the total transmitted power as assumed here is not seen to further improve the localization performance. This indicates that AOA estimation performance for a perfectly separated path depends on the total transmitted signal power, regardless of the signal bandwidth. Hence, increasing *B* by more spreading of the fixed transmitted power over the spectrum can only help the MVUE separate the multipaths, which eventually pushes the performance to approach the free-space limit. Figure 5 also shows that the logarithm of the MSE rises almost linearly with *N*
_{P} for *M*= 2, while for other *M*, the MSE remains almost constant even if *N*
_{P} is close to 10. The results for *N*
_{P}=5 in Fig. 5 are consistent with the results of the same case, i.e., *B*= 40 MHz, in Fig. 3. The results of the mentioned case from both figures consistently indicate that the MSE is far from the free-space limit for *M*= 2, while for other *M*, the MSE is already close to the free-space limit. Hence, if the MSE is already close to the free-space limit due to an appropriate provision of *B* and *M* to deal with the multipath environment, the MVUE will be robust against variation of *N*
_{P}. Otherwise, the corresponding MSE will rise exponentially with *N*
_{P}.

Figure 6 shows the MSE performance in relation to *N*
_{P} and *B*, for *M*=2, *δ*=10 ns, and *ρ*= 0 dB. The figure provides same observations as previously discussed, regarding the characteristics of MSE against *N*
_{P} and impact of increasing *B* on the MSE performance for multipath environments. Interestingly, it also shows that the free-space results do not depend on *B*. Theoretically, this may be justified by the following considerations. For *N*
_{P}=1, (1) becomes \(\phantom {\dot {i}\!}H_{q,k,m}=g_{q,0}e^{-j(\omega _{q,0}k+\phi _{q,0,m})}+w_{q,k,m}\). The AOA-based localization basically relies on the estimation of *ϕ*
_{
q,0,m
}, ∀(*q*,*m*), in which the AOA information is contained. As a result of [24], we note that the CRLB of *ϕ*
_{
q,0,m
} based on the (2*K*+1) sample observation of *H*
_{
q,k,m
} is inversely proportional to |*g*
_{
q,0}|^{2}(2*K*+1) for large *K*. Recall that *B*=(2*K*+1)*Δ*, and |*g*
_{
q,0}|^{2}
*B* is proportional to *P*
_{t} according to (22). Therefore, |*g*
_{
q,0}|^{2}(2*K*+1) is also proportional to *P*
_{t}. In addition, the CRLB of *ϕ*
_{
q,0,m
} depends on *P*
_{t}, instead of *B*. Note also that by first-order approximation, the association between a small error of *ϕ*
_{
q,0,m
} and the resulting localization error is approximately linear. Therefore, the free-space localization CRLB results also depend on *P*
_{t}, instead of *B*.

Finally, regarding comparison between the impacts of *B* and *M* on the MSE performance, we note from Figs. 3, 4, 5 and 6 that doubling *M* gives greater performance benefit than doubling *B* for all cases observable from the figures. This should come from the following principles of AOA-based localization using (1). Increasing *B* while maintaining *P*
_{t} only helps the MVUE separate the multipaths. On the other hand, increasing *M* not only provides more observation data that help multipath separation but also improves AOA sensitivity and therefore the free-space limit.

Figure 7 shows the MSE performance in relation to *δ* and *M*, for *B*=80 MHz, *ρ*= 0 dB, and *N*
_{P}=10, while Fig. 8 shows the MSE performance in relation to *δ* and *B*, for *M*=4, *ρ*= 0 dB, and *N*
_{P}=10. Note that changing *δ* does not affect either the size of *E*
_{
k
} or the number of summands in (16), because it does not affect either quantity of observation data or the number of parameters for estimation. By changing *δ*, we only recompute *ω*
_{
q,n
}, *n* > 0,∀*q* to obey (24) for use in the construction of new *E*
_{
k
}. Below are the reported various observations from the figures. The multipath density has a profound impact on the MSE performance, as the performance tends to get severely worse than the free-space limit when *δ* is lower than a certain boundary value that can be reduced by increasing *B* or *M*. For example, it can be seen from Fig. 7 that for *M*=4, the MSE starts to get worse than the free-space limit when the *δ* is decreasing below a value between 5 and 10 ns, while for a larger *M*, such characteristic occurs at a smaller *δ*. It can be also seen from Fig. 8 that for *B*=40 MHz, the MSE starts to get worse than the free-space limit when the *δ* is decreasing below a value between 10 and 20 ns, while for a larger *B*, such characteristic occurs at a smaller *δ*. It may be also noted from Fig. 7 that in addition to reducing the boundary value, provision for a larger *M* also reduces the rate of deterioration when the *δ* decreases below beyond the boundary value. Again, regarding comparison between the impacts of *B* and *M* on the MSE performance, we see that increasing *M* provides greater performance benefit.

Figure 9 shows the MSE performance in relation to *ρ* and *M*, for *B*=80 MHz, *δ*=2 ns, and *N*
_{P}=10. Note that changing *ρ* does not affect either the size of *E*
_{
k
} or the number of summands in (16). By changing *ρ*, we only recompute *g*
_{
q,n
}, *n* > 0,∀*q* to obey (23) for use in the construction of new *E*
_{
k
}. The figure shows that all curves are essentially flat, and therefore, the MSE seems to be independent of *ρ*. Comparing the MSE results in Fig. 9 and the free-space limits observable from Fig. 7, we see that the MSE at *δ*=2 ns is farthest to the free-space limit when *M*=4, while it is nearest when *M*=16. The flat characteristic of the curves in Fig. 9 exists, no matter how far from the free-space limit the MSE is. This may sound surprising, because the channel at *ρ*=20 dB is very much alike a free-space channel, and for this condition, one can easily design an algorithm that performs very close to the free-space limit. An algorithm that simply treats the channel as a free-space channel should be able to achieve such performance, because that insignificant model mismatch should only cause insignificant bias to the estimation result. This also means that when the modeled reflection paths are weak, the MVUE could perform surprisingly as poor as the case where the paths are strong. Such behavior of the MVUE, which embraces all modeled paths into its idealized unbiased estimation task, will be mathematically justified soon in this section. Hence, we suggest that reflection paths with insignificant amplitude should not be included explicitly in the channel model. This is to maintain that the CRLB may be also meaningful in a study of biased estimation algorithms.

We may claim more strictly from the results in Fig. 9 that the localization performance of the MVUE is independent of the strength of a reflection path. This can be mathematically justified by the following considerations. Note that the gain of a particular reflection path appears as a constant factor consistently for all non-zero elements along only two columns of *E*
_{
k
}. For a specific *g*
_{
q,n
}, *n*>0, such two columns correspond to respectively the (*n*+1)-th column of \(\mathbf {D}_{q,k}^{(\Omega)}\) and the *n*-th column of \(\mathbf {D}_{q,k}^{(\Theta)}\). The indexes of them within *E*
_{
k
} are always greater than two, because they all belong to \(\mathbf {D}_{q,k}^{(*)}\) in (15). Therefore, by scaling the value of the *g*
_{
q,n
} with a real factor, *E*
_{
k
} can be recomputed accordingly by post-multiplying itself with a real constant diagonal matrix, where all diagonal elements are equal to one except the elements associated with the two indexes. The inverse of the Fisher information matrix can then be recomputed by pre- and post-multiplying itself with the inverse of that diagonal matrix. Such operation will not affect the localization performance of the MVUE computed by (17), because the two indexes are always greater than two.

We have been realizing from the results of Figs. 7 and 8 that the multipath density reflected by *δ* is crucial to the effectiveness of the infrastructure reflected by *B* and *M*. However, we consider that care may be only required for the second path that has delay closest to the direct path, because it contributes most to the difficulty of separating the direct path from other paths. Thus, it may be more interesting to investigate the case of channels where the path delay rule in (24) is replaced by

Figure 10 shows the MSE performance in relation to *δ*
_{1} and *B*, for *M*=4, *ρ*=0 dB, *N*
_{P}=10, *δ*
_{0}=10 ns, and *δ*
_{1}≤10 ns, which can then be compared with the cases *δ*
_{0}=*δ*
_{1}≤10 ns presented in Fig. 8. We can then see that the performance degradation due to moving from *δ*
_{0}=*δ*
_{1}=10 ns to *δ*
_{0}=10 ns with *δ*
_{1}=1 ns is much less than the degradation due to moving from the same original condition to *δ*
_{0}=*δ*
_{1}=1 ns. Hence, allowing the reflection paths to be close in delay between themselves could not degrade the performance so much, compared to allowing significant reflection paths to be close in delay to the direct path. It is then very important to give much care for each significant reflection path with delay close to that of the direct path. Note that a position of scatterer that could produce such a reflection path can only be around the straight line connecting the MD and the BS. For such a position, we may further note that everyone around the BS is most cumbersome. This is because the corresponding reflection path AOA can be considerably different from the direct-path AOA, and then, the reflection path needs to be modeled explicitly as having such different AOA but similar delay to that of the direct path. On the other hand, for such a scatterer position rather than those around the BS, the corresponding reflection path AOA cannot be considerably different from the direct-path AOA. Accordingly, by neglecting the seen insignificant difference on both the delay and AOA, the reflection path can be approximately modeled by merging itself with the direct path based on only complex path-amplitude addition. Therefore, it is important to avoid the most cumbersome scatterers by ensuring that the BS antenna arrays are carefully placed not close to any significant reflective materials, and in some cases, using radio-absorptive materials may be helpful.

## Conclusions

We studied the problem of AOA-based localization using MIMO-OFDM channel state information as observation data. In particular, we derived a method to compute the CRLB which is a fundamental limit on the localization MSE and applied it to obtain fundamental insights into the problem. We found that the CRLB is independent of the strength of a reflection path. Therefore, we suggested that reflection paths with insignificant amplitude should not be included explicitly in the channel model. Provided that the mobile device-transmitted signal power is fixed, the following may be concluded from our investigation. The MSE localization performance can be improved by increasing the transmitted signal bandwidth *B* alone. However, there is a limit where further increasing *B* cannot further improve the performance. The limit is found to equal the performance virtually obtained from the free-space radio propagation assumption. The performance can be considerably improved also by increasing the base station antenna array size *M* alone, as, when *M* increases, not only does the free-space limit decrease but also the MSE gets closer to the decreasing limit. In particular, scaling *M* always has greater impact on the MSE than scaling *B*. Provided that the MSE is close to the free-space limit, the optimum unbiased estimator will be robust to variation on the number of multipaths *N*
_{P}. Otherwise, the MSE will rise exponentially with *N*
_{P}. The multipath density that is inversely proportional to *δ* has a profound impact on the MSE performance, as the performance tends to get severely worse than the free-space limit when the density is higher than a value proportional to *B* and *M*. Finally, when significant reflection paths with AOAs very different from that of the direct path have similar delays to that of the direct path, the localization performance could be severely degraded.

## References

- 1
H Liu, H Darabi, P Banerjee, J Liu, Survey of wireless indoor positioning techniques and systems. IEEE Trans. Syst. Man Cybern. Part C Appl. Rev.

**37**(6), 1067–1080 (2007). - 2
Z Farid, R Nordin, M Ismail, Recent advances in wireless indoor localization techniques and system. J. Comput. Netw. Commun.

**2013**(185138), 1–12 (2013). - 3
K Yu, I Sharp, YJ Guo,

*Ground-based wireless positioning*, 1st edn. (Wiley, West Sussex, 2009). - 4
Y Zhao, K Liu, Y Ma, Z Li, An improved k-NN algorithm for localization in multipath environments. EURASIP J. Wirel. Commun. Netw.

**2014**(208), 1–10 (2014). - 5
MB Zeytinci, V Sari, FK Harmanci, E Anarim, M Akar, Location estimation using RSS measurements with unknown path loss exponents. EURASIP J. Wirel. Commun. Netw.

**2013**(178), 1–14 (2013). - 6
P Bahl, VN Padmanabhan, in

*IEEE INFOCOM*. RADAR: an in-building RF-based user location and tracking system (The Institute of Electrical and Electronics Engineers (IEEE)Piscataway, 2000), pp. 775–784. - 7
M Youssef, A Agrawala, in

*Proceedings of the 3rd International Conference on Mobile Systems, Applications, and Services*. The Horus WLAN Location Determination System (Association for Computing Machinery (ACM)New York, 2005), pp. 205–218. - 8
K Wu, J Xiao, Y Yi, D Chen, X Luo, LM Ni, CSI-based indoor localization. IEEE Trans. Parallel Distrib. Syst.

**24**(7), 1300–1309 (2013). - 9
T Demeechai, P Kukieattikool, T Ngo, T-G Chang, Localization based on standard wireless lan infrastructure using mimo-ofdm channel state information. EURASIP J. Wirel. Commun. Netw.

**2016**(146), 1–16 (2016). - 10
NB Rejeb, I Bousnina, MBB Salah, A Samet, Joint mean angle of arrival, angular and Doppler spreads estimation in macrocell environments. EURASIP J. Adv. Signal Process.

**2014**(133), 1–10 (2014). - 11
SO Al-Jazzar, A Muchkaev, A Al-Nimrat, M Smadi, Low complexity and high accuracy angle of arrival estimation using eigenvalue decomposition with extension to 2D AOA and power estimation. EURASIP J. Wirel. Commun. Netw.

**2011**(123), 1–13 (2011). - 12
Y Shen, MZ Win, Fundamental limits of wideband localization: Part I: a general framework. IEEE Trans. Inf. Theory.

**56**(10), 4956–4980 (2010). - 13
H Godrich, AM Haimovich, RS Blum, Target localization accuracy gain in mimo radar-based systems. IEEE Trans. Inf. Theory.

**56**(6), 2783–2803 (2010). - 14
K Witrisal, E Leitinger, S Hinteregger, P Meissner, Bandwidth scaling and diversity gain for ranging and positioning in dense multipath channels. IEEE Wirel. Commun. Lett.

**5**(4), 396–399 (2016). - 15
H Minn, N Al-Dhahir, Optimal training signals for MIMO OFDM channel estimation. IEEE Trans. Wirel. Commun.

**5**(5), 1158–1168 (2006). - 16
H Zhu, J Wang, Chunk-based resource allocation in OFDMA systems—part I: chunk allocation. IEEE Trans. Commun.

**57**(9), 2734–2744 (2009). - 17
H Zhu, J Wang, Chunk-based resource allocation in OFDMA systems—part II: Joint chunk, power and bit allocation. IEEE Trans. Commun.

**60**(2), 499–509 (2012). - 18
H Zhu, Radio resource allocation for OFDMA systems in high speed environments. IEEE J. Sel. Areas Commun.

**30**(4), 748–759 (2012). - 19
SM Kay,

*Fundamentals of statistical signal processing: estimation theory*(Prentice Hall, New Jersey, 1993). - 20
IEEE Std 802.11ac - 2013, IEEE Standard for Information Technology-Telecommunications and information exchange between systemsŰlocal and metropolitan area networks-specific requirements, Part 11: wireless LAN medium access control (MAC) and physical layer (PHY) specifications, Amendment 4: enhancements for very high throughput for operation in bands below 6 GHz. (The Institute of Electrical and Electronics Engineers, Inc., New York, NY, USA, 2013).

- 21
SK Chronopoulos, C Votis, V Raptis, G Tatsis, P Kostarakis, in

*AIP Conference Proceedings 1203*. in depth analysis of noise effects in orthogonal frequency division multiplexing systems, utilising a large number of subcarriers (American Institute of Physics (AIP)New York, 2010), pp. 967–972. - 22
SK Chronopoulos, V Christofilakis, G Tatsis, P Kostarakis, Performance of turbo coded OFDM under the presence of various noise types. Wirel. Pers. Commun.

**87**(4), 1319–1336 (2016). - 23
W Shi, X Qi, J Li, S Yan, L Chen, Y Yu, X Feng, Simple solution to the optimal deployment of cooperative nodes in two-dimensional TOA-based and AOA-based localization system. EURASIP J. Wirel. Commun. Netw.

**2017**(79), 1–16 (2017). - 24
DC Rife, RR Boorstyn, Single-tone parameter estimation from discrete-time observations. IEEE Trans. Inf. Theory.

**20**(5), 591–598 (1974).

## Acknowledgements

The authors would like to thank the anonymous reviewers for their constructive comments, which helped a lot to improve the presentation of this paper.

### Funding

Not applicable.

## Author information

### Affiliations

### Contributions

Both authors contributed to the searching of the literature. TD contributed to theoretical analysis. Both authors contributed to the design and implementation of computer simulation experiments and interpretation of the results. Both authors have read and approved the final manuscript.

### Corresponding author

Correspondence to Tanee Demeechai.

## Ethics declarations

### Competing interests

The authors declare that they have no competing interests.

### Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## 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

#### Received

#### Accepted

#### Published

#### DOI

### Keywords

- Localization
- Angle of arrival
- MIMO-OFDM
- Channel state information
- Multipath propagation
- Cramer-Rao lower bound