Research Article  Open Access
5D Parameter Estimation of NearField Sources Using Hybrid Evolutionary Computational Techniques
Abstract
Hybrid evolutionary computational technique is developed to jointly estimate the amplitude, frequency, range, and 2D direction of arrival (elevation and azimuth angles) of nearfield sources impinging on centrosymmetric cross array. Specifically, genetic algorithm is used as a global optimizer, whereas pattern search and interior point algorithms are employed as rapid local search optimizers. For this, a new multiobjective fitness function is constructed, which is the combination of mean square error and correlation between the normalized desired and estimated vectors. The performance of the proposed hybrid scheme is compared not only with the individual responses of genetic algorithm, interior point algorithm, and pattern search, but also with the existing traditional techniques. The proposed schemes produced fairly good results in terms of estimation accuracy, convergence rate, and robustness against noise. A large number of MonteCarlo simulations are carried out to test out the validity and reliability of each scheme.
1. Introduction
Parameter estimation of signals is one of the key issues in array signal processing, which has direct applications in radar, sonar, seismic exploration, electronic surveillance, and so forth [1]. In the literature, various algorithms are available to discuss this issue, such as the MUSIC algorithm [2], the maximum likelihood (ML) algorithm [3], the matrix pencil (MP) algorithm [4], and the ESPRIT algorithm [5]. Many of these algorithms make a supposition that the sources are positioned in the far field of sensors array so that the signal received from them can be taken as plane waves. With this supposition, the wave front of each signal is only a function of the DOA of the sources, which is easy to deal with. However, the situation becomes complicated if the sources are situated closer to the sensor array (near field). In this case, the waves are considered to be spherical, where the wavefront of each signal is the function of DOA, as well as, range of the sources [6].
Many classical algorithms are also available to discuss the problem of nearfield source localization, such as the linear prediction algorithm [7], the 2D MUSIC algorithm [8], and the ESPRIT based algorithms [9, 10]. However, these algorithms mainly focus on 2D case, that is, estimation of the elevation angle and range parameters. Some algorithms are also available which deal with the 3D case (elevation angle, azimuth angle, and range) of nearfield sources, for example, [11–14]. In [11] expectationmaximization (EM) algorithm is proposed, but it suffers from heavy computations and iterative process. A unitary ESPRIT algorithm is developed in [12] which requires further parameter pairing process, while the algorithm presented in [13] heavily relies on different carrier frequencies and approximated sinusoidal signals and also requires high sampling narrow band data. A spectral search based method is presented in [14] which can only be used for underwater environment. In [15], comparatively an efficient algorithm based on cumulants is proposed for 4D parameter estimation of nearfield sources (frequency, range, and 2D DOA), but it also requires a large number of snapshots and ends up with higher mean square error (MSE). Moreover, it is also unable to estimate the amplitude of signals.
Now to estimate the parameters of nearfield sources, heuristic techniques like evolutionary computing techniques (ECT) can also be used in the field of optimization. ECT, which is also known as computational intelligence, is a subfield of artificial intelligence that can be employed for combinatorial as well as for continuous optimization problems. ECT has stochastic or metaheuristic optimization nature and is considered to be global optimization methods. These techniques include genetic algorithm (GA) [16], particle swarm optimization (PSO) [17], and differential evolution (DE) [18]. These techniques are based on the principle of biological evolution, such as genetic inheritance and natural selection. One of the most important features of ECT is that they become even more reliable and effective when hybridized with any other efficient scheme such as pattern search (PS), active set (AS), and interior point algorithm (IPA) [19–24].
In this paper, 5D parameters (amplitude, frequency, range, elevation angle, and azimuth angle) of nearfield sources impinging on centrosymmetric cross array are jointly estimated. Initially we used GA, PS, and IPA alone, but then we adopt hybrid evolutionary computing techniques based on GA hybridized with PS or IPA. In these hybrid approaches, the solution starts with a global optimizer (GA) and ends up with local optimizers (PS or IPA). For this a new multiobjective fitness function is used, which is the combination of MSE and correlation between normalized desired and estimated vectors. It requires only a single snapshot, which obviously decreases the computational cost. The performances of these two hybrid approaches (GAPS and GAIPA) are compared not only with each other, but also with the individual performance of GA, IPA, and PS. Besides, the proposed hybrid schemes are also compared with the traditional techniques available in the literature [15].
Throughout the paper, matrices and vectors are represented by bold upper and lower case letters, respectively, whereas , , and are used, respectively, for transpose, hermitian, and normalization of vectors or matrix.
The rest of the work is organized as follows. In Section 2, data model is developed for nearfield sources, while Section 3 describes the signal subspace dimension. The proposed schemes are given in Section 4, while results and simulations are provided in Section 5. Finally, conclusion and future work direction are given in Section 6.
2. Signal Model for NearField Sources
In this section, signal model for nearfield sources impinging on centrosymmetric cross array (CSCA) is developed. All sources are considered to be narrow band and mutually statistically independent. The amplitude , frequency , range , and 2D DOA are different for different sources. The CSCA is composed of two subarrays that are placed along axis and axis, respectively, as shown in Figure 1. The total number of sensors in the array is where each subarray consists of sensors, while the reference sensor is common among both. If is the total number of sources, then the signal received at th and th sensor in axis and axis subarrays, respectively, can be modeled as where and represent the additive white Gaussian noise (AWGN) added at th and th sensors in axis and axis subarrays, respectively.
In (1), and can be given as In (3), , where . Similarly, , where . So, (3) can be represented as In the same way, where (5) can be further rewritten as Similarly, in (2), and can be given as By using (4) and ((6)(7)) in (1) and (2), we get:where represents the frequency of th source, while is the maximum frequency to be used. In vector form (8) can be collectively represented as where can be defined as where From (8), one can see that the unknown parameters are , and where . So, the problem in hand is to estimate these 5D parameters jointly and efficiently; before starting the problem, it is important to find out the dimension of the signal subspace from the received snapshots.
3. Signal Subspace Dimension
For this purpose, we used nonparametric technique: where is a source vector, is our array manifold matrix, and is an AWGN vector with spectral matrix . The spectral matrix of w is given as where We expect that the signals are incoherent, so that the rank of is equal to the number of signals. Let the rank of be ; then eigendecomposition of is given as where has column vectors which are eigenvectors of , and has column vectors which are eigenvectors of . We expect the last eigenvalues representing noise to be the smallest and also equal. For finding the dimensions of two subspaces, we can use the following hypothesis [25]: This numerator is the arithmetic mean of being the smallest eigenvalues, while denominator is their geometric mean. We start with , then is chosen correctly, and then the last eigen values are the smallest and equal, making . After having found by this test, we know exactly the number of signals; whether any of these signals is friend, foe, or indifferent is not the topic of concern for this paper.
4. Proposed Schemes
In this section, brief introduction and flow diagram are provided for IPA, PS, and GA.
4.1. Interior Point Algorithm (IPA)
Interior point methods (barrier methods) can be used for linear and nonlinear convex optimization problems. It uses either conjugate gradient step through a trust region or Newton step by using linear programming in order to get an optimum solution during each iteration [26]. The IPA has extensive applications and performs very well particularly in the presence of less local minima. However, its performance is superb even in the presence of more local minima when it is used as a local search optimizer with PSO or GA. For detailed applications and derivation of the algorithm, it is recommended that reader should see [27]. By observing such applications, in this work IPA is mainly used as a local search optimizer with GA.
4.2. Pattern Search (PS)
Pattern search was introduced by Hookes and Jeeves in 1961 which is gradient or derivative free technique and can be used for both local and global optimization problems. Basically, PS works on mesh which is defined according to some specific rules. If no improvement is achieved in cost function at the mesh points of current iteration, then the mesh is polished and the process is repeated. It has applications in many fields, such as signal processing and soft computing [28]. In this work, PS is also mainly used as a local search optimizer with GA in which the best chromosome achieved through GA is given as the starting point to PS.
4.3. Genetic Algorithm (GA)
GA is basically different from previously discussed algorithm (IPA and PS) and is applicable to a wide range of optimization problems. GA is more prominent and proficient algorithm than any other evolutionary computing technique due to its ease in conception and ease in implementation and more importantly less probable to get stuck in the presence of local optima. GA is being successfully applied to a wide range of applications from commerce to scientific research [29].
The steps for GA and GAPS in the form of pseudocode are given below, while their flow diagram is shown in Figure 2.
Step 1 (initialization). In this step, we randomly generate I number of chromosomes, where the length of each chromosome is 5*P. In each chromosome the first P genes represent amplitudes, the second P genes contain the frequencies, and the next P genes represent the ranges, while the fourth and fifth P genes represent elevation and azimuth angles, respectively, of the sources as follows:where where and are the lowest, while and are the highest limits of signals amplitude and range, respectively.
Step 2 (fitness function). Our goal is to minimize the errors received for both subarrays. For th chromosome, it can be given as where in (21), and are defined in (8), respectively, while and are given asSimilarly, in (21), can be defined as where .
Step 3 (termination criteria). The termination criteria depend on the following conditions if they are achieved:(a)the objective function value is achieved which is predefined; that is, , or(b)total number of iterations has been completed.
Step 4 (reproduction). New population is reproduced by using the operators of crossover, elitism, and mutation selection as shown in Table 1.

