30:45
Video length is 30:45
Fixed-Point Made Easy for FPGA Programming
One of the biggest challenges in FPGA programming is the process of quantizing mathematical operations to fixed-point for more efficient implementation.
This session teaches the fundamentals of the fixed-point number system and fixed-point arithmetic, along with considerations for targeting popular FPGA devices. These concepts are then reinforced through practical demonstrations, capped by walking through the process of quantizing a signal processing design.
Topics include:
- Fixed-point theory
- Fixed-point number system
- Mathematical range
- Quantization error in the time and frequency domains
- Common functions
- Arithmetic: square root, reciprocal, log2
- Trigonometry: cosine, sine, atan2
- Signal processing: FIR, FFT
- FPGA considerations
- Targeting Xilinx and Intel devices
- Maintaining precision
- Using native floating point for full-precision calculations
- Example: communications packet detection
- Matched filter
- Peak detection
- FPGA optimizations
Published: 11 May 2020
Featured Product
Fixed-Point Designer
Up Next:
Related Videos:
您也可以从以下列表中选择网站:
如何获得最佳网站性能
选择中国网站(中文或英文)以获得最佳网站性能。其他 MathWorks 国家/地区网站并未针对您所在位置的访问进行优化。
美洲
- América Latina (Español)
- Canada (English)
- United States (English)
欧洲
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)
亚太
- Australia (English)
- India (English)
- New Zealand (English)
- 中国
- 日本Japanese (日本語)
- 한국Korean (한국어)