[ieee 2005 13th ieee international conference on networks jointly held with the 2005 ieee 7th...
TRANSCRIPT
![Page 1: [IEEE 2005 13th IEEE International Conference on Networks Jointly held with the 2005 IEEE 7th Malaysia International Conf on Communic - Kuala Lumpur, Malaysia (16-18 Nov. 2005)] 2005](https://reader037.vdocuments.site/reader037/viewer/2022092708/5750a6831a28abcf0cba2baf/html5/thumbnails/1.jpg)
The HSLO(3)-FDTD With Direct-Domain and
Temporary-Domain Approaches On Infinite Space
Wave PropagationMohammad Khatim Hasan
Department of Industrial ComputingUniversiti Kebangsaan Malaysia
Bangi, Selangor, MalaysiaEmail: [email protected]
*Mohamed Othman, *Rozita Johari and+Zulkifly Abbas
*Department of CommunicationTechnology and Network
and +Department of PhysicsUniversiti Putra Malaysia
Serdang, Selangor, MalaysiaEmail: [email protected]
Jumat SulaimanDepartment of MathematicUniversiti Malaysia Sabah
Kota Kinabalu, Sabah, MalaysiaEmail: [email protected]
Abstract-In this paper, some numerical simulations by anew high-speed low order (3)-finite difference time domain(HSLO (3)-FDTD) method with direct-domain (DD) andtemporary-domain (TD) approaches are conducted to simulateone dimensional free space wave propagation represented bya Gaussian pulse. The simulation is conducted on 2 meter ofsolution domain truncated by a simple absorbing boundarycondition. The efficiency of the new schemes are analyzedand compared with the standard finite difference time domain(FDTD) method in terms of processing time, amplitude andglobal error. The new schemes (HSLO (3)-FDTD by bothapproaches) solve the problem faster and produce similar resultto the output simulated by the standard FDTD.
Keywords-FDTD; HSLO-FDTD; numerical simulationof wave propagation; direct-domain approach; temporary-domainapproach.
I. INTRODUCTIONAdvancement in electronic devices, such as wireless com-
munication devices is very crucial in today technology. Clas-sical "trial and error" design paradigm for electromagneticdevices is very costly in terms of money and time taken. Thesignificant advances in computer modeling of electromagneticinteractions in the last few decades have made possible toshift from the classical method to one that heavily relies oncomputer simulation. Computational electromagnetics (CEM)has been a great technological importance and due to this,it has become a central problem in present-day computationalscience. Industrial and engineering requirements have motivateadvances in computational electromagnetic fields. Beside that,recent advances in computer technology also motivate thefields. In computational electromagnetic, numerical methodplays an important role. The method facilitates the advance-ment of research in many fields. The electromagnetics phe-nomenon can be described by Maxwell equations.Maxwell equations can be solved either in time-domain or
frequency-domain. Furthermore, the numerical method can berepresented by partial differential equation (PDE) formulation
or integral equation (IE) formulation. In frequency domain,the most popular integral solver is the Method of Moment(MoM). This method reduces the volume of the problem spa-tial dimensions by one [1]. This gives advantages to solve threedimension problems by two dimensional methods. However,MoM results in a dense linear system of equations. Solvingthis system with Gauss elimination has the complexity ofo(N3), where the size of the matrix is N x N. One wayto solve this workload is through iterative method, whichis usually based on matrix-vector multiplication, with thecomplexity of O(N2). If the Maxwell equations in PDE form,which is the Hemholtz equation, the most common method isthe Finite Element Method (FEM)[2] and the Finite DifferenceMethod (FDM)[3]. Most of the FDM method use the iterativeapproaches.
In time domain, the methods for JIE have not been usedwidely. Most of the methods are called Marching-on-in-time(MOT). The method however prone to instability [4]. Howeverthe instability can be overcome by using implicit time steppingmethod. In the PDE formulation however have several popularmethod, which are the finite-difference time-domain (FDTD)[5], finite-volume time-domain (FVTD) [6] and finite-elementtime-domain (FETD)[7]. FVTD was introduced to CEM by[6]. The method is borrowed from method that is extensivelyused in computational fluid dynamics (CFD), whereas FETDmethod [8]based on variational fonnulation of the PDE. Boththe FVTD and FETD are very suitable for unstructured grid.Most of recent research in electromagnetic solve time-
domain problem because they can solve a problem for severalfrequencies in a single calculation. The FDTD method is themost applied method used in this domain. In CEM, FDTDrefers to finite difference approximation to the Faraday's andAmpere's laws using second order accurate in time and space.The method was first proposed by Yee [9]. He used an electricfield (E) which was offset both spatially and temporallyfrom a magnetic field grid to obtain update equations that
I-4244-0000-7/05/$20.00 ©2005 IEEE. 1002
![Page 2: [IEEE 2005 13th IEEE International Conference on Networks Jointly held with the 2005 IEEE 7th Malaysia International Conf on Communic - Kuala Lumpur, Malaysia (16-18 Nov. 2005)] 2005](https://reader037.vdocuments.site/reader037/viewer/2022092708/5750a6831a28abcf0cba2baf/html5/thumbnails/2.jpg)
yield the present fields throughout the computational domainin term of past fields. The method was further developed[10] to solve electromagnetic scattering from a dielectriccylinder. This method is the most commonly used to solveproblem in time-domain because of its simplicity and directlyadapted to homogeneous problem. Since then, the methodhas become one of the most powerful Maxwell equationssolver of electrodynamics. It has been implemented on variousapplications such as electromagnetic penetration problem [III,electromagnetic scattering of complex object [12], radar crosssection [13], anisotropic material [14], monopole antenna([15], [16]), dipoles wire, ([17], [181), radiation pattem [19],mobile antenna ([20], [21], [22]), microstrip antenna ([23],[24]), wireless LAN ([25], [26], [27], [28]), radiation fromcable ([29], [30]) and PEC scatterer [31]). However, there aredrawbacks in the method. One of the drawbacks is it needs along processing time to simulate problems.The algorithmic simplicity, robustness, and potential for
great volumetric complexity afforded by FDTD modeling haveprompted an extraordinary level of interest in this technique.One of the primary reasons for the widespread popularity ofFDTD is it computational efficiency. FDTD is also well suitedfor parallel implementation. Beside FDTD, Transmission LineMethod (TLM)[32] is an altemative method that can beimplemented in the time-domain.
II. SOME LITERATURE ON INCREASING THE SPEED OFFDTD METHOD
To increase the speed of the method, some researchersapply higher-order scheme in FDTD method. Lan, Liu andLin [33] have developed a second order accuracy in timeand fourth order in space. This new scheme is then com-pared to FDTD by modelling plane-wave pulse propagatingthrough free-space. Result show that the higher-order methodreduces the numerical dispersion and has improved stability.Georgakapoulus, Birtcher, Balanis and Renaut [34] apply theFDTD(2,4) to a wave propagating problem. They also applythe method to solve array analysis, cavity resonance, monopoleantenna coupling and personal electronic devices ([35], [36]).In the paper, they used the same gridding concept in [37].The only difference is that they implement FDTD(2,4) at thecoarser grid. Propokidis and Tsiboukis [38] have implementFDTD(2,4) to simulate a lossy dielectric problem. All ofthe experimental result shows that FDTD(2,4) can simulateaccurately with coarser grid mesh than the FDTD(2,2). Theimplementation of higher-order truncation to Maxwell equa-tions increase the complexity of the method, however bysolving the problem in coarser grid will increase the speedof the processing time.The advancement of multiprocessor technology also influ-
ence the development of high speed FDTD algorithms. Perlik,Opsahl and Taflove [39] develop Parallel Virtual Machine(PVM) FDTD code to predict scattering of electromagneticfields on a Connection Machine (CM). The Maxwell equationsonto a massively single instruction multiple data (SIMD)parallel architecture. The machine is located at Cambridge
University. Rodohan and Saunders [40] implement a PVMparallel FDTD algorithm on network of Transputers to sim-ulate electromagnetic waves of a rectangular antenna. Theparallel machine consist of several type of heterogeneousworkstations with SIMD architechture. Jensen, Fijany andRahmat-Samii [20] proposed a new design of parallelism, inboth spatial and time. They solve circular scatterer but thedesign is merely analyzed theoretically. Nguyen, Zook andZhang [41] solve electromagnetic scattering problem usingdomain decomposition FDTD with heterogeneous network ofworkstation which composes of 4 SUN SPARCstation andfour IBM RS/6000. Schiavone, Codreanu, Palaniappan andWahid [42] implement PVM parallel FDTD code on Beowulfcluster to solve printed dipole antenna. The machine locatedat University of Central Florida. Guiffaut and Mahdjoubi[43] develop Message-Passing-Interface (MPI)FDTD code tocalculate the near and far field data. The experiment wasperformed on the CRAY T3E machine. Zhenghui, Benqing andZejie [44] describe the strategy used for parallel implementa-tion of the FDTD algorithm on cluster of workstation withtwo heterogeneous PC (Pentium-II 266/64Mb and Pentium-II 200/64Mb) and a workstation by PVM parallel softwareto solve one dimensional free space problem. Yang, Liao,Jen and Xiong [45] proposed new design of decompositionfor implementing parallel FDTD on domain decompositionusing MPI library to analyze coupling model of pulse intoslot. The researcher decompose the whole domain into severalsub-domains according to features of the problem. Moreover,each sub-domain may have its own lattices independently tosuit the special shapes. Araujo, Santos, Sobrinho and Rocha([46], [47]) analysis a monopole antenna and horn antennausing MPI library.
In this research, we increase the speed of FDTD processingtime via different approach. The new method which is calledthe High Speed Low Order (3) FDTD (HSLO(3)-FDTD)method will solve a one dimensional wave propagating in freespace problem on the same mesh size used by the standardFDTD using a single processor machine.
III. FREE SPACE MAXWELL EQUATIONS
Let's consider the Maxwell equations for free space below.
&E 1_ IV x H
At EO
aH 1=_ Iv x EAt Po
(1)
(2)
where E,H,Eo and ,a0 are the electric fields, magnetic fields,electric permittivity and magnetic permeability, respectively.For one-dimensional case using E, and Hy, the Eqs. (1) and(2) become
(9Ex 1 09Hy=E_ 1OH
Ot EO az
yHy 1 9ExAt PO Oz
(3)
(4)
1003
![Page 3: [IEEE 2005 13th IEEE International Conference on Networks Jointly held with the 2005 IEEE 7th Malaysia International Conf on Communic - Kuala Lumpur, Malaysia (16-18 Nov. 2005)] 2005](https://reader037.vdocuments.site/reader037/viewer/2022092708/5750a6831a28abcf0cba2baf/html5/thumbnails/3.jpg)
These are the equations of a plane wave with the electric fieldoriented in the x-direction, magnetic field in the y- direction,and travelling in the z-direction. For further details, see [481.
IV. HIGH SPEED Low ORDER (3) FINITE-DIFFERENCETIME-DOMAIN METHOD
The HSLO(3)-FDTD method was developed by borrowingthe concept implemented in Modified Explicit Group(MEG)introduced recently by Othman and Abdullah [49], which isthe extension of the concept of the half-sweep iterative methodpropose by Abdullah [50] through the Explicit DecoupledGroup (EDG) iterative method. Both of the Modified ExplicitGroup and the Explicit Decoupled Group are classified asiterative method and was used to solve eliptic type of problem.
In this research, we modify the concept used in MEGmethod and apply it to develop HSLO-FDTD for solving thefree space Maxwell equations in time-domain. The iterativeconcept in MEG is ignored because there is no matrix inHSLO-FDTD method to be solved. By taking central differ-ence approximations as below,
5F(i) Fn((i + it) - Fn(i - m2 ) O(A2) (5)6x mAX
for spatial derivatives and
6F(i) = Fn+ (i) +O(At2) (6)It At ( y6
for temporal derivatives in (3) and (4) yields
+ 2 (k)A\t
H n (k + m2 )-H&(k- m)m2e )A,I
H +(k + m) -Hyn(k + m ) EX+ (k + m)Exn (k)At miioAx
(8)By rearranging Eqs. (7) and (8) above the same way asstandard FDTD scheme, yields
2k2 2 (- k) (k+m)-Hy (k- (9)
H5'+l (k+2) = Hyn(k 2 )_t (E+x (k±m)-n-K+ (k))(10)
where= At
which m is odd number. See that (9) and (10) is a generalizedform of FDTD method where when m = 1, it is the standardFDTD, when m = 3, it is the HSLO(3)-FDTD, when m = 5,it is the HSLO(5)-FDTD, and so on. By using Eq. (9) and(10), we only calculate m of node points in the entire solutiondomain from 0 to T time steps.
In this paper, Eq. (9) and (10) with m = 3, will be usedto solve problem in solution domain given by Fig.l(b) withthe black square and circle is the magnetic and electric fields
.-... p.... u*- --u-@-u
(a)
(b)
Fig. 1. a) Solution domain for standard FDTD method and (b) Solutiondomain for HSLO(3)-FDTD method
have to be solved in the main HSLO(3)-FDTD algorithm.The uncalculated node will be solved later only at T byusing weighted average after the entire black node have beencalculated. The standard FDTD will be executed on solutiondomain given by Fig. l(a).
V. DIRECT-DOMAIN AND TEMPORARY-DOMAINALGORITHM
The HSLO(3)-FDTD can be implemented in direct-domain(DD) and temporary-domain(TD) algorithms. The al-gorithm for HSLO(3)-FDTD will be illustrated in Algo. 1 andAlgo. 2 with D* = -At = 0.5. From both algorithmsbelow (Algo. 1 and 2), we can see that both algorithms havethe same complexity which is G( NpNt), where Np is thenumber of grid points and Nt is the number of time step.
Transform Actual Solution Domain,Np toNTemporary Solution Domain,' p
Loop for T from 0 to NtLoop for i from O to N3p
Ex= -E_3 * (Hy+j - Hyi)End LoopGaussian Pulse,Ex = e-05*(Setting ABC BoundaryLoop for i from 0 to Np
Hy= H, - Dt * (Exi - Exi-1)3n *ooEnd Loop
End LoopTransform Temporary Solution Domain, "P to'3
Actual Solution Domain,NpCalculate remaining grid point in solution domain
Algo. 1. HSLO(3)-FDTD (TD) Algorithm.
Loop for T from 0 to NtLoop for i from 1,(i + 3) to Np
EX = Dt *(Yi+2 - Hyi-1)End LoopGaussian Pulse,Ex e-Setting ABC BoundaryLoop for i from O,(i + 3) to Np
Hyi = Dtu- L * (EXi+4-EXilEnd Loop
End LoopCalculate remaining grid point in solution domain
1004
![Page 4: [IEEE 2005 13th IEEE International Conference on Networks Jointly held with the 2005 IEEE 7th Malaysia International Conf on Communic - Kuala Lumpur, Malaysia (16-18 Nov. 2005)] 2005](https://reader037.vdocuments.site/reader037/viewer/2022092708/5750a6831a28abcf0cba2baf/html5/thumbnails/4.jpg)
Algo. 2. HSLO(3)-FDTD (DD) Algorithm.
We further analyze the complexity of both algorithms bynumber of arithmetic operation for addition/substraction(ADD/SUB) and multiplication/division (MUL/DIV). Thesummary of arithmetic calculation for FDTD, HSLO(3)-FDTD(DD) and HSLO(3)-FDTD(TD)are as Table 1.
TABLE ICOMPARISON OF FDTD, HSLO(3)-FDTD(DD) AND
HSLO(3)-FDTD(TD) ARITHMETIC COMPLEXITY
Arithmetic OperationMethod ADD/SUB MUIJDIVFDTD 4NpNt 2NpNtHSLO(3)-FDTD(DD) 4N9Nt + 2NE 2NpNt + 2Er4.3t 3 2N1 2N3HSLO(3)-FDTD(TD) 4EN + Np P2N + + I1 3 3
From Table 1, we can calculate relative gain by bothHSLO(3)-FDTD algorithms to standard FDTD. The formu-lation of gain for both method are as below.Relative gain (ADD/SUB) for HSLO(3)-FDTD(DD),
Gr(ADD/SUB) =2 1
and relative gain (ADD/SUB) for HSLO(3)-FDTD(TD),
Gr(ADD/SUB) = 2-3and taking the limit Nt -X oo, we obtain the percentage gainof 67% for both HSLO(3)-FDTD algorithms and relative gain(MUL/DIV) for HSLO(3)-FDTD(DD),
Gr(MUL'DIV) = 2 1
and relative gain (MUL/DIV) for HSLO(3)-FDTD(TD),2 1 1
Gr(MUL/DIV) =
and again taking the limit Nt -* oo, we obtain the percentagegain of 67% for both HSLO(3)-FDTD algorithms. As thecomplexity is the major contributor to processing time, we
predict that the maximum relative reduction in processing timefor both HSLO(3)-FDTD algorithms are 67%.
VI. NUMERICAL EXPERIMENT AND RESULTSThe effectiveness of HSLO(3)-FDTD method is analyzed
by executing a one dimensional free space wave propagationproblem with Gaussian pulse as the point source. We willgenerate a Gaussian pulse at the middle of the solutiondomain of 2 meter, truncated with simple absorbing boundarycondition. To ensure the accuracy of the simulated result, thesolution domain is discretize into 600 grid points with cellsize of 0.0033 meter and time slice of 5.5 x 10-12 ns. Theexperiment was run on Intel Pentium 3 of Mobile CPU 1 GHz727 MHz 256 MB of RAM with LINUX operating system.The result of simulation is given in Fig. 2 and 3. From
those figures, both HSLO(3)-FDTD algorithms results are
Fig. 2. Wave propagation from the centre of solution domain at Ins
Fig. 3. Wave propagation from the centre of solution domain at 4.4 ns
very similar with standard FDTD. These figures (Fig. 2 &3) shows the behavior of wave propagation in free space fromthe point source until being absorbed by the the absorbingboundary. However, there exist a small reduction in accuracyof approximation by HSLO(3)-FDTD method. The reductionin accuracy are shown in Fig. 3 & 4 as global error inpower density unit. From the figure, we found that HSLO(3)-FDTD(DD) has better accuracy than HSLO(3)-FDTD(TD) butHSLO(3)-FDTD(TD) method approximate amplitude similarto standard FDTD (refer Fig. 5) than HSLO(3)-FDTD(DD).The comparison of processing time is given in Fig. 6. and
we can see that both new schemes simulate the problem fasterthan the standard FDTD scheme with 49.99% to 61.77%reduction in processing time for HSLO(3)-FDTD(DD) and44.50% to 60.100% reduction in processing time for HSLO(3)-FDTD(TD). As mention before, it is expected that the max-
imum reduction in processing time gain by both HSLO(3)-FDTD approaches are 67%.
VII. CONCLUSION AND FUTURE RESEARCH
The HSLO(3)-FDTD method give us the opportunity tosolve 1 grid point of the solution domain in the main loop of
1005
0.05i -~~~~~FOTD
X HSLO3)-FDTD(DD)0 04 HSLO"3?FDTlDITDI
IA~~~~~~~~~~~~~~~~~~~~~~~~~~~~P
0.02--,As003 jA
t 0.01 A A'AlAAA60.00 A.--.
002 n [ 7 171 205 239 273 307 341 375 409 443 3
IA: I~~VA
-0.03 l A
-0.04 AA
-0.05Grid points
![Page 5: [IEEE 2005 13th IEEE International Conference on Networks Jointly held with the 2005 IEEE 7th Malaysia International Conf on Communic - Kuala Lumpur, Malaysia (16-18 Nov. 2005)] 2005](https://reader037.vdocuments.site/reader037/viewer/2022092708/5750a6831a28abcf0cba2baf/html5/thumbnails/5.jpg)
Fig. 4. Global error for HSLO(3)-FDTD(DD) and HSLO(3)-FDTD(TD)tostandard FDTD methods before absorbed by ABC
-.FDTDH*HSL0(3}-FDTD(DD0)
0.00 * HSLO(3)-FDTD(TD)I!
1.00
1.00
0.99 0-" ~ ~ ~ "0.99
.1. 2.2 3.3Tinmes)
Fig. 5. Amplitude for standard FDTD, HSLO(3)-FDTD(DD) and HSLO(3)-FDTD(TD)
20 -
18 - -- HSLO3)-FDTD(DD)0 16 -HSLO(3)-FDTD(TD)
r_ 16 - - =
0 4-14
10
0.6
0
2 -
1.1 2.2 3.3 44Time (ns)
HSLO(3)-FDTD and the remaining point only at the requiredtime step. This approach will increase the speed of FDTDalgorithm. The Performance of this scheme was tested forproblem in one dimensional free space propagation with ABCboundary condition. The major advantages of this schemeis that it requires less processing time and less complexityalgorithm than the existing FDTD scheme but there exista small reduction in its accuracy. It is clearly shown thatHSLO(3)-FDTD by both approaches are better than standardFDTD in one-dimension for free space wave propagatingsimulation.
In this paper, we demonstrate the effectiveness of thenew method on free space wave propagation with simpleabsorbing boundary via direct-domain and temporary-domainapproach. Both approach show tremendous result in simulatingproblems. In the near future, we will apply this method for twodimensional problem.
ACKNOWLEDGMENT
The authors would like to thank the Govemment ofMalaysia, Public Service Department of Malaysia and Uni7versiti Kebangsaan Malaysia for the first author study leavesand sponsorship.
REFERENCES
[11 J.J.H. Wang, Generalized moment methods in electromagnetics, fonnula-tion and computer solution of integral equations. John Wiley and SonsInc, 1991.
[21 J.L. Volakis, A. Chatterjee, and L.C. Kempel, Finite element methodforelectromagnetics, antennas, microwave circuits and scattering applica-tions, IEEE Press, 1998.
[3] M.N.O. Sadiku, Numerical techniques in electromagnetics, CRC Press,2nd edition, 2001.
[41 B.P. Rynne and P.D. Smith, "Stability of time marching algorithms forthe electric field integral equations", Journal of Electromagnetic WavesApplication, vol. 12, pp. 1181-1205, 1990.
[51 A. Taflove, Computational electrodynamics: The finite-difference time-domain method, Artech House, 2nd edition, 2000.
[6] V. Shankar, W. Hall, and H. Mohammadian, "A cfd-based finite volumeprocedure for computational electromagnetics-interdisciplinary applica-tions of CFD methods", AIAA, pp. 551-564, 1989.
[7] P.P. Silvester and R.L. Ferrari, Finite elements for electrical engineers,Cambridge University Press, 2nd edition, 1990.
[8] J.F. Lee, R. Lee and A. Cangellaris, 'Time-domain finite-element meth-ods", IEEE Trans. Antenna and Propagations, vol. 45, pp. 430-442,March 1997.
[9] K.S. Yee, "Numerical solution of initial boundary value problems involv-ing maxwell's equations in isotropic media",IEEE Tran. Antennas Prop.,vol. 14, pp.302-307, March 1966.
[10] A. Taflove and M. Brodwin, "Numerical solution of steady stateelectromagnetic scattering problems using the time-dependent maxwell'sequations", IEEE Tran. Micro. Theo. Tech., vol. 23, pp.623-730, August1975.
[11] A. Taflove, "Application of the finite-difference time-domain methodto sinusoidal steady state electromagnetic-penetration problems", IEEETrans. Electromagnetic Compatibility, vol. 22, pp. 191-202, March 1980.
[12] K. Umashankar and A. Taflove, "A novel method to analyze electro-magnetic scattering og complex objects", IEEE Trans. ElectromagneticCompatibility, vol. 24, pp. 398-405, April 1982.
[131 A. Taflove, K. Umashankar and T.G. Jurgens, "Validation of FDTDmodelling of the radar cross section of three-dimensional structuresspanning up to nine wavelengths", IEEE Trans. Antenna Prop., vol. 33,pp. 662-666, June 1985.
[14] J.B. Schneider and S. Hudson, "The finite-difference time-domainmethod applied to anisotropic material", IEEE Trans. Antennas and Prop.,vol. 41, pp. 994-999, July 1993.
1006
1 .60E-05 -HSLO(3)-FDT0(DDj
1.40E-05
1 .20E-05
° 1.0E-05
n 8.OOE-06
6.OOE-06 -
4.OOE-06
2.OOE-06
O.OOE+001.1 2.2 3.3
Time(ns)
Fig. 6. Comparison of HSLO(3)-FDTD(DD), HSLO(3)-FDTD(TD)standard FDTD processing time
![Page 6: [IEEE 2005 13th IEEE International Conference on Networks Jointly held with the 2005 IEEE 7th Malaysia International Conf on Communic - Kuala Lumpur, Malaysia (16-18 Nov. 2005)] 2005](https://reader037.vdocuments.site/reader037/viewer/2022092708/5750a6831a28abcf0cba2baf/html5/thumbnails/6.jpg)
[15] J.G. Maloney, G.S. Smith and W.R.J. Scott, "Accurate computation ofthe radiation from simple antennas using the finite-difference time-domainmethod", IEEE Trans. Antenna and Prop., vol. 38, pp.1059-1068, July1990.
[16] P.A. Tirkas, C.A. Balanis, M.P. Purchine and G.C. Barber, "Finite-difference time-domain method for electromagnetic radiation, interfer-ence, and interaction with complex structures", IEEE Transactions onElectromagnetic Compatibility, vol. 35, pp. 192-203, February 1993.
t17] R.J. Luebbers and K. Kunz, "Finite difference time domain calculationsof antenna mutual coupling", IEEE Trans. Electromagnetic Compatibility,vol. 34, pp. 357-359, March 1992.
[181 R.J. Luebbers, J. Beggs and K. Chamberlain, "Finite difference time-domain calculation of transients in antennas with nonlinear loads", IEEETrans. Antennas and Prop., vol. 41, pp.566-573, May 1993.
[19] P.A. Tirkas and C.A. Balanis, "Finite-difference time-domain methodfor antenna radiation", IEEE Trans. Antennas and Prop., vol. 40, pp.334-340, March 1992.
[20] M.A. Jensen, A. Fijany and Y. Rahmat-Samii, "Time-parallel computa-tional strategy for FDTD solution of maxwell's equations", AP-S. Digest,vol. 1, pp.380-383,1994.
[211 M. Hussein and A. Sebak, "Application of the finite-difference timedomain method to the analysis of mobile antennas", IEEE Transactionson Vehicular Technology, vol. 45, pp. 417-426, March 1996.
[22] N. Patwari and A. Safaai-Jazi, "High-gain low-sidelobe double-veedipoles", IEEE Transactions on Antennas and Propagation, vol. 48, pp.333-335, March 2000.
[23] R.J. Luebbers and H.S. Langdon, "A simple feed model that reduce timesteps needed for fDTD antenna and microstrip calculations", IEEE Trans.Antennas and Prop., vol. 44, pp. 1000-1005, July 1996.
[241 S.C. Gao, L.W. Li, M.S. Leong and T.S. Yeo, "Analysis of an H-shapedpatch antenna by using the FDTD method", PIER, vol. 34, pp. 165-187,2001.
[25] V. Radisic, Y. Qian and T. Itoh, "Novel architechtures for high-efficiencyamplifiers for wireless applications", IEEE Trans. Antenna and Prop., vol.46, pp. 1901-1909, Nov. 1998.
[26] E. Vasilyeva and A. Taflove, "A compact dual-band antenna for portablewireless communications", Proceeding ofIEEE Antenna & PropagationSociety International Symposium, vol. 1, pp. 262-265, 2000.
[271 A. Rennings, R. Muller, S. Otto, P. Waldow and I. Wolff, "A novelintegrated dual-band antenna for all relevant wireless-LAN standards(IEEE 802.11a, b and g)", Proceeding of 33rd European MicrowaveConference, pp. 1263-1266, 2003.
[28J G. Cakir and L. Sevgi, "Design, simulation and tests of a low-costmicrostrip patch antenna arrays for the wireless communication", TurkJournal of Electrical Engineering, vol. 13, pp. 93-103, January 2005.
[29] J.J. Boonzaaier and C.W.I. Pistonius, "Finite difference time-domainfield approximations for thin wires with a lossy coating", 1EE Proceedingon Microwave and Antenna Propagation, vol. 141, pp. 107-113, February1994.
[301 D.M. Hockanson, J.L. Drewniak, T.H. Hubing and T.P. Doren, "FDTDmodelling of common-mode radiation from cables", IEEE Trans. Elec-tromagnetic and Compatibility, vol. 38, pp. 376-387, March 1996.
[31] V. Anantha and A. Taflove, "Calculation of diffraction coefficients ofthree-dimensional infinite conducting wedges using FDTD", IEEE Trans.Antennas and Prop., vol. 46, pp. 1755-1756, Nov. 1998.
[32] W.J.R. Hoefer, "The transmission-line matrix method and applications",IEEE Trans. Micro. Theory and Tech., vol. 33,pp. 882-893, Oct. 1985.
[331 K. Lan, Y. Liu and W. Lin, "Higher order (2,4) scheme for reducingdispersion in FDTD algorithm", IEEE Tran. on Electromag. Comp., vol.41, pp.160-165, Feb. 1999.
[34] S.V. Georgakopoulos, C.R. Birtcher, C.A. Balanis and R.A. Renaut,"Higher-order finite difference schemes for electromagnetic radiation,scattering, and penetration, part 1: theory", IEEE Antennas Prop. Mag.,vol. 44, pp.134-142, January 2002.
[351 S.V. Georgakopoulos, R.A. Renaut, C.A. Balanis and C.R Birtcher"A hybrid fourth-order FDTD utilising a second-order FDTD subgfid",IEEE Microwave and Wireless Components Letters., vol. I1, pp. 462-464,November 2001.
[36] S.V. Georgakopoulos, C.R. Birtcher, C.A. Balanis and R.A. Renaut,"Higher-order finite difference schemes for electromagnetic radiation,scattering, and penetration, part 2: applications", IEEE Antennas Prop.Mag., vol. 44, pp. 92-100, February 2002.
[37] M.W. Chevalier, R.J. Luebbers and V.P. Cable, " FDTD local grid with
material traverse", IEEE Trans. Antennas and Prop., vol. 45, pp. 411-421,March 1997.
[381 K.P. Propokidis and T.D. Tsiboukis, "Higher-order FDTD(2,4) schemefor accurate simulations in lossy dielectrics", Electronic Letters, vol. 39,pp. 835-836, Nov. 2003.
[39] A.T. Perlik, T. Opsahl and A. Taflove, "Predicting scattering of elec-tromagnetic fields using FDTD on a connection machine", IEEE Trans.Magnetics, vol. 25, pp. 2910-2912, Aprill 1989.
[40] D.P. Rodohan and S.R. Saunders, "Parallel implementations of thefinite difference time domain (FDTD) method", CodIt. Conf Camp.Electromagnetics, pp.367-370, 1994.
[411 S.T. Nguyen, B.J. Zook and X. Zhang, "Distributed computation ofelectromagnetic scattering problems using finite-difference time-domainecompositions. IEEE Proc.-High Perfonn. Distrib. Comp., pp.85-93,1994.
[42] G.A. Schiavone, 1. Codreanu, R. Palaniappan and P. Wahid, "FDTDspeedups obtained in distributed computing on a Linux workstationcluster", Proceeding of IEEE Antennas and Propagations Society Inter-national Symposium, vol. 3, pp. 1336-1339, 2000.
[43] C. Guiffaut and K. Mahdjoubi, " A parallel FDTD algorithm using theMPI library", IEEE Antennas and Propagation Magazine, vol. 43, pp.94-103, February 2001.
[44] X. Zhenghui, G. Benqing, and Z. Zejie, "A strategy for parallel imple-mentation of the FDTD algorithm", 2002 3rd International Symposiumon Electromagnetic Compatibility, pp.259-263, 2002.
[451 D. Yang, C. Liao, L. Jen and J. Xiong, "A parallel FDTD algorithmbased on domain decomposition method using the MPI library", Proc.Intern. Conf. on Par and Distrib. Comp.> App. and Tech., 2003, pp.730-733, 2003.
[46 J.S. Araujo, R.O. Santos, C.L.S.S. Sobrinho, J.M. Rocha, L.A. Guedesand RY. Kawasaki, " Analysis of antennas by FDTD method usingparallel processing with MPI", Proceedings of the 2003 SBMO/IEEEM77-S International on Microwave and Optoelectronics Conference, pp.1049-1054, 2003.
[47] J.S. Araujo, R.O. Santos, C.L.S.S. Sobrinho, J.M. Rocha, L.A. Guedesand RY. Kawasaki, " Analysis of monopole antenna by FDTD methodusing Beowulf cluster", Proceedings of the 17th International Conferenceon Applied Electromagnetics and Communications 2003, pp. 437-440,2003.
[48] A. Taflove, Computational Electrodynamics: The Finite-Difference Time-Domain Method. Artech House,lst edition, 1995.
[49] M. Othman and A.R. Abdullah, "An efficient four points modifiedexplicit group poisson solver", Intern. Jour Comp. Math., vol. 76, pp.203-217, 2000.
[501 A.R. Abdullah, "The four point explicit decoupled group (EDG) method:a fast poisson solver," International Journal Computer Mathematics. vol38,pp.61-70, 1991.
1007