A prime-factor decomposed algorithm for the discrete sine transform (Q803771): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Gabriele Drauschke / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Gabriele Drauschke / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0045-7906(90)90007-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2002881031 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:30, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A prime-factor decomposed algorithm for the discrete sine transform |
scientific article |
Statements
A prime-factor decomposed algorithm for the discrete sine transform (English)
0 references
1990
0 references
The paper presents a prime factor algorithm for the discrete sine transform, which is similar to the known prime factor algorithm for the discrete cosine transform [cf. \textit{K. R. Rao} and the first author, ``Discrete cosine transform. Algorithms, advantages, applications.'' (1990; Zbl 0726.65162)].
0 references
prime factor
0 references
decomposition
0 references
index mapping
0 references
prime factor algorithm
0 references
discrete sine transform
0 references
discrete cosine transform
0 references
