Thesis (PhD (Electrical and Electronic Engineering))--University of Stellenbosch, 2011. / ENGLISH ABSTRACT: This work considers the acceleration of matrix-based computational electromagnetic (CEM) techniques using graphics processing units (GPUs). These massively parallel processors have gained much support since late 2006, with software tools such as CUDA and OpenCL greatly simplifying the process of harnessing the computational power of these devices. As with any advances in computation, the use of these devices enables the modelling of more complex problems, which in turn should give rise to better solutions to a number of global challenges faced at present. For the purpose of this dissertation, CUDA is used in an investigation of the acceleration of two methods in CEM that are used to tackle a variety of problems. The first of these is the Method of Moments (MOM) which is typically used to model radiation and scattering problems, with the latter begin considered here. For the CUDA acceleration of the MOM presented here, the assembly and subsequent solution of the matrix equation associated with the method are considered. This is done for both single and double precision oating point matrices. For the solution of the matrix equation, general dense linear algebra techniques are used, which allow for the use of a vast expanse of existing knowledge on the subject. This also means that implementations developed here along with the results presented are immediately applicable to the same wide array of applications where these methods are employed. Both the assembly and solution of the matrix equation implementations presented result in signi cant speedups over multi-core CPU implementations, with speedups of up to 300x and 10x, respectively, being measured. The implementations presented also overcome one of the major limitations in the use of GPUs as accelerators (that of limited memory capacity) with problems up to 16 times larger than would normally be possible being solved. The second matrix-based technique considered is the Finite Element Method (FEM), which allows for the accurate modelling of complex geometric structures including non-uniform dielectric and magnetic properties of materials, and is particularly well suited to handling bounded structures such as waveguide. In this work the CUDA acceleration of the cutoff and dispersion analysis of three waveguide configurations is presented. The modelling of these problems using an open-source software package, FEniCS, is also discussed. Once again, the problem can be approached from a linear algebra perspective, with the formulation in this case resulting in a generalised eigenvalue (GEV) problem. For the problems considered, a total solution speedup of up to 7x is measured for the solution of the generalised eigenvalue problem, with up to 22x being attained for the solution of the standard eigenvalue problem that forms part of the GEV problem. / AFRIKAANSE OPSOMMING: In hierdie werkstuk word die versnelling van matriksmetodes in numeriese elektromagnetika (NEM) deur die gebruik van grafiese verwerkingseenhede (GVEe) oorweeg. Die gebruik van hierdie verwerkingseenhede is aansienlik vergemaklik in 2006 deur sagteware pakette soos CUDA en OpenCL. Hierdie toestelle, soos ander verbeterings in verwerkings vermoe, maak dit moontlik om meer komplekse probleme op te los. Hierdie stel wetenskaplikes weer in staat om globale uitdagings beter aan te pak. In hierdie proefskrif word CUDA gebruik om ondersoek in te stel na die versnelling van twee metodes in NEM, naamlik die Moment Metode (MOM) en die Eindige Element Metode (EEM). Die MOM word tipies gebruik om stralings- en weerkaatsingsprobleme op te los. Hier word slegs na die weerkaatsingsprobleme gekyk. CUDA word gebruik om die opstel van die MOM matriks en ook die daaropvolgende oplossing van die matriksvergelyking wat met die metode gepaard gaan te bespoedig. Algemene digte lineere algebra tegnieke word benut om die matriksvergelykings op te los. Dit stel die magdom bestaande kennis in die vagebied beskikbaar vir die oplossing, en gee ook aanleiding daartoe dat enige implementasies wat ontwikkel word en resultate wat verkry word ook betrekking het tot 'n wye verskeidenheid probleme wat die lineere algebra metodes gebruik. Daar is gevind dat beide die opstelling van die matriks en die oplossing van die matriksvergelyking aansienlik vinniger is as veelverwerker SVE implementasies. 'n Verselling van tot 300x en 10x onderkeidelik is gemeet vir die opstel en oplos fases. Die hoeveelheid geheue beskikbaar tot die GVE is een van die belangrike beperkinge vir die gebruik van GVEe vir groot probleme. Hierdie beperking word hierin oorkom en probleme wat selfs 16 keer groter is as die GVE se beskikbare geheue word geakkommodeer en suksesvol opgelos. Die Eindige Element Metode word op sy beurt gebruik om komplekse geometriee asook nieuniforme materiaaleienskappe te modelleer. Die EEM is ook baie geskik om begrensde strukture soos golfgeleiers te hanteer. Hier word CUDA gebruik of om die afsny- en dispersieanalise van drie gol eierkonfigurasies te versnel. Die implementasie van hierdie probleme word gedoen deur 'n versameling oopbronkode wat bekend staan as FEniCS, wat ook hierin bespreek word. Die probleme wat ontstaan in die EEM kan weereens vanaf 'n lineere algebra uitganspunt benader word. In hierdie geval lei die formulering tot 'n algemene eiewaardeprobleem. Vir die gol eier probleme wat ondersoek word is gevind dat die algemene eiewaardeprobleem met tot 7x versnel word. Die standaard eiewaardeprobleem wat 'n stap is in die oplossing van die algemene eiewaardeprobleem is met tot 22x versnel.

<p dir="ltr">This work introduces an innovative algorithm for co-simulating time-dependent Drift Diffusion (DD) equations with Maxwell\textquotesingle s equations to characterize semiconductor devices. Traditionally, the DD equations, derived from the Boltzmann transport equations, are used alongside Poisson\textquotesingle s equation to model electronic carriers in semiconductors. While DD equations coupled with Poisson\textquotesingle s equation underpin commercial TCAD software for micron-scale device simulation, they are limited by electrostatic assumptions and fail to capture time dependent high-frequency effects. Maxwell\textquotesingle s equations are fundamental to classical electrodynamics, enabling the prediction of electrical performance across frequency range crucial to advanced device fabrication and design. However, their integration with DD equations has not been studied thoroughly. The proposed method advances current simulation techniques by introducing a new broadband patch-based method to solve time-domain 3-D Maxwell\textquotesingle s equations and integrating it with the solution of DD equations. This technique is free of the low-frequency breakdown issues prevalent in conventional full-wave simulations. Meanwhile, it enables large-scale simulations with reduced computational complexity. This work extends the simulation to encompass the complete device, including metal contacts and interconnects. Thus, it captures the entire electromagnetic behavior, which is especially critical in electrically larger systems and high-frequency scenarios. The electromagnetic interactions of the device with its contacts and interconnects are investigated, providing insights into performance at the chip level. Validation through numerical experiments and comparison with results from commercial TCAD tools confirm the effectiveness of the proposed method. </p>

To investigate near-eld contributions for installed antennas, an in-house code iswritten to incorporate near-eld terms in Shooting and Bouncing Rays (SBR). SBRis a method where rays are launched toward an object and scatter using GeometricalOptics (GO). These rays induce currents on the object, from which the totalscattered eld can be found.To gauge the eect of near-eld terms, the in-house code can be set to excludenear-eld terms. Due to this characteristic, the method is named SBR Includingor Excluding Near-eld Terms (SIENT). The SIENT implementation is thoroughlydescribed. To make SIENT more exible, the code works with triangulated meshesof objects. Antennas are represented as near-eld sources, allowing complex antennasto be represented by simple surface currents. Further, some implementedoptimizations of SIENT are shown.To test the implemented method, SIENT is compared to a reference solution andcomparable commercial SBR solvers. It is shown that SIENT compares well to thecommercial options. Further, it is shown that the inclusion of near-eld terms actsas a small correction to the far-eld of the installed antenna. / För att undersöka närfältsbidrag för installerade antenner, har en kod skrivits för‌att ta med närfältstermer i Shooting Bouncing Rays (SBR). SBR är en metod där strålar (”rays”) skjuts mot ett object och sprids via Geometrisk Optik (GO). Dessa strålar inducerar strömmar på objectet, från vilka det totala sprida fältet kan hittas. För att undersöka bidraget från närfältstermer, så kan koden exkludera dessa. På grund av denna karaktär, kallas koden SBR Including or Excluding Near-field Terms (SIENT). Implementationen av SIENT beskrivs utförligt. För att göra SIENT mer flexibel, arbetar SIENT med triangulerade nät av objekt. Antenner representeras av närfältskällor, vilket låter komplexa antenner representeras med enkla yt-strömmar.Implementerade optimeringar av SIENT visas också.För att testa den implementerade metoden, jämförs SIENT med en referenslösning och jämförbara kommerciella SBR-lösare. Det visas att SIENT överensstämmer bra med kommerciella alternativ. Det visas också att närfältstermer agerar som enmindre korrektion till fjärrfältet av den installerade antennen.

The purpose of this thesis is to present solutions to overcome several key difficulties that limit the application of numerical modelling in communication cable design and analysis. In particular, specific limiting factors are that simulations are time consuming, and the process of comparison requires skill and is poorly defined and understood. When much of the process of design consists of optimisation of performance within a well defined domain, the use of artificial intelligence techniques may reduce or remove the need for human interaction in the design process. The automation of human processes allows round-the-clock operation at a faster throughput. Achieving a speedup would permit greater exploration of the possible designs, improving understanding of the domain. This thesis presents work that relates to three facets of the efficiency of numerical modelling: minimizing simulation execution time, controlling optimization processes and quantifying comparisons of results. These topics are of interest because simulation times for most problems of interest run into tens of hours. The design process for most systems being modelled may be considered an optimisation process in so far as the design is improved based upon a comparison of the test results with a specification. Development of software to automate this process permits the improvements to continue outside working hours, and produces decisions unaffected by the psychological state of a human operator. Improved performance of simulation tools would facilitate exploration of more variations on a design, which would improve understanding of the problem domain, promoting a virtuous circle of design. The minimization of execution time was achieved through the development of a Parallel TLM Solver which did not use specialized hardware or a dedicated network. Its design was novel because it was intended to operate on a network of heterogeneous machines in a manner which was fault tolerant, and included a means to reduce vulnerability of simulated data without encryption. Optimisation processes were controlled by genetic algorithms and particle swarm optimisation which were novel applications in communication cable design. The work extended the range of cable parameters, reducing conductor diameters for twisted pair cables, and reducing optical coverage of screens for a given shielding effectiveness. Work on the comparison of results introduced ―Colour maps‖ as a way of displaying three scalar variables over a two-dimensional surface, and comparisons were quantified by extending 1D Feature Selective Validation (FSV) to two dimensions, using an ellipse shaped filter, in such a way that it could be extended to higher dimensions. In so doing, some problems with FSV were detected, and suggestions for overcoming these presented: such as the special case of zero valued DC signals. A re-description of Feature Selective Validation, using Jacobians and tensors is proposed, in order to facilitate its implementation in higher dimensional spaces.