Fast Complexified Quaternion Fourier Transform
In this paper, we consider the extension of the Fourier transform to biquaternion-valued signals. We introduce a transform that we call the biquaternion Fourier transform (BiQFT). After giving some general properties of this transform, we show how it can be used to generalize the notion of analytic signal to complex-valued signals. We introduce the notion of hyperanalytic signal. We also study the Hermitian symmetries of the BiQFT and their relation to the geometric nature of a biquaternion-valued signal. Finally, we present a fast algorithm for the computation of the BiQFT. This algorithm is based on a (complex) change of basis and four standard complex FFTs.