Sorry, you need to enable JavaScript to visit this website.

Divisione Impatti Antropici e del Cambiamento Climatico sul Territorio

  1. Home
  2. Produzione Scientifica
  3. Simulation of patch array antennas through the implementation of finite-difference time-domain (FD-TD) algorithm on distributed memory massively parallel systems

Simulation of patch array antennas through the implementation of finite-difference time-domain (FD-TD) algorithm on distributed memory massively parallel systems

TitoloSimulation of patch array antennas through the implementation of finite-difference time-domain (FD-TD) algorithm on distributed memory massively parallel systems
Tipo di pubblicazioneArticolo su Rivista peer-reviewed
Anno di Pubblicazione1998
AutoriPalazzari, P., D'Atanasio Paolo, and Ragusini F.
RivistaLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1401
Paginazione105-114
ISBN Number3540644431; 9783540644439
ISSN03029743
Parole chiaveAlgorithms, Antenna arrays, Computational power, Computer simulation languages, Directional patterns (antenna), Distributed Memory, Electromagnetic Fields, Electromagnetic process, Finite difference method, Finite difference time domain method, Massively parallel systems, Memory architecture, Microstrip antennas, Parallel implementations, Parallel processor, Patch array antennas, Slot antennas, Temporal and spatial evolutions, Time domain analysis
Abstract

The Finite Difference-Time Domain (FD-TD) method is widely used to simulate propagative electromagnetic processes. In this paper we describe the parallel implementation of this method on the massively SIMD parallel processor APE100/Quadrics, discussing the choice of such kind of architecture. The algorithm we implemented is tailored to simulate patch array antennas, giving as result the temporal and spatial evolution of the electromagnetic field generated by the simulated antenna as well as its radiation pattern. The measured results on a test case evidence an efficiency in the utilization of the computational power Ƞ1=10%, giving a sustained computation rate of 2.5 Gflops. A comparison with experimental data on a specific test case is shown to validate the implemented parallel code. © Springer-Verlag Berlin Heidelberg 1998.
Note

cited By 0
URLhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84957076476&partnerID=40&md5=65b8fa8a8d7c3a87bbe54f14fc0a47f4
Citation KeyPalazzari1998105