THE MULTIPLICATIVE COMPLEXITY AND ALGORITHM OF THE GENERALIZED DISCRETE FOURIER TRANSFORMGFT

Y.H. Zeng

Journal of Computational Mathematics ›› 1995, Vol. 13 ›› Issue (4) : 351-356.

PDF(21369 KB)
中国科学院数学与系统科学研究院期刊网
JCM
PDF(21369 KB)
Journal of Computational Mathematics ›› 1995, Vol. 13 ›› Issue (4) : 351-356.

THE MULTIPLICATIVE COMPLEXITY AND ALGORITHM OF THE GENERALIZED DISCRETE FOURIER TRANSFORMGFT

    {{javascript:window.custom_author_en_index=0;}}
  • {{article.zuoZhe_EN}}
Author information +
History +

HeighLight

{{article.keyPoints_en}}

Abstract

{{article.zhaiyao_en}}

Key words

QR code of this article

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}. Journal of Computational Mathematics, 1995, 13(4): 351-356

References

Publishing order | Descend order by publishing year | Descend order by cited within

References

{{article.reference}}

Funding

RIGHTS & PERMISSIONS

{{article.copyrightStatement_en}}
{{article.copyrightLicense_en}}
PDF(21369 KB)

Accesses

Citation

Detail
Sections
Recommended

/

〈 〉