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
••
13 Sep 2010TL;DR: A novel formulation and a highly-parallel implementation of the frequently required matrix data alignment and manipulation is introduced by using MMA operations on the same array processor so that no additional circuitry is needed.
Abstract: The two-dimensional (2D) forward/inverse discrete Fourier transform (DFT), discrete cosine transform (DCT), discrete sine transform (DST), discrete Hartley transform (DHT), discrete Walsh-Hadamard transform (DWHT), play a fundamental role in many practical applications. Due to the separability property, all these transforms can be uniquely defined as a triple matrix product with one matrix transposition. Based on a systematic approach to represent and schedule different forms of the $n\times n$ matrix-matrix multiply-add (MMA) operation in 3D index space, we design new orbital highly-parallel/scalable algorithms and present an efficient $n\times n$ unified array processor for computing {\it any} $n\times n$ forward/inverse discrete separable transform in the minimal $2n$ time-steps. Unlike traditional 2D systolic array processing, all $n^2$ register-stored elements of initial/intermediate matrices are processed simultaneously by all $n^2$ processing elements of the unified array processor at each time-step. Hence the proposed array processor is appropriate for applications with naturally arranged multidimensional data such as still images, video frames, 2D data from a matrix sensor, etc. Ultimately, we introduce a novel formulation and a highly-parallel implementation of the frequently required matrix data alignment and manipulation by using MMA operations on the same array processor so that no additional circuitry is needed.
14 citations
01 Jan 1993
14 citations
••
TL;DR: A new linear V LSI array architecture for the VLSI implementation of a prime-length 1-D Inverse Discrete Sine Transform (IDST) is proposed, which uses a new design approach that uses a parallel version of the TSP.
Abstract: In this paper a new linear VLSI array architecture for the VLSI implementation of a prime-length 1-D Inverse Discrete Sine Transform (IDST) is proposed. This new design approach uses a ...
14 citations
••
TL;DR: A generalized signal flow graph for the DCT/DST of type II (DCT-II/ DST-II) computation and their inverses DCT-III/D ST-III is described, based on the fast, recursive and numerically stable Hou's algorithm.
14 citations
••
15 Mar 1999TL;DR: The new lapped transform is real-valued, and at the same time allows unambiguous detection of spatial orientation, and its performance in spectral approaches to image restoration and enhancement in comparison to the DFT is investigated.
Abstract: We propose a new real-valued lapped transform for 2D-signal and image processing Lapped transforms are particularly useful in block-based processing, since their intrinsically overlapping basis functions reduce or prevent block artifacts Our transform is derived from the modulated lapped transform (MLT), which, as a real-valued and separable transform like the discrete cosine transform, does not allow to unambiguously identify oriented structures from modulus spectra This is in marked contrast to the (complex-valued) discrete Fourier transform (DFT) The new lapped transform is real-valued, and at the same time allows unambiguous detection of spatial orientation Furthermore, a fast algorithm for this transform exists As an application example, we investigate the transform's performance in spectral approaches to image restoration and enhancement in comparison to the DFT
14 citations