A low multiplicative complexity fast recursive DCT-2 algorithm (Q6231676)
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: A low multiplicative complexity fast recursive DCT-2 algorithm |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A low multiplicative complexity fast recursive DCT-2 algorithm |
preprint article from arXiv |
Statements
15 March 2012
0 references
cs.IT
0 references
math.IT
0 references
Maxim Vashkevich
0 references
Alexander Petrovsky
0 references
