search ieeexplore.ieee.org.
Papers Published
- Goodman, S.D. and Brooke, M.A., Symbolic substitution system for data compression,
Appl. Opt. (USA), vol. 32 no. 5
(1993),
pp. 752 - 60 .
(last updated on 2007/04/11)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 processKeywords:
data compression;parallel processing;symbolic substitution;