[PDF] Top 20 Recursive fast computation of the two-dimensional discrete cosine transform
Has 10000 "Recursive fast computation of the two-dimensional discrete cosine transform" found on our website. Below are the top 20 most common "Recursive fast computation of the two-dimensional discrete cosine transform".
Recursive fast computation of the two-dimensional discrete cosine transform
... Employing fast algorithms for the computation of these CCiSCC oper- ations, we can thus substantially reduce the numbers of multiplications required, compared with those of [r] ... See full document
9
A Refined Fast 2-D Discrete Cosine Transform Algorithm
... menting the fast Fourier transform in pipelined digital hardware with a butterfly calculation unit, two-port data memory, ROM for storing twiddle factors, and memory addressing controller ... See full document
4
Normal Bases Expansion of the Discrete Cosine Transform
... that the discrete cosine transform (DCT) can be obtained by projecting the discrete Fourier trans- form from the extension field to the ...Applying the ... See full document
3
Two dimensional discrete fractional Fourier transform
... example, the 2D Fourier transform computes the spectrum for a 2D signal, and 2D discrete cosine transform (DCT) is widely used in image compression ...analyze the 2D time- ... See full document
10
A refined fast 2-D discrete cosine transform algorithm with regularbutterfly structure
... In this paper, a fast computation algorithm for the two-dimensional discrete cosine transform (2-D DCT) is derived based on index permutation.. Furthermore, as compared[r] ... See full document
8
Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format
... On the compressed image in the restricted quadtree and shading format, this paper presents a novel and fast 2D DCT algorithm and the proposed algorithm takes O(K 2 log K + N 2 ) ..., ... See full document
9
An efficient architecture for two-dimensional discrete wavelet transform
... The advantages of the proposed architecture are the near 100% hardware utilization, fast computation time, regular data flow, and low complexity control circuit, making this desi[r] ... See full document
4
An Efficient Architecture for Two-Dimensional Discrete Wavelet Transform
... Among the various architectures, the best-known design for the 2-D DWT is the parallel filter architecture [15], ...[16]. The design of the parallel filter architecture is ... See full document
10
A memory-efficient realization of cyclic convolution and its application to discrete cosine transform
... 10.1109/TCSVT.2004.842608 the implementation of the DA-based architectures [2], [7]–[9], ...Most of the DA-based designs exploit some memory reduction techniques such as the ... See full document
9
Generic RAM-based architectures for two-dimensional discrete wavelet transform with line-based method
... construct the corresponding two-dimen- sional architectures by use of the line-based method for any given hardware architecture of one-dimensional (1-D) wavelet filters, in- ... See full document
11
Application of two-dimensional nonuniform fast Fourier transform (2-D NUFFT) technique to analysis of shielded microstrip circuits
... calculation of the error is based on the results obtained by direct computation of ...Both the square and octagonal schemes have identical reg- ular Fourier matrices and column ... See full document
7
Eigendecomposition of The Discrete Double-Curl Operator with Application to Fast Eigensolver for Three Dimensional Photonic Crystals
... solve the GEVP, we apply these theoretical results to project the GEVP to a standard eigenvalue problem (SEVP), which involves only the eigenspace associated with the nonzero eigenvalues ... See full document
20
Eigendecomposition of The Discrete Double-Curl Operator with Application to Fast Eigensolver for Three Dimensional Photonic Crystals*
... solve the GEVP, we apply these theoretical results to project the GEVP to a standard eigenvalue problem (SEVP), which involves only the eigenspace associated with the nonzero eigenvalues ... See full document
24
EIGENDECOMPOSITION OF THE DISCRETE DOUBLE-CURL OPERATOR WITH APPLICATION TO FAST EIGENSOLVER FOR THREE-DIMENSIONAL PHOTONIC CRYSTALS
... solve the GEVP, we apply these theoretical results to project the GEVP to a standard eigenvalue problem (SEVP), which involves only the eigenspace associated with the nonzero eigenvalues ... See full document
23
Two-stage circular-convolution-algorithm/architecture for the discrete cosine transform
... The elements in the pre- processing stage consist of 1, - 1, and 0 only; the postprocessing stage is of block diagonal form in which each block performs a circular-convolut[r] ... See full document
8
On matrix factorizations for recursive pruned discrete cosine transforms
... Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan 10764, Taiwan, ROC Received 27 August 1997; received in revised form 6 February 1998 Abstract This paper ... See full document
8
Memory analysis and architecture for two-dimensional discrete wavelet transform
... ABSTRACT The large amount of the frame memory access and the die area occupied by the embedded internal buffer are the most critical is- sues for the implementation ... See full document
4
Progressive Pattern Matching Approach Using Discrete Cosine Transform
... lot of significant books were transcribed by elite ...into the contents that are accessible is inevitable. One way of digitizing the contents of documents is through human ...kind ... See full document
5
Directional textures auto-inspection using discrete cosine transform
... After the suppressed DCT image is transformed back to the spatial domain and binarized by SPC binarization, the textures are removed in the final image while any original defects are ... See full document
18
High throughput CORDIC-based systolic array design for the discrete cosine transform
... In this paper, we propose a modified Malvar algorithm that can transfer the Discrete Hartley Transform (DHT) results to the Discrete Cosine Transform ( DCT) by using [r] ... See full document
4
相關主題