摘要
In this paper, two algorithms are presented for generating two code scan lists of an N dimensional Hilbert cell, and a formal proof of the backward encoding algorithm is given. On the basis of the self similarity properties of a Hilbert curve, this paper gives a novel algorithm for generating a static evolvement rule table through analyzing a Hilbert cell. By looking up the static evolvement rule table, the N dimensional Hilbert mappings are efficiently implemented.
In this paper, two algorithms are presented for generating two code scan lists of an N-dimensional Hilbert cell, and a formal proof of the backward encoding algorithm is given. On the basis of the self-similarity properties of a Hilbert curve, this paper gives a novel algorithm for generating a static evolvement rule table through analyzing a Hilbert cell. By looking up the static evolvement rule table, the N-dimensional Hilbert mappings are efficiently implemented.
