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

T. E. McCannon

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

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

Theory of computation · 3 · 3 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
3 papers
Information theory · 100%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Information theory
estimation theory
0.021982
On the design of nonlinear discrete-time predictors · IEEE Trans. Inf. Theory 1982
On a class of random processes exhibiting optimal nonlinear one-step predictors · IEEE Trans. Inf. Theory 1981
Information theory › probability theory › stochastic processes › time series analysis
nonlinear prediction
0.021982
On the design of nonlinear discrete-time predictors · IEEE Trans. Inf. Theory 1982
On a class of random processes exhibiting optimal nonlinear one-step predictors · IEEE Trans. Inf. Theory 1981
Information theory
hypothesis testing
0.011985
Two-dimensional memoryless detection of a random signal in phi -mixing non-Gaussian noise · IEEE Trans. Inf. Theory 1985
Information theory › probability theory
stochastic processes
0.021982
On the design of nonlinear discrete-time predictors · IEEE Trans. Inf. Theory 1982
On a class of random processes exhibiting optimal nonlinear one-step predictors · IEEE Trans. Inf. Theory 1981
Physical-layer communications › signal processing for communications › statistical signal processing
non-gaussian noise
0.011985
Two-dimensional memoryless detection of a random signal in phi -mixing non-Gaussian noise · IEEE Trans. Inf. Theory 1985
Physical-layer communications
signal processing for communications
0.011985
Two-dimensional memoryless detection of a random signal in phi -mixing non-Gaussian noise · IEEE Trans. Inf. Theory 1985

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

series expansion · 0.0nonlinear regression · 0.0minimum mean-squared error · 0.0iterative procedure · 0.0
YearPublicationVenuePosition
1985 Two-dimensional memoryless detection of a random signal in phi -mixing non-Gaussian noise
abstract
The problem is considered of designing memoryless detection systems for detecting random signals in qb-mixing noise environments. Assuming that the bivariate densities of the noise can be expressed in an infinite series expansion, the nonlinearity is expressed as a series expansion and the coefficients are found that maximize the asymptotic relative efficiency.
T. E. McCannon
IEEE Trans. Inf. Theory1
1982 On the design of nonlinear discrete-time predictors
abstract
The problem of minimum mean-squared error prediction of a discrete-time random process using a nonlinear filter consisting of a zero-memory nonlinearity followed by a linear filter is studied. Classes of random processes for which the best predictor is realizable using a nonlinear filter of the above form are discussed. For those random processes for which the best predictor is not realizable using the above nonlinear filter, an iterative procedure is presented for finding a suboptimal nonlinear filter; special attention is directed to the case where the nonlinearity is a polynomial. Also, a noniterative approach based on nonlinear regression is presented.
T. E. McCannon, Neal C. Gallagher, D. Minoo-Hamedani, Gary L. Wise
IEEE Trans. Inf. Theory1
1981 On a class of random processes exhibiting optimal nonlinear one-step predictors
abstract
Two classes of random processes that exhibit one-step predictors with optimal nonlinear minimum mean-squared error (MMSE) are discussed, and conditions for membership to one of these classes are given. Examples of each class are presented, and the optimal one-step predictors are given.
T. E. McCannon, Neal C. Gallagher
IEEE Trans. Inf. Theory1