Address generator of an N-dimensional Hilbert scan

Research output: Contribution to conferencePaper

1 Citation (Scopus)

Abstract

There are several algorithms for N-dimensional Hilbert scanning, such as the Butz algorithm and the Quinqueton algorithm. The Butz algorithm is a mapping function using several bit operations such as shifting, exclusive OR, etc. On the other hand, the Quinqueton algorithm computes all addresses of this curve using recursive functions, but takes time to compute a one-to-one mapping correspondence. Both algorithms are complex to compute and both are difficult to implement in hardware. In this paper, we propose a new, simple, non-recursive algorithm for N-dimensional Hilbert scanning using lookup tables. The merit of our algorithm is that the computation is fast and the hardware implementation is much easier than previous ones.

Original languageEnglish
Pages1031-1034
Number of pages4
Publication statusPublished - 1996 Dec 1
Externally publishedYes
EventProceedings of the 1996 IEEE International Conference on Image Processing, ICIP'96. Part 2 (of 3) - Lausanne, Switz
Duration: 1996 Sep 161996 Sep 19

Other

OtherProceedings of the 1996 IEEE International Conference on Image Processing, ICIP'96. Part 2 (of 3)
CityLausanne, Switz
Period96/9/1696/9/19

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Address generator of an N-dimensional Hilbert scan'. Together they form a unique fingerprint.

  • Cite this

    Kamata, S. I. (1996). Address generator of an N-dimensional Hilbert scan. 1031-1034. Paper presented at Proceedings of the 1996 IEEE International Conference on Image Processing, ICIP'96. Part 2 (of 3), Lausanne, Switz, .