(19) * << * >> * Russian * English * Content * All Issues

Fast algorithms of discrete orthogonal transforms realized in the number system with an irrational base
D.V. Sobolev
Image Processing Systems Institute of RAS
Samara State Aerospace University

 PDF, 418kB

Pages: 174-179.

Full text of article: Russian language.

Abstract:
The article considers a generalization of discrete orthogonal transforms (Fibonacci transforms) introduced by S.S. Agaian and N.N. Aizenberg. The transforms under consideration are focused on the data representation in recurrent number systems with an irrational base and do not require multiplications for the implementation.

Citation:
Sobolev DV. Fast algorithms of discrete orthogonal transforms realized in the number system with an irrational base. Computer Optics 1999; 19: 174 - 179.

References:
  1. Agaian SS, Aizenberg NN, Alaverdian SB. Discrete Fibonacci transform. Problems of theoretical cybernetics. Proc. 3rd All Soviet Union Conf.; Gorky; 1988; 1: 5-67.
  2. Agaian SS. Advances and problems of the fast orthogonal transforms for signal-images processing applications. Pattern recognition, classification, forecasting. Moscow: Nauka Publisher; 1990; 3: 146-214.
  3. S.Agaian, S.Alaverdian Fast orthogonal Fibonacci transform. Proc. Int. Coll. On Coding Theory, 1998, Osaka, Japan, pp. 335- 353.
  4. M.Hall Combinatorial Theory. Blaisdell Publ. Comp., 1967.
  5. G.Bergman A number system with an irrational base. Math. Magaz., No 31, 1957. pp. 98-119.
  6. Stakhov AP. Codes of the golden proportion. Moscow: Radio i Svyaz Publisher; 1984.
  7. Chernov VM. The implementation of number-theoretic transforms in the codes generated by the redundant number systems. Electronic Simulation 1993; 4: 33-37.
  8. N.Glumov, V.Myasnikov, V.Sergeyev Polynomial bases for image processing in a sliding window. Pattern Recognition and Image Analysis, Vol. 4, No.4, 1994, pp.408-413.
  9. Stakhov AP, Luzhetsky VA. Machine arithmetic of digital computers in Fibonacci codes and golden proportion. Moscow: Scientific Council of Academy of Science of the USSR on complex problem; 1981; Cybernetics: 64.
  10. V.Chernov, M.Pershina "Error-free" calculation of the convolution using generalized Mersenne and Fermat transforms over algebraic fields. Proc. CAIP'97. Springer, LNCS 1296, 1997, pp.621-628.
  11. A.Fraenkel Systems of numeration. Amer. Math. Monthly, Vol. 92, 1985, pp.105-114.
  12. A.Fraenkel The use and usefulness of numeration systems. Inf and Comp., Vol. 81, No 1, 1989, pp.46-61.
  13. A.Bertrand-Mathis Comment ecrire les nombres entiers, dans une base qui n’est pas entiere. Acta math. hung., Vol. 54, No 3-4, 1989, pp.237-241.

© 2009, IPSI RAS
151, Molodogvardeiskaya str., Samara, 443001, Russia; E-mail: journal@computeroptics.ru ; Tel: +7 (846) 242-41-24 (Executive secretary), +7 (846) 332-56-22 (Issuing editor), Fax: +7 (846) 332-56-20