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

Lane H. Brandenburg

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

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

Theory of computation · 3 · 2 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
3 papers
Information theory · 94% Mathematical optimization · 6%

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

TopicWeightPapersLastEvidence papers
Information theory › probability theory
stochastic processes
0.021974
Approximation of finite-energy random processes by continuous processes (Corresp.) · IEEE Trans. Inf. Theory 1974
Shaping filter representation of nonstationary colored noise · IEEE Trans. Inf. Theory 1971
Information theory › signal processing › sampling theory
sampling and reconstruction
0.011973
On the reconstruction error of sampled data estimates (Corresp.) · IEEE Trans. Inf. Theory 1973
Information theory › probability theory › stochastic processes › numerical methods for stochastic processes
stochastic process approximation
0.011974
Approximation of finite-energy random processes by continuous processes (Corresp.) · IEEE Trans. Inf. Theory 1974
Information theory › probability theory › stochastic processes › stochastic process representation
covariance function
0.011971
Shaping filter representation of nonstationary colored noise · IEEE Trans. Inf. Theory 1971

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

multiplicity analysis · 0.0mean-square approximation · 0.0causal linear time-invariant system · 0.0riccati equation · 0.0mean-square differentiability · 0.0
YearPublicationVenuePosition
1974 Approximation of finite-energy random processes by continuous processes (Corresp.)
abstract
It is shown that any random process with finite energy can be approximated arbitrarily closely by a mean-square continuous process. We obtain approximants that in addition have continuous sample paths with probability 1. By a straightforward extension of these results, the approximating process can be made to have differentiable sample paths. The approximation can be performed in real time, in the sense that the approximating process constructed can be regarded as the output of a causal linear time-invariant system whose input is the finite energy process that is to be approximated.
Lane H. Brandenburg
IEEE Trans. Inf. Theory1
1973 On the reconstruction error of sampled data estimates (Corresp.)
abstract
In the sampling and reconstruction of a random process a discrepancy may occur between its multiplicity and that of its reconstructed version. It is shown that under general conditions an error due to this discrepancy is not present in the total error due to sampling and reconstruction. The problem is studied in the more general framework of tracking a random process of arbitrary multiplicity with one of unit multiplicity; there too, the tracking error can be made arbitrarily small.
Anthony Ephremides, Lane H. Brandenburg
IEEE Trans. Inf. Theory2
1971 Shaping filter representation of nonstationary colored noise
abstract
The problem of determining a shaping filter for nonstationary colored noise is considered. The shaping filter transforms white noise into a possibly nonstationary random process (having no white noise component) with a specified covariance function. A set of conditions to be satisfied by the covariance function leads to the determination of a shaping filter. The shaping filter coefficients are simply related to the solution of a matrix Riccati equation. In order to formulate the Riccati equation, basic results concerning the mean-square differentiability of a random process are developed. If the Riccati equation can not be defined, an autonomous (zero-input) shaping filter may be easily determined.
Lane H. Brandenburg, H. E. Meadows
IEEE Trans. Inf. Theory1