(14-15(02)) * << * >> * Russian * English * Content * All Issues

On various schemes for the decomposition of a 2D DFT with data representation in the quaternion algebra
M.V. Pershina, M.A. Chicheva

 PDF, 1702 kB

Pages: 13-19.

Full text of article: Russian language.

Abstract:
This work considers fast algorithms for a two-dimensional DFT of a real sequence with data representation in the quaternion algebra. Algorithms have been developed that take into account the real type of the input signal in two ways: by combining and by reducing the size of the fundamental region. Various transformation decomposition schemes are presented, estimates of multiplicative complexity are obtained.

Citation:
Pershina MV, Chicheva MA. On various schemes for the decomposition of a 2D DFT with data representation in the quaternion algebra. Computer Optics 1995; 14-15(2): 13-19.

References:
  1. Yaroslavsky LP. An introduction to digital picture processing; Moscow: Sov. Radio Publ.; 1979; 312.
  2. Vlasenko VA, Lappa YM, Yaroslavsky LP. Methods of synthesis of fast algorithms for signal convolution and spectral analysis; Moscow: Nauka Publisher; 1990; 160.
  3. Van Der Waerden BL. Algebra; Moscow: Nauka Publisher; 1976: 648.
  4. Blahut R. Fast algorithms of digital signal processing; Moscow: Mir Publisher; 1987; 448.
  5. Chernov VM. Arithmetic methods in the theory of descrete orthogonal transforms. Workshop on Digital Image Processing and Computer Graphics. Proceedings SPIE; 1994; V.2363 .

© 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