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

A. Karachalios, K. Nakos, D. Reisis, H. Alnuweiri
{"title":"A new FFT architecture for 4 × 4 MIMO-OFDMA systems with variable symbol lengths","authors":"A. Karachalios, K. Nakos, D. Reisis, H. Alnuweiri","doi":"10.1109/IIT.2009.5413367","DOIUrl":null,"url":null,"abstract":"We present a new FFT architecture for multi-input multi-output (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 × k, up to 2048 points. The architecture scales to support 4 × 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.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Innovations in Information Technology (IIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIT.2009.5413367","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

We present a new FFT architecture for multi-input multi-output (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 × k, up to 2048 points. The architecture scales to support 4 × 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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种新的可变符号长度的4 × 4 MIMO-OFDMA系统FFT架构
我们提出了一种新的FFT架构,用于多输入多输出(MIMO) OFDMA无线系统,该系统需要处理可变符号长度,范围从128到2048个复杂点。该组织基于16个并发蝶形处理元素,每个元素通过实现就地技术计算128点FFT。一种新颖的处理器-存储器互连方案允许处理元件在k的集合中操作,1≤k≤16,以完成大小为128 × k的FFT计算,最多可达2048个点。该架构可扩展到支持4 × 4 MIMO-OFDMA操作。FPGA实现表明,所提出的组织在Xilinx Virtex-4上需要9995片,而完成相同任务的四个并行FFT架构需要21624片。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A software development tool for improving Quality of Service in Distributed Database Systems XQPoint: A queriable homomorphic XML compressor Design and simulation of a speech processor for cochlear implant based on Arabic language On popularity quality: Growth and decay phases of publication popularities Impact of applying realistic mobility models on the performance analysis of Internet gateway discovery approaches for Mobile Ad Hoc Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1