Powering by a Table Look-Up and a Multiplication with Operand Modification
暂无分享,去创建一个
[1] Shuzo Yajima,et al. Efficient Initial Approximation for Multiplicative Division and Square Root by a Multiplication with Operand Modification , 1997, IEEE Trans. Computers.
[2] David W. Matula,et al. Redundant binary Booth recoding , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.
[3] Naofumi Takagi. Generating a power of an operand by a table look-up and a multiplication , 1997, Proceedings 13th IEEE Sympsoium on Computer Arithmetic.
[4] Naofumi Takagi. Studies on Hardware Algorithms for Arithmetic Operations with a Redundant Binary Representation , 1988 .
[5] Debjit Das Sarma,et al. Faithful interpolation in reciprocal tables , 1997, Proceedings 13th IEEE Sympsoium on Computer Arithmetic.
[6] Andrew S. Noetzel. An Interpolating Memory Unit for Function Evaluation: Analysis and Design , 1989, IEEE Trans. Computers.
[7] Debjit Das Sarma,et al. Faithful bipartite ROM reciprocal tables , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.
[8] Naofumi Takagi. Arithmetic unit based on a high-speed multiplier with a redundant-binary addition tree , 1991, Optics & Photonics.