By Topic

Space-filling curves: Their generation and their application to bandwidth reduction

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

This paper introduces a class of finite-state algorithms which characterize self-similar space-filling curves. The curves enable one to continuously map a line onto an N -dimensional cube, and find application in compressing the bandwidth of arbitrary waveforms. The bandwidth compression is effected in return for an increased susceptibility of the signal to perturbations. The algorithms are represented in a diagrammatic form which enables one to convert the N coordinates of a point in a cube into a single number representing the distance along a space-filling curve, or vice-versa, merely by visual inspection. The diagrams are always finite in size and may be constructed by following a rather simple numerical procedure.

Published in:

Information Theory, IEEE Transactions on  (Volume:15 ,  Issue: 6 )