Efficient Algorithms for Running Type-I and Type-III Discrete Sine Transforms
Summary :
Fast algorithms for computing the running type-I discrete sine transform (DST-I) and type-III discrete sine transform (DST-III) are proposed. The algorithms are based on a recursive relationship between three subsequent local discrete sine spectra. The computational complexity of the algorithms is compared with that of fast DST-I and DST-III algorithms. Fast inverse algorithms for signal processing in the running discrete sine transform domains are also proposed.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.3 pp.761-763
- Publication Date
- 2004/03/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Image
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Vitaly KOBER, "Efficient Algorithms for Running Type-I and Type-III Discrete Sine Transforms" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 3, pp. 761-763, March 2004, doi: .
Abstract: Fast algorithms for computing the running type-I discrete sine transform (DST-I) and type-III discrete sine transform (DST-III) are proposed. The algorithms are based on a recursive relationship between three subsequent local discrete sine spectra. The computational complexity of the algorithms is compared with that of fast DST-I and DST-III algorithms. Fast inverse algorithms for signal processing in the running discrete sine transform domains are also proposed.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_3_761/_p
Copy
@ARTICLE{e87-a_3_761,
author={Vitaly KOBER, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Algorithms for Running Type-I and Type-III Discrete Sine Transforms},
year={2004},
volume={E87-A},
number={3},
pages={761-763},
abstract={Fast algorithms for computing the running type-I discrete sine transform (DST-I) and type-III discrete sine transform (DST-III) are proposed. The algorithms are based on a recursive relationship between three subsequent local discrete sine spectra. The computational complexity of the algorithms is compared with that of fast DST-I and DST-III algorithms. Fast inverse algorithms for signal processing in the running discrete sine transform domains are also proposed.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Efficient Algorithms for Running Type-I and Type-III Discrete Sine Transforms
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 761
EP - 763
AU - Vitaly KOBER
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2004
AB - Fast algorithms for computing the running type-I discrete sine transform (DST-I) and type-III discrete sine transform (DST-III) are proposed. The algorithms are based on a recursive relationship between three subsequent local discrete sine spectra. The computational complexity of the algorithms is compared with that of fast DST-I and DST-III algorithms. Fast inverse algorithms for signal processing in the running discrete sine transform domains are also proposed.
ER -
English
