✦ LIBER ✦

Multidimensional Polynomial Transform Algorithm For Multidimensional Discrete Hartley Transform

✍ Scribed by Lizhi Cheng; Yonghong Zeng

Book ID: 105767437
Publisher: Springer
Year: 2002
Tongue: English
Weight: 66 KB
Volume: 21
Category: Article
ISSN: 0278-081X
DOI: 10.1007/s00034-002-2001-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New polynomial transform algorithm for m

New polynomial transform algorithm for multidimensional DCT

✍ Yonghong Zeng; Guoan Bi; Leyman, A.R. 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 202 KB

Prime factor algorithm for multidimensio

Prime factor algorithm for multidimensional discrete cosine transform

✍ Guoan Bi; Yonghong Zeng; Yen Qiu Chen 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 210 KB

Multidimensional fast Hartley transform

Multidimensional fast Hartley transform onto SIMD hypercubes

✍ E.L Zapata; F Argüello; F.F Rivera; J.D Bruguera 📂 Article 📅 1990 🏛 Elsevier Science ⚖ 748 KB

Odd-Factor Algorithms for Multidimension

Odd-Factor Algorithms for Multidimensional Discrete W Transform

✍ Guoan Bi; Yonghong Zeng; Zhiping Lin 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 138 KB

Vector coding algorithms for multidimens

Vector coding algorithms for multidimensional discrete Fourier transform

✍ Zhaodou Chen; Lijing Zhang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 186 KB

A new fast algorithm is presented for the multidimensional discrete Fourier transform (DFT). This algorithm is derived using an interesting technique called "vector coding" (VC), and we call it the vector-coding fast Fourier transform (VC-FFT) algorithm. Since the VC-FFT is an extension of the Coole

Fast algorithms for the multidimensional

Fast algorithms for the multidimensional discrete Fourier transform

✍ Guessoum, A.; Mersereau, R. 📂 Article 📅 1986 🏛 IEEE ⚖ 715 KB