A new FFT Architecture for $4 imes 4$ MIMO-OFDMA Systems with Variable Symbol Lengths Conference Paper

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. 2009 IEEE.

name of conference

• 2009 International Conference on Innovations in Information Technology (IIT)

authors

• Alnuweiri, Hussein

published proceedings

• 2009 International Conference on Innovations in Information Technology (IIT)

author list (cited authors)

• Karachalios, A., Nakos, K., Reisis, D., & Alnuweiri, H.

citation count

• 2

complete list of authors

• Karachalios, A||Nakos, K||Reisis, D||Alnuweiri, H

publication date

• December 2009

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

keywords

• Mental Health

Digital Object Identifier (DOI)

• 10.1109/iit.2009.5413367

International Standard Book Number (ISBN) 13

• 9781424456987

start page

• 80

end page

• 84

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Fiit.2009.5413367