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

Wolfgang Splettstösser

dblp:93/4669 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
0since 2021 · last 1987
—ORCID · none

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

Theory of computation · 5 · 2 first-authorDatabases, data management, data science and information retrieval · 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
5 papers
Information theory · 86% Coding theory · 9% Mathematical optimization · 5%

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

TopicWeightPapersLastEvidence papers
Information theory › signal processing › sampling theory
sampling theorem
0.021982
Sampling approximation of continuous functions with multidimensional domain · IEEE Trans. Inf. Theory 1982
On Walsh differentiable dyadically stationary random processes · IEEE Trans. Inf. Theory 1982
Information theory › signal processing
signal prediction
0.011987
Linear prediction from samples of a function and its derivatives · IEEE Trans. Inf. Theory 1987
Information theory › signal processing › sampling theory
aliasing error
0.011982
Sampling approximation of continuous functions with multidimensional domain · IEEE Trans. Inf. Theory 1982
Information theory › signal processing › sampling theory
multidimensional sampling
0.011982
Sampling approximation of continuous functions with multidimensional domain · IEEE Trans. Inf. Theory 1982
Information theory › probability theory
stochastic processes
0.011982
On Walsh differentiable dyadically stationary random processes · IEEE Trans. Inf. Theory 1982
Coding theory › boolean functions
walsh functions
0.011982
On Walsh differentiable dyadically stationary random processes · IEEE Trans. Inf. Theory 1982
Information theory › signal processing › sampling theory
sampling and reconstruction
0.011981
Sampling Series Approximation of Continuous Weak Sense Stationary Processes · Inf. Control. 1981
Information theory › signal processing › sampling theory
bandlimited functions
0.011987
Linear prediction from samples of a function and its derivatives · IEEE Trans. Inf. Theory 1987
Mathematical optimization › numerical analysis
error estimation
0.011977
A Sampling Theorem for Duration-Limited Functions with Error Estimates · Inf. Control. 1977
Information theory › signal processing
sampling theory
0.011977
A Sampling Theorem for Duration-Limited Functions with Error Estimates · Inf. Control. 1977
Information theory › probability theory › stochastic processes
stationary processes
0.011981
Sampling Series Approximation of Continuous Weak Sense Stationary Processes · Inf. Control. 1981
Information theory
signal processing
0.011977
A Sampling Theorem for Duration-Limited Functions with Error Estimates · Inf. Control. 1977

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

taylor series approximation · 0.0newton series · 0.0multidimensional convolution integrals · 0.0dyadic derivative · 0.0de la vallée poussin integrals · 0.0sampling theorem · 0.0
YearPublicationVenuePosition
1987 Linear prediction from samples of a function and its derivatives
abstract
Some formulas for the prediction of the values of a band-limited function based on its samples from the past are generalized by including past samples of its first derivative. The new sums, developed by an approach based on Newton series, make it possible to double the distance between the sample points. The resulting formulas are shown to apply to the prediction problem for a large class of entire functions of exponential type. In addition, a related prediction formula which uses past samples of successively higher derivatives is shown to behave similarly to the Taylor series approximation, again for a class of functions that includes the band-limited functions.
Dale H. Mugler, Wolfgang Splettstösser
IEEE Trans. Inf. Theory2
1982 On the prediction of band-limited signals from past samples
Wolfgang Splettstösser
Inf. Sci.1
1982 On Walsh differentiable dyadically stationary random processes
abstract
Some basic properties of dyadically stationary (DS) processes are introduced, including continuity and spectral representation. A sampling theorem based on the Walsh functions is investigated for random signals that are not necessarily sequency-limited. By using the concept of a dyadic derivative, the resulting aliasing error is calculated together with the speed of convergence. An example gives a glimpse into the possibilities of applying the sampling theorem as well as the dyadic derivative.
Wolfgang Engels, Wolfgang Splettstösser
IEEE Trans. Inf. Theory2
1982 Sampling approximation of continuous functions with multidimensional domain
abstract
After evaluating Shannon's sampling theorem for functions of several variables, the aliasing error is estimated in dependence upon smoothness conditions. As a main tool the concept of multidimensional convolution integrals is introduced, in particular those of de La Vallée Poussin, which are also helpful in constructing generalized sampling series having better aliasing bounds.
Wolfgang Splettstösser
IEEE Trans. Inf. Theory1
1981 Sampling Series Approximation of Continuous Weak Sense Stationary Processes
Wolfgang Splettstösser
Inf. Control.1
1978 Sampling principle for duration-limited signals and dyadic Walsh analysis
P. L. Butzer, Wolfgang Splettstösser
Inf. Sci.2
1977 A Sampling Theorem for Duration-Limited Functions with Error Estimates
P. L. Butzer, Wolfgang Splettstösser
Inf. Control.2