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

M. J. McDonnell

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

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

Theory of computation · 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
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › signal processing › signal recovery
deconvolution
0.011976
A sampling function appropriate for deconvolution (Corresp.) · IEEE Trans. Inf. Theory 1976
Information theory › signal processing
sampling theory
0.011976
A sampling function appropriate for deconvolution (Corresp.) · IEEE Trans. Inf. Theory 1976
Information theory › signal processing › sampling theory
sub-nyquist sampling
0.011976
A sampling function appropriate for deconvolution (Corresp.) · IEEE Trans. Inf. Theory 1976

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

sampling theory · 0.0
YearPublicationVenuePosition
1976 A sampling function appropriate for deconvolution (Corresp.)
abstract
We present a sampling theory, in one and two dimensions, which is appropriate for deconvolution problems. Our concern is with the possibility of sampling at a rate lower than the Nyquist rate. A new criterion for choosing sampling rates is introduced.
M. J. McDonnell
IEEE Trans. Inf. Theory1