Research Article  Open Access
Guohua Wang, Yufa Sun, "A Hybrid Approach for Fast Computation of Multiple Incident Angles Electromagnetic Scattering Problems with Compressive Sensing and Adaptive Cross Approximation", International Journal of Antennas and Propagation, vol. 2016, Article ID 1416094, 6 pages, 2016. https://doi.org/10.1155/2016/1416094
A Hybrid Approach for Fast Computation of Multiple Incident Angles Electromagnetic Scattering Problems with Compressive Sensing and Adaptive Cross Approximation
Abstract
A hybrid compressive approach for fast computation of the electromagnetic scattering problems with multiple incident angles is proposed. The compressive sensing (CS) technique is firstly introduced to the method of moment (MoM) to reduce the number of the righthand sides (RHS), but since the resulting excitation matrix contains linear dependency and has lowrank characteristics, the adaptive cross approximation (ACA) algorithm is used to recompress such excitation matrix, keeping only the necessary physical information. The hybrid compressive approach can reduce the number of the RHS to lower level. In fact, the ratio of the number of the RHS between the compressed excitation matrix and the original excitation matrix in the conventional MoM is close to one to fifteen. Numerical results are presented to validate the efficiency and accuracy of this method, which turns out to be highly efficient and accurate for the solution to multiple incident angles electromagnetic scattering problems.
1. Introduction
Accurate and efficient analysis of the electromagnetic scattering with multiple incident angles has attracted increasing attention from academia and industry. The method of moment (MoM) [1, 2] together with iterative methods is often used for the accurate analysis of electromagnetic scattering problems, and some fast algorithms like the multilevel fast multipole algorithm (MLFMA) [3], the adaptive integral method (AIM) [4], and the adaptive cross approximation (ACA) [5, 6] are generally applied to reduce both the computation time and the memory requirements for electrically large radiation and scattering problems. But, for the problems with multiple incident angles, the above methods become timeconsuming due to the presence of multiple righthand side (RHS) problems.
An efficient method to accelerate the solution to multiple RHS problems is to remove redundancies in the initial excitation and reduce the number of RHS. In [7, 8], the compressive sensing (CS) theory [9, 10] was introduced into the traditional MoM to solve wideangle monostatic scattering problem of 2D targets. In [11], the CS technique was used to analyze the multistatic scattering problems. In this paper, a new excitation matrix is firstly constructed with smaller RHS number than traditional MoM, and the measurement values of the induced current coefficients can be calculated by direct method or iterative method. Finally, true current coefficients can be reconstructed by a recovery method such as the orthogonal matching pursuit (OMP) [12] algorithm. However, the number of the measurement values and sparse transformation base in the CS are difficult to determine according to different scattering targets. In [7], to balance the computational complexity and the accuracy, the number of measurements was set to 24. To reduce the number of measurements to a lower level than the CS technique, a hybrid compressive method named CSACA is advised. Such method utilizes the lowrank characteristics of the new excitation matrix generated by the CS. The CS technique is firstly used with a reduced number of RHS; then the ACA algorithm is introduced into CS to recompress the new excitation matrix so as to reduce the number of RHS further, so as to realize the efficient calculation of the multiple excitation 3D electromagnetic problems.
2. A Hybrid Compressive Technique of the Excitation Matrix
2.1. Compressive Sensing Theory
The CS theory exploits the inherent scarcity or compressibility features of the signal in some transform basis and directly samples the most important information of the signal at the rate far below Nyquist rate [13]. The original signal can be reconstructed accurately by solving an optimization problem.
Let represent a discrete signal of length , which can be expanded as a linear combination of a set of standard orthogonal bases :where is a set of basis functions in orthogonal basis and is the expanded complex coefficients vector of signal. represents the transpose operation. If can be represented by combination of only nonzero entries and , it can be named sparse [14] in field. Assume that is onedimensional signal of length and is the number of measurements. By constructing dimensional measurement matrix and computing inner products operation, we can obtain the observation signal , which is the linear measurement of the original signal . can also be seen as the projection of a sparse signal in a low dimensional space:where the CS matrix is defined as dimensional matrix . Once the measurement has been obtained, a reconstruction algorithm is required to reconstruct the sparse signal from the measured vector of length . As the number of measurements is much smaller than the dimension of the original signal, the reconstruction process becomes an issue of solving the underdetermined equations, which generally has no determined solution. However, if satisfies strict restricted isometry property (RIP) [15] condition, this issue will have a determined solution, and the signal recovery issue can be converted to convex optimization algorithm; then the approximation of can be obtained by solving the norm minimization problem:
Finally, the original signal can be reconstructed as
2.2. Application of CS to Multiple Excitation Problems
In this paper, the MoM in the frequency domain is used to solve 3D electromagnetic scattering problems by solving the related electric field integral equations (EFIEs). By using RaoWiltonGlisson (RWG) vector basis functions [16] and employing Galerkin’s method of moments, the related EFIEs can be transformed into a dense, complex system of linear equations:where is the impedance matrix and is the number of unknowns. is the excitation matrix with plane waves and is the induced current density matrix. For various angles of incidence, computing responses became timeconsuming due to the presence of a multiple RHS problem. In order to reduce the number of RHS and accelerate the solution process, according to CS theory [7–11], new excitation is constructed as follows:in which the new source is formed by random superposition of the incident at different incident angles. Substituting into (5),
in which is the column vector of new excitation matrix . As the impedance matrix is not changed with incident angle, each column vector of can be described as
Rewriting and as dimensional row vector, (8) can be expressed as a matrix formin which is dimensional Gaussian random number matrix. Actually, can just be seen as the dimensional measurements of true induced current coefficients . On the other hand, according to CS theory [7–11], can also be written asin which is defined as CS matrix. Once the expanded complex coefficients matrix has been calculated by OMP, can be reconstructed accurately. As the induced current is sparse in orthogonal basis and the number of measurement values , the number of RHS in linear system equations is reduced.
2.3. Recompression of the RHS Excitation Matrix
As stated in previous works [7, 8], the new excitation matrix is formed by random superposition of various plane waves with different directions of incidence, which is of low rank and can be recompressed by a lowrank representation [17] algorithm to reduce the RHS to lower level than that by using CS method.
An efficient technique to achieve a matrix lowrank approximation is ACA algorithm, which has been introduced by Bebendorf in [5]. In 2005, the algorithm has been successfully applied to moderate electrical size scattering and radiation computations [6]. The ACA algorithm is purely algebraic in nature, kernel independent, and relatively easy to implement. Also, the algorithm does not require a priori knowledge of each impedance submatrix.
The new excitation matrix can be well approximated by the product of two fullrank matrixes using ACA method:where and and is the effective rank of new excitation matrix which is much smaller than the number of RHS. Induced current density matrix in (9) can be calculated approximately by exploiting the following expression:This expression reduces the computational effort massively, because the number of RHS is equal to the rank , which is much smaller than the initial number of RHS in (5).
3. Numerical Results
To test the performance of the new method, the scattering characteristics of differently shaped objects are presented and compared with those obtained by using the traditional MoM solution. The measurement matrix in the CS is set to Gaussian random matrix, orthogonal basis is set to discrete cosine transform matrix, the OMP is used as the recovery algorithm, and the ACA iteration error threshold is set to . Both examples are calculated on a PC with 3 GHz Intel Core 2 Duo CPU and 8 GB RAM (only one core is used). To provide a comparison between the original and the recovered current coefficients, the following relative root mean square error (RRMSE) is introduced:
3.1. NASA Almond Model
The scattering problem of a 252.3744 mm perfect electric conductor (PEC) Almond [18] at the frequency of 7 GHz is considered first. The surface of the Almond has been discretized by RWG basis functions with average edge length of , which requires 12621 unknowns. The model is illuminated by a set of incident plane waves with incident direction of and , where the angle interval for is . The monostatic radar cross section (RCS) is computed by using the CSACA method proposed in this paper. The CS technique is firstly applied with the measurement number , and then the new excitation matrix is recompressed by using the ACA, which can further reduce the number of RHS from to rank . The backscattering monostatic RCS in horizontally transmitted and horizontal received (HH) field polarization calculated by the CSACA method and the traditional MoM are shown in Figure 1.
The recovered current coefficients and the true current coefficients (computed by MoM) obtained using a RWG basis with multiple incident angles are shown in Figure 2.
As the effective rank of takes different values, the RRMSE varies with it. The relationship between the global RRMSE and the effective rank is presented in Figure 3, from which we can find that the CSACA method can reduce the number of RHS effectively with very low RRMSE.
High numerical accuracy of the current distributions makes it possible to obtain a reliable value of the nearfield distribution, as shown in [19], where the field generated by the surface currents lying on a Cartesian quadrant has been assessed in closed analytical form to evaluate the exact field distribution excited by current pulse basis functions. The spatial distribution of the electric field component at a distance above the Almond, computed using the proposed hybrid approach, is shown in Figure 4.
(a)
(b)
(c)
3.2. PEC Missile Model
The second example is a PEC missile model shown in Figure 5, which has a length of 9.91 m, a wingspan of 6.28 m, and a height of 2.19 m.
The HH polarization backscattering monostatic RCS is computed at the frequency of 300 MHz, which requires 25263 unknowns. The missile model is illuminated by a set of incident plane waves with the incident direction of and , where the angle interval for is . Firstly, the number of measurements in the CS is set to , and then the new excitation matrix generated by the CS is recompressed by the ACA, which can further reduce the RHS number to . The HH polarization backscattering monostatic RCS in plane calculated by the CSACA method in this paper and the MLFMA are shown in Figure 4. Recovered and true current coefficients obtained through using a RWG basis are shown in Figure 6, while the relationship between global RRMSE with rank of is shown in Figure 7. From this figure, it appears that the RRMSE is still very low when rank is greater than 14. From the above examples, we can conclude that the results obtained by the CSACA method are very accurate.
Table 1 lists the CPU time requirements of the proposed examples. It can be seen that the CSACA method has compressed much more CPU time demand than the conventional MoM implementation.

