Loading…

Computing linear transforms of symbolic signals

Signals that represent information may be classified into two forms: numeric and symbolic. Symbolic signals are discrete-time sequences that at, any particular index, have a value that is a member of a finite set of symbols. Set membership defines the only mathematical structure that symbolic sequen...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing 2002-03, Vol.50 (3), p.628-634
Main Authors: Wei Wang, Johnson, D.H.
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Signals that represent information may be classified into two forms: numeric and symbolic. Symbolic signals are discrete-time sequences that at, any particular index, have a value that is a member of a finite set of symbols. Set membership defines the only mathematical structure that symbolic sequences satisfy. Consequently, symbolic signals cannot be directly processed with existing signal processing algorithms designed for signals having values that are elements of a field (numeric signals) or a group. Generalizing an approach due to Stoffer (see Biometrika, vol.85, p.201-213, 1998), we extend time-frequency and time-scale analysis techniques to symbolic signals and describe a general linear approach to developing processing algorithms for symbolic signals. We illustrate our techniques by considering spectral and wavelet analyses of DNA sequences.
ISSN:1053-587X
1941-0476
DOI:10.1109/78.984752