An optimal algorithm for grouping in NEDA

MaRDI QIDQ3538098zbMATH OpenFDO

Authors Lei Jia, Tinggui Xie, Zhenyu Liu

Publication date 24 November 2008

zbMATH Keywords

discrete cosine transformdistributed arithmeticfast Fourier transforms

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Distributed algorithms (68W15)

Recommendations

• The design of optimal DFT algorithms using dynamic programming
• Pruning fast Fourier transform algorithm design using group-based method
• Multiplierless multiple constant multiplication
• Simplified design of constant coefficient multipliers
• Simple FFT and DCT algorithms with reduced number of operations.

Cited in

(2)

• NEDA
• scientific article; zbMATH DE number 1532409 (Why is no real title available?)

This page was built for publication: An optimal algorithm for grouping in NEDA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3538098)