I've been studying recently some variations of the CORDIC, and it seems to me that the logic behind at least the basic cordic or the redundant CORDIC is very similar to the logic used to design digit recurrence for the division (using redundant digit set). Is this statement correct?
At each iteration they have to guess a digit to construct the final answer, I would also say that the division is a particular case of the CORDIC iteration, indeed the CORDIC used in linear mode actually allows to retrieve the iteration for the division.
Therefore I'd say that a good understanding of the division is essential for understanding CORDIC, because it teaches you how to use Robertson and PD diagrams, tools that are used also in the Redundant CORDIC for example.
Are these observations correct?