Fast algorithms for short prime length fast biased polynomial transforms
Ja‐Ling Wu · IEE Proceedings E Computers and Digital Techniques · 1990
In the paper, 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.