Instantaneous frequency and amplitude of complex signals based on quaternion Fourier transform

The ideas of instantaneous amplitude and phase are well understood for signals with real-valued samples, based on the analytic signal which is a complex signal with one-sided Fourier transform. We extend these ideas to signals with complex-valued samples, using a quaternion-valued equivalent of the analytic signal obtained from a one-sided quaternion Fourier transform which we refer to as the hypercomplex representation of the complex signal. We present the necessary properties of the quaternion Fourier transform, particularly its symmetries in the frequency domain and formulae for convolution and the quaternion Fourier transform of the Hilbert transform. The hypercomplex representation may be interpreted as an ordered pair of complex signals or as a quaternion signal. We discuss its derivation and properties and show that its quaternion Fourier transform is one-sided. It is shown how to derive from the hypercomplex representation a complex envelope and a phase. A classical result in the case of real signals is that an amplitude modulated signal may be analysed into its envelope and carrier using the analytic signal provided that the modulating signal has frequency content not overlapping with that of the carrier. We show that this idea extends to the complex case, provided that the complex signal modulates an orthonormal complex exponential. Orthonormal complex modulation can be represented mathematically by a polar representation of quaternions previously derived by the authors. As in the classical case, there is a restriction of non-overlapping frequency content between the modulating complex signal and the orthonormal complex exponential. We show that, under these conditions, modulation in the time domain is equivalent to a frequency shift in the quaternion Fourier domain. Examples are presented to demonstrate these concepts

Intelligent OFDM telecommunication system. Part 2. Examples of complex and quaternion many-parameter transforms

In this paper, we propose unified mathematical forms of many-parametric complex and quaternion Fourier transforms for novel Intelligent OFDM-telecommunication systems (OFDM-TCS). Each many-parametric transform (MPT) depends on many free angle parameters. When parameters are changed in some way, the type and form of transform are changed as well. For example, MPT may be the Fourier transform for one set of parameters, wavelet transform for other parameters and other transforms for other values of parameters. The new Intelligent-OFDM-TCS uses inverse MPT for modulation at the transmitter and direct MPT for demodulation at the receiver. © 2019 IOP Publishing Ltd. All rights reserved

Complex and Hypercomplex Discrete Fourier Transforms Based on Matrix Exponential Form of Euler's Formula

We show that the discrete complex, and numerous hypercomplex, Fourier transforms defined and used so far by a number of researchers can be unified into a single framework based on a matrix exponential version of Euler's formula $e^{j\theta}=\cos\theta+j\sin\theta$, and a matrix root of -1 isomorphic to the imaginary root $j$. The transforms thus defined can be computed using standard matrix multiplications and additions with no hypercomplex code, the complex or hypercomplex algebra being represented by the form of the matrix root of -1, so that the matrix multiplications are equivalent to multiplications in the appropriate algebra. We present examples from the complex, quaternion and biquaternion algebras, and from Clifford algebras Cl1,1 and Cl2,0. The significance of this result is both in the theoretical unification, and also in the scope it affords for insight into the structure of the various transforms, since the formulation is such a simple generalization of the classic complex case. It also shows that hypercomplex discrete Fourier transforms may be computed using standard matrix arithmetic packages without the need for a hypercomplex library, which is of importance in providing a reference implementation for verifying implementations based on hypercomplex code.Comment: The paper has been revised since the second version to make some of the reasons for the paper clearer, to include reviews of prior hypercomplex transforms, and to clarify some points in the conclusion