HOME

TheInfoList



OR:

The spectral concentration problem in
Fourier analysis In mathematics, Fourier analysis () is the study of the way general functions may be represented or approximated by sums of simpler trigonometric functions. Fourier analysis grew from the study of Fourier series, and is named after Josep ...
refers to finding a time sequence of a given length whose
discrete Fourier transform In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex- ...
is maximally localized on a given
frequency Frequency is the number of occurrences of a repeating event per unit of time. It is also occasionally referred to as ''temporal frequency'' for clarity, and is distinct from ''angular frequency''. Frequency is measured in hertz (Hz) which is eq ...
interval, as measured by the spectral concentration.


Spectral concentration

The
discrete-time Fourier transform In mathematics, the discrete-time Fourier transform (DTFT) is a form of Fourier analysis that is applicable to a sequence of values. The DTFT is often used to analyze samples of a continuous function. The term ''discrete-time'' refers to the ...
(DTFT) ''U''(''f'') of a finite series w_t, t = 1,2,3,4,...,T is defined as :U(f) = \sum_^w_t e^. In the following, the
sampling interval In signal processing, sampling is the reduction of a continuous-time signal to a discrete-time signal. A common example is the conversion of a sound wave to a sequence of "samples". A sample is a value of the signal at a point in time and/or s ...
will be taken as Δ''t'' = 1, and hence the frequency interval as ''f'' ∈ ½,½ ''U''(''f'') is a
periodic function A periodic function is a function that repeats its values at regular intervals. For example, the trigonometric functions, which repeat at intervals of 2\pi radians, are periodic functions. Periodic functions are used throughout science to desc ...
with a period 1. For a given frequency ''W'' such that 0<''W''<½, the spectral concentration \lambda(T,W) of ''U''(''f'') on the interval ''W'',''W''is defined as the ratio of power of ''U''(''f'') contained in the
frequency band A frequency band is an interval in the frequency domain, delimited by a lower frequency and an upper frequency. The term may refer to a radio band or an interval of some other spectrum. The frequency range of a system is the range over which i ...
''W'',''W''to the power of ''U''(''f'') contained in the entire frequency band ½,½ That is, :\lambda(T,W) = \frac . It can be shown that ''U''(''f'') has only isolated zeros and hence 0<\lambda(T,W)<1 (see . Thus, the spectral concentration is strictly less than one, and there is no finite sequence w_t for which the DTFT can be confined to a band ''W'',''W''and made to vanish outside this band.


Statement of the problem

Among all
sequences In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members (also called ''elements'', or ''terms''). The number of elements (possibly infinite) is called t ...
\lbrace w_t \rbrace for a given ''T'' and ''W'', is there a sequence for which the spectral concentration is maximum? In other words, is there a sequence for which the
sidelobe In antenna engineering, sidelobes are the lobes (local maxima) of the far field radiation pattern of an antenna or other radiation source, that are not the ''main lobe''. The radiation pattern of most antennas shows a pattern of "''lobes''" ...
energy outside a frequency band ''W'',''W''is minimum? The answer is yes; such a sequence indeed exists and can be found by optimizing \lambda(T,W). Thus maximising the power :\int_^ ^2 \,df subject to the constraint that the total power is fixed, say :\int_^ ^2 \,df=1, leads to the following equation satisfied by the optimal sequence w_t: :\sum_^ \frac w_ = \lambda w_. This is an
eigenvalue In linear algebra, an eigenvector () or characteristic vector of a linear transformation is a nonzero vector that changes at most by a scalar factor when that linear transformation is applied to it. The corresponding eigenvalue, often denoted b ...
equation for a
symmetric Symmetry (from grc, συμμετρία "agreement in dimensions, due proportion, arrangement") in everyday language refers to a sense of harmonious and beautiful proportion and balance. In mathematics, "symmetry" has a more precise definiti ...
matrix Matrix most commonly refers to: * ''The Matrix'' (franchise), an American media franchise ** ''The Matrix'', a 1999 science-fiction action film ** "The Matrix", a fictional setting, a virtual reality environment, within ''The Matrix'' (franchis ...
given by :M_ = \frac. It can be shown that this matrix is
positive-definite In mathematics, positive definiteness is a property of any object to which a bilinear form or a sesquilinear form may be naturally associated, which is positive-definite. See, in particular: * Positive-definite bilinear form * Positive-definite fu ...
, hence all the eigenvalues of this matrix lie between 0 and 1. The largest eigenvalue of the above equation corresponds to the largest possible spectral concentration; the corresponding eigenvector is the required optimal sequence w_t. This sequence is called a 0''th''–order Slepian sequence (also known as a discrete prolate spheroidal sequence, or DPSS), which is a unique taper with maximally suppressed sidelobes. It turns out that the number of dominant eigenvalues of the matrix ''M'' that are close to 1, corresponds to ''N=2WT'' called as
Shannon number The Shannon number, named after the American mathematician Claude Shannon, is a conservative lower bound of the game-tree complexity of chess of 10120, based on an average of about 103 possibilities for a pair of moves consisting of a move for Wh ...
. If the eigenvalues \lambda are arranged in decreasing order (i.e., \lambda_>\lambda_>\lambda_>...>\lambda_), then the eigenvector corresponding to \lambda_ is called ''nth''–order Slepian sequence (DPSS) (0≤''n''≤''N''-1). This ''nth''–order taper also offers the best sidelobe suppression and is pairwise
orthogonal In mathematics, orthogonality is the generalization of the geometric notion of ''perpendicularity''. By extension, orthogonality is also used to refer to the separation of specific features of a system. The term also has specialized meanings in ...
to the Slepian sequences of previous orders (0,1,2,3....,n-1). These lower order Slepian sequences form the basis for
spectral estimation In statistical signal processing, the goal of spectral density estimation (SDE) or simply spectral estimation is to estimate the spectral density (also known as the power spectral density) of a signal from a sequence of time samples of the signa ...
by multitaper method. Not limited to time series, the spectral concentration problem can be reformulated to apply on the surface of the sphere by using
spherical harmonics In mathematics and physical science, spherical harmonics are special functions defined on the surface of a sphere. They are often employed in solving partial differential equations in many scientific fields. Since the spherical harmonics form a ...
, for applications in
geophysics Geophysics () is a subject of natural science concerned with the physical processes and physical properties of the Earth and its surrounding space environment, and the use of quantitative methods for their analysis. The term ''geophysics'' som ...
and
cosmology Cosmology () is a branch of physics and metaphysics dealing with the nature of the universe. The term ''cosmology'' was first used in English in 1656 in Thomas Blount (lexicographer), Thomas Blount's ''Glossographia'', and in 1731 taken up in ...
among others.


See also

* Multitaper *
Fourier transform A Fourier transform (FT) is a mathematical transform that decomposes functions into frequency components, which are represented by the output of the transform as a function of frequency. Most commonly functions of time or space are transformed, ...
*
Discrete Fourier transform In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex- ...


References

* Partha Mitra and Hemant Bokil. ''Observed Brain Dynamics'', Oxford University Press, USA (2007)
Link for book
* Donald. B. Percival and Andrew. T. Walden. ''Spectral Analysis for Physical Applications: Multitaper and Conventional Univariate Techniques'', Cambridge University Press, UK (2002). * Partha Mitra and B. Pesaran, "Analysis of Dynamic Brain Imaging Data." The Biophysical Journal, Volume 76 (1999), 691-708
arxiv.org/abs/q-bio/0309028
* F. J. Simons, M. A. Wieczorek and F. A. Dahlen. ''Spatiospectral concentration on a sphere''. SIAM Review, 2006, {{doi, 10.1137/S0036144504445765 Fourier analysis Signal processing