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

N. Jeremy Kasdin

dblp:136/0009 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1995
—ORCID · unresolved

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

Applied, interdisciplinary, general and emerging computing · 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%

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

TopicWeightPapersLastEvidence papers
Information theory › probability theory › stochastic processes › numerical methods for stochastic processes
stochastic process simulation
0.011995
Discrete simulation of colored noise and stochastic processes and 1/fα power law noise generation · Proc. IEEE 1995
Information theory › signal processing
spectral estimation
0.011995
Discrete simulation of colored noise and stochastic processes and 1/fα power law noise generation · Proc. IEEE 1995

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

runge-kutta methods · 0.0power-law noise model · 0.0autoregressive modeling · 0.0
YearPublicationVenuePosition
1995 Discrete simulation of colored noise and stochastic processes and 1/fα power law noise generation
abstract
This paper discusses techniques for generating digital sequences of noise which simulate processes with certain known properties or describing equations. Part I of the paper presents a review of stochastic processes and spectral estimation (with some new results) and a tutorial on simulating continuous noise processes with a known autospectral density or autocorrelation function. In defining these techniques for computer generating sequences, it also defines the necessary accuracy criteria. These methods are compared to some of the common techniques for noise generation and the problems, or advantages, of each are discussed. Finally, Part I presents results on simulating stochastic differential equations. A Runge-Kutta (RK) method is presented for numerically solving these equations. Part II of the paper discusses power law, or 1/f/sup /spl alpha//, noises. Such noise processes occur frequently in nature and, in many cases, with nonintegral values for /spl alpha/. A review of 1/f noises in devices and systems is followed by a discussion of the most common continuous 1/f noise models. The paper then presents a new digital model for power law noises. This model allows for very accurate and efficient computer generation of 1/f/sup /spl alpha// noises for any /spl alpha/. Many of the statistical properties of this model are discussed and compared to the previous continuous models. Lastly, a number of approximate techniques for generating power law noises are presented for rapid or real time simulation.>
N. Jeremy Kasdin
Proc. IEEE1