Fast Fourier Transform using compiler auto-vectorization
| dc.contributor.author | Göc, Dundar | |
| dc.contributor.department | Chalmers tekniska högskola / Institutionen för matematiska vetenskaper | sv |
| dc.contributor.examiner | Raum, Martin | |
| dc.contributor.supervisor | Raum, Martin | |
| dc.date.accessioned | 2019-09-01T09:53:47Z | |
| dc.date.available | 2019-09-01T09:53:47Z | |
| dc.date.issued | 2019 | sv |
| dc.date.submitted | 2019 | |
| dc.description.abstract | The purpose of this thesis is to develop a fast Fourier transformation algorithm written in C with the use of GCC (GNU Compiler Collection) auto-vectorization in the multiplicative group of integers modulo n, where n is a word sized odd integer. The specific Fourier transform algorithm employed is the cache-friendly version of the Truncated Fourier Transform. The algorithm was implemented by modifying an existing library for modular arithmetic written in C called zn poly. The majority of the thesis work consisted of changing the code in a way to make integration into FLINT possible. FLINT is a versatile library, written in C, aimed at fast arithmetic of different kinds. The results show that auto-vectorization is possible with a potential speedup factor of 3. The performance increase is however entirely dependent on the task at hand and the nature of the computation being made. | sv |
| dc.identifier.uri | https://hdl.handle.net/20.500.12380/300206 | |
| dc.language.iso | eng | sv |
| dc.setspec.uppsok | PhysicsChemistryMaths | |
| dc.title | Fast Fourier Transform using compiler auto-vectorization | sv |
| dc.type.degree | Examensarbete för masterexamen | sv |
| dc.type.uppsok | H | |
| local.programme | Complex adaptive systems (MPCAS), MSc |