頁籤選單縮合
題名 | Fast Computation of Two-Dimensional Circular Convolution=二維迴旋之快速演算法 |
---|---|
作者姓名(中文) | 胡能忠; 鄭朝元; | 書刊名 | Journal of the Chinese Institute of Electrical Engineering |
卷期 | 4:1 1997.02[民86.02] |
頁次 | 頁45-50 |
分類號 | 448.5 |
關鍵詞 | 二維迴旋; 二維離散哈特雷轉換; 二維類似離散哈特雷轉換; 一維斜迴旋; 2-D CC; 2-D DHT; 2-D harley-like DHT; 1-D SCC; |
語文 | 英文(English) |
中文摘要 | 二維迴旋可透過二維哈特雷轉換而得。同時二維離散哈特雷轉換可分解成數個一 維 H �兜鉥哄A而在一維 H �偯W率域相乘即為一維斜迴旋,故二維迴旋可利用不同長度之一 維斜迴旋而得之。本法與利用多項式轉換來計算二維迴旋之計算量相同。唯本法係幾何性, 而後者卻為代數性。 |
英文摘要 | A 2-D circular convolution (CC) can be computed by the 2-D discrete Hartley transform (DHT) which can be computed effiiently by 1-D H �� transforms of various sizes, Therefore, a 2-D CC is computed by evaluating the product in a 1-D H �� transform domain resulting in a 1-D skew-circular convolution (SCC). This algorithm is the same as the 2-D CC computed by the Chinese remainder theorem (CRT) and the polynomial transform (PT), which is algebraic in its nature while our algorithm is geometric. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。