Realization of A/D and D/A Coders.
Abstract
The notion of a discrete-time coder as a device which converts real vector-valued sequences into sequences over a finite alphabet is formalized. A hierarchical classification of all coders, in terms of their input-output mappings, is sought. This classification is based on a canonical structure theory being developed for coders. An algebraic approach is used to define three classes of coders which have simple canonical realizations, i.e., ones for which known synthesis procedures may be used. It is proposed that coders be viewed as acceptors of real languages, and the hierarchy of the real languages be used in conjunction with the hierarchy suggested by these three coders to achieve a complete classification. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1981
- Accession Number
- ADA099230
Entities
People
- D. G. Wimpey
- M. E. Kaliski
- T. L. Johnson
Organizations
- Massachusetts Institute of Technology