Novel VLSI implementation of Peano-Hilbert curve address generator

Yan Wang, Shoushun Chen, Amine Bermak

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

3 Citations (Scopus)

Abstract

This paper presents a fast algorithm for generating Hilbert address for hardware implementation with low storage requirement. This work avoids the use of recursive functions as compared with Quinqueton's work, and eliminates complicated bit manipulations as proposed by Butz, and does not use any look-up-tables as implemented by Kamata. Each address can be obtained in one clock cycle by one-to-one mapping using a simple incremental counter and cascading of multiplexers. The merit of our method is that it achieves very high speed when computing the Hilbert address which requires little memory storage.

Original languageEnglish
Title of host publication2008 IEEE International Symposium on Circuits and Systems, ISCAS 2008
Pages476-479
Number of pages4
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event2008 IEEE International Symposium on Circuits and Systems, ISCAS 2008 - Seattle, WA, United States
Duration: 18 May 200821 May 2008

Other

Other2008 IEEE International Symposium on Circuits and Systems, ISCAS 2008
CountryUnited States
CitySeattle, WA
Period18/5/0821/5/08

Fingerprint

Recursive functions
Clocks
Hardware
Data storage equipment

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Electrical and Electronic Engineering

Cite this

Wang, Y., Chen, S., & Bermak, A. (2008). Novel VLSI implementation of Peano-Hilbert curve address generator. In 2008 IEEE International Symposium on Circuits and Systems, ISCAS 2008 (pp. 476-479). [4541458] https://doi.org/10.1109/ISCAS.2008.4541458

Novel VLSI implementation of Peano-Hilbert curve address generator. / Wang, Yan; Chen, Shoushun; Bermak, Amine.

2008 IEEE International Symposium on Circuits and Systems, ISCAS 2008. 2008. p. 476-479 4541458.

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

Wang, Y, Chen, S & Bermak, A 2008, Novel VLSI implementation of Peano-Hilbert curve address generator. in 2008 IEEE International Symposium on Circuits and Systems, ISCAS 2008., 4541458, pp. 476-479, 2008 IEEE International Symposium on Circuits and Systems, ISCAS 2008, Seattle, WA, United States, 18/5/08. https://doi.org/10.1109/ISCAS.2008.4541458
Wang Y, Chen S, Bermak A. Novel VLSI implementation of Peano-Hilbert curve address generator. In 2008 IEEE International Symposium on Circuits and Systems, ISCAS 2008. 2008. p. 476-479. 4541458 https://doi.org/10.1109/ISCAS.2008.4541458
Wang, Yan ; Chen, Shoushun ; Bermak, Amine. / Novel VLSI implementation of Peano-Hilbert curve address generator. 2008 IEEE International Symposium on Circuits and Systems, ISCAS 2008. 2008. pp. 476-479
@inproceedings{414db1d93a1041b3a880c07fb3061eda,
title = "Novel VLSI implementation of Peano-Hilbert curve address generator",
abstract = "This paper presents a fast algorithm for generating Hilbert address for hardware implementation with low storage requirement. This work avoids the use of recursive functions as compared with Quinqueton's work, and eliminates complicated bit manipulations as proposed by Butz, and does not use any look-up-tables as implemented by Kamata. Each address can be obtained in one clock cycle by one-to-one mapping using a simple incremental counter and cascading of multiplexers. The merit of our method is that it achieves very high speed when computing the Hilbert address which requires little memory storage.",
author = "Yan Wang and Shoushun Chen and Amine Bermak",
year = "2008",
doi = "10.1109/ISCAS.2008.4541458",
language = "English",
isbn = "9781424416844",
pages = "476--479",
booktitle = "2008 IEEE International Symposium on Circuits and Systems, ISCAS 2008",

}

TY - GEN

T1 - Novel VLSI implementation of Peano-Hilbert curve address generator

AU - Wang, Yan

AU - Chen, Shoushun

AU - Bermak, Amine

PY - 2008

Y1 - 2008

N2 - This paper presents a fast algorithm for generating Hilbert address for hardware implementation with low storage requirement. This work avoids the use of recursive functions as compared with Quinqueton's work, and eliminates complicated bit manipulations as proposed by Butz, and does not use any look-up-tables as implemented by Kamata. Each address can be obtained in one clock cycle by one-to-one mapping using a simple incremental counter and cascading of multiplexers. The merit of our method is that it achieves very high speed when computing the Hilbert address which requires little memory storage.

AB - This paper presents a fast algorithm for generating Hilbert address for hardware implementation with low storage requirement. This work avoids the use of recursive functions as compared with Quinqueton's work, and eliminates complicated bit manipulations as proposed by Butz, and does not use any look-up-tables as implemented by Kamata. Each address can be obtained in one clock cycle by one-to-one mapping using a simple incremental counter and cascading of multiplexers. The merit of our method is that it achieves very high speed when computing the Hilbert address which requires little memory storage.

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

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

U2 - 10.1109/ISCAS.2008.4541458

DO - 10.1109/ISCAS.2008.4541458

M3 - Conference contribution

SN - 9781424416844

SP - 476

EP - 479

BT - 2008 IEEE International Symposium on Circuits and Systems, ISCAS 2008

ER -