Conference Paper

Implementation of three-dimensional FPGA-based FDTD solvers: an architectural overview

EM Photonics, Inc.
DOI: 10.1109/FPGA.2003.1227265 In proceeding of: Field-Programmable Custom Computing Machines, 2003. FCCM 2003. 11th Annual IEEE Symposium on
Source: DBLP

ABSTRACT Maxwell's equations, which govern electromagnetic propagation, are a system of coupled, differential equations. As such, they can be represented in difference form, thus allowing their numerical solution. By implementing both the temporal and spatial derivatives of Maxwell's equations in difference form, we arrive at one of the most common computational electromagnetic algorithms, the Finite-Difference Time-Domain (FDTD) method (Yee, 1966). In this technique, the region of interest is sampled to generate a grid of points, hereafter referred to as a mesh. The discretized form of Maxwell's equations is then solved at each point in the mesh to determine the associated electromagnetic fields. In this extended abstract, we present an architecture that overcomes the previous limitations. We begin with a high-level description of the computational flow of this architecture.

0 Bookmarks
 · 
59 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: In order to take advantage of the significant benefits afforded by computational electromagnetic techniques, such as the finite-difference time-domain (FDTD) method, solvers capable of analyzing realistic problems in a reasonable time frame are required. Although software-based solvers are frequently used, they are often too slow to be of practical use. To speed up computations, hardware-based implementations of the FDTD method have been recently proposed. In this paper, we present our most recent progress in the area of FPGA-based 3D FDTD accelerators. Three aspects of the design are discussed, including the host-PC interface, memory hierarchy, and computational datapath. Implementation and benchmarking results are also presented, demonstrating that this accelerator is capable of at least three-fold speedups over thirty-node PC clusters.
    12th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM 2004), 20-23 April 2004, Napa, CA, Proceedings; 01/2004
  • [Show abstract] [Hide abstract]
    ABSTRACT: Although the importance of fast, accurate computational electromagnetic (CEM) solvers is readily apparent, how to construct them is not. By nature, CEM algorithms are both computationally and memory intensive. Furthermore, the serial nature of most software-based implementations does not take advantage of the inherent parallelism found in many CEM algorithms. In an attempt to exploit parallelism, supercomputers and computer clusters are employed. However, these solutions can be prohibitively expensive and frequently impractical. Thus, a CEM accelerator or CEM co-processor would provide the community with much-needed processing power. This would enable iterative designs and designs that would otherwise be impractical to analyze. To this end, we are developing a full-3D, hardware-based accelerator for the finite-difference time-domain (FDTD) method (K.S. Yee, IEEE Trans. Antennas and Propag., vol. 14, pp. 302-307, 1966). This accelerator provides speedups of up to three orders of magnitude over single-PC solutions and will surpass the throughputs of the PC clusters. In this paper, we briefly summarize previous work in this area, where it has fallen short, and how our work fills the void. We then describe the current status of this project, summarizing our achievements to date and the work that remains. We conclude with the projected results of our accelerator.
    Antennas and Propagation Society International Symposium, 2004. IEEE; 07/2004
  • [Show abstract] [Hide abstract]
    ABSTRACT: Modeling, simulation and optimization using com- puting tools are the core approach nowadays in science com- plementary to experiment and theory. Computational Fluid Dynamics (CFD) has evolved many years ago to simulate fluid physics by solving Navier-Stokes equations, or its simple variants, Euler equations. However, most problems spend many hours to get solutions even with expensive supercomputers or clusters. The long computation time required for fluid dynamics simulations has lead the industry to look for some alternatives. Field Programmable Gate Arrays (FPGAs) are becoming more and more attractive for high precision scientific computations. FPGA holds the potential to alleviate this situations. It is possible for an FPGA to configure hundreds of multipliers working concurrently. In this paper, the authors explain the design on implementing the one-dimensional Euler equations in hardware. Two designs with single and double floating-point arithmetic are developed in an FPGA. Synthesis results show that a single floating-point arithmetic design is consumed less area and memory usage, also operating at higher frequency. However, double-precision design is crucial for give a better accuracy of the result. I. INTRODUCTION
    01/2011;

Full-text (2 Sources)

View
54 Downloads
Available from
Jun 3, 2014