Step 5 (hybridization). In this important step, for further improvements, the best chromosome achieved through GA is given to PS and IPA as starting point. The parameter settings for IPA and PS are provided in Table 1.
Step 6 (storage). For better statistical analysis, store the global best of the current run and repeat Steps 2–5 for sufficient numbers of independent runs.
5. Results and Discussion
In this section, several simulations are performed to validate the proposed schemes. Initially, the comparison of proposed hybrid schemes is carried out with the individual performance of GA, IPA, and PS in terms of estimation accuracy, convergence rate, and proximity effects. At the end of this section, the comparison of proposed schemes is made with the traditional existing technique [15] using error as a figure of merit. We have used a MATLAB builtin optimization tool box, for which the parameter settings are provided in Table 1. All the values of frequencies, ranges, and DOA are taken in terms of MegaHertz (MHz), wavelength , and radians (rad), respectively. Every time, we have used same number of sensors in both subarrays, where the reference sensor is common for both. The interelement spacing between the two consecutive sensors in each subarray is taken as . Each result is averaged over 100 independent runs.
Case 1. In this case, the estimation accuracy of IPA, PS, GA, GAIPA, and GAPS is discussed for 2 sources. The CSCA consists of 9 sensors; that is, each subarray is composed of four sensors, while the reference sensor is common for them. In this case, no noise is added to the system. The desired values of amplitudes, frequencies, ranges, elevation, and azimuth angles are , , , rad, and ; , , , rad, and rad.
Although in this case, GA alone has produced fairly good estimation accuracy as provided in Table 2; however, it becomes even more accurate when hybridized with IPA and PS. Among all schemes, the GAPS approach produced better results and maintained less error between desired values and estimated values. The second best scheme is GAIPA, while GA alone provides the third best results.

