Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

C. E. Schmidt

dblp:141/3664 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 1980
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Audio and music processing · 100%
Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Audio and music processing › speech coding
differential PCM
0.011980
On Soft-Decision Demodulation for PCM- and DPCM- Encoded Speech · IEEE Trans. Commun. 1980
Audio and music processing › speech coding
PCM
0.011980
On Soft-Decision Demodulation for PCM- and DPCM- Encoded Speech · IEEE Trans. Commun. 1980
Audio and music processing
speech coding
0.011980
On Soft-Decision Demodulation for PCM- and DPCM- Encoded Speech · IEEE Trans. Commun. 1980
Physical-layer communications
modulation
0.011980
On Soft-Decision Demodulation for PCM- and DPCM- Encoded Speech · IEEE Trans. Commun. 1980
Physical-layer communications › signal detection › soft-output detection
soft demodulation
0.011980
On Soft-Decision Demodulation for PCM- and DPCM- Encoded Speech · IEEE Trans. Commun. 1980

Methods — techniques the papers use, named apart from their topics

soft-decision demodulation · 0.0interpolation · 0.0
YearPublicationVenuePosition
1980 A connected digit recognizer based on dynamic time warping and isolated digit templates
abstract
A connected digit recognizer is proposed in which a set of isolated word templates is used as reference patterns and an unconstrained dynamic time warping algorithm is used to literally spot the digits in the string. Segmentation boundaries between digits are obtained as the termination point of the dynamic path from the previous time warp. A region around the boundary is searched for the optimum starting point for the succeeding digit. At each stage the recognizer keeps track of a set of candidate digit strings for each test string. The string with the smallest accumulated distance is used as the preliminary string estimate. For variable length digit strings of from 2 to 5 digits (where the recognizer was not told the length of the string), word error rates of about 2-3% and string error rates on the order of 8% were obtained for both speaker dependent and speaker independent systems.
Lawrence R. Rabiner, C. E. Schmidt
ICASSP2
1980 On Soft-Decision Demodulation for PCM- and DPCM- Encoded Speech
abstract
In a simulation of soft decision demodulation-interpolation for digital speech transmission, it has been noted that signal-to-noise ratio gains due to the technique are greater with nonadaptive and periodically adaptive quantizers than with instantaneously adaptive quantizers; further, the gains are greater with PCM than with differential PCM. Our results for nonadaptive PCM reinforce those in a recent analytical paper by Sundberg [1].
Nuggehally S. Jayant, R. Steele, Ngai Wai Chan, C. E. Schmidt
IEEE Trans. Commun.4
1978 Directory assistance by means of automatic recognition of spoken spelled names
abstract
An automatic word recognizer is used to accept strings of spelled letters spoken in isolation. The output of the recognizer is a set of best candidate letters for each letter spoken in the string. Candidate strings forming spelled last names and initials are compared to name strings obtained from a telephone directory stored in a disk file. A systematic search is carried out to find a matching entry in the directory. An evaluation has been carried out with ten talkers spelling lists of names extracted from an 18,000 entry telephone directory. Although the median acoustic error rate per spelled letter is approximately 20%, the median error rate in furnishing the requested directory entry is approximately 4%.
Aaron E. Rosenberg, C. E. Schmidt
ICASSP2