Discrete Octonion Linear Canonical Transform: Definition and Properties

: In this paper, the discrete octonion linear canonical transform (DOCLCT) is defined. According to the definition of the DOCLCT, some properties associated with the DOCLCT are explored, such as linearity, scaling, boundedness, Plancherel theorem, inversion transform and shift transform. Then, the relationship between the DOCLCT and the three-dimensional (3-D) discrete linear canonical transform (DLCT) is obtained. Moreover, based on a new convolution operator, we derive the convolution theorem of the DOCLCT. Finally, the correlation theorem of the DOCLCT is established.


Introduction
The linear canonical transform (LCT) [1][2][3] is a generalized form of the fractional Fourier transform (FrFT).As a linear integral transform with three parameter class, the LCT is more flexible than the FrFT and is a widely used analytical and processing tool in applied mathematics and engineering [4][5][6][7][8].For analyzing and processing the non-stationary spectrum of finite-duration signals, Pei and Ding [9] proposed the discrete linear canonical transform (DLCT).The DLCT is a very important tool for processing discrete data with a digital camera.Wei et al. [10] studied image encryption using the the random discrete linear canonical transform, which demonstrated that the proposed encryption method is a security-enhanced image encryption scheme.Sun and Li [11] proposed the sliding discrete linear canonical transform and obtained an adaptive method for the computation of the DLCT.Zhang and Li [12] proposed and designed the definition of the DLCT in graph settings.Based on different kinds of DLCTs, several scholars studied many properties and applications [13][14][15][16][17].
Recently, hypercomplex algebras [18,19] are increasingly receiving research interest from scholars.Quaternion algebras are hypercomplex algebras of order 4 and have been widely applied in optical and signal processing [20][21][22].Urynbassarova et al. [23] extended the DLCT to the quaternion linear canonical transform domain, and proposed the discrete quaternion linear canonical transform (DQLCT).Some properties of the two-dimensional (2-D) DQLCT were derived, such as the shift, modulation, inversion formula and Plancherel theorem.Moreover, they studied the convolution theorem and fast algorithm for the 2-D DQLCT.Based on the 2-D DQLCT, some applications were illustrated by the simulations.Srivastava et al. [24] presented the discrete quadratic-phase Fourier transform.The convolution and correlation theorems for the discrete quadratic-phase Fourier transform were studied.
Octonion algebras [25] are another hypercomplex algebra with order 8 which is the generalized form of the quaternion algebra.Hahn and Snopek [26] proposed the octonion Fourier transform (OFT) and studied the properties.Several applications of the OFT in signal processing were studied in [27,28].In order to analyze and process the octonion spectrum of finite-duration signals, Błaszczyk [29] exploited the discrete form for the OFT and obtained the discrete octonion Fourier transform (DOFT).According to the DOFT, the analysis of solutions for difference equations and 3-D discrete linear time invariant systems were discussed.Researchers have considered that the linear canonical transform is a general form of the Fourier transform and has good analytical and processing properties [30,31].We [32] substituted the octonion Fourier kernel function with the octonion linear canonical kernel function and obtained the octonion linear canonical transform (OCLCT).Next, some papers [32,33] discussed many properties and uncertainty principles associated with the OCLCT.Moreover, many scholars [34,35] proposed different transform forms of the OCLCT.
So far, the OCLCT is mainly studied regarding the integral transform of non-stationary continuous signals.As far as we know, the discrete form of the OCLCT has never been published to date.In this paper, in order to study octonion finite-length signals, we propose the discrete octonion linear canonical transform (DOCLCT).The DOCLCT is obtained by replacing the Fourier transform kernel function with the linear canonical transform kernel function based on the octonion algebra setting.Then, several important properties of the DOCLCT are derived, such as linearity, scaling, boundedness, Plancherel theorem inversion transform and shift transform.Moreover, the relation between the DOCLCT and the 3-D DLCT is obtained.The convolution theorem associated with the DOCLCT is presented by a new convolution operator.Finally, the correlation theorem of the DOCLCT is exploited.
This paper is organized as follows: In Section 2, several basic properties of octonion algebra are presented.The definition and the properties of the DOCLCT are obtained in Section 3. In Section 4, the convolution theorem for the DOCLCT is derived.The correlation theorem of the DOCLCT is discussed in Section 5.In Section 6, the conclusions and potential applications are drawn.

