The basics of FPGA mathematics
Adam Taylor, EADS Astrium
EETimes (8/7/2012 1:35 PM EDT)
One of the many benefits of an FPGA-based solution is the ability to implement a mathematical algorithm in the best possible manner for the problem at hand. For example, if response time is critical, then we can pipeline the stages of mathematics. But if accuracy of the result is more important, we can use more bits to ensure we achieve the desired precision. Of course, many modern FPGAs also provide the benefit of embedded multipliers and DSP slices, which can be used to obtain the optimal implementation in the target device.
Let's take a look at the rules and techniques that you can use to develop mathematical functions within an FPGA or other programmable device
To read the full article, click here
Related Semiconductor IP
- Secure Boot Loader
- Memory Subsystem
- 4/8-bit mixed-precision NPU IP
- Compiler-centric single-core LPU
- SMC 2nm 1V8 ESD Power Clamp – Low Leakage
Related Articles
- The rise of FPGA technology in High-Performance Computing
- The Future of Embedded FPGAs - eFPGA: The Proof is in the Tape Out
- eFPGA Saved Us Millions of Dollars. It Can Do the Same for You
- Automotive Architectures: Domain, Zonal and the Rise of Central
Latest Articles
- Versat-AI: An ONNX-to-SoC Compiler for Model-Agnostic CGRA Edge Inference
- HyNoC: A Hybrid Circuit-Switch/Wormhole Network-on-Chip for Distributed VLIW Computing on FPGA
- Hybrid ASIC-FPAA Fabric for Performance Security Trade-off
- A Centralized Performance Monitoring Architecture for Heterogeneous Multicore SoCs
- A Low-Latency ASIC Architecture for Real-Time Line Segment Detection