English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We study recursive algorithm for computing DCT of lengths $N=q 2^m$ ($m,q \in\mathbb{N}$, $q$ is odd) due to C.W.Kok. We show that this algorithm has thesame multiplicative complexity as theoretically achievable by the prime factordecomposition, when $m \leqslant 2$. We also show that C.W.Kok's factorizationallows a simple conversion to a scaled form. We analyze complexity of such ascaled factorization, and show that for some lengths it achieves lowermultiplicative complexity than one of known prime factor-based scaledtransforms.

On Fast Algorithm for Computing Even-Length DCT