Abstract. This paper introduces a fast algorithm for the energy space boson Boltzmann collision operator. Compared to the direct O(N3) calculation and the previous O(N2 logN) method [Markowich and Pareschi, 2005], the new algorithm runs in complexity O(N log N), which is optimal up to a logarithmic factor (N is the number of grid points in energy space). The basic idea is to partition the 3-D s...

A new method for finding the rotation angle in iris images for biometric identification is presented in this paper. The proposed approach is based on Fourier descriptors analysis and algebraic properties of vector rotation in complex space.

A function f (X 1 ; X 2 ; : : : ; X n) is said to be t th-order correlation-immune if the ran-ally, if all possible outputs are equally likely, then f is called a t ?resilient function. In this paper, we provide three diierent characterizations of t th-order correlation immune functions and resilient functions where the random variable is over GF (q). The rst is in terms of the structure of a c...

The Euler transformation is a linear sequence transformation to accelerate the convergence of an alternating series. The sequence of weights of the transformation is extended to a continuous weight function which can accelerate Fourier type integrals including Hankel transforms with a slowly convergent integrand. We show that the continuous weight function can also be used to compute the Fourie...

We introduce a tractable multi-currency model with stochastic volatility and correlated stochastic interest rates that takes into account the smile in the FX market and the evolution of yield curves. The pricing of vanilla options on FX rates can be efficiently performed through the FFT methodology thanks to the affine property of the model. Our framework is also able to describe many non trivi...

A major application of the FFT is fast convolution or fast ltering where the DFT of the signal is multiplied term-by-term by the DFT of the impulse (helps to be doing nite impulse response (FIR) ltering) and the time-domain output is obtained by taking the inverse DFT of that product. What is less well-known is the DFT can be calculated by convolution. There are several di erent approaches to t...

In this article, we focus on the parameterization of nonrigid geometrical deformations with a small number of flexible degrees of freedom . In previous work, we proposed a general framework called polyaffine to parameterize deformations with a small number of rigid or affine components, while guaranteeing the invertibility of global deformations. However, this framework lacks some important pro...

To fully utilize the available spectrum for a wireless communication system it is feasible to adapt to different situations on the channel as well as different systems with various quality of service. In this paper a generic OFDM transmitter is presented and it is shown that high flexibility can be obtained with a reasonable amount of additional hardware. Part of the design, the FFT-processor, ...

Implicitly dealiasing is a recently-developed technique which improves upon conventional zero padding to compute linear convolutions via fast Fourier transforms. For onedimensional inputs, the memory requirements and performance are similar to conventional zero-padded convolutions, but implicitly dealiased convolutions are faster and require less memory when the data is multi-dimensional. We sh...