Address generator of an N-dimensional Hilbert scan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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
Title of host publicationIEEE International Conference on Image Processing
Editors Anon
Place of PublicationLos Alamitos, CA, United States
PublisherIEEE
Pages1031-1034
Number of pages4
Volume2
Publication statusPublished - 1996
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

Fingerprint

Recursive functions
Scanning
Hardware
Table lookup

ASJC Scopus subject areas

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

Cite this

Kamata, S. (1996). Address generator of an N-dimensional Hilbert scan. In Anon (Ed.), IEEE International Conference on Image Processing (Vol. 2, pp. 1031-1034). Los Alamitos, CA, United States: IEEE.

Address generator of an N-dimensional Hilbert scan. / Kamata, Seiichiro.

IEEE International Conference on Image Processing. ed. / Anon. Vol. 2 Los Alamitos, CA, United States : IEEE, 1996. p. 1031-1034.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kamata, S 1996, Address generator of an N-dimensional Hilbert scan. in Anon (ed.), IEEE International Conference on Image Processing. vol. 2, IEEE, Los Alamitos, CA, United States, pp. 1031-1034, Proceedings of the 1996 IEEE International Conference on Image Processing, ICIP'96. Part 2 (of 3), Lausanne, Switz, 96/9/16.
Kamata S. Address generator of an N-dimensional Hilbert scan. In Anon, editor, IEEE International Conference on Image Processing. Vol. 2. Los Alamitos, CA, United States: IEEE. 1996. p. 1031-1034
Kamata, Seiichiro. / Address generator of an N-dimensional Hilbert scan. IEEE International Conference on Image Processing. editor / Anon. Vol. 2 Los Alamitos, CA, United States : IEEE, 1996. pp. 1031-1034
@inproceedings{36480af410fa4618a8b2576586a3362c,
title = "Address generator of an N-dimensional Hilbert scan",
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.",
author = "Seiichiro Kamata",
year = "1996",
language = "English",
volume = "2",
pages = "1031--1034",
editor = "Anon",
booktitle = "IEEE International Conference on Image Processing",
publisher = "IEEE",

}

TY - GEN

T1 - Address generator of an N-dimensional Hilbert scan

AU - Kamata, Seiichiro

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0030388882&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030388882&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0030388882

VL - 2

SP - 1031

EP - 1034

BT - IEEE International Conference on Image Processing

A2 - Anon, null

PB - IEEE

CY - Los Alamitos, CA, United States

ER -