Abstract: The SRT cube root algorithm plays a significant role in fields such as multimedia and computer graphics. Although existing algorithms can accelerate computation by increasing the radix, they still face issues such as a lack of initialization processing, complex design of the quotient digit selection table, and implementation difficulties. This paper designs and implements an SRT cube root algorithm with radix-4. Firstly, proposing a high-radix SRT cube root initialization algorithm to ensure the feasibility of subsequent iterative calculations; designing a quotient digit selection table for the radix-4 SRT cube root algorithm to provide necessary conditions for quotient digit selection; optimizing the timely conversion algorithm to avoid multiple carries during the conversion process. Secondly, the above radix-4 SRT cube root algorithm is improved and implemented based on the PyRTL tool, effectively mitigat- ing the implementation challenges of high-radix SRT cube root algorithms. Finally, a comparison with the existing radix-2 SRT cube root algorithm demonstrates the effectiveness and superiority of the proposed algorithm.

Key words: SRT cube root algorithm, high-radix, quotient digit selection table, hardware algorithm