Centralized Fast Slant Transform Algorithms
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 社団法人電子情報通信学会の論文
- 1997-04-25
著者
-
YANG Jar-Ferr
Department of Electrical Engineering, National Cheng Kung University
-
Fan Chih-peng
Department Of Electrical Engineering National Chung Hsing University
-
Fan Chih-peng
Department Of Electrical Engineering National Cheng Kung University
-
Yang Jar-ferr
Department Of Electrical Engineering National Cheng Kung University
関連論文
- A Gerschgorin Radii Based Source Number Detection : Analysis and Simulations (Special Section on Digital Signal Processing)
- Implementations of Low-Cost Hardware Sharing Architectures for Fast 8×8 and 4×4 Integer Transforms in H.264/AVC(Digital Signal Processing)
- Fast 2-Dimensional 8×8 Integer Transform Algorithm Design for H.264/AVC Fidelity Range Extensions(Image Processing and Video Processing)
- Centralized Fast Slant Transform Algorithms
- Fast Algorithm Designs for Low-Complexity 4×4 Discrete Cosine Transform(Digital Signal Processing)
- Efficient Coding Translation of GSM and G.729 Speech Coders across Mobile and IP Networks(Speech and Hearing)
- Time-Varied Pitch Gain Predictor for Low Bit Rate Speech Coders
- Transform-Based CELP Vocoders with Low-Delay Low-Complexity and Variable-Rate Features