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

Michael M. Fitelson

dblp:134/6360 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1974
—ORCID · none

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

Theory of computation · 2 · 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 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › signal processing › spectral estimation
maximum entropy spectrum
0.011973
Notes on maximum-entropy processing (Corresp.) · IEEE Trans. Inf. Theory 1973
Information theory › signal processing
spectral estimation
0.011973
Notes on maximum-entropy processing (Corresp.) · IEEE Trans. Inf. Theory 1973
YearPublicationVenuePosition
1974 Asymptotic statistics of periodogram-type spectral estimates for the output of nonlinear devices (Corresp.)
abstract
The high resolution statistics of a periodogram-type spectral estimate for a periodic deterministic signal plus Gaussian noise are well understood. If, however, the signal plus noise is first passed through a nonlinear memoryless device (such as a hard limiter), the situation becomes much more complicated. The main result of this correspondence is the derivation of the high resolution limit of the joint statistics of theIandQcomponents of a periodogram for a certain class of nonlinear devices with a deterministic periodic signal and Gaussian noise as input. This result permits the calculation of the asymptotic central moments of the spectral estimate formed from the foregoing periodogram. It then becomes possible to subject a device employing this technique for spectral estimation to a detailed performance analysis.
Michael M. Fitelson
IEEE Trans. Inf. Theory1
1973 Notes on maximum-entropy processing (Corresp.)
abstract
Maximum-entropy processing is a method for computing the power density spectrum from the firstNlags of the autocorrelation function. Unlike the discrete Fourier transform, maximum-entropy processing does not assume that the other lag values are zero. Instead, one mathematically ensures that the fewest possible assumptions about unmeasured data are made by choosing the spectrum that maximizes the entropy for the process. The use of the maximum entropy approach to spectral analysis was introduced by Burg [1]. In this correspondence, the authors derive the maximum-entropy spectrum by obtaining a spectrum that is forced to maximize the entropy of a stationary random process.
J. A. Edward, Michael M. Fitelson
IEEE Trans. Inf. Theory2