7,970 research outputs found
Fast Algorithms for the computation of Fourier Extensions of arbitrary length
Fourier series of smooth, non-periodic functions on are known to
exhibit the Gibbs phenomenon, and exhibit overall slow convergence. One way of
overcoming these problems is by using a Fourier series on a larger domain, say
with , a technique called Fourier extension or Fourier
continuation. When constructed as the discrete least squares minimizer in
equidistant points, the Fourier extension has been shown shown to converge
geometrically in the truncation parameter . A fast algorithm has been described to compute Fourier extensions for the case
where , compared to for solving the dense discrete
least squares problem. We present two algorithms for
the computation of these approximations for the case of general , made
possible by exploiting the connection between Fourier extensions and Prolate
Spheroidal Wave theory. The first algorithm is based on the explicit
computation of so-called periodic discrete prolate spheroidal sequences, while
the second algorithm is purely algebraic and only implicitly based on the
theory
FFT Interpolation from Nonuniform Samples Lying in a Regular Grid
This paper presents a method to interpolate a periodic band-limited signal
from its samples lying at nonuniform positions in a regular grid, which is
based on the FFT and has the same complexity order as this last algorithm. This
kind of interpolation is usually termed "the missing samples problem" in the
literature, and there exists a wide variety of iterative and direct methods for
its solution. The one presented in this paper is a direct method that exploits
the properties of the so-called erasure polynomial, and it provides a
significant improvement on the most efficient method in the literature, which
seems to be the burst error recovery (BER) technique of Marvasti's et al. The
numerical stability and complexity of the method are evaluated numerically and
compared with the pseudo-inverse and BER solutions.Comment: Submitted to the IEEE Transactions on Signal Processin
Chirplet approximation of band-limited, real signals made easy
In this paper we present algorithms for approximating real band-limited
signals by multiple Gaussian Chirps. These algorithms do not rely on matching
pursuit ideas. They are hierarchial and, at each stage, the number of terms in
a given approximation depends only on the number of positive-valued maxima and
negative-valued minima of a signed amplitude function characterizing part of
the signal. Like the algorithms used in \cite{gre2} and unlike previous
methods, our chirplet approximations require neither a complete dictionary of
chirps nor complicated multi-dimensional searches to obtain suitable choices of
chirp parameters
Advancements of MultiRate Signal processing for Wireless Communication Networks: Current State Of the Art
With the hasty growth of internet contact and voice and information centric communications, many contact technologies have been urbanized to meet the stringent insist of high speed information transmission and viaduct the wide bandwidth gap among ever-increasing high-data-rate core system and bandwidth-hungry end-user complex. To make efficient consumption of the limited bandwidth of obtainable access routes and cope with the difficult channel environment, several standards have been projected for a variety of broadband access scheme over different access situation (twisted pairs, coaxial cables, optical fibers, and unchanging or mobile wireless admittance). These access situations may create dissimilar channel impairments and utter unique sets of signal dispensation algorithms and techniques to combat precise impairments. In the intended and implementation sphere of those systems, many research issues arise. In this paper we present advancements of multi-rate indication processing methodologies that are aggravated by this design trend. The thesis covers the contemporary confirmation of the current literature on intrusion suppression using multi-rate indication in wireless communiquE9; networks
- …