Hi Adam,
Thanks for your email. I never knew about Opencores before, this is
really cool!
Just remember that you will need to properly pipeline the CORDIC
function i.e. it will take longer than 1 clock cycle for the data to
be valid. I think I had 4 or 5 cycle pipeline delay.
This is
Hi Guys,
Thanks a million for all your emails.
Consider making a lookup table. If your accuracy requirements and
space will allow it. This is the way things use to be done before
calculators and computers and it will work in a lot of cases.
The lookup table approach definitely sounds like a
Hi Eoin,
We’ve found here that some of the Xilinx cores can be very sensitive to how
you feed them and how they are configured. Have you tried looking for skipped
transactions and missed beats? I would not have thought this core would be as
sensitive to things as say their SSR FFT.
A while back my student developed a work to produce non-linear functions
for FPGA through various linear approximations and lookups with the goal
to minimize hw resources while maintaining good and quantifiable
accuracy. It included arctan among others:
S. M. H. Ho and H. K. So, "NnCore: A
Consider making a lookup table. If your accuracy requirements and space will
allow it. This is the way things use to be done before calculators and
computers and it will work in a lot of cases.
Bob Stricklin
> On Dec 13, 2021, at 6:55 AM, baldwin wrote:
>
> Hi Guys,
>
> Quick question; I'm
Dear Eoin,
It has been a while since I played with the cordic algorithm. I used this
for Radar signal processing in the day. The Xilinx should work, but if not
try opencores.org and look for arithmetic operations. Refer to
https://opencores.org/projects/cf_cordic. I can't remember the exact
Hi Guys,
Quick question; I'm just wondering what is the best way to calculate
arctan on the FPGA? I am currently using the Xilinx CORDIC block to take
I and Q and use them to calculate phase, but have found this to give
unreliable data. While it sometimes gives out the correct phase value,
7 matches
Mail list logo
