Generating a power of an operand by a table look-up and a multiplication
暂无分享,去创建一个
[1] Naofumi Takagi. Studies on Hardware Algorithms for Arithmetic Operations with a Redundant Binary Representation , 1988 .
[2] P. Michael Farmwald. High bandwidth evaluation of elementary functions , 1981, 1981 IEEE 5th Symposium on Computer Arithmetic (ARITH).
[3] Shuzo Yajima,et al. Efficient Initial Approximation for Multiplicative Division and Square Root by a Multiplication with Operand Modification , 1997, IEEE Trans. Computers.
[4] David W. Matula,et al. Redundant binary Booth recoding , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.
[5] Debjit Das Sarma,et al. Faithful bipartite ROM reciprocal tables , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.
[6] Naofumi Takagi. Arithmetic unit based on a high-speed multiplier with a redundant-binary addition tree , 1991, Optics & Photonics.