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: It is suggested that DCTs are more popular because fewer DCT coefficients than DFT coefficients are needed to get a good approximation to a typical signal, since the higher-frequency coefficients are small in magnitude and can be more crudely quantized than the low-frequency coefficient.
Abstract: Discrete cosine transforms (DCTs) and discrete Fourier transforms (DFTs) are reviewed in order to determine why DCTs are more popular for image compression than the easier-to-compute DFTs. DCT-based image compression takes advantage of the fact that most images do not have much energy in the high-frequency coefficients. It is suggested that DCTs are more popular because fewer DCT coefficients than DFT coefficients are needed to get a good approximation to a typical signal, since the higher-frequency coefficients are small in magnitude and can be more crudely quantized than the low-frequency coefficients. >
75 citations
TL;DR: The authors provide a theoretical justification by showing that any discrete transform whose basis functions satisfy the fundamental recurrence formula has a second-order autoregressive structure in its filter realization and extend these time-recursive concepts to multi-dimensional transforms.
Abstract: An optimal unified architecture that can efficiently compute the discrete cosine, sine, Hartley, Fourier, lapped orthogonal, and complex lapped transforms for a continuous stream of input data that arise in signal/image communications is proposed. This structure uses only half as many multipliers as the previous best known scheme (Liu and Chiu, 1993). The proposed architecture is regular, modular, and has only local interconnections in both data and control paths. There is no limitation on the transform size N and only 2N-2 multipliers are needed for the DCT. The throughput of this scheme is one input sample per clock cycle. The authors provide a theoretical justification by showing that any discrete transform whose basis functions satisfy the fundamental recurrence formula has a second-order autoregressive structure in its filter realization. They also demonstrate that dual generation transform pairs share the same autoregressive structure. They extend these time-recursive concepts to multi-dimensional transforms. The resulting d-dimensional structures are fully-pipelined and consist of only d 1D transform arrays and shift registers. >
75 citations
TL;DR: It is shown that a DCT coding scheme reproduces faithfully the seismic waveform at approximately one-third of the original rate, revealing that sinusoidal transforms are well-suited for robust, low-rate seismic signal representation.
Abstract: The authors consider the development and evaluation of transform coding algorithms for the storage of seismic signals. Transform coding algorithms are developed using the discrete Fourier transform (DFT), the discrete cosine transform (DCT), the Walsh-Hadamard transform (WHT), and the Karhunen-Loeve transform (KLT). These are evaluated and compared to a linear predictive coding algorithm for data rates ranging from 150 to 550 bit/s. The results reveal that sinusoidal transforms are well-suited for robust, low-rate seismic signal representation. In particular, it is shown that a DCT coding scheme reproduces faithfully the seismic waveform at approximately one-third of the original rate. >
74 citations
74 citations
TL;DR: In this article, a steplike waveform is converted into a duration-limited one which preserves the spectrum of the original waveform and is suitable for discrete Fourier transform (DFT) computations.
Abstract: A steplike waveform which has attained its final value is converted into a duration-limited one which preserves the spectrum of the original waveform and is suitable for discrete Fourier transform (DFT) computations. The method, which is based upon the response of a time-invariant linear system excited by a rectangular pulse of suitable duration, is first applied to continuous waveforms and then to discrete (sampled) waveforms. The difference (errors) between the spectra of a continuous waveform and a discrete representation of it are reviewed.
74 citations