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.
VLSI Architectures for Computing DFT's
NASA Tech Briefs ; 10 , 4
1986-07-01
Sonstige
Keine Angabe
Englisch
Parallel architectures for optoelectronic VLSI processing
British Library Conference Proceedings | 1999
|Energy-Efficient High-Throughput VLSI Architectures for Product-Like Codes
British Library Online Contents | 2019
Integrated multiparadigm computing architectures
AIAA | 1991
|