I have done several FPGA algorithms using HLS C++ Templates using tail-recursion. It works very well. Although it is a high-level abstraction, and the underlyin

I have done several FPGA algorithms using HLS C++ Templates using tail-recursion. It works very well. Although it is a high-level abstraction, and the underlying logic gate structure is not easily accessible. HLS generates hard to read 'machine' VHDL or Verilog. Though if you really wanted to it is possible to reverse engineer and get the actual logic. The HLS (Synthesizable C++) is only a few lines and easily verifiable, so there is no real need to ever reverse engineer. Also, I assuming we are talking about actual recursive algorithms, not something obvious like feedback, or IIR filters..