Simplifications result from use of residue Fermat number systems. System of finite arithmetic over residue Fermat number systems enables calculation of discrete Fourier transform (DFT) of series of complex numbers with reduced number of multiplications. Computer architectures based on approach suitable for design of very-large-scale integrated (VLSI) circuits for computing DFT's. General approach not limited to DFT's; Applicable to decoding of error-correcting codes and other transform calculations. System readily implemented in VLSI.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    VLSI Architectures for Computing DFT's


    Contributors:
    Truong, T. K. (author) / Chang, J. J. (author) / Hsu, I. S. (author) / Reed, I. S. (author) / Pei, D. Y. (author)

    Published in:

    Publication date :

    1986-07-01



    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English




    Parallel architectures for optoelectronic VLSI processing

    Fey, D. / Grimm, G. / Erhard, W. et al. | British Library Conference Proceedings | 1999



    Digital VLSI architectures for beam-enhanced RF aperture arrays

    Wijayaratna, Sewwandi / Madanayake, Arjuna / Wijenayake, Chamith et al. | IEEE | 2015