Preliminaries
This section presents knowledge of octonion algebra [36].This is the research foundation of this paper.solutions for difference equations and 3-D discrete linear time invariant systems were discussed.Researchers have considered that the linear canonical transform is a general form of the Fourier transform and has good analytical and processing properties [30,31].We [32] substituted the octonion Fourier kernel function with the octonion linear canonical kernel function and obtained the octonion linear canonical transform (OCLCT).Next, some papers [32,33] discussed many properties and uncertainty principles associated with the OCLCT.Moreover, many scholars [34,35] proposed different transform forms of the OCLCT.So far, the OCLCT is mainly studied regarding the integral transform of non-stationary continuous signals.As far as we know, the discrete form of the OCLCT has never been published to date.In this paper, in order to study octonion finite-length signals, we propose the discrete octonion linear canonical transform (DOCLCT).The DOCLCT is obtained by replacing the Fourier transform kernel function with the linear canonical transform kernel function based on the octonion algebra setting.Then, several important properties of the DOCLCT are derived, such as linearity, scaling, boundedness, Plancherel theorem inversion transform and shift transform.Moreover, the relation between the DOCLCT and the 3-D DLCT is obtained.The convolution theorem associated with the DOCLCT is presented by a new convolution operator.Finally, the correlation theorem of the DOCLCT is exploited.

Octonion Algebra
This paper is organized as follows: In Section 2, several basic properties of octonion algebra are presented.The definition and the properties of the DOCLCT are obtained in Section 3. In Section 4, the convolution theorem for the DOCLCT is derived.The correlation theorem of the DOCLCT is discussed in Section 5.In Section 6, the conclusions and potential applications are drawn.

Preliminaries
This section presents knowledge of octonion algebra [36].This is the research foundation of this paper.For any octonion algebra, o ∈ O can be represented as  That is to say, any octonion algebra can be composed of the sum of two quaternion algebras.

Discrete Linear Canonical Transform
Next, we present the definition of the 3-D DLCT.
where the discrete linear canonical transform kernel signal is where ∆s k is the periodic sampling interval in the space domain s k and ∆y k is the periodic sampling interval in the DLCT domain y k .

Discrete Quaternion Linear Canonical Transform
In paper [23], the authors proposed the DQLCT and exploited knowledge about the DQLCT.The DQLCT expands the research scope of the discrete quaternion Fourier transform, and provides a way to solve problems about quaternion non-stationary finitelength signals.Due to the non-commutativity and non-associative properties of quaternion, there are three kinds of DQLCT.The authors of [23] proposed the two-sided DQLCT.
where the discrete quaternion linear canonical transform kernel signal is where ∆s k is the periodic sampling interval in the space domain s k and ∆y k is the periodic sampling interval in the DQLCT domain y k .
The inverse transform of the DQLCT is displayed by where

Discrete Octonion Fourier Transform
In paper [29], the DOFT of 3-D octonion finite-length signals was given.The DOFT is a very good tool for studying octonion finite-length signals.In the following description, a 3-D octonion finite-length function is equivalent to a 3-D octonion finite-length signal.Definition 3. Let a 3-D octonion-valued function x(n) be a 3-D finite-length signal and x : The DOFT is defined as follows: where The inverse transform of the DOFT is presented by the following formula [29]:

Discrete Octonion Linear Canonical Transform
In this section, based on the DOFT, we extend the 2-D DQLCT to the 3-D discrete octonion linear canonical transform domain.A new transform, the discrete octonion linear canonical transform, is proposed.We can use DOCLCT to solve the problem of non-stationary 3-D octonion finite-length signals.

Definition 4. The DOCLCT of an octonion-valued signal
where the kernel signals of the DOCLCT are and ), the DOCLCT reduces to the DOFT.

Properties of the DOCLCT
Next, we present several properties of the DOCLCT.
Theorem 1 (Linearity).For any octonion-valued signals x, y : Then, the linearity of the DOCLCT is Proof.This proof step can be directly obtained by the definition of the DOCLCT.□ Theorem 2 (Scaling).For an octonion-valued signal x : Then, the scaling of the DOCLCT is where Proof.According to the definition of the DOCLCT, we have Let u = tn = (u 1 , u 2 , u 3 ).Then, the above formula becomes is the even part and is the odd part of a function x(n) in the third variable n 3 , respectively.Then, Proof.According to the Formula (1), the DOCLCT of the function x(n) becomes From the Euler formula, then where Hence, we have the result.□ Theorem 4. (Plancherel theorem) The Plancherel theorem of the DOCLCT is Proof.According to Theorem 3, then By the Plancherel theorem for the DQLCT [23], we have In addition, based on the formula then we have □ Theorem 5 (Inversion transform).The inversion transform of the DOCLCT is obtained as follows: where Proof.According to the definition of the DOCLCT, we have In addition, by the kernel signals of the DOCLCT, the following formulas hold: By these three formulas (25), the inverse transform of the DOCLCT can be established.

□
The following lemma shows that the DOCLCT can be disassembled by the Euler formula.
Next, we give the shift transform of the DOCLCT.There are three forms of the shift function based on three variables, ).These three shift functions are independent of each other and are not affected by other remaining variables.
Theorem 6 (Shift transform of the DOCLCT).Let ℘ T 1 , ℘ T 2 and ℘ T 3 denote the DOCLCT of the three shift functions x(n 1 − l 1 , n 2 , n 3 ), x(n 1 , n 2 − l 2 , n 3 ) and x(n 1 , n 2 , n 3 − l 3 ), respectively.Then, where Proof.We present the proof process for the DOCLCT of the function x T 1 , and the other two types are obtained according to the same steps.
Using the same steps, the other two formulas, ( 29) and (30), can be obtained.□

Convolution Theorem of the DOCLCT
In this section, we first give the definition of the convolution operator associated with the DOCLCT.Then, we obtain the convolution theorem of the DOCLCT by the convolution operator.Definition 5. Suppose the real functions x(n) and f (n) are given; the convolution operator ⋇ ∧ is defined by where U k denotes the intervals [0, Lemma 2. The convolution theorem for the 3-D DLCT is obtained: Proof.According to the definition of the 3-D DLCT and the convolution operator, then Let r = n − u = (r 1 , r 2 , r 3 ).Then, the above formula becomes Then, we have Based on the definition of the 3-D DLCT, we can obtain the proof.□ Next, we obtain the relation between the DOCLCT and the 3-D DLCT.Then, we derive a convolution theorem for the DOCLCT.Lemma 3. The relation between the DOCLCT and the 3-D DLCT is given as follows: Proof.According to Definition 1, then The third equation is based on this fact: e −e 1 π 2 = −e e 1 π 2 .According to the same method, we can obtain the following two equations: where 3).By the sine and cosine functions, we write the second kernel function D A 2 (n 2 , m 2 ) of the 3-D DLCT in the cosine and sine forms, respectively.
(45) Adding Formulas (43) and (45), then For the convenience of calculation, assume that By the same steps, we can write D e 1 A 3 (n 3 , m 3 ) in the form Adding the above two formulas, the following formula is obtained: Finally, the result can be proven.□ Theorem 7. The convolution theorem for the DOCLCT is obtained as follows: where Proof.Using Lemma 3, then we have (56) According to Lemma 2, we obtain Hence, the result can be obtained.□

Correlation Theorem of the DOCLCT
In this section, the correlation operator is presented; then, we obtain the correlation theorem of the DOCLCT.Definition 6.Given the real functions x(n) and f (n), the correlation operator ⋉ is defined by Lemma 4. The correlation theorem for the 3-D DLCT is obtained as follows: where Proof.The proof process is similar to Theorem 7, so it is omitted.□

Conclusions
In the present work, the results presented show that the DLCT can be generalized to the case of octonion algebras.We proposed the DOCLCT and studied some basic properties associated with the DOCLCT.Then, according to a new convolution operate, we obtained the convolution theorem of the DOCLCT by the relationship between the DOCLCT and the 3-D DLCT.Finally, the correlation theorem of the DOCLCT was exploited.The properties of the DOCLCT show that they can be used for the analysis of the convolution theorem.The most important contribution of this article is that it provides basic tools for the timefrequency analysis of non-stationary 3-D octonion finite-length signals.The presented results form the foundation of octonion-based signals and system theory.
For applications, the proposed convolution theorem can be used to solve integral equations with special kernels [37].We can also discuss the design of multiplicative filters with the convolution theorem of the DOCLCT.
We can use the convolution theorem of the DOCLCT in the analysis of some 3-D linear time-invariant systems described in [28].This hypercomplex generalization of the DOCLCT provides an excellent tool for the analysis of 3-D discrete linear time-invariant systems and 3-D discrete data.
The authors of [38] show how some interesting properties of 1-D complex Gabor filters are extended to 2-D by quaternionic Gabor filters.In parallel, they introduce the corresponding quaternionic Gabor filter-based approach to disparity estimation and texture segmentation.Thus, if one is interested in the development of Gabor filters with values in octonion algebras it is possible to define octonion Gabor filters based on the DOCLCT and to introduce the local octonion phase.This is a theoretical necessity to develop and analyze the DOCLCT.
The DOCLCT is a new concept which allows for the processing of a few gray-scale or color images, as well as images with their local information as one octonion 8-D image in the spectral domain.This concept generalizes the traditional complex and quaternion 2-D DLCTs and can be effectively used for parallel processing up to eight gray-scale images or two color images [39,40].Surely, the methods presented here are only a first step in using hypercomplex methods in image processing.Detailed work in this area remains in the plan for further action, as well as the further development of this theory.
As a theoretical basis of the frequency-domain definitions of high-dimensional analytic signals, the DOCLCT can be applied in the domain of analytic signals.Other potential applications can be found in noise analysis and image processing, such as the methods presented in [41,42].
Future research will be concerned with extensions of the applications sketched in this paper.Thus, we hope to open a door for future research on high-dimensional signal processing using representations in hypercomplex algebras.

Funding:
This work was supported by the National Natural Science Foundation of China (No. 62301474) and the Natural Science Foundation of the Jiangsu Higher Education Institutions of China (No. 23KJB110026).