✦ LIBER ✦

Comparison of algorithms for computing the two-dimensional discrete Hartley transform

✍ Scribed by Reichenbach, Stephen E.; Burton, John C.; Miller, Keith W.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An array architecture for computing two-

✍ Anindya Sundar Dhar; Swapna Banerjee 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 398 KB

Separable two-dimensional discrete Hartl

✍ Watson, Andrew B.; Poirson, Allen 📂 Article 📅 1986 🏛 Optical Society of America 🌐 English ⚖ 391 KB

Fast computation of the two-dimensional

✍ Hu, N.-C.; Lu, F.-F. 📂 Article 📅 1995 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 352 KB

Fast computation of the discrete Hartley

✍ Priyanka Jain; Balbir Kumar; S. B. Jain 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

Theory and algorithms for two-dimensiona

✍ Xichun Zhang; Gang Wei 📂 Article 📅 2006 🏛 South China University of Technology and Academy o 🌐 English ⚖ 159 KB

Fast computation of the discrete cosine

✍ Malvar, H. 📂 Article 📅 1987 🏛 IEEE ⚖ 227 KB