In this paper, we propose general fast one dimensional (1-D) and two dimensional (2-D) slant transform algorithms. By introducing simple and structural permutations, the heavily computational operations are centralized to become standardized and localized processing units. The total numbers of multiplications for the proposed fast 1-D and 2-D slant transforms are less than those of the existed methods. With advantages of convenient description in formulation and efficient computation for realization, the proposed fast slant transforms are suitable for applications in signal compression and pattern recognition.
|頁（從 - 到）||705-711|
|期刊||IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences|
|出版狀態||Published - 1997|
All Science Journal Classification (ASJC) codes