Java signal processing: FFTs with bytecodes

✍ Scribed by Glossner, John; Thilo, Jesse; Vassiliadis, Stamatis

• Publisher: John Wiley and Sons
• Year: 1998
• Tongue: English
• Weight: 90 KB
• Volume: 10
• Category: Article
• ISSN: 1040-3108
• DOI: 10.1002/(sici)1096-9128(199809/11)10:11/13<1173::aid-cpe403>3.0.co;2-1

✦ Synopsis

This paper investigates the possibility of using Java as a language for digital signal processing. We compare the performance of the fast Fourier transform using Java interpreters, compilers, and native execution. To characterize the Java language as a platform for signal processing, we have implemented a traditional FFT algorithm in both C and Java and compared their relative performances. Additionally, we have developed a Tensor algebra FFT library in both Matlab and Java. Each of the Tensor libraries has been coded to exploit the characteristics of the source language. Our results indicate that the latest Sun Solaris 2.6 Java platform can provide performance within 20% to 60% of optimized C code on short FFT computations. On longer FFT computations, Java is about a factor of 2 to 3 times less efficient than optimized C code. We expect this gap to narrow with better compiler technology and direct execution on Java processors such as the DELFT-JAVA multithreaded processor.