Computer program uses fast-polynomial-transformation (FPT) algorithm applicable to two-dimensional mathematical convolutions. Two-dimensional cyclic convolutions converted to one-dimensional convolutions in polynomial rings. Program decomposes cyclic polynomials into polynomial convolutions of same length. Only FPT's and fast Fourier transforms of same length required. Modular approach saves computional resources. Program written in C.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Fast-Polynomial-Transform Program


    Contributors:
    Truong, T. K. (author) / Hsu, I. S. (author) / Chu, Y. F. (author)

    Published in:

    Publication date :

    1987-11-01



    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English





    Fast Edge Directed Polynomial Interoplation

    Muresan, D. D. | British Library Conference Proceedings | 2005