Presentation	1996/2/2 A hardware implementation of Hilbert scanning algorithm Sei-ichiro Kamata,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	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, nonrecursive 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.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	Image scanning / Hilbert curve / Space-filling curve / Lookup table
Paper #	IE95-124
Date of Issue

Conference Information
Committee	IE
Conference Date	1996/2/2(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Image Engineering (IE)
Language	ENG
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	A hardware implementation of Hilbert scanning algorithm
Sub Title (in English)
Keyword(1)	Image scanning
Keyword(2)	Hilbert curve
Keyword(3)	Space-filling curve
Keyword(4)	Lookup table
1st Author's Name	Sei-ichiro Kamata
1st Author's Affiliation	Faculty of Engineering, Kyushu Institute of Technology()
Date	1996/2/2
Paper #	IE95-124
Volume (vol)	vol.95
Number (no)	504
Page	pp.pp.-
#Pages	8
Date of Issue