Fast algorithms for short prime length fast biased polynomial transforms
作者:
J.-L.Wu,
期刊:
IEE Proceedings E (Computers and Digital Techniques)
(IET Available online 1990)
卷期:
Volume 137,
issue 2
页码: 137-138
年代: 1990
DOI:10.1049/ip-e.1990.0014
出版商: IEE
数据来源: IET
摘要:
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.
点击下载:
PDF
(243KB)
返 回