Gaussian integers representation in pitti’s number system
P. S. Bogdanov

S.P. Korolyov Samara State Aerospace University

Full text of article: Russian language.

Abstract:
In this paper the algorithm of representation of Gaussian integers in a canonical numerical system with the basis a=i-1 based on division with remainder is considered. Algorithms of performance of the basic arithmetic operations with numbers in the chosen numerical system are offered.

Key words:
canonical numerical system, norm division with remainder.

References:

  1. Knuth, D.Е. The art of computer programming. Vol. 2: Seminumerical algorithms / D.Е. Knuth. – Addison-Wesley, Reading, Mass., 1969.
  2. Kovacs, A. Generalized binary number system / A. Kovacs // Annales Univ. Sci. Budapest, Sect. Comp. – 2001. –Vol. 20. – P. 195-206.
  3. Fedoseev, V. Cryptography and Canonical Number Systems in Quadratic Fields / V. Fedoseev, V. Chernov // Machine Graphic & Vision. – 2006. – Vol. 15(3/4). – P. 363-372.
  4. Chernov, V.M. Arithmetical methods of synthesis of fast algorithms of Discrete orthogonal Transforms / V.M. Cher­nov. – Moscow: “Fizmatlit” Publisher, 2007. – 264 p. – (in Russian).
  5. Borevich, Z.I. Number theory / Z.I. Borevich, I. R. Shafarevich; third edition. – Moscow, “Science” Publisher, 1885. – 504 p. – (in Russian).
© 2009, IPSI RAS
Institution of Russian Academy of Sciences, Image Processing Systems Institute of RAS, Russia, 443001, Samara, Molodogvardeyskaya Street 151; E-mail: ko@smr.ru; Phones: +7 (846) 332-56-22, Fax: +7 (846) 332-56-20