论文信息 - A Direct Method of Computing the GNAF of an Integer

A Direct Method of Computing the GNAF of an Integer

In this correspondence we present a simple direct method of finding the nonadjacent form and arithmetic weight of an integer with respect to an arbitrary radix.

J.J. Liu | L.D. Rudolph | L. Rudolph | J.J. Liu

[1] Franco P. Preparata,et al. Some Results in the Theory of Arithmetic Codes , 1971, Inf. Control..

[2] Tadao Kasami,et al. Minimal Negative Gate Networks , 1972, IEEE Transactions on Computers.

[3] S. Muroga,et al. Synthesis of Networks with a Minimum Number of Negative Gates , 1971, IEEE Transactions on Computers.

[4] Toshihide Ibaraki. Gate-Interconnection Minimization of Switching Networks Using Negative Gates , 1971, IEEE Transactions on Computers.

[5] E. Gilbert. Lattice Theoretic Properties of Frontal Switching Functions , 1954 .

[6] James L. Massey,et al. Error-correcting codes in computer arithmetic. , 1972 .

[7] W. Edwin Clark,et al. On arithmetic weight for a general radix representation of integers (Corresp.) , 1973, IEEE Trans. Inf. Theory.

[8] Sheldon B. Akers. On Maximum Inversion with Minimum Inverters , 1968, IEEE Transactions on Computers.

[9] Thammavarapu R. N. Rao,et al. Error coding for arithmetic processors , 1974 .

[10] A. A. Markov. On the Inversion Complexity of a System of Functions , 1958, JACM.