Smoothed DPCM codes

Jerry D. Gibson; Wen-Whei Chang

doi:10.1109/GLOCOM.1989.64270

Smoothed DPCM codes

Jerry D. Gibson^*, Wen-Whei Chang

^*Corresponding author for this work

Department of Electrical and Computer Engineering

Research output: Contribution to conference › Paper › peer-review

1 Scopus citations

Abstract

Minimum mean squared error (MMSE) fixed-lag smoothing is used in conjunction with DPCM (differential pulse code modulation) to develop a code generator employing delayed decoding. This smoothed DPCM (SDPCM) code generator is compared to DPCM and interpolative DPCM (IDPCM) code generators at rates 1 and 2 for tree coding several synthetic sources, as well as to a DPCM code/generator at rate 2 for speech sources. The (M, L) algorithm is used for tree searching, and SDPCM outperforms IDCPM and DPCM at rate 2 for synthetic sources with M = 1, 4, 8, and 12, and at rate 1 with M ≥ 4. For speech, SDPCM provides a slight improvement in MSE (mean squared error) over DPCM codes, which is also evident in sound spectrograms and listening tests.

Original language	English
Pages	1911-1915
Number of pages	5
DOIs	https://doi.org/10.1109/GLOCOM.1989.64270
State	Published - 27 Nov 1989
Event	IEEE Global Telecommunications Conference & Exhibition (GLOBECOM '89). Part 1 (of 3) - Dallas, TX, USA Duration: 27 Nov 1989 → 30 Nov 1989

Conference

Conference	IEEE Global Telecommunications Conference & Exhibition (GLOBECOM '89). Part 1 (of 3)
City	Dallas, TX, USA
Period	27/11/89 → 30/11/89

Access to Document

10.1109/GLOCOM.1989.64270

Cite this

@conference{906bb2fe7d544008adc4d04281d17a1d,

title = "Smoothed DPCM codes",

abstract = "Minimum mean squared error (MMSE) fixed-lag smoothing is used in conjunction with DPCM (differential pulse code modulation) to develop a code generator employing delayed decoding. This smoothed DPCM (SDPCM) code generator is compared to DPCM and interpolative DPCM (IDPCM) code generators at rates 1 and 2 for tree coding several synthetic sources, as well as to a DPCM code/generator at rate 2 for speech sources. The (M, L) algorithm is used for tree searching, and SDPCM outperforms IDCPM and DPCM at rate 2 for synthetic sources with M = 1, 4, 8, and 12, and at rate 1 with M ≥ 4. For speech, SDPCM provides a slight improvement in MSE (mean squared error) over DPCM codes, which is also evident in sound spectrograms and listening tests.",

author = "Gibson, {Jerry D.} and Wen-Whei Chang",

year = "1989",

month = nov,

day = "27",

doi = "10.1109/GLOCOM.1989.64270",

language = "English",

pages = "1911--1915",

note = "IEEE Global Telecommunications Conference & Exhibition (GLOBECOM '89). Part 1 (of 3) ; Conference date: 27-11-1989 Through 30-11-1989",

}

TY - CONF

T1 - Smoothed DPCM codes

AU - Gibson, Jerry D.

AU - Chang, Wen-Whei

PY - 1989/11/27

Y1 - 1989/11/27

N2 - Minimum mean squared error (MMSE) fixed-lag smoothing is used in conjunction with DPCM (differential pulse code modulation) to develop a code generator employing delayed decoding. This smoothed DPCM (SDPCM) code generator is compared to DPCM and interpolative DPCM (IDPCM) code generators at rates 1 and 2 for tree coding several synthetic sources, as well as to a DPCM code/generator at rate 2 for speech sources. The (M, L) algorithm is used for tree searching, and SDPCM outperforms IDCPM and DPCM at rate 2 for synthetic sources with M = 1, 4, 8, and 12, and at rate 1 with M ≥ 4. For speech, SDPCM provides a slight improvement in MSE (mean squared error) over DPCM codes, which is also evident in sound spectrograms and listening tests.

AB - Minimum mean squared error (MMSE) fixed-lag smoothing is used in conjunction with DPCM (differential pulse code modulation) to develop a code generator employing delayed decoding. This smoothed DPCM (SDPCM) code generator is compared to DPCM and interpolative DPCM (IDPCM) code generators at rates 1 and 2 for tree coding several synthetic sources, as well as to a DPCM code/generator at rate 2 for speech sources. The (M, L) algorithm is used for tree searching, and SDPCM outperforms IDCPM and DPCM at rate 2 for synthetic sources with M = 1, 4, 8, and 12, and at rate 1 with M ≥ 4. For speech, SDPCM provides a slight improvement in MSE (mean squared error) over DPCM codes, which is also evident in sound spectrograms and listening tests.

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

U2 - 10.1109/GLOCOM.1989.64270

DO - 10.1109/GLOCOM.1989.64270

M3 - Paper

AN - SCOPUS:0024888885

SP - 1911

EP - 1915

T2 - IEEE Global Telecommunications Conference & Exhibition (GLOBECOM '89). Part 1 (of 3)

Y2 - 27 November 1989 through 30 November 1989

ER -

Smoothed DPCM codes

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this