UNIVERSAL TREE ENCODING FOR SPEECH.

Yasuo Matsuyama, Robert M. Gray

Research output: Contribution to journal › Article

12 Citations (Scopus)

Abstract

A low-rate (about one bit per sample) waveform coder for speech compression is designed using techniques from universal source coding, fake process tree encoding, and linear predictive coding (LPC). The system does not require on-line adaptation or LPC analysis, yet it yields a fidelity that compares well with the best existing adaptive-waveform coder of the same rate.

Original languageEnglish
Pages (from-to)31-40
Number of pages10
JournalIEEE Transactions on Information Theory
VolumeIT-27
Issue number1
Publication statusPublished - 1981 Jan
Externally publishedYes

Fingerprint

coding

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering

Cite this

Matsuyama, Y., & Gray, R. M. (1981). UNIVERSAL TREE ENCODING FOR SPEECH. IEEE Transactions on Information Theory, IT-27(1), 31-40.

UNIVERSAL TREE ENCODING FOR SPEECH. / Matsuyama, Yasuo; Gray, Robert M.

In: IEEE Transactions on Information Theory, Vol. IT-27, No. 1, 01.1981, p. 31-40.

Research output: Contribution to journal › Article

Matsuyama, Y & Gray, RM 1981, 'UNIVERSAL TREE ENCODING FOR SPEECH.', IEEE Transactions on Information Theory, vol. IT-27, no. 1, pp. 31-40.
Matsuyama Y, Gray RM. UNIVERSAL TREE ENCODING FOR SPEECH. IEEE Transactions on Information Theory. 1981 Jan;IT-27(1):31-40.
Matsuyama, Yasuo ; Gray, Robert M. / UNIVERSAL TREE ENCODING FOR SPEECH. In: IEEE Transactions on Information Theory. 1981 ; Vol. IT-27, No. 1. pp. 31-40.
@article{3b3a93130a014829a05b6ab880243b1c,
title = "UNIVERSAL TREE ENCODING FOR SPEECH.",
abstract = "A low-rate (about one bit per sample) waveform coder for speech compression is designed using techniques from universal source coding, fake process tree encoding, and linear predictive coding (LPC). The system does not require on-line adaptation or LPC analysis, yet it yields a fidelity that compares well with the best existing adaptive-waveform coder of the same rate.",
author = "Yasuo Matsuyama and Gray, {Robert M.}",
year = "1981",
month = "1",
language = "English",
volume = "IT-27",
pages = "31--40",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - UNIVERSAL TREE ENCODING FOR SPEECH.

AU - Matsuyama, Yasuo

AU - Gray, Robert M.

PY - 1981/1

Y1 - 1981/1

N2 - A low-rate (about one bit per sample) waveform coder for speech compression is designed using techniques from universal source coding, fake process tree encoding, and linear predictive coding (LPC). The system does not require on-line adaptation or LPC analysis, yet it yields a fidelity that compares well with the best existing adaptive-waveform coder of the same rate.

AB - A low-rate (about one bit per sample) waveform coder for speech compression is designed using techniques from universal source coding, fake process tree encoding, and linear predictive coding (LPC). The system does not require on-line adaptation or LPC analysis, yet it yields a fidelity that compares well with the best existing adaptive-waveform coder of the same rate.

UR - http://www.scopus.com/inward/record.url?scp=0019477553&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019477553&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0019477553

VL - IT-27

SP - 31

EP - 40

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 1

ER -

Access to Document