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

Tahereh Fazel

dblp:08/10622 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2003
—ORCID · none

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

Computer networks · 1 · 1 first-author

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.

Theoretical computer science
1 paper
Coding theory · 100%
Computer graphics and multimedia
1 paper
Audio and music processing · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory
channel coding
0.012003
Robust transmission of MELP-compressed speech: an illustrative example of joint source-channel decoding · IEEE Trans. Commun. 2003
Coding theory › error-correcting codes
convolutional codes
0.012003
Robust transmission of MELP-compressed speech: an illustrative example of joint source-channel decoding · IEEE Trans. Commun. 2003
Coding theory › error-correcting codes › decoding › decoding algorithms
joint source-channel decoding
0.012003
Robust transmission of MELP-compressed speech: an illustrative example of joint source-channel decoding · IEEE Trans. Commun. 2003
Coding theory › source coding
residual redundancy exploitation
0.012003
Robust transmission of MELP-compressed speech: an illustrative example of joint source-channel decoding · IEEE Trans. Commun. 2003
Coding theory › channel coding
turbo codes
0.012003
Robust transmission of MELP-compressed speech: an illustrative example of joint source-channel decoding · IEEE Trans. Commun. 2003
Audio and music processing
speech coding
0.012003
Robust transmission of MELP-compressed speech: an illustrative example of joint source-channel decoding · IEEE Trans. Commun. 2003

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

markov chain modeling · 0.1iterative decoding · 0.1entropy rate estimation · 0.1
YearPublicationVenuePosition
2003 Robust transmission of MELP-compressed speech: an illustrative example of joint source-channel decoding
abstract
A mixed-excitation linear predictive (MELP) speech coder was selected as the US federal standard for 2400 b/s speech compression. This paper examines the quality of MELP-compressed speech when transmitted over noisy communication channels in conjunction with a variety of error-control schemes. The focus is on channel decoders that exploit the "residual redundancy" inherent in the MELP bitstream. This residual redundancy, which is manifested by the correlation in time and the nonuniform distribution of various MELP parameters, can be quantified by modeling the parameters as one-step Markov chains and computing the entropy rate of the Markov chains based on the relative frequencies of transitions. Moreover, this residual redundancy can be exploited by an appropriately "tuned" channel decoder to provide substantial coding gain when compared with decoders that do not exploit it. Channel coding schemes include conventional binary convolutional codes and iteratively-decoded parallel concatenated convolutional (turbo) codes.
Tahereh Fazel, Thomas E. Fuja
IEEE Trans. Commun.1