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

A general and fast method is conceived for computing the cyclic convolutionof n points, where n is a prime number. This method fully exploits the internalstructure of the cyclic matrix, and hence leads to significant reduction of themultiplication complexity in terms of CPU time by 50%, as compared withWinograd's algorithm. In this paper, we only consider the real and complexfields due to their most important applications, but in general, the ideabehind this method can be extended to any finite field of interest. Clearly, itis well-known that the discrete Fourier transform (DFT) can be expressed interms of cyclic convolution, so it can be utilized to compute the DFT when theblock length is a prime.

General Method for Prime-point Cyclic Convolution over the Real Field