A new matrix approach to real FFTs and convolutions of length 2^k

ISSN： 0010-485X

Source： Computing, Vol.80, Iss.1, 2007-05, pp. : 23-45

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Minimum k Arborescences with Bandwidth Constraints

By Cai Mao-cheng Deng Xiaotie Wang Lusheng

Algorithmica, Vol. 38, Iss. 4, 2004-01 ,pp. : 529-537

Springer Publishing Company

Access to resources Recommend Favorite

Efficient Solution of A, x ^(k) = b ^(k) Using A ⁻¹

By Ditkowski Adi Fibich Gadi Gavish Nir

Journal of Scientific Computing, Vol. 32, Iss. 1, 2007-07 ,pp. : 29-44

Springer Publishing Company

Access to resources Recommend Favorite

On the Exact Complexity of Evaluating Quantified k -CNF

By Calabro Chris Impagliazzo Russell Paturi Ramamohan

Algorithmica, Vol. 65, Iss. 4, 2013-04 ,pp. : 817-827

Springer Publishing Company

Access to resources Recommend Favorite

Necklaces, Convolutions, and X+Y

By Bremner David Chan Timothy Demaine Erik Erickson Jeff Hurtado Ferran Iacono John Langerman Stefan Ptraşcu Mihai Taslakian Perouz

Algorithmica, Vol. 69, Iss. 2, 2014-06 ,pp. : 294-314

Springer Publishing Company

Access to resources Recommend Favorite

A finite capacity BMAP _K/G _K/1 queue with the generalized foreground-background processor-sharing discipline

By D’Apice C. Manzo R.

Automation and Remote Control, Vol. 67, Iss. 3, 2006-03 ,pp. : 428-434

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite