A new FFT architecture for 4 x 4 MIMO-OFDMA systems with variable symbol lengths

A. Karachalios, K. Nakos, D. Reisis, Hussein Alnuweiri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

We present a new FFT architecture for multi-input multioutput (MIMO) OFDMA wireless systems that require processing variable symbol lengths, ranging from 128 to 2048 complex points. The organization is based on 16 concurrent butterfly processing elements with each element computing a 128-point FFT by implementing an in-place technique. A novel processor-memory interconnection scheme allows the processing elements to operate in sets of k, 1 ≤ k ≤ 16, for completing FFT computations of size 128 x k, up to 2048 points. The architecture scales to support 4 x 4 MIMO-OFDMA operation. An FPGA implementation shows that the proposed organization requires 9995 slices on Xilinx Virtex-4 compared to 21624 slices of four parallel FFT architectures accomplishing the same task.

Original languageEnglish
Title of host publication2009 International Conference on Innovations in Information Technology, IIT '09
Pages80-84
Number of pages5
DOIs
Publication statusPublished - 1 Dec 2009
Event2009 International Conference on Innovations in Information Technology, IIT '09 - Al-Ain, United Arab Emirates
Duration: 15 Dec 200917 Dec 2009

Other

Other2009 International Conference on Innovations in Information Technology, IIT '09
CountryUnited Arab Emirates
CityAl-Ain
Period15/12/0917/12/09

Fingerprint

Fast Fourier transforms
Processing
Field programmable gate arrays (FPGA)
Data storage equipment

ASJC Scopus subject areas

  • Information Systems

Cite this

Karachalios, A., Nakos, K., Reisis, D., & Alnuweiri, H. (2009). A new FFT architecture for 4 x 4 MIMO-OFDMA systems with variable symbol lengths. In 2009 International Conference on Innovations in Information Technology, IIT '09 (pp. 80-84). [5413367] https://doi.org/10.1109/IIT.2009.5413367

A new FFT architecture for 4 x 4 MIMO-OFDMA systems with variable symbol lengths. / Karachalios, A.; Nakos, K.; Reisis, D.; Alnuweiri, Hussein.

2009 International Conference on Innovations in Information Technology, IIT '09. 2009. p. 80-84 5413367.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Karachalios, A, Nakos, K, Reisis, D & Alnuweiri, H 2009, A new FFT architecture for 4 x 4 MIMO-OFDMA systems with variable symbol lengths. in 2009 International Conference on Innovations in Information Technology, IIT '09., 5413367, pp. 80-84, 2009 International Conference on Innovations in Information Technology, IIT '09, Al-Ain, United Arab Emirates, 15/12/09. https://doi.org/10.1109/IIT.2009.5413367
Karachalios A, Nakos K, Reisis D, Alnuweiri H. A new FFT architecture for 4 x 4 MIMO-OFDMA systems with variable symbol lengths. In 2009 International Conference on Innovations in Information Technology, IIT '09. 2009. p. 80-84. 5413367 https://doi.org/10.1109/IIT.2009.5413367
Karachalios, A. ; Nakos, K. ; Reisis, D. ; Alnuweiri, Hussein. / A new FFT architecture for 4 x 4 MIMO-OFDMA systems with variable symbol lengths. 2009 International Conference on Innovations in Information Technology, IIT '09. 2009. pp. 80-84
@inproceedings{bfb9da1e016a41c8b783c2cae367a51c,
title = "A new FFT architecture for 4 x 4 MIMO-OFDMA systems with variable symbol lengths",
abstract = "We present a new FFT architecture for multi-input multioutput (MIMO) OFDMA wireless systems that require processing variable symbol lengths, ranging from 128 to 2048 complex points. The organization is based on 16 concurrent butterfly processing elements with each element computing a 128-point FFT by implementing an in-place technique. A novel processor-memory interconnection scheme allows the processing elements to operate in sets of k, 1 ≤ k ≤ 16, for completing FFT computations of size 128 x k, up to 2048 points. The architecture scales to support 4 x 4 MIMO-OFDMA operation. An FPGA implementation shows that the proposed organization requires 9995 slices on Xilinx Virtex-4 compared to 21624 slices of four parallel FFT architectures accomplishing the same task.",
author = "A. Karachalios and K. Nakos and D. Reisis and Hussein Alnuweiri",
year = "2009",
month = "12",
day = "1",
doi = "10.1109/IIT.2009.5413367",
language = "English",
isbn = "9781424456987",
pages = "80--84",
booktitle = "2009 International Conference on Innovations in Information Technology, IIT '09",

}

TY - GEN

T1 - A new FFT architecture for 4 x 4 MIMO-OFDMA systems with variable symbol lengths

AU - Karachalios, A.

AU - Nakos, K.

AU - Reisis, D.

AU - Alnuweiri, Hussein

PY - 2009/12/1

Y1 - 2009/12/1

N2 - We present a new FFT architecture for multi-input multioutput (MIMO) OFDMA wireless systems that require processing variable symbol lengths, ranging from 128 to 2048 complex points. The organization is based on 16 concurrent butterfly processing elements with each element computing a 128-point FFT by implementing an in-place technique. A novel processor-memory interconnection scheme allows the processing elements to operate in sets of k, 1 ≤ k ≤ 16, for completing FFT computations of size 128 x k, up to 2048 points. The architecture scales to support 4 x 4 MIMO-OFDMA operation. An FPGA implementation shows that the proposed organization requires 9995 slices on Xilinx Virtex-4 compared to 21624 slices of four parallel FFT architectures accomplishing the same task.

AB - We present a new FFT architecture for multi-input multioutput (MIMO) OFDMA wireless systems that require processing variable symbol lengths, ranging from 128 to 2048 complex points. The organization is based on 16 concurrent butterfly processing elements with each element computing a 128-point FFT by implementing an in-place technique. A novel processor-memory interconnection scheme allows the processing elements to operate in sets of k, 1 ≤ k ≤ 16, for completing FFT computations of size 128 x k, up to 2048 points. The architecture scales to support 4 x 4 MIMO-OFDMA operation. An FPGA implementation shows that the proposed organization requires 9995 slices on Xilinx Virtex-4 compared to 21624 slices of four parallel FFT architectures accomplishing the same task.

UR - http://www.scopus.com/inward/record.url?scp=77952472322&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77952472322&partnerID=8YFLogxK

U2 - 10.1109/IIT.2009.5413367

DO - 10.1109/IIT.2009.5413367

M3 - Conference contribution

SN - 9781424456987

SP - 80

EP - 84

BT - 2009 International Conference on Innovations in Information Technology, IIT '09

ER -