Field programmable gate array-assigned complex-valued computation and its limits
Journal Article
·
· Review of Scientific Instruments
- National Instruments, Ganghoferstrasse 70b, 80339 Munich (Germany)
- National Instruments, 11500 N MOPac Expy, Austin, Texas 78759 (United States)
- Institute of Applied Physics, TU Wien, Wiedner Hauptstrasse 8, 1040 Wien (Austria)
We discuss how leveraging Field Programmable Gate Array (FPGA) technology as part of a high performance computing platform reduces latency to meet the demanding real time constraints of a quantum optics simulation. Implementations of complex-valued operations using fixed point numeric on a Virtex-5 FPGA compare favorably to more conventional solutions on a central processing unit. Our investigation explores the performance of multiple fixed point options along with a traditional 64 bits floating point version. With this information, the lowest execution times can be estimated. Relative error is examined to ensure simulation accuracy is maintained.
- OSTI ID:
- 22314442
- Journal Information:
- Review of Scientific Instruments, Vol. 85, Issue 9; Other Information: (c) 2014 AIP Publishing LLC; Country of input: International Atomic Energy Agency (IAEA); ISSN 0034-6748
- Country of Publication:
- United States
- Language:
- English
Similar Records
Mitigation of cache memory using an embedded hard-core PPC440 processor in a Virtex-5 Field Programmable Gate Array.
Evaluation of soft-core processors on a Xilinx Virtex-5 field programmable gate array.
Field Programmable Gate Arrays for Enhancing the Speed and Energy Efficiency of Quantum Dynamics Simulations
Technical Report
·
Mon Feb 01 00:00:00 EST 2010
·
OSTI ID:22314442
Evaluation of soft-core processors on a Xilinx Virtex-5 field programmable gate array.
Technical Report
·
Fri Apr 01 00:00:00 EDT 2011
·
OSTI ID:22314442
Field Programmable Gate Arrays for Enhancing the Speed and Energy Efficiency of Quantum Dynamics Simulations
Journal Article
·
Fri Mar 27 00:00:00 EDT 2020
· Journal of Chemical Theory and Computation
·
OSTI ID:22314442
+3 more