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

Martin G. Lichtenstein

dblp:134/3797 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1968
—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%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › signal processing for communications
signal parameter estimation
0.011968
The resolution of closely spaced signals · IEEE Trans. Inf. Theory 1968
Information theory
hypothesis testing
0.011968
The resolution of closely spaced signals · IEEE Trans. Inf. Theory 1968
Information theory › hypothesis testing
maximum likelihood detection
0.011968
The resolution of closely spaced signals · IEEE Trans. Inf. Theory 1968

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

linear filtering · 0.0cross-ambiguity function · 0.0
YearPublicationVenuePosition
1968 The resolution of closely spaced signals
abstract
This paper presents a method for resolving signals closely spaced in parameter space in the sense that the parameters of the signals being measured (i.e., time of arrival, frequency, etc.) are close together. A maximum-likelihood method is used to resolveMsignals inK-dimensional space, whereMmay be unknown. The resulting procedure first generates aK-dimensional cross-ambiguity function and then passes this function through aK-dimensional linear filter. The procedure effectively reduces the problem from its original form of optimally searching for a maximum in the(M \times K)-dimensional space to searching forMmaxima in theK-dimensional parameter space. The method is obviously sub-optimal; its advantage lies in the relatively simple form of the detection scheme.
Martin G. Lichtenstein, Tzay Y. Young
IEEE Trans. Inf. Theory1