Title :
Fast algorithms for short prime length fast biased polynomial transforms
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan
fDate :
3/1/1990 12:00:00 AM
Abstract :
Fast algorithms for three short prime length fast biased polynomial transforms are presented, based on the strategy of the minimum number of rotations. These algorithms are of practical use in digital image processing.
Keywords :
picture processing; polynomials; digital image processing; fast algorithms; minimum number of rotations; short prime length fast biased polynomial transforms;
Journal_Title :
Computers and Digital Techniques, IEE Proceedings E
