https://scholars.lib.ntu.edu.tw/handle/123456789/123870
Title: | Fast Algorithms for Short Prime Length Fast Biased Polynomial Transform | Authors: | Wu, Ja-Ling Huang, Y.M. Hsu, S.H. |
Issue Date: | 1988 | Start page/Pages: | - | Source: | Telecom'88 | Abstract: | 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. |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-0025404316&doi=10.1049%2fip-e.1990.0014&partnerID=40&md5=2bb539fe7e4efabdec6d8edc3337c53e | DOI: | 10.1049/ip-e.1990.0014 | SDG/Keyword: | Image processing; Mathematical Techniques - Matrix Algebra; Mathematical transformations; Digital Image Processing; Fast Algorithms; Fast Biased Polynomial Transforms (FBPT); Polynomial Transforms; Computer programming |
Appears in Collections: | 資訊網路與多媒體研究所 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.