Topic
Discrete sine transform
About: Discrete sine transform is a research topic. Over the lifetime, 3269 publications have been published within this topic receiving 73181 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: In this article, a least squares IIR (infinite impulse response) algorithm, in the transformed domains, which fits each of the retained subsets of the complex transform components accurately, is presented.
Abstract: The mixed transform representation of time-varying signals uses partial sets of basis functions from the discrete Fourier transform (DFT) and the Walsh-Hadamard transform. The location, magnitude, and phase of the transform components have to be specified for proper signal reconstruction. A least-squares IIR (infinite impulse response) algorithm, in the transformed domains, which fits each of the retained subsets of the complex transform components accurately, is presented. The IIR function, while characterized by real coefficients about twice the number of the retained complex transform components, carries enough location, magnitude, and phase information for accurate signal reconstruction. To illustrate the technique's accuracy and efficiency, its application to model the DFT part of a voice speech segment is given. >
19 citations
TL;DR: Simulation results show that the proposed ADMR algorithm provides higher recognition rates than those obtained in previous studies, in addition to a superiority of SVM performance compared to ANN performance at low signal-to-noise ratios.
Abstract: Automatic digital modulation recognition (ADMR) has become an interesting problem in wireless communication systems with various civil and military applications. In this paper, an ADMR algorithm is proposed for both orthogonal frequency division multiplexing and multi-carrier code division multiple access systems using discrete transforms and mel-frequency cepstral coefficients (MFCCs). The proposed algorithm uses one of the discrete cosine transform, discrete sine transform, and discrete wavelet transform with MFCCs to extract the modulated signal coefficients, and uses also either a support vector machine (SVM) or an artificial neural network (ANN) for modulation classification. Simulation results show that the proposed algorithm provides higher recognition rates than those obtained in previous studies, in addition to a superiority of SVM performance compared to ANN performance at low signal-to-noise ratios.
19 citations
TL;DR: In this article, a movie encryption scheme using a discrete multiple-parameter fractional Fourier transform and theta modulation is proposed, in which each frame of the movie is transformed by a filtering procedure and then multiplexed into a complex signal.
Abstract: A movie encryption scheme is proposed using a discrete multiple-parameter fractional Fourier transform and theta modulation. After being modulated by sinusoidal amplitude grating, each frame of the movie is transformed by a filtering procedure and then multiplexed into a complex signal. The complex signal is multiplied by a pixel scrambling operation and random phase mask, and then encrypted by a discrete multiple-parameter fractional Fourier transform. The movie can be retrieved by using the correct keys, such as a random phase mask, a pixel scrambling operation, the parameters in a discrete multiple-parameter fractional Fourier transform and a time sequence. Numerical simulations have been performed to demonstrate the validity and the security of the proposed method.
19 citations
TL;DR: This paper proposes a new method for deriving the closed-form orthogonal discrete Fourier transform (DFT) eigenvectors of arbitrary length using the complete generalized Legendre sequence and develops a novel method for computing the DFT.
Abstract: In this paper, we propose a new method for deriving the closed-form orthogonal discrete Fourier transform (DFT) eigenvectors of arbitrary length using the complete generalized Legendre sequence (CGLS). From the eigenvectors, we then develop a novel method for computing the DFT. By taking a specific eigendecomposition to the DFT matrix, after proper arrangement, we can derive a new fast DFT algorithm with systematic construction of an arbitrary length that reduces the number of multiplications needed as compared with the existing fast algorithm. Moreover, we can also use the proposed CGLS-like DFT eigenvectors to define a new type of the discrete fractional Fourier transform, which is efficient in implementation and effective for encryption and OFDM.
19 citations
TL;DR: A multidimensional fast Hartley transform algorithm is described that successively applies 1D Fourier transforms to reduceundant operations to a minimum in the processing of real-valued data.
Abstract: In the processing of real-valued data, a purely real transform such as the Hartley transform is more desirable than the complex Fourier transform because it avoids unnecessary complex computations. This advantage is most significant in multidimensional transformations, where a large amount of data has to be processed. A multidimensional fast Hartley transform algorithm is described that successively applies 1D Fourier transforms. Redundant operations are reduced to a minimum. Special indexing schemes (parity operators) are introduced to avoid unscrambling procedures. >
19 citations