A design and implementation of 32-paths parallel 256-point FFT/IFFT for optical OFDM systems

Hun-sik Kang, S. Chang, In-Ki Hwang, J. Lee
{"title":"A design and implementation of 32-paths parallel 256-point FFT/IFFT for optical OFDM systems","authors":"Hun-sik Kang, S. Chang, In-Ki Hwang, J. Lee","doi":"10.1109/ICACT.2016.7423414","DOIUrl":null,"url":null,"abstract":"This paper presents the design and implementation of thirty-two paths parallel FFT/IFFT for optical OFDM systems. Employing OFDM over high speed optical transmission systems requires large hardware resources due to computational-intensive operations such as full-parallel FFT implementation. The proposed 256-point FFT/IFFT adopts 32-paths parallel architecture with mixed radix-23 and radix-25 algorithm to reduce large number of complex multipliers. With this architecture, 256 full parallel data signals can be divided into eight sequential groups. Each group, composed of 32 parallel signals, is pipeline-processed. As a result, the hardware resources for full parallel 256-point FFT operation can be reduced to as much as those of 32-point FFT resource plus 32-path 8-point single-path delay feedback (SDF). The proposed FFT architecture is implemented with field programmable gate array and integrated in 12 Gbps, 64-QAM encoded real-time optical OFDM system. The implementation result shows that an 86% complex multiplier reduction can be achieved in comparison with full parallel architecture. The attained error vector magnitude (EVM) is approximately up to -32 dB for 64-QAM OFDM signals.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"154 8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 18th International Conference on Advanced Communication Technology (ICACT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACT.2016.7423414","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

This paper presents the design and implementation of thirty-two paths parallel FFT/IFFT for optical OFDM systems. Employing OFDM over high speed optical transmission systems requires large hardware resources due to computational-intensive operations such as full-parallel FFT implementation. The proposed 256-point FFT/IFFT adopts 32-paths parallel architecture with mixed radix-23 and radix-25 algorithm to reduce large number of complex multipliers. With this architecture, 256 full parallel data signals can be divided into eight sequential groups. Each group, composed of 32 parallel signals, is pipeline-processed. As a result, the hardware resources for full parallel 256-point FFT operation can be reduced to as much as those of 32-point FFT resource plus 32-path 8-point single-path delay feedback (SDF). The proposed FFT architecture is implemented with field programmable gate array and integrated in 12 Gbps, 64-QAM encoded real-time optical OFDM system. The implementation result shows that an 86% complex multiplier reduction can be achieved in comparison with full parallel architecture. The attained error vector magnitude (EVM) is approximately up to -32 dB for 64-QAM OFDM signals.
光学OFDM系统32路并行256点FFT/IFFT的设计与实现
本文介绍了用于光OFDM系统的32路并行FFT/IFFT的设计与实现。在高速光传输系统中采用OFDM需要大量的硬件资源,因为计算密集型的操作,如全并行FFT的实现。所提出的256点FFT/IFFT采用32路并行架构,采用基数23和基数25混合算法,减少了大量的复数乘法器。在这种架构下,256个全并行数据信号可以被分成8个顺序组。每组由32个并行信号组成,采用流水线处理。因此,完全并行256点FFT操作的硬件资源可以减少到32点FFT资源加上32路8点单路延迟反馈(SDF)的硬件资源。所提出的FFT架构采用现场可编程门阵列实现,并集成在12gbps 64-QAM编码的实时光OFDM系统中。实现结果表明,与全并行架构相比,该架构可将复杂乘法器降低86%。对于64-QAM OFDM信号,获得的误差矢量幅度(EVM)大约高达-32 dB。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信