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

Mary E. Thompson

dblp:38/699 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2007
0000-0003-2354-8880ORCID · corroborated

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

Computer networks · 2

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%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › concatenated codes
turbo-like codes
0.112007
Application of Cumulant Method In Performance Evaluation of Turbo-Like Codes · IEEE Trans. Commun. 2007
Coding theory
channel coding
0.012007
Application of Cumulant Method In Performance Evaluation of Turbo-Like Codes · IEEE Trans. Commun. 2007
Coding theory › error-correcting codes › decoding
iterative decoding
0.012007
Application of Cumulant Method In Performance Evaluation of Turbo-Like Codes · IEEE Trans. Commun. 2007

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

monte carlo simulation · 0.1higher-order statistics · 0.1cumulant matching · 0.1
YearPublicationVenuePosition
2007 Application of Cumulant Method In Performance Evaluation of Turbo-Like Codes
abstract
In this article, a new method for performance evaluation of turbo-like codes is presented. This is based on estimating the probability density function (pdf) of the bit log-likelihood-ratio (LLR) using higher order statistics. We do not restrict ourselves to any specific model for thepdfand try to estimate it directly using a cumulant matching method. Numerical results show a close agreement between the proposed method and simulations. The complexity of this method is similar to the Monte-Carlo simulation with the advantage of providing similar accuracy using significantly fewer samples.
Ali Abedi 0001, Mary E. Thompson, Amir K. Khandani
ICC2
2007 Application of Cumulant Method In Performance Evaluation of Turbo-Like Codes
abstract
In this paper, a new method for performance evaluation of turbo-like codes is presented. This is based on estimating the probability density function of the bit log-likelihood-ratio using higher order statistics. We do not restrict ourselves to any specific model for the pdf and try to estimate it directly using a cumulant matching method. Numerical results show a close agreement between the proposed method and the simulations. The complexity of this method is similar to the Monte-Carlo simulation with the advantage of providing similar accuracy using significantly fewer samples.
Ali Abedi 0001, Mary E. Thompson, Amir K. Khandani
IEEE Trans. Commun.2