English
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
|
E-mail This Article | 
|
|
Printer-Friendly Page |
Related Articles
- Why Transceiver-Rich FPGAs Are Suitable for Vehicle Infotainment System Designs
- The rise of FPGA technology in High-Performance Computing
- Implementation basics for autonomous driving vehicles
- Understanding Interface Analog-to-Digital Converters (ADCs) with DataStorm DAQ FPGA
- FPGA Market Trends with Next-Gen Technology
New Articles
- How NoC architecture solves MCU design challenges
- Automating Hardware-Software Consistency in Complex SoCs
- Beyond Limits: Unleashing the 10.7 Gbps LPDDR5X Subsystem
- How to Design Secure SoCs: Essential Security Features for Digital Designers
- System level on-chip monitoring and analytics with Tessent Embedded Analytics
Most Popular
- System Verilog Assertions Simplified
- Synthesis Methodology & Netlist Qualification
- Design Rule Checks (DRC) - A Practical View for 28nm Technology
- Enhancing VLSI Design Efficiency: Tackling Congestion and Shorts with Practical Approaches and PnR Tool (ICC2)
- UPF Constraint coding for SoC - A Case Study