Fractional cosine, sine, and Hartley transforms

In previous papers, the Fourier transform (FT) has been generalized into the fractional Fourier transform (FRFT), the linear canonical transform (LCT), and the simplified fractional Fourier transform (SFRFT). Because the cosine, sine, and Hartley transforms are very similar to the FT, it is reasonable to think they can also be generalized by the similar way. We introduce several new transforms. They are all the generalization of the cosine, sine, or Hartley transform. We first derive the fractional cosine, sine, and Hartley transforms (FRCT/FRST/FRHT). They are analogous to the FRFT. Then, we derive the canonical cosine and sine transforms (CCT/CST). They are analogous to the LCT. We also derive the simplified fractional cosine, sine, and Hartley transforms (SFRCT/SFRST/SFRHT). They are analogous to the SFRFT and have the advantage of real-input-real-output. We also discuss the properties, digital implementation, and applications (e.g., the applications for filter design and space-variant pattern recognition) of these transforms. The transforms introduced in this paper are very efficient for digital implementation. We can just use one half or one fourth of the real multiplications required for the FRFT and LCT to implement them. When we want to process even, odd, or pure real/imaginary functions, we can use these transforms instead of the FRFT and LCT. Besides, we also show that the FRCT/FRST, CCT/CST, and SFRCT/SFRST are also useful for the one-sided (t ∈ [0, ∞]) signal processing