DSP Builder for Intel® FPGAs (Advanced Blockset): Handbook

ID 683337
Date 5/27/2022

A newer version of this document is available. Customers should click here to go to the newest version.

Document Table of Contents

11.7. Newton-Raphson Root Finding Tutorial

This DSP Builder tutorial implements a floating-point iterative algorithm. The tutorial also demonstrates how to exploit pipeline parallelism.

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.

Note: The following design examples show the various stages of the Newton-Raphson root finding tutorial:
  • demo_newton_iteration.mdl
  • demo_newton_convergence.mdl
  • demo_newton_valid.mdl
  • demo_newton_control.mdl
  • demo_newton_final.mdl