Case 2. In this case, the estimation accuracy is discussed for 3 sources having values , , , rad, and rad; , , , rad, and rad; , , , rad, and . This time the array is composed of 13 sensors. Due to the increase of sources, the accuracy of IPA, PS, and GA has been significantly despoiled. However, as listed in Table 3, the accuracy of GA has improved when hybridized with IPA and PS.
The hybrid GAPS technique proved to be the most accurate approach for three sources, while the second best approach is the other hybrid GAIPA approach.

Case 3. In this case, the estimation accuracy of four nearfield sources is discussed in the absence of noise where the CSCA is composed of 17 sensors. The desired values are , , , rad, and rad; , , , rad, and rad; , , , rad, and rad; , , , rad, and rad. One can see from Table 4 that the estimation accuracy of all schemes degraded as we have faced more local minima in this case. However, even in this case, the hybrid approaches especially the GAPS performed well and made a close estimate of desired response. The second best scheme is again the other hybrid GAIPA approach.

Case 4. In Figure 3, convergence rate is shown for each scheme against different number of sources. From convergence, we mean, the total number of times a particular technique achieved its goal. In this case, we have taken the same two sources as given in Case 1, but this time the CSCA consists of 17 sensors for each number of sources. The bar graph shows that the hybrid GAPS technique has converged many number of times as compared to the remaining approaches for all sources. The second best convergence rate is maintained by GAIPA, while the third best scheme is GA alone.
Case 5. In this case, the estimation accuracy is checked in the presence of low signal to noise ratio (SNR). The value of SNR is 5 dB, while the array has 13 sensors. The desired values of amplitude, frequency, ranges, elevation and azimuth angles of 3 sources are , , , rad, and rad; ,, , rad, and rad; , , , rad, and rad. As provided in Table 5, due to low SNR’ the accuracy of all schemes is despoiled. However, the hybrid GAPS scheme is robust enough to produce better results even in the presence of low SNR. The second best result is produced by the other hybrid GAIPA scheme.

Case 6. In Figure 4, the convergence rate of each scheme is evaluated against noise and it has been shown that the convergence rate of all schemes degraded at low values of SNR. However, with the increase of SNR, the convergence rate of each scheme has improved. Again, the hybrid GAPS has shown fairly good robustness against all the values of SNR.
Case 7. In this case, the proximity effect of DOA of three sources is evaluated in terms of estimation accuracy and convergence rate in the presence of 10 dB noise. As given in Table 6, due to proximity and low SNR, we have faced more local minima. However, once again one can see that the hybrid GAPS produced fairly good results in terms of accuracy and convergence rate even in this case, while the second best result is given by GAIPA.

