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

G. Casinovi

dblp:47/4540 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2009
—ORCID · none

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

Theory of computation · 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 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › ergodic theory
ergodic theorem
0.112009
Sampling and Ergodic Theorems for Weakly Almost Periodic Signals · IEEE Trans. Inf. Theory 2009
Information theory › signal processing › sampling theory
sampling theorem
0.112009
Sampling and Ergodic Theorems for Weakly Almost Periodic Signals · IEEE Trans. Inf. Theory 2009
Information theory
signal processing
0.112009
Sampling and Ergodic Theorems for Weakly Almost Periodic Signals · IEEE Trans. Inf. Theory 2009
Information theory › signal processing › sampling theory
signal sampling
0.112009
Sampling and Ergodic Theorems for Weakly Almost Periodic Signals · IEEE Trans. Inf. Theory 2009
Information theory › signal processing › spectral estimation
spectral density estimation
0.112009
Sampling and Ergodic Theorems for Weakly Almost Periodic Signals · IEEE Trans. Inf. Theory 2009

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

commutative groups · 0.1abstract harmonic analysis · 0.1
YearPublicationVenuePosition
2009 Sampling and Ergodic Theorems for Weakly Almost Periodic Signals
abstract
The theory of abstract harmonic analysis on commutative groups is used to prove sampling and ergodic theorems concerning a particular class of finite-power signals, which are known as weakly almost periodic. The analysis brings to light some noteworthy differences between finite-energy and finite-power signal sampling. It is shown that the bandwidth of the Fourier transform of a weakly almost periodic signal is generally larger than the bandwidth of the power spectrum of the signal. Consequently, the signal power spectrum by itself does not generally provide enough information to determine the value of the time-domain Nyquist rate, that is, the minimum sampling rate necessary for exact signal reconstruction in the time-domain. On the other hand, it is also shown that the minimum sampling rate needed to obtain alias-free spectral estimates is determined by the bandwidth of the power spectrum and, consequently, may be lower than the time-domain Nyquist rate. Finally, the sampling and ergodic theorems established in this paper are used in an analysis of averaged periodogram estimates of the power spectrum of a weakly almost periodic signal. It is shown that the value of the time shift between consecutive windows may contribute to the asymptotic bias of the estimates.
G. Casinovi
IEEE Trans. Inf. Theory1