頁籤選單縮合
題 名 | New Algorithms of Two-Dimensional Discrete Hartley Transform=新的二維離散哈特利轉換演算法 |
---|---|
作 者 | 楊明錞; 吳家麟; | 書刊名 | Journal of the Chinese Institute of Electrical Engineering |
卷 期 | 4:1 1997.02[民86.02] |
頁 次 | 頁37-44 |
分類號 | 448.5 |
關鍵詞 | 投影; 擴域; 離散傅利葉轉換; 離散哈特利轉換; Projection; Extension field; Discrete fourier transform; Discrete hartley transform; |
語 文 | 英文(English) |
中文摘要 | 在這篇論文中,我們提出二維離散哈特利轉換可視為將二維離散傅利葉轉換從擴域 投影到基域,而投影量的運算是藉由軌跡函數完成。這種觀點和傳統藉由三角函數來看二維 離散哈特利轉換是有很大的不同。藉由此觀點,我們推導出三個新的二維離散哈特利轉換演 算法。藉由此套技巧,多種新的二維離散哈特利轉換演算法亦可有系統地推導出。 |
英文摘要 | In this paper, We show that the 2-D DHT can be obtained by projecting the two-dimensional discrete Fourier transform (2-D DFT) from the extension field to the subfield. The trace functions are applied to perform the projection operator. It is quite different from the traditional treatment of the 2-D DHT, which is trigonometric decomposition based. Three new fast 2-D DHT algorithms are proposed to demonstrate the power of this framework. Applying the same technique, several different novel fast 2-D DHT algorithms can also be developed systematically via the projection framework. |
本系統中英文摘要資訊取自各篇刊載內容。