<?xml version="1.0" encoding="utf-8" standalone="no"?>
<!DOCTYPE article SYSTEM "http://www.adv-radio-sci.net/inc/ars/copernicus.dtd">
<article language="en">
	<journal>
		<journal_title>Advances in Radio Science</journal_title>
		<journal_url>www.adv-radio-sci.net</journal_url>
		<issn>1684-9965</issn>
		<eissn>1684-9973</eissn>
		<volume_number>6</volume_number>
		<volume_title>Kleinheubacher Berichte 2007</volume_title>
		<publication_year>2008</publication_year>
	</journal>
	<doi>10.5194/ars-6-89-2008</doi>
	<article_url>http://www.adv-radio-sci.net/6/89/2008/</article_url>
	<abstract_html>http://www.adv-radio-sci.net/6/89/2008/ars-6-89-2008.html</abstract_html>
	<fulltext_pdf>http://www.adv-radio-sci.net/6/89/2008/ars-6-89-2008.pdf</fulltext_pdf>
	<start_page>89</start_page>
	<end_page>94</end_page>
	<publication_date>2008-05-26</publication_date>
	<article_title content_type="html">Matrix-Vector Based Fast Fourier Transformations on SDR Architectures</article_title>
	<authors>
		<author numeration="1" affiliations="2">
			<name>Y. He</name>
		</author>
		<author numeration="2" affiliations="1">
			<name>K. Hueske</name>
			<email>klaus.hueske@uni-dortmund.de</email>
		</author>
		<author numeration="3" affiliations="1">
			<name>J. Götze</name>
		</author>
		<author numeration="4" affiliations="2">
			<name>E. Coersmeier</name>
		</author>
	</authors>
	<affiliations>
		<affiliation numeration="1" content_type="html">University of Dortmund, Information Processing Lab, Otto-Hahn-Str. 4, 44221 Dortmund, Germany</affiliation>
		<affiliation numeration="2" content_type="html">Nokia Research Center, Bochum, Meesmannstr. 103, 44807 Bochum, Germany</affiliation>
	</affiliations>
	<abstract content_type="html">Today Discrete Fourier Transforms (DFTs) are applied in various
radio standards based on OFDM (Orthogonal Frequency Division Multiplex).
It is important to gain a fast computational speed for the DFT, which is usually
achieved by using specialized Fast Fourier Transform (FFT) engines. However, in face
of the Software Defined Radio (SDR) development, more general (parallel) processor
architectures are often desirable, which are not tailored to FFT computations. Therefore,
alternative approaches are required to reduce the complexity of the DFT. Starting from a matrix-vector
based description of the FFT idea, we will present different factorizations of the DFT matrix, which
allow a reduction of the complexity that lies between the original DFT and the minimum FFT complexity.
The computational complexities of these factorizations and their suitability for implementation on different
processor architectures are investigated.</abstract>
	<references>
		<reference numeration="1" content_type="text"> Berthold, U., Riehmeier, A.-R., and Jondral, F. K.: Spectral partitioning for modular software defined radio, 59th Vehicular Technology Conference (VTC2004), 2, 1218&amp;ndash;1222, May 2004. </reference>
		<reference numeration="2" content_type="text"> Cooley, J. W. and Tukey, J. W.: An algorithm for the machine calculation of complex Fourier series, Math. Comput., 19, 297&amp;ndash;301, 1965. </reference>
		<reference numeration="3" content_type="text"> Dillinger, M., Madani, K., and Alonistioti, N.: Software Defined Radio-Architectures, Systems and Functions, Wiley Series in Software Radio, John Wiley &amp; Sons Ltd., 2003. </reference>
		<reference numeration="4" content_type="text"> Heyne, B. and Götze, J.: A Pure Cordic Based FFT for Reconfigurable Digital Signal Processing, 12th European Signal Processing Conference (Eusipco2004), Vienna, September 2004. </reference>
		<reference numeration="5" content_type="text"> Jeon, C. H. and Reeves, A. P.: The fast Fourier transform on a multicluster computer architecture, Proceedings of the 19th Annual Hawaii International Conference on System Sciences, 103&amp;ndash;110, 1986. </reference>
		<reference numeration="6" content_type="text"> Schoenes, M., Eberli, S., Burg, A., et al.: A novel SIMD DSP architecture for software defined radio, Proc. of the 46th IEEE International Midwest Symposium on Circuits and Systems (MWSCAS2003), 3, 1443&amp;ndash;1446, December 2003.  </reference>
		<reference numeration="7" content_type="text"> Son, B. S., Jo, B. G., Sunwoo, M. H., and Yong, S. K.: A high-speed FFT processor for OFDM systems, Proc. of the IEEE International Symposium on Circuits and Systems (ISCAS2002), 3, 281&amp;ndash;284, May 2002.  </reference>
		<reference numeration="8" content_type="text"> Van Loan, C.: Computational Frameworks for the Fast Fourier Transform, Frontiers in applied mathematics, Society for Industrial and Applied Mathematics, Philadelphia, 1992.  </reference>
	</references>
</article>

