Hardware-Efficient Algorithm for 3D Spatial Rotation

  • Aleksandr CariowEmail author
  • Galina Cariowa
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 889)


In this paper, we have proposed a novel VLSI-oriented parallel algorithm for quaternion-based rotation in 3D space. The advantage of our algorithm is a reduction the number of multiplications through replacing part of them by less costly squarings. The algorithm uses Logan’s trick, which proposes to replace the calculation of the product of two numbers on summing the squares via the Binomial theorem. Replacing digital multipliers by squaring units implies reducing power consumption as well as decreases hardware circuit complexity.


Quaternions Rotation matrix Fast algorithms 


  1. 1.
    Markley, F.L.: Unit quaternion from rotation matrix. J. Guid., Control. Dyn. 31(2), 440–442 (2008).
  2. 2.
    Shuster, M.D., Natanson, G.A.: Quaternion computation from a geometric point of view. J. Astronaut. Sci. 41(4), 545–556 (1993)MathSciNetGoogle Scholar
  3. 3.
    Doukhnitch, E., Chefranov, A., Mahmoud, A.: Encryption schemes with hyper-complex number systems and their hardware-oriented implementation. In: Elci, A. (ed.) Theory and Practice of Cryptography Solutions for Secure Information Systems, pp. 110–132. IGI Global, Hershey (2013)Google Scholar
  4. 4.
    Granata, J., Conner, M., Tolimieri, R.: The tensor product: a mathematical programming language for FFTs and other fast DSP operations. IEEE Signal Process. Mag. 9(1), 40–48 (1992)Google Scholar
  5. 5.
    Logan, J.R.: A square-summing high-speed multiplier. Comput. Des., 67–70 (1971)Google Scholar
  6. 6.
    Johnson, E.L.: A digital quarter square multiplier. IEEE Trans. Comput. C-29(3), 258–261 (1980).
  7. 7.
    Cariow, A., Cariowa, G.: A hardware-efficient approach to computing the rotation matrix from a quaternion, CoRR arXiv:1609.01585, pp. 1–5 (2016)
  8. 8.
    Deshpande, A., Draper, J.: Squaring units and a comparison with multipliers. In: 53rd IEEE International Midwest Symp. on Circuits and Systems (MWSCAS 2010), Seattle, Washington, 1st–4th August 2010, pp. 1266–1269 (2010).
  9. 9.
    Liddicoat, A.A., Flynn, M.J.: Parallel computation of the square and cube function, Computer Systems Laboratory, Stanford University, Technical report No. CSL-TR-00-808, August (2000)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Faculty of Computer Science and Information TechnologyWest Pomeranian University of TechnologySzczecinPoland

Personalised recommendations