Fast-polynomial-transform (FPT) algorithm computes two-dimensional cyclic convolution of two-dimensional arrays of complex numbers. New algorithm uses cyclic polynomial convolutions of same length. Algorithm regular, modular, and expandable.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    FPT Algorithm for Two-Dimensional Cyclic Convolutions


    Contributors:

    Published in:

    Publication date :

    1987-09-01



    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English