The Fast Direct 2-D DCT/DST Computation
Fast algorithm for the 3-D DCT-II
... for fast calculation of the 3-D ...3-D DCT-II VR algorithm achieves a sig- nificant saving—more than 40%—in the total number of multi- plications, as compared with the RCF approach while ...
11
DCT and DST based Image Compression for 3D Reconstruction
... A direct comparison of compression with JPEG and JPEG2000 is presented in Table ...on DCT. The main difference is that our approach is based on DCT with DST and the coefficients are compressed ...
22
A VLSI Array Architecture for Realization of DFT, DHT, DCT and DST
... A comparative study of the proposed architecture with five other existing architectures reveals its superiority in speed (in terms of latency and throughput) and in processor interconnection over the others. It does not ...
19
Fast DCT-I, DCT-III, and DCT-IV via Moments
... between fast algorithms for DCTs and moments compu- ...the computation of DCT-I, DCT-III, and DCT-IV more ...log 2 N/ log 2 log 2 N) and is superior to that of O(N ...
8
A novel method for reducing number of computation in 2d dct
... with the use of a recursive kernel [13]. Using Algebraic Signal Approach (with polynomial algebras) factorization is applied recursively to obtain another fast algorithm as mentioned in [19]. Using some definite ...
7
Efficient Fast Multiplication Free Integer Transformation for the 1 D DCT of the H 265 Standard
... efficient fast 1-D algorithm for this DCT matrix is to reduce the complexity and hence the hardware and increase the speed of computa- tion to meet the constantly improving demands in the fields of ...
12
Fast Computation of Kernel Estimators
... proposed fast algorithm against the binned approximation and the naive direct exact implementa- tion in terms of the computation time and the approximation ...proposed fast algorithm was ...
23
Fast Signal Recovery in the Presence of Mutual Coupling Based on New 2 D Direct Data Domain Approach
... Thus, the computation was reduced and the signal recovery was very fast. Taking mutual coupling into account, a method was derived for estimation of the coupling coefficient which can accurately estimate the ...
9
CORDIC Based Efficient DCT Architecture for low power image computation
... type-II DCT, which is often called simply "the DCT", its inverse, the type-III DCT, is correspondingly often called simply "the inverse DCT" or "the ...a DCT of overlapping ...
10
Fast computation of approximant bases in canonical form
... The first two items are direct consequences of the construction, given in Definition 5.5. They specify the dimensions of the transformed instance. In the context of Algorithm 5, the output column linearization of ...
38
A Fast Signature Computation Algorithm for LFSR and MISR
... the computation time of the input contribution just like the direct substitution of the least significant input subsequence in the memory-driven approach—the memory-driven approach thus has a fair speedup ...
10
An Integrated Skew Detection And Correction Using Fast Fourier Transform And DCT
... Using Fast Fourier Transform And DCT Mandip Kaur, Simpel Jindal Abstract: Skew detection and correction is very important task before pre-processing of an image and it is a major problem in scanned ...
6
Fast Polarizable Force Field Computation in Biomolecular Simulations
... cause significant energy drift if the computed dipole moments are reasonably accurate. But history dependence is more detrimental and for tolerable energy drift, it requires the computed dipole moments to be two orders of ...
102
Efficient 2-D DCT Computation from an Image Representation Point of View
... the 2-D DCT in a block-mode, meaning that the algorithm is applied in a finite number of image sub-blocks, which is a common policy in the case of image compression applications such as JPEG, and the ...
17
A Pipeline VLSI Architecture for Fast Computation of the 2-D Discrete Wavelet Transform
... the computation of the 2-D discrete wavelet transform (DWT) is ...the 2-D filtering operation into four subtasks that can be performed independently in parallel and minimizing the delay ...
12
Odd type DCT/DST for video coding: Relationships and low-complexity implementations
... cations of the MVM approach without optimization. Table II reports the number of additions and multiplications, the number of logic elements (LEs), the maximum achievable clock frequency (f CK ) and the Area-Delay ...
8
DCT-DST Plane sectorization of Row wise Transformed color Images in CBIR
... of DCT-DST plane of Row wise transformed images and feature vector generation with and without augmentation of zeroth column component of DCT transformed image and the last column component of ...
11
Implementation of computation-reduced DCT using a novel method
... into DCT coefficients. In this paper, we present a novel DCT architecture that reduces the power consumption by decreasing the computational complexity based on the correlation between two successive ...
18
Monotone and fast computation of Euler’s constant
... † Equal contributors Abstract We construct sequences of finite sums ( ˜ l n ) n≥0 and ( u ˜ n ) n≥0 converging increasingly and decreasingly, respectively, to the Euler-Mascheroni constant γ at the geometric rate ...
9
Fast Computation of Lexical Affinity Models
... elterra,claclark @plg2.uwaterloo.ca Abstract We present a framework for the fast compu- tation of lexical affinity models. The frame- work is composed of a novel algorithm to effi- ciently compute the ...
7