Multi-channel sampling for band-limited signals is fundamental in the theory of multi-channel parallel A/D environment and multiplexing wireless communication environment. As the fractional Fourier transform has been found wide applications in signal processing fields, it is necessary to consider the multi-channel sampling theorem based on the fractional Fourier transform. In this paper, the multi-channel sampling theorem for the fractional band-limited signal is firstly proposed, which is the generalization of the well-known sampling theorem for the fractional Fourier transform. Since the periodic nonuniformly sampled signal in the fractional Fourier domain has valuable applications, the reconstruction expression for the periodic nonuniformly sampled signal has been then obtained by using the derived multi-channel sampling theorem and the specific space-shifting and phase-shifting properties of the fractional Fourier transform. Moreover, by designing different fractional Fourier filters, we can obtain reconstruction methods for other sampling strategies.
The fractional Fourier transform is a generalization of the classical Fourier transform, which is introduced from the mathematic aspect by Namias at first and has many applications in optics quickly. Whereas its potential appears to have remained largely unknown to the signal processing community until 1990s. The fractional Fourier transform can be viewed as the chirp-basis expansion directly from its definition, but es-sentially it can be interpreted as a rotation in the time-frequency plane, i.e. the unified time-frequency transform. With the order from 0 increasing to 1, the fractional Fourier transform can show the characteristics of the signal changing from the time domain to the frequency domain. In this research paper, the fractional Fourier transform has been com-prehensively and systematically treated from the signal processing point of view. Our aim is to provide a course from the definition to the applications of the fractional Fourier transform, especially as a reference and an introduction for researchers and interested readers.
The sampling rate conversion is always used in order to decrease computational amount and storage load in a system. The fractional Fourier transform (FRFT) is a powerful tool for the analysis of nonstationary signals, especially, chirp-like signal. Thus, it has become an active area in the signal processing community, with many applications of radar, communication, electronic warfare, and information security. Therefore, it is necessary for us to generalize the theorem for Fourier domain analysis of decimation and interpolation. Firstly, this paper defines the digital fre- quency in the fractional Fourier domain (FRFD) through the sampling theorems with FRFT. Secondly, FRFD analysis of decimation and interpolation is proposed in this paper with digital frequency in FRFD followed by the studies of interpolation filter and decimation filter in FRFD. Using these results, FRFD analysis of the sam- pling rate conversion by a rational factor is illustrated. The noble identities of decimation and interpolation in FRFD are then deduced using previous results and the fractional convolution theorem. The proposed theorems in this study are the bases for the generalizations of the multirate signal processing in FRFD, which can advance the filter banks theorems in FRFD. Finally, the theorems introduced in this paper are validated by simulations.
As the fractional Fourier transform has attracted a considerable amount of attention in the area of optics and signal processing, the discretization of the fractional Fourier transform becomes vital for the application of the fractional Fourier transform. Since the discretization of the fractional Fourier transform cannot be obtained by directly sampling in time domain and the fractional Fourier domain, the discretization of the fractional Fourier transform has been investigated recently. A summary of discretizations of the fractional Fourier transform developed in the last nearly two decades is presented in this paper. The discretizations include sampling in the fractional Fourier domain, discrete-time fractional Fourier transform, fractional Fourier series, discrete fractional Fourier transform (including 3 main types: linear combination-type; sampling-type; and eigen decomposition-type), and other discrete fractional signal transform. It is hoped to offer a doorstep for the readers who are interested in the fractional Fourier transform.
As generalization of the fractional Fourier transform (FRFT), the linear canonical transform (LCT) has been used in several areas, including optics and signal processing. Many properties for this transform are already known, but the convolution theorems, similar to the version of the Fourier transform, are still to be determined. In this paper, the authors derive the convolution theorems for the LCT, and explore the sampling theorem and multiplicative filter for the band limited signal in the linear canonical domain. Finally, the sampling and reconstruction formulas are deduced, together with the construction methodology for the above mentioned multiplicative filter in the time domain based on fast Fourier transform (FFT), which has much lower computational load than the construction method in the linear canonical domain.
