DSP Builder for Intel® FPGAs (Advanced Blockset): Handbook
A newer version of this document is available. Customers should click here to go to the newest version.
Visible to Intel only — GUID: hco1423076808896
Ixiasoft
Visible to Intel only — GUID: hco1423076808896
Ixiasoft
11.7. Newton-Raphson Root Finding Tutorial
Consider an application that finds the intersections of two equations:
y = e x
y = mx + c
The design finds the roots of the equation, ex - mx - c = 0, using Newton-Raphson iteration. The Newton-Raphson part of the design derives an improved approximation to the root from the previous guess.
- demo_newton_iteration.mdl
- demo_newton_convergence.mdl
- demo_newton_valid.mdl
- demo_newton_control.mdl
- demo_newton_final.mdl
- Implementing the Newton Design
- Improving DSP Builder Floating-Point Designs
In floating-point designs when comparing against zero, many of the samples never terminate and circulate through the feedback loop indefinitely. Because of the round-off errors accumulating in the NewtonStep subsystem, the residue may never reach exactly zero for many of the data samples.