Improved Algorithm for ODCT Computation of a Running Data Sequence
Fast windowed update algorithms capable of independently updating the odd discrete cosine transform (ODCT) and odd discrete sine transform (ODST) of a running data sequence are analytically developed. In this algorithm, to compute the ODCT coefficients of a real-time sequence, we do not require the...
Saved in:
Main Authors: | S. Akhter, V. Karwal, R. C. Jain |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2012-01-01
|
Series: | Journal of Electrical and Computer Engineering |
Online Access: | http://dx.doi.org/10.1155/2012/879626 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Improving doublet cell removal efficiency through multiple algorithm runs
by: Yong She, et al.
Published: (2025-01-01) -
An Improved Clustering Algorithm of Tunnel Monitoring Data for Cloud Computing
by: Luo Zhong, et al.
Published: (2014-01-01) -
Reconceptualizing Constitutionalism in the AI Run Algorithmic Society
by: Matej Avbelj
Published: (2024-10-01) -
A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences
by: Fernando Soler-Toscano, et al.
Published: (2017-01-01) -
Resource Efficient Hardware Architecture for Fast Computation of Running Max/Min Filters
by: Cesar Torres-Huitzil
Published: (2013-01-01)