4. Conclusions
An efficient method to analyze the electromagnetic scattering problems with multiple incident angles based on the MoM technique has been presented. A hybrid compressive method using the CS technique and the ACA is introduced to compress the excitation matrix. The numerical results demonstrate that the adopted approach leads to very accurate RCS results. Furthermore, the ratio of the number of RHS between the compressed excitation matrix and the original excitation matrix in the conventional MoM is close to one to fifteen.
Competing Interests
The authors declare that they have no competing interests.
Acknowledgments
This work was supported by the National Natural Science Foundation of China (Grant no. 61172020), the Specialized Research Fund for the Doctoral Program of Higher Education of China (Grant no. 20123401110006), and the Fund for 211 Project of Anhui University, China (Grant no. ZYGG201202).
References
 R. F. Harrington, Field Computation by Method of Moments, Macmillan, New York, NY, USA, 1968.
 W. C. Gibson, The Method of Moments in Electromagnetics, CRC Press, Boca Raton, Fla, USA, 2007.
 J. Song, C. C. Lu, and W. C. Chew, “Multilevel fast multipole algorithm for electromagnetic scattering by large complex objects,” IEEE Transactions on Antennas and Propagation, vol. 45, no. 10, pp. 1488–1493, 1997. View at: Publisher Site  Google Scholar
 E. Bleszynski, M. Bleszynski, and T. Jaroszewicz, “AIM: adaptive integral method for solving largescale electromagnetic scattering and radiation problems,” Radio Science, vol. 31, no. 5, pp. 1225–1251, 1996. View at: Publisher Site  Google Scholar
 M. Bebendorf, “Approximation of boundary element matrices,” Numerische Mathematik, vol. 86, no. 4, pp. 565–589, 2000. View at: Publisher Site  Google Scholar  MathSciNet
 K. Zhao, M. N. Vouvakis, and J.F. Lee, “The adaptive cross approximation algorithm for accelerated method of moments computations of EMC problems,” IEEE Transactions on Electromagnetic Compatibility, vol. 47, no. 4, pp. 763–773, 2005. View at: Publisher Site  Google Scholar
 M. S. Chen, F. L. Liu, H. M. Du, and X. L. Wu, “Compressive sensing for fast analysis of wideangle monostatic scattering problems,” IEEE Antennas and Wireless Propagation Letters, vol. 10, no. 3, pp. 1243–1246, 2014. View at: Publisher Site  Google Scholar
 X.Y. Cao, M.S. Chen, and X.L. Wu, “Application of compressed sensing to solving 3D electromagnetic scattering problems over a wide angle,” in Proceedings of the International Conference on Microwave and Millimeter Wave Technology (ICMMT '12), pp. 720–723, Shenzhen, China, May 2012. View at: Publisher Site  Google Scholar
 R. G. Baraniuk, “Compressive sensing,” IEEE Signal Processing Magazine, vol. 24, no. 4, pp. 118–121, 2007. View at: Publisher Site  Google Scholar
 R. G. Baraniuk, V. Cevher, M. F. Duarte, and C. Hegde, “Modelbased compressive sensing,” Institute of Electrical and Electronics Engineers. Transactions on Information Theory, vol. 56, no. 4, pp. 1982–2001, 2010. View at: Publisher Site  Google Scholar  MathSciNet
 L. Carin, D. Liu, W. Lin, and B. Guo, “Compressive sensing for multistatic scattering analysis,” Journal of Computational Physics, vol. 228, no. 9, pp. 3464–3477, 2009. View at: Publisher Site  Google Scholar  MathSciNet
 T. T. Cai and L. Wang, “Orthogonal matching pursuit for sparse signal recovery with noise,” IEEE Transactions on Information Theory, vol. 57, no. 7, pp. 4680–4688, 2011. View at: Publisher Site  Google Scholar  MathSciNet
 E. J. Candés, “Compressive sampling,” in Proceedings of the International Congress of Mathematicians, pp. 1433–1452, European Mathematical Society, Madrid, Spain, 2006. View at: Google Scholar
 D. L. Donoho, “Compressed sensing,” IEEE Transactions on Information Theory, vol. 52, no. 4, pp. 1289–1306, 2006. View at: Publisher Site  Google Scholar  MathSciNet
 E. J. Candés, J. Romberg, and T. Tao, “Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information,” IEEE Transactions on Information Theory, vol. 52, no. 2, pp. 489–509, 2006. View at: Publisher Site  Google Scholar  MathSciNet
 S. M. Rao, D. R. Wilton, and A. W. Glisson, “Electromagnetic scattering by surfaces of arbitrary shape,” IEEE Transactions on Antennas and Propagation, vol. 30, no. 3, pp. 409–418, 1982. View at: Publisher Site  Google Scholar
 J. Shaeffer, “Direct solve of electrically large integral equations for problem sizes to 1 M unknowns,” IEEE Transactions on Antennas and Propagation, vol. 56, no. 8, pp. 2306–2313, 2008. View at: Publisher Site  Google Scholar  MathSciNet
 A. C. Woo, H. T. G. Wang, M. J. Schuh, and M. L. Sanders, “Benchmark radar targets for the validation of computational electromagnetics programs,” IEEE Transactions on Antennas and Propagation, vol. 35, no. 1, pp. 84–89, 1993. View at: Google Scholar
 R. Cicchetti, D. Caratelli, and A. Faraone, “Exact closedform expression of the electromagnetic field excited by a uniform current distribution lying on a Cartesian quadrant,” IEEE Transactions on Antennas and Propagation, vol. 61, no. 4, pp. 2142–2155, 2013. View at: Publisher Site  Google Scholar  MathSciNet
Copyright
Copyright © 2016 Guohua Wang and Yufa Sun. 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.