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

Optical production systems using neural networks and symbolic substitution

Elizabeth Botha, David Casasent, and Etienne Barnard
Appl. Opt. 27(24) 5185-5193 (1988)

Architectural relationships involving symbolic substitution

John L. Johnson
Appl. Opt. 27(3) 529-533 (1988)

Parallel implementation of optical symbolic substitution logic using shadow-casting and polarization

Ahmed Louri
Appl. Opt. 30(5) 540-548 (1991)

Symbolic substitution applications to image processing

Stephen D. Goodman and William T. Rhodes
Appl. Opt. 27(9) 1708-1714 (1988)

Optical symbolic substitution: system design using phase-only holograms

Joseph N. Mait and Karl-Heinz Brenner
Appl. Opt. 27(9) 1692-1700 (1988)