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: This paper proposes a fast approximate algorithm for the associated Legendre transform by means of polynomial interpolation accelerated by the Fast Multipole Method (FMM), and shows that the algorithm is stable and is faster than the direct computation for N ≥ 511.
Abstract: The spectral method with discrete spherical harmonics transform plays an important role in many applications. In spite of its advantages, the spherical harmonics transform has a drawback of high computational complexity, which is determined by that of the associated Legendre transform, and the direct computation requires time of O(N3) for cut-off frequency N. In this paper, we propose a fast approximate algorithm for the associated Legendre transform. Our algorithm evaluates the transform by means of polynomial interpolation accelerated by the Fast Multipole Method (FMM). The divide-and-conquer approach with split Legendre functions gives computational complexity O(N2 log N). Experimental results show that our algorithm is stable and is faster than the direct computation for N ≥ 511.
101 citations
01 Jan 1996
TL;DR: A 4 mm2, two-dimensional (2-D) 8 8 discrete cosine transform (DCT) core processor for HDTV-resolution video compression/decompression in a 0.3m CMOS triple-well, double-metal technology operates at 150 MHz from a 0-V power supply and consumes 10 mW, only 2% power dissipation of a previous 3.3-V design.
Abstract: A 4 mm2, two-dimensional (2-D) 8 8 discrete cosine transform (DCT) core processor for HDTV-resolution video compression/decompression in a 0.3m CMOS triple-well, double-metal technology operates at 150 MHz from a 0.9-V power supply and consumes 10 mW, only 2% power dissipation of a previous 3.3-V design. Circuit techniques for dynamically varying threshold voltage (VT scheme) are introduced to reduce active power dissipation with negligible overhead in speed, standby power dissipation, and chip area. A way to exploreVDD Vth design space is also studied.
98 citations
TL;DR: This paper develops a 2D DFRFT which can preserve the rotation properties and provide similar results to continuous FRFT.
98 citations
TL;DR: It is shown that the one-dimensional shallow water equations and the two-dimensional Zakharov–Kuznetsov equation are multi-symplectic and derive spectral discretizations for these systems and present numerical experiments.
98 citations
TL;DR: It is shown that the DCT, DST, DHT and their inverse transforms share an almost identical lattice structure so that they are very suitable for VLSI implementation for high-speed applications.
Abstract: Unified efficient computations of the discrete cosine transform (DCT), discrete sine transform (DST), discrete Hartley transform (DHT), and their inverse transforms employing the time-recursive approach are considered. Unified parallel lattice structures that can dually generate the DCT and DST simultaneously as well the DHT are developed. These structures can obtain the transformed data for sequential input time recursively with a throughput rate of one per clock cycle. The total number of multipliers required is a linear function of the transform size N, with no constraint on N. The resulting architectures are regular, modular, and without global communication so that they are very suitable for VLSI implementation for high-speed applications. It is shown that the DCT, DST, DHT and their inverse transforms share an almost identical lattice structure. The tradeoff between time and area for the block data processing is considered. >
97 citations