Case 8. In this case, we have compared the proposed two hybrid schemes with traditional technique given in [15]. Basically, in [15], Liang et al. have proposed a cumulants based technique to estimate the 4D parameters (Frequency, range, elevation angle, and azimuth angle) of nearfield sources. In [15], mean square error (MSE) is used, while in the current work, the error is the combination of MSE and correlation between the desired and estimated vectors as discussed in Section 3. For these simulations, two sources are considered in the presence of noise. The values of the two sources are exactly the same as given above in Case 1. Figures 5, 6, 7, and 8 have shown the error for frequency, azimuth angle, elevation angle, and range of two nearfield sources by using [15] and the two proposed hybrid schemes. One can clearly observe that, in each case (especially for range estimation), the proposed schemes have maintained fairly minimum error as compared to [15]. Besides, [15] is unable to estimate the amplitude, while our proposed schemes have shown satisfactory error for amplitude estimation as shown in Figure 9.
6. Conclusion and Future Work
In this work, we have mainly developed two hybrid schemes (GAIPA and GAPS) to estimate the 5D parameters (amplitude, frequency, range, elevation angle, and azimuth angle) of sources located in the near field of the sensors array. A new multiobjective fitness function was developed, which is the combination of MSE and correlation between normalized desired and normalized estimated vectors. It requires only single snapshot. The two hybrid schemes have shown good performance as compared to their individual responses in terms of estimation accuracy, convergence rate, and so forth. The proposed schemes have also shown good results as compared to traditional technique by using an error as a figure of merit. However, the hybrid GAPS proved to be the best approach among them for the joint estimation of amplitude, frequency, range, elevation angle, and azimuth angle of nearfield sources.
In future, one can check the same approach for null steering and beam steering in the field of adaptive beamforming.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
References
 H. Krim and M. Viberg, “Two decades of array signal processing research: the parametric approach,” IEEE Signal Processing Magazine, vol. 13, no. 4, pp. 67–94, 1996. View at: Publisher Site  Google Scholar
 R. O. Schmidt, “Multiple emitter location and signal parameter estimation,” IEEE Transactions on Antennas and Propagation, vol. 34, no. 3, pp. 276–280, 1986. View at: Publisher Site  Google Scholar
 S. M. Kay, Fundamentals of Statistical Signal Processing: Estimation Theory, vol. 1 of Prentice Hall Signal Processing Series, PrenticeHall, Upper Saddle River, NJ, USA, 1st edition, 1993.
 T. K. Sarkar and O. Pereira, “Using the matrix pencil method to estimate the parameters of a sum of complex exponentials,” IEEE Antennas and Propagation Magazine, vol. 37, no. 1, pp. 48–55, 1995. View at: Publisher Site  Google Scholar
 R. Roy and T. Kailath, “ESPRIT—estimation of signal parameters via rotational invariance techniques,” IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. 37, no. 7, pp. 984–995, 1989. View at: Publisher Site  Google Scholar
 A. Swindlehurst and T. Kailath, “Passive directionofarrival and range estimation for nearfield sources,” in Proceedings of the 4th Annual ASSP Workshop on Spectrum Estimation and Modeling, pp. 123–128, Minneapolis, Minn, USA, August 1988. View at: Publisher Site  Google Scholar
 E. Grosicki, K. AbedMeraim, and Y. Hua, “A weighted linear prediction method for nearfield source localization,” IEEE Transactions on Signal Processing, vol. 53, no. 10, part 1, pp. 3651–3660, 2005. View at: Publisher Site  Google Scholar
 D. Starer and A. Nehorai, “Passive localization on nearfield sources by path following,” IEEE Transactions on Signal Processing, vol. 42, no. 3, pp. 677–680, 1994. View at: Publisher Site  Google Scholar
 J.F. Chen, X.L. Zhu, and X.D. Zhang, “A new algorithm for joint rangeDOAfrequency estimation of nearfield sources,” EURASIP Journal on Applied Signal Processing, vol. 2004, Article ID 105173, pp. 386–392, 2004. View at: Publisher Site  Google Scholar
 Y. Wu, L. Ma, C. Hou, G. Zhang, and J. Li, “Subspacebased method for joint range and DOA estimation of multiple nearfield sources,” Signal Processing, vol. 86, no. 8, pp. 2129–2133, 2006. View at: Publisher Site  Google Scholar
 N. Kabaoğlu, H. A. Çırpan, E. Çekli, and S. Paker, “Deterministic maximum likelihood approach for 3D near field source localization,” AEU—International Journal of Electronics and Communications, vol. 57, no. 5, pp. 345–350, 2003. View at: Publisher Site  Google Scholar
 R. N. Challa and S. Shamsunder, “Passive nearfield localization of multiple nonGaussian sources in 3D using cumulants,” Signal Processing, vol. 65, no. 1, pp. 39–53, 1998. View at: Publisher Site  Google Scholar
 K. AbedMeraim and Y. Hua, “3D near field source localization using second order statistics,” in Proceedings of the 31st Asilomar Conference on Signals, Systems & Computers, vol. 2, pp. 1307–1311, Pacific Grove, Calif, USA, November 1997. View at: Google Scholar
 D.S. Yang, J. Shi, and B.S. Liu, “A new nearfield source localization algorithm based on generalized esprit,” in Proceedings of the 4th IEEE Conference on Industrial Electronics and Applications (ICIEA '09), pp. 1115–1120, Xi'an, China, May 2009. View at: Publisher Site  Google Scholar
 J. Liang, S. Yang, J. Zhang, L. Gao, and F. Zhao, “4D nearfield source localization using cumulant,” EURASIP Journal on Advances in Signal Processing, vol. 2007, Article ID 17820, 10 pages, 2007. View at: Publisher Site  Google Scholar
 J. H. Holland, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, Complex Adaptive Systems, The MIT Press, Cambridge, Mass, USA, 1975.
 J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks (ICNN '96), vol. 4, pp. 1942–1948, Perth, Wash, USA, December 1995. View at: Publisher Site  Google Scholar
 R. Storn and K. Price, “Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997. View at: Publisher Site  Google Scholar
 Z. Fawad, I. M. Qureshi, J. A. khan, and Z. U. khan, “An application of artificial intelligence for the joint estimation of amplitude and twodimensional direction of arrival of far field sources using 2Lshape array,” International Journal of Antennas and Propagation, vol. 2013, Article ID 593247, 10 pages, 2013. View at: Publisher Site  Google Scholar
 M. AtiqueurRehman, F. Zaman, I. M. Qureshi, and Y. A. Shiekh, “Null and sidelobes adjustment of damaged array using hybrid computing,” in Proceedings of the IEEE International Conference on Emerging Technologies (ICET '12), pp. 483–484, Islamabad, Pakistan, October 2012. View at: Publisher Site  Google Scholar
 F. Zaman, I. Qureshi, A. Malik, and U. Khan, “Real time direction of arrival estimation in noisy environment using particle swarm optimization with single snapshot,” Research Journal of Applied Sciences, Engineering & Technology, vol. 4, no. 13, pp. 1949–1952, 2012. View at: Google Scholar
 F. Zaman, J. A. Khan, Z. U. Khan, and I. M. Qureshi, “An application of hybrid computing to estimate jointly the amplitude and direction of arrival with single snapshot,” in Proceedings of the 10th IEEE International Bhurban Conference on Applied Sciences and Technology (IBCAST '13), pp. 15–19, Islamabad, Pakistan, January 2013. View at: Publisher Site  Google Scholar
 F. Zaman, I. M. Qureshi, A. Naveed, J. A. Khan, and R. M. Asif Zahoor, “Amplitude and directional of arrival estimation: comparison between different techniques,” Progress in Electromagnetics Research B, vol. 39, pp. 319–335, 2012. View at: Publisher Site  Google Scholar
 F. Zaman, I. M. Qureshi, A. Naveed, and Z. U. Khan, “Joint estimation of amplitude, direction of arrival and rang of near field sources using memetic computing,” Progress in Electromagnetics Research C, vol. 31, pp. 199–213, 2012. View at: Publisher Site  Google Scholar
 T. W. Anderson, “Asymtotic theory of principal component analysis,” Annals of Mathematical Statistics, vol. 34, no. 1, pp. 122–148, 1963. View at: Publisher Site  Google Scholar
 R. A. Waltz, J. L. Morales, J. Nocedal, and D. Orban, “An interior algorithm for nonlinear optimization that combines line search and trust region steps,” Mathematical Programming, vol. 107, no. 3, pp. 391–408, 2006. View at: Publisher Site  Google Scholar
 S. J. Wright, PrimalDual InteriorPoint Methods, SIAM, Philadelphia, Pa, USA, 1997.
 V. Torczon, “On the convergence of pattern search algorithms,” SIAM Journal on Optimization, vol. 7, no. 1, pp. 1–25, 1997. View at: Publisher Site  Google Scholar
 B. Addad, S. Amari, and J.J. Lesage, “Genetic algorithms for delays evaluation in networked automation systems,” Engineering Applications of Artificial Intelligence, vol. 24, no. 3, pp. 485–490, 2011. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2014 Fawad Zaman and Ijaz Mansoor Qureshi. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.