Improved algorithm for ODCT computation of a running data sequence (Q355853)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Improved algorithm for ODCT computation of a running data sequence |
scientific article; zbMATH DE number 6191238
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved algorithm for ODCT computation of a running data sequence |
scientific article; zbMATH DE number 6191238 |
Statements
Improved algorithm for ODCT computation of a running data sequence (English)
0 references
25 July 2013
0 references
Summary: 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 ODST coefficients. Similarly, the ODST coefficients of the shifted sequence can be calculated without using ODCT coefficients. The running input data sequence is sampled using a rectangular window. However, this idea can be easily extended for other windows. The update algorithm derived herein can be used to compute the transform coefficients of the shifted sequence as new data points are available. The complexity of developed algorithm is \(O(N)\). The validity of algorithm is tested by MATLAB simulations.
0 references
0.8188124299049377
0 references
0.8188124299049377
0 references
0.8165672421455383
0 references