Abstract
A new application of symbolic substitution is presented for string matching with the goal of data compression. A temporal sequence of input symbols is mapped onto a two-dimensional array that contains a tree structure, which in turn is mapped into another array for string generation. A symbolic substitution system and the necessary rules are developed to implement the mapping of the input mapping and the generation of an output sequence. A nonadaptive scheme of compression and decompression is described first, followed by an adaptive scheme with additional rules for the dynamic adaptation process.
© 1993 Optical Society of America
Full Article | PDF ArticleMore Like This
Elizabeth Botha, David Casasent, and Etienne Barnard
Appl. Opt. 27(24) 5185-5193 (1988)
John L. Johnson
Appl. Opt. 27(3) 529-533 (1988)
Ahmed Louri
Appl. Opt. 30(5) 540-548 (1991)