DocumentCode :
913108
Title :
Space-filling curves: Their generation and their application to bandwidth reduction
Author :
Bially, Theodore
Volume :
15
Issue :
6
fYear :
1969
fDate :
11/1/1969 12:00:00 AM
Firstpage :
658
Lastpage :
664
Abstract :
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.
Keywords :
Bandwidth compression; Source coding; Bandwidth; Character generation; Gaussian distribution; Information theory; Inspection; Probability distribution; Radar detection; Redundancy; Stochastic processes; White noise;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1969.1054385
Filename :
1054385
Link To Document :
بازگشت