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
12 May 2008
TL;DR: A two-tier model using the DCT is shown to be able to model F0 contours to around 10 Hz RMS error, and a proof-of-concept system for synthesising DCT parameters is evaluated, showing that the benefits do not come at the expense of speech synthesis applications.
Abstract: The discrete cosine transform is proposed as a basis for representing fundamental frequency (F0) contours of speech. The advantages over existing representations include deterministic algorithms for both analysis and synthesis and a simple distance measure in the parameter space. A two-tier model using the DCT is shown to be able to model F0 contours to around 10 Hz RMS error. A proof-of-concept system for synthesising DCT parameters is evaluated, showing that the benefits do not come at the expense of speech synthesis applications.
40 citations
TL;DR: It is demonstrated that the proposed algorithm is significantly more efficient than the conventional filtered spatial domain and earlier proposed DCT domain methods.
Abstract: A method for efficient spatial domain filtering, directly in the discrete cosine transform (DCT) domain, is developed and proposed. It consists of using the discrete sine transform (DST) and the DCT for transform-domain processing on the in JPEG basis of the previously derived convolution-multiplication properties of discrete trigonometric transforms. The proposed scheme requires neither zero padding of the input data nor kernel symmetry. It is demonstrated that, in typical applications, the proposed algorithm is significantly more efficient than the conventional filtered spatial domain and earlier proposed DCT domain methods. The proposed method is applicable to any DCT-based image compression standard, such as JPEG, MPEG, and H.261.
40 citations
40 citations
CNET1
TL;DR: Methodologies for constructing fast algorithms to compute the discrete Fourier transform of a 2-D real sequence are introduced and the resulting algorithms are shown to be in-place and butterfly-style as well as the usual 1-D FFT algorithms.
Abstract: Methodologies for constructing fast algorithms to compute the discrete Fourier transform (DFT) of a 2-D real sequence are introduced. The resulting algorithms are shown to be in-place and butterfly-style as well as the usual 1-D FFT algorithms. Above all, the computational load of these algorithms is reduced to less than one-half of their complex counterparts. Due to the in-place property, the storage requirement is exactly halved. A comparison is made on the basis of arithmetic complexity, storage, and input/output requirements. >
40 citations
TL;DR: The proposed algorithm has significantly lower arithmetic complexity, shorter delays and simpler indexing schemes than existing algorithms based on the concatenation of the WHT and FFT, and saves about 70%-36% in computer run-time for transform lengths of 16-4096.
Abstract: An efficient fast Walsh-Hadamard-Fourier transform algorithm which combines the calculation of the Walsh-Hadamard transform (WHT) and the discrete Fourier transform (DFT) is introduced. This can be used in Walsh-Hadamard precoded orthogonal frequency division multiplexing systems (WHT-OFDM) to increase speed and reduce the implementation cost. The algorithm is developed through the sparse matrices factorization method using the Kronecker product technique, and implemented in an integrated butterfly structure. The proposed algorithm has significantly lower arithmetic complexity, shorter delays and simpler indexing schemes than existing algorithms based on the concatenation of the WHT and FFT, and saves about 70%-36% in computer run-time for transform lengths of 16-4096.
40 citations