170,820 research outputs found
Compressed Sensing of Analog Signals in Shift-Invariant Spaces
A traditional assumption underlying most data converters is that the signal
should be sampled at a rate exceeding twice the highest frequency. This
statement is based on a worst-case scenario in which the signal occupies the
entire available bandwidth. In practice, many signals are sparse so that only
part of the bandwidth is used. In this paper, we develop methods for low-rate
sampling of continuous-time sparse signals in shift-invariant (SI) spaces,
generated by m kernels with period T. We model sparsity by treating the case in
which only k out of the m generators are active, however, we do not know which
k are chosen. We show how to sample such signals at a rate much lower than m/T,
which is the minimal sampling rate without exploiting sparsity. Our approach
combines ideas from analog sampling in a subspace with a recently developed
block diagram that converts an infinite set of sparse equations to a finite
counterpart. Using these two components we formulate our problem within the
framework of finite compressed sensing (CS) and then rely on algorithms
developed in that context. The distinguishing feature of our results is that in
contrast to standard CS, which treats finite-length vectors, we consider
sampling of analog signals for which no underlying finite-dimensional model
exists. The proposed framework allows to extend much of the recent literature
on CS to the analog domain.Comment: to appear in IEEE Trans. on Signal Processin
Time Delay Estimation from Low Rate Samples: A Union of Subspaces Approach
Time delay estimation arises in many applications in which a multipath medium
has to be identified from pulses transmitted through the channel. Various
approaches have been proposed in the literature to identify time delays
introduced by multipath environments. However, these methods either operate on
the analog received signal, or require high sampling rates in order to achieve
reasonable time resolution. In this paper, our goal is to develop a unified
approach to time delay estimation from low rate samples of the output of a
multipath channel. Our methods result in perfect recovery of the multipath
delays from samples of the channel output at the lowest possible rate, even in
the presence of overlapping transmitted pulses. This rate depends only on the
number of multipath components and the transmission rate, but not on the
bandwidth of the probing signal. In addition, our development allows for a
variety of different sampling methods. By properly manipulating the low-rate
samples, we show that the time delays can be recovered using the well-known
ESPRIT algorithm. Combining results from sampling theory with those obtained in
the context of direction of arrival estimation methods, we develop necessary
and sufficient conditions on the transmitted pulse and the sampling functions
in order to ensure perfect recovery of the channel parameters at the minimal
possible rate. Our results can be viewed in a broader context, as a sampling
theorem for analog signals defined over an infinite union of subspaces
Sub-Nyquist Sampling: Bridging Theory and Practice
Sampling theory encompasses all aspects related to the conversion of
continuous-time signals to discrete streams of numbers. The famous
Shannon-Nyquist theorem has become a landmark in the development of digital
signal processing. In modern applications, an increasingly number of functions
is being pushed forward to sophisticated software algorithms, leaving only
those delicate finely-tuned tasks for the circuit level.
In this paper, we review sampling strategies which target reduction of the
ADC rate below Nyquist. Our survey covers classic works from the early 50's of
the previous century through recent publications from the past several years.
The prime focus is bridging theory and practice, that is to pinpoint the
potential of sub-Nyquist strategies to emerge from the math to the hardware. In
that spirit, we integrate contemporary theoretical viewpoints, which study
signal modeling in a union of subspaces, together with a taste of practical
aspects, namely how the avant-garde modalities boil down to concrete signal
processing systems. Our hope is that this presentation style will attract the
interest of both researchers and engineers in the hope of promoting the
sub-Nyquist premise into practical applications, and encouraging further
research into this exciting new frontier.Comment: 48 pages, 18 figures, to appear in IEEE Signal Processing Magazin
Computationally Efficient Nonparametric Importance Sampling
The variance reduction established by importance sampling strongly depends on
the choice of the importance sampling distribution. A good choice is often hard
to achieve especially for high-dimensional integration problems. Nonparametric
estimation of the optimal importance sampling distribution (known as
nonparametric importance sampling) is a reasonable alternative to parametric
approaches.In this article nonparametric variants of both the self-normalized
and the unnormalized importance sampling estimator are proposed and
investigated. A common critique on nonparametric importance sampling is the
increased computational burden compared to parametric methods. We solve this
problem to a large degree by utilizing the linear blend frequency polygon
estimator instead of a kernel estimator. Mean square error convergence
properties are investigated leading to recommendations for the efficient
application of nonparametric importance sampling. Particularly, we show that
nonparametric importance sampling asymptotically attains optimal importance
sampling variance. The efficiency of nonparametric importance sampling
algorithms heavily relies on the computational efficiency of the employed
nonparametric estimator. The linear blend frequency polygon outperforms kernel
estimators in terms of certain criteria such as efficient sampling and
evaluation. Furthermore, it is compatible with the inversion method for sample
generation. This allows to combine our algorithms with other variance reduction
techniques such as stratified sampling. Empirical evidence for the usefulness
of the suggested algorithms is obtained by means of three benchmark integration
problems. As an application we estimate the distribution of the queue length of
a spam filter queueing system based on real data.Comment: 29 pages, 7 figure
Towards low-latency real-time detection of gravitational waves from compact binary coalescences in the era of advanced detectors
Electromagnetic (EM) follow-up observations of gravitational wave (GW) events
will help shed light on the nature of the sources, and more can be learned if
the EM follow-ups can start as soon as the GW event becomes observable. In this
paper, we propose a computationally efficient time-domain algorithm capable of
detecting gravitational waves (GWs) from coalescing binaries of compact objects
with nearly zero time delay. In case when the signal is strong enough, our
algorithm also has the flexibility to trigger EM observation before the merger.
The key to the efficiency of our algorithm arises from the use of chains of
so-called Infinite Impulse Response (IIR) filters, which filter time-series
data recursively. Computational cost is further reduced by a template
interpolation technique that requires filtering to be done only for a much
coarser template bank than otherwise required to sufficiently recover optimal
signal-to-noise ratio. Towards future detectors with sensitivity extending to
lower frequencies, our algorithm's computational cost is shown to increase
rather insignificantly compared to the conventional time-domain correlation
method. Moreover, at latencies of less than hundreds to thousands of seconds,
this method is expected to be computationally more efficient than the
straightforward frequency-domain method.Comment: 19 pages, 6 figures, for PR
Scalable macromodelling methodology for the efficient design of microwave filters
The complexity of the design of microwave filters increases steadily over the years. General design techniques available in literature yield relatively good initial designs, but electromagnetic (EM) optimisation is often needed to meet the specifications. Although interesting optimisation strategies exist, they depend on computationally expensive EM simulations. This makes the optimisation process time consuming. Moreover, brute force optimisation does not provide physical insights into the design and it is only applicable to one set of specifications. If the specifications change, the design and optimisation process must be redone. The authors propose a scalable macromodel-based design approach to overcome this. Scalable macromodels can be generated in an automated way. So far the inclusion of scalable macromodels in the design cycle of microwave filters has not been studied. In this study, it is shown that scalable macromodels can be included in the design cycle of microwave filters and re-used in multiple design scenarios at low computational cost. Guidelines to properly generate and use scalable macromodels in a filter design context are given. The approach is illustrated on a state-of-the-art microstrip dual-band bandpass filter with closely spaced pass bands and a complex geometrical structure. The results confirm that scalable macromodels are proper design tools and a valuable alternative to a computationally expensive EM simulator-based design flow
Fast algorithms and efficient GPU implementations for the Radon transform and the back-projection operator represented as convolution operators
The Radon transform and its adjoint, the back-projection operator, can both
be expressed as convolutions in log-polar coordinates. Hence, fast algorithms
for the application of the operators can be constructed by using FFT, if data
is resampled at log-polar coordinates. Radon data is typically measured on an
equally spaced grid in polar coordinates, and reconstructions are represented
(as images) in Cartesian coordinates. Therefore, in addition to FFT, several
steps of interpolation have to be conducted in order to apply the Radon
transform and the back-projection operator by means of convolutions.
Both the interpolation and the FFT operations can be efficiently implemented
on Graphical Processor Units (GPUs). For the interpolation, it is possible to
make use of the fact that linear interpolation is hard-wired on GPUs, meaning
that it has the same computational cost as direct memory access. Cubic order
interpolation schemes can be constructed by combining linear interpolation
steps which provides important computation speedup.
We provide details about how the Radon transform and the back-projection can
be implemented efficiently as convolution operators on GPUs. For large data
sizes, speedups of about 10 times are obtained in relation to the computational
times of other software packages based on GPU implementations of the Radon
transform and the back-projection operator. Moreover, speedups of more than a
1000 times are obtained against the CPU-implementations provided in the MATLAB
image processing toolbox
Detection of variable frequency signals using a fast chirp transform
The detection of signals with varying frequency is important in many areas of
physics and astrophysics. The current work was motivated by a desire to detect
gravitational waves from the binary inspiral of neutron stars and black holes,
a topic of significant interest for the new generation of interferometric
gravitational wave detectors such as LIGO. However, this work has significant
generality beyond gravitational wave signal detection.
We define a Fast Chirp Transform (FCT) analogous to the Fast Fourier
Transform (FFT). Use of the FCT provides a simple and powerful formalism for
detection of signals with variable frequency just as Fourier transform
techniques provide a formalism for the detection of signals of constant
frequency. In particular, use of the FCT can alleviate the requirement of
generating complicated families of filter functions typically required in the
conventional matched filtering process. We briefly discuss the application of
the FCT to several signal detection problems of current interest
- …