2026-09-20T03:48:37Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/81596 2023-07-11 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Padua, David A. Xiong, Jianxin 2015-09-25T20:19:24Z 2015-09-25T20:19:24Z 10000-01-01 2001 2001 After presenting the translation and optimization techniques utilized by the SPL compiler, empirical data is presented showing the efficiency of the resulting C/FORTRAN code. Timings are compared, using fast Fourier transform (FFT), Walsh-Hadama transform (WHT), discrete cosine transform (DCT) and discrete sine transform (DST) as the benchmarks, to those obtained by highly optimized implementations including FFTW and the WHT package. The results of this comparison show that the SPL compiler produces code that is competitive and, in many cases, faster than the competitors. Made available in DSpace on 2015-09-25T20:19:24Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3030495.pdf: 4776468 bytes, checksum: 3a1fb5bcccebb4a02d28d316e469d1c7 (MD5) Previous issue date: 2001 Embargo set by: Seth Robbins for item 82877 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs U of I Only 112 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001. http://hdl.handle.net/2142/81596 (MiAaPQ)AAI3030495 eng Computer Science Automatic Optimization of DSP Algorithms text Computer Science Computer Science University of Illinois at Urbana-Champaign Dissertation Ph.D.