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

Daniel P. Petersen

dblp:08/3515 · DBLP profile ↗
← Back
9ranked-venue papers
7as first author
0since 2021 · last 1976
0009-0002-3227-5247ORCID · corroborated

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

Theory of computation · 6 · 6 first-authorSystems, architecture and hardware · 1Computer networks · 1Databases, 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
7 papers
Information theory · 72% Coding theory · 11% Logic in computer science · 11%
Computer networks
1 paper
Physical-layer communications · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware reliability and fault tolerance · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › signal processing
filtering
0.021975
A proof of the separability of prefiltering and coding (Corresp.) · IEEE Trans. Inf. Theory 1975
Reexamination of the prefiltering problem in a state-variable formulation (Corresp.) · IEEE Trans. Inf. Theory 1970
Information theory › signal processing › filtering
prefiltering
0.021975
A proof of the separability of prefiltering and coding (Corresp.) · IEEE Trans. Inf. Theory 1975
Reexamination of the prefiltering problem in a state-variable formulation (Corresp.) · IEEE Trans. Inf. Theory 1970
Physical-layer communications › MIMO › precoding
linear precoding
0.011976
Optimal Linear Coding for Vector Channels · IEEE Trans. Commun. 1976
Physical-layer communications
MIMO
0.011976
Optimal Linear Coding for Vector Channels · IEEE Trans. Commun. 1976
Information theory
channel capacity
0.011976
Optimal Linear Coding for Vector Channels · IEEE Trans. Commun. 1976
Information theory › interference management › power control
power allocation
0.011976
Optimal Linear Coding for Vector Channels · IEEE Trans. Commun. 1976
Logic in computer science
separability
0.011975
A proof of the separability of prefiltering and coding (Corresp.) · IEEE Trans. Inf. Theory 1975
Coding theory
source coding
0.011975
A proof of the separability of prefiltering and coding (Corresp.) · IEEE Trans. Inf. Theory 1975
Hardware reliability and fault tolerance
majority voting
0.011973
Dissent in a Majority Voting System · IEEE Trans. Computers 1973
Algorithms and data structures › randomized algorithms
sampling
0.011970
Reexamination of the prefiltering problem in a state-variable formulation (Corresp.) · IEEE Trans. Inf. Theory 1970
Information theory › signal processing › sampling theory
sampling and reconstruction
0.021964
Reconstruction of Multidimensional Stochastic Fields from Discrete Measurements of Amplitude and Gradient · Inf. Control. 1964
Sampling and Reconstruction of Wave-Number-Limited Functions in N-Dimensional Euclidean Spaces · Inf. Control. 1962
Information theory › estimation theory
sequential estimation
0.011965
Recursion formulas for sequential estimation (Corresp.) · IEEE Trans. Inf. Theory 1965
Rendering
sampling
0.011965
Linear interpolation, extrapolation, and prediction of random space-time fields with a limited domain of measurement · IEEE Trans. Inf. Theory 1965

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

mean-squared-error criterion · 0.0eigenvalue decomposition · 0.0weighted-mean-square-error optimization · 0.0logic function design · 0.0wave-number analysis · 0.0state-variable analysis · 0.0least-square reconstruction · 0.0least-mean-square estimation · 0.0
YearPublicationVenuePosition
1976 Linear sequential coding of random space-time fields
Daniel P. Petersen
Inf. Sci.1
1976 Optimal Linear Coding for Vector Channels
abstract
This paper is concerned with the problem of obtaining the optimal linear vector coding (transformation) method that matches anr-dimensional vector signal and ak-dimensional channel under a given channel power constraint and mean-squared-error criterion. The encoder converts thercorrelated random variables intorindependent random variables and selects at mostkindependent random variables which correspond to theklargest eigenvaiues of the signal covariance matrixQ. The encoder reinserts cross correlation into thekrandom variables in such a way that the largest eigenvalue ofQis assigned to the smallest eigenvalue of the channel noise covariance matrixRand the second largest eigenvalue ofQto the second smallest eigenvalue ofR, etc. When only the total power for allkchannels is prescribed, the optimal individual channel power assignments are obtained in terms of the total power, the eigenvalues ofQ, and the eigenvalues ofR. When the individual channel power limits are constrained byP_{1}, ..., P_{k}andRis a diagonal matrix, the necessary conditions of an inverse eigenvalue problem must be satisfied to optimize the vector signal transmission system. An iterative numerical method has been developed for the case of correlated channel noise.
Kyong-Hwa Lee, Daniel P. Petersen
IEEE Trans. Commun.2
1975 A proof of the separability of prefiltering and coding (Corresp.)
abstract
A random signal observed in additive noise is to be linearly preprocessed for transmission via a channel of dimensionality less than that of either the observations or the signal. At the receiver, the signal is to be linearly reconstructed under a weighted-mean-square-error criterion. It is shown that there is no loss of overall optimality if the operation on the raw observations is partitioned into an optimal (least mean-square-error) prefilter followed by a linear coder.
Daniel P. Petersen
IEEE Trans. Inf. Theory1
1973 Dissent in a Majority Voting System
abstract
The reliability of digital computing systems is a significant problem. A scheme using multiply redundant computing devices with a majority voting device to determine the output has been shown to improve the reliability of that output. In this paper, a devices called a dissent detector is suggested as an addition to the system. The function of this device is that of an alarm to indicate the quality of the information (likelihood that the information is correct). Dissent is defined as a family of logic functions that compare the outputs of the voters to the output of the majority gate and report the disagreement or degree of disagreement that takes place. The operation of a dissent-detector that reports any disagreement in a triplicated majority voting system is demonstrated by example. The example illustrates the importance of the dissent information to the conditional reliability of the output of the majority gate. The results show that, with very little additional equipment, the conditional reliability of a majority voting system can be greatly enhanced. In fact, the conditional reliability of the example system exceeds the reliability of any of the system components, including the majority gate and the dissent detector.
S. Lee Hight, Daniel P. Petersen
IEEE Trans. Computers2
1970 Reexamination of the prefiltering problem in a state-variable formulation (Corresp.)
abstract
Optimal (least-mean-square linear) filtering of random signals prior to sampling may be represented as a Wiener-Kalman state-variable filter followed by a coder that synthesizes the signal to be sampled as a linear combination of the estimated states. Although the prefilter doubles the number of states of the overall presampling signal process, the postsampling reconstruction filter need only model the original signal generator and the coder. Overall optimization involves selecting the parameters of the coder to minimize a weighted time-averaged error criterion.
Daniel P. Petersen
IEEE Trans. Inf. Theory1
1965 Recursion formulas for sequential estimation (Corresp.)
Daniel P. Petersen
IEEE Trans. Inf. Theory1
1965 Linear interpolation, extrapolation, and prediction of random space-time fields with a limited domain of measurement
abstract
Formulas are derived for linear (least-square) reconstruction of multidimensional ({\em e.g.}, space-time) random fields from sample measurements taken over a limited region of observation. Data may or may not be contaminated with additive noise, and the sampling points may or may not be constrained to lie on a periodic The solution of the optimum filter problem in wave-number space is possible under certain restrictive conditions: 1) that the sampling locations be periodic and occupy a sector of the Euclidean sampling space, and 2) that the wave-number spectrum be factorable into two components, one of which represents a function nonzero only within the data space, the other only within the sector imaging the data space through the origin. If the values of the continuous field are accessible before sampling, a prefiltering operation can, in general, reduce the subsequent error of reconstruction. However, the determination of the optimum filter functions is exceedingly difficult, except under very special circumstances. A one-dimensional second-order Butterworth process is used to illustrate the effects of various postulated constraints on the sampling and filtering configuration.
Daniel P. Petersen, David Middleton
IEEE Trans. Inf. Theory1
1964 Reconstruction of Multidimensional Stochastic Fields from Discrete Measurements of Amplitude and Gradient
Daniel P. Petersen, David Middleton
Inf. Control.1
1962 Sampling and Reconstruction of Wave-Number-Limited Functions in N-Dimensional Euclidean Spaces
Daniel P. Petersen, David Middleton
Inf. Control.1