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.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

    Fast-Polynomial-Transform Program


    Beteiligte:
    Truong, T. K. (Autor:in) / Hsu, I. S. (Autor:in) / Chu, Y. F. (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    01.11.1987



    Medientyp :

    Sonstige


    Format :

    Keine Angabe


    Sprache :

    Englisch







    Fast Edge Directed Polynomial Interoplation

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