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

Discrete transforms such as the discrete Fourier transform (DFT) and thediscrete Hartley transform (DHT) are important tools in numerical analysis. Thesuccessful application of transform techniques relies on the existence ofefficient fast transforms. In this paper some fast algorithms are derived. Thetheoretical lower bound on the multiplicative complexity for the DFT/DHT areachieved. The approach is based on the factorization of DHT matrices.Algorithms for short blocklengths such as $N \in \{3, 5, 6, 12, 24 \}$ arepresented.

A Factorization Scheme for Some Discrete Hartley Transform Matrices