An Efficient FFT Architecture for OFDM Communication Systems

K. Harikrishna, T. Rao
{"title":"An Efficient FFT Architecture for OFDM Communication Systems","authors":"K. Harikrishna, T. Rao","doi":"10.1109/ARTCom.2009.78","DOIUrl":null,"url":null,"abstract":"This paper presents a high level implementation of a high performance FFT for Modulator and Demodulator in OFDM. The design has been coded in VHDL and targeted into Xilinx Virtex-E XCV3200E FPGAs. The hardware requirement comparison shows that our implementation outperforms other implementations of FFT on the same series of FPGAs. Radix-22 algorithm has the same multiplicative complexity as the radix-4 algorithm, but retains the butterfly structure of radix-2 algorithm.","PeriodicalId":256610,"journal":{"name":"2009 International Conference on Advances in Recent Technologies in Communication and Computing","volume":" 22","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Advances in Recent Technologies in Communication and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARTCom.2009.78","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

This paper presents a high level implementation of a high performance FFT for Modulator and Demodulator in OFDM. The design has been coded in VHDL and targeted into Xilinx Virtex-E XCV3200E FPGAs. The hardware requirement comparison shows that our implementation outperforms other implementations of FFT on the same series of FPGAs. Radix-22 algorithm has the same multiplicative complexity as the radix-4 algorithm, but retains the butterfly structure of radix-2 algorithm.
OFDM通信系统中一种高效的FFT体系结构
本文介绍了一种用于OFDM调制器和解调器的高性能FFT的高级实现。该设计已用VHDL编码,并针对Xilinx Virtex-E XCV3200E fpga。硬件需求比较表明,我们的实现优于同一系列fpga上的其他FFT实现。基数-22算法具有与基数-4算法相同的乘法复杂度,但保留了基数-2算法的蝴蝶结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信