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.

Kenneth S. Miller

dblp:12/1963 · DBLP profile ↗
← Back
13ranked-venue papers
11as first author
0since 2021 · last 1985
—ORCID · none

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

Theory of computation · 9 · 8 first-authorSystems, architecture and hardware · 2 · 1 first-authorComputer networks · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 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
5 papers
Information theory · 98% Algorithms and data structures · 1% Mathematical optimization · 1%
Computer networks
1 paper
Physical-layer communications · 100%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Performance modeling and evaluation · 67% Emerging computing paradigms · 33%

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

TopicWeightPapersLastEvidence papers
Information theory
estimation theory
0.011979
A comparison of some Kalman estimators (Corresp.) · IEEE Trans. Inf. Theory 1979
Information theory › estimation theory › bayesian estimation
kalman filtering
0.011979
A comparison of some Kalman estimators (Corresp.) · IEEE Trans. Inf. Theory 1979
Physical-layer communications › signal processing for communications › spectral analysis
spectral estimation
0.011972
Some Remarks on Spectral Moment Estimation · IEEE Trans. Commun. 1972
Information theory › probability theory
stochastic processes
0.011969
Nonstationary autoregressive processes (Corresp.) · IEEE Trans. Inf. Theory 1969
Performance modeling and evaluation › simulation › analog and hybrid computer simulation
analog computer simulation
0.011961
Initial Conditions in Computer Simulation · IRE Trans. Electron. Comput. 1961
Emerging computing paradigms
analog computing
0.011961
Analog Computation of Covariance Matrices · IRE Trans. Electron. Comput. 1961
Performance modeling and evaluation
simulation
0.011961
Initial Conditions in Computer Simulation · IRE Trans. Electron. Comput. 1961
Information theory › hypothesis testing
signal detection
0.011957
An analysis of coherent integration and its application to signal detection · IRE Trans. Inf. Theory 1957
Information theory › probability theory › stochastic processes
spectral density
0.011969
Nonstationary autoregressive processes (Corresp.) · IEEE Trans. Inf. Theory 1969
Information theory › hypothesis testing
false alarm probability
0.011957
An analysis of coherent integration and its application to signal detection · IRE Trans. Inf. Theory 1957
Algorithms and data structures
numerical linear algebra
0.011961
Analog Computation of Covariance Matrices · IRE Trans. Electron. Comput. 1961
Information theory › signal processing
signal-to-noise ratio
0.011957
An analysis of coherent integration and its application to signal detection · IRE Trans. Inf. Theory 1957

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

spectral approach · 0.0covariance matrix comparison · 0.0covariance approach · 0.0transfer function simulation · 0.0integrator minimization · 0.0analog computation · 0.0
YearPublicationVenuePosition
1985 Invariance in moving target detection
abstract
Some schemes for detecting moving point targets against structured backgrounds from observations on the output of an imaging system are investigated. When the velocity of the target and the background image are considered as known, it is shown that the uniformly most powerful detector, invariant with respect to image intensity variations, consists of specific spatial-temporal differencing schemes. This places such schemes on a rigorous foundation.
Kenneth S. Miller, R. Raghavan, Marvin M. Rochwarger
IEEE Trans. Inf. Theory1
1979 A comparison of some Kalman estimators (Corresp.)
abstract
Various estimators of a dynamical state vector are optimally combined to obtain new estimators. The performance o! these new estimators is evaluated by comparing the traces of their covariance matrices. A nontrivial example is given to illustrate the techniques.
Donald Leskiw, Kenneth S. Miller
IEEE Trans. Inf. Theory2
1976 Hypothesis testing of complex covariance matrices
abstract
Let\cal ybe a mean zero complex stationary Gaussian signal process depending on a vector parameter\theta \prime = \{ \theta_{1}, \theta_{2}, \theta_{3} \}whose components represent parameters of the covariance function R(r) of\cal y. These parameters are chosen as\theta_{1} = R(0), \theta_{2} = |R( \tau )| /R(0), \theta_{3} =phase ofR( \tau), and they are simply related to the parameters of the spectral density of\cal y. This paper is concerned with the determination of most powerful (MP) tests that distinguish between random signals having different covariance functions. The tests are based uponNcorrelated pairs of independent observations on\cal y. Although the MP test that distinguishes between\theta = \theta_{o}and the alternative hypothesis\theta = \theta_{1}has been solved previously [11], the problem of identifying the random signals is often complicated by the fact that the signal power\theta_{1} = R(0)is not a distinguishing feature of either hypothesis. This paper determines the MP invariant test that delineates between the composite hypothesis\lambda \equiv R( \tau)/R(0) = \lambda_{0}and the composite alternative\lambda = \lambda_{1}. In addition, the uniformly MP invariant test that distinguishes between the composite hypotheses\theta_{2} <_{=} | \lambda_{o} |and\theta_{2} > | \lambda_{0} |has also been found. In all cases, exact probability distributions have been obtained.
Kenneth S. Miller, Marvin M. Rochwarger
IEEE Trans. Inf. Theory1
1976 Correction to 'Hypothesis Testing of complex Covariance Matrices'
Kenneth S. Miller, Marvin M. Rochwarger
IEEE Trans. Inf. Theory1
1975 Complex random fields
Kenneth S. Miller
Inf. Sci.1
1972 Some Remarks on Spectral Moment Estimation
abstract
Methods for estimating the normalized moments of the power spectrum of a stationary stochastic process via both spectral and covariance approaches are outlined. Various relationships between these two techniques are examined and typical extensions which submit to similar analyses are listed.
Kenneth S. Miller, Marvin M. Rochwarger
IEEE Trans. Commun.1
1972 A covariance approach to spectral moment estimation
abstract
We are interested in estimating the moments of the spectral density of a comp[ex Gaussian signal process\{ q^{(1)} (t) \}when the signal process is immersed in independent additive complex Gaussian noise\{q^{(2)} (t) \}. Using vector samplesQ = \{ q(t_1),\cdots ,q(t_m)\}, whereq(t) = q^{(1)}(t) + q^{(2)}(t), estimators for determining the spectral moments or parameters of the signal-process power spectrum may be constructed. These estimators depend upon estimates of the covariance functionR_1 (h)of the signal process at only one value ofh \neq 0. In particular, ifm = 2, these estimators are maximum-likelihood solutions. (The explicit solution of the likelihood equations form > 2is still an unsolved problem.) using these solutions, asymptotic (with sample size) formulas for the means and variances of the spectral mean frequency and spectral width are derived. It is shown that the leading term in the variance computations is identical with the Cramér-Rao lower bound calculated using the Fisher information matrix. Also considered is the case Where the data set consists ofNsamples Of continuous data, each of finite duration. In this case asymptotic (withN) formulas are also derived for the means and variances of the spectral mean frequency and spectral width.
Kenneth S. Miller, Marvin M. Rochwarger
IEEE Trans. Inf. Theory1
1970 On estimating spectral moments in the presence of colored noise
abstract
Let\{q^(1) (t)\}, the signal, be a complex Gaussian process corrupted by additive Gaussian noise\{q^(2) (t) \}. Observations onp(t)q(t)andp(t) q^(2) (t)are assumed to be available wherep(t)is a smooth weighting function andq = q^(1) + q^(2). Using the Fourier transform of the samples ofp(t)q(t)andp(t) q^(2) (t), estimators are derived for estimating the mean frequency and spectral width of the unknown power spectrum of the unweighted signal process. The means and variances of these statistics are computed in general, and explicitly for nontrivial practical examples. Asymptotic formulas for the moment estimators as a function of the number of realizations, frequency resolution, signal-to-noise ratio and spectral width, and consistency of the estimators are some of the results that are discussed in detail.
Kenneth S. Miller, Marvin M. Rochwarger
IEEE Trans. Inf. Theory1
1969 Nonstationary autoregressive processes (Corresp.)
abstract
LetRy_{t} = u_{t}be a stochastic difference equation. Various relations between the input and output covariances and spectral densities are deduced under the hypotheses thatRis time dependent and thatu_{t}is a member of a nonstationary random process.
Kenneth S. Miller
IEEE Trans. Inf. Theory1
1961 Analog Computation of Covariance Matrices
T. W. Connolly, Kenneth S. Miller
IRE Trans. Electron. Comput.2
1961 Initial Conditions in Computer Simulation
abstract
A technique is developed for the straightforward simulation of the transfer function of a certain class of linear systems. This method is particularly well adapted to the analysis of systems with fixed transfer function and variable initial conditions and forcing functions. In particular, a single simulation, minimal in its use of integrators, will suffice to handle forcing functions and initial conditions on both input and output.
Kenneth S. Miller, John B. Walsh
IRE Trans. Electron. Comput.1
1957 An analysis of coherent integration and its application to signal detection
abstract
An important characteristic of coherent integrators is that their effective bandwidth decreases as the integration time increases. If it is only known that a weak signal occurs somewhere in a given frequency range, then the number of integration channels required to cover the specified range increases as the amount of coherent integration is increased. However, each integration channel can independently cause a false alarm, although only the particular channel in which the signal appears can cause a true alarm. The question arises therefore whether it is profitable to lengthen the coherent integration period to increase the signal-to-noise ratio when doing so requires an increase in the number of integration channels. This problem is investigated analytically. Numerical results appropriate for system design are presented as a series of graphs of missed-signal probability vs number of integration channels, with initial signal-to-noise ratio and over-all false alarm probability as parameters. Also included is a detailed analysis of statistical properties of ideal and approximate ideal coherent integrators.
Kenneth S. Miller, R. Bernstein
IRE Trans. Inf. Theory1
1956 Solution of an integral equation occurring in the theories of prediction and detection
abstract
In many of the theories of prediction and detection developed during the past decade, one encounters linear integral equations which can be subsumed under the general form\int_a^b R(t, \tau) x(\tau) d\tau = f(t), a \leqq t \leqq b. This equation includes as special cases the Wiener-Hopf equation and the modified Wiener-Hopf equation\int_0^T R(\mid t - \tau \mid ) x(\tau) d\tau = f(t), 0 \leqq t \leqq T. The type of kernel considered in this note occurs when the noise can be regarded as the result of operating on white noise with a succession of not necessarily time-invariant linear differential and inverse-differential operators. For this type of noise, which is essentially a generalization of the stationary noise with a rational spectral density function, it is shown that the solution of the integral equation can be expressed in terms of solution of a certain linear differential equation with variable coefficients.
Kenneth S. Miller, Lotfi A. Zadeh
IRE Trans. Inf. Theory1