首页 | 本学科首页   官方微博 | 高级检索  
     

基于FPGA的高速浮点FFT的实现研究
引用本文:刘健,史彩娟,赵丽莉.基于FPGA的高速浮点FFT的实现研究[J].微型机与应用,2012,31(14):79-81,84.
作者姓名:刘健  史彩娟  赵丽莉
作者单位:河北联合大学信息学院,河北唐山,063009
摘    要:研究了利用FPGA实现浮点FFT的技术,提出了一种循环控制、RAM访问和蝶形运算三大模块以流水线方式协同工作的方案,结合数据缓冲和并行处理技术,讨论了蝶形运算单元的工作机制。浮点乘法器采用并行Booth编码和3级Wallace压缩树的结构,浮点加法器中采用独立的定点加法器和减法器,使运算得以高速进行。RAM读/写时序和运算参数都可利用寄存器设置。本设计已在Cyclone-Ⅱ系列芯片EP2C8Q208中实现,200MHz主频下,采用外部RAM,完成1024点复数FFT只需750μs。

关 键 词:FPGA  浮点FFT  蝶形运算  Booth编码  Wallace压缩树

Research of high speed floating point FFT based on FPGA
Liu Jian,Shi Caijuan,Zhao Lili.Research of high speed floating point FFT based on FPGA[J].Microcomputer & its Applications,2012,31(14):79-81,84.
Authors:Liu Jian  Shi Caijuan  Zhao Lili
Affiliation:(Information Institute,Hebei United University,Tangshan 063009,China)
Abstract:The paper discusses technology of implementing floating point FFT on FPGA. Scheme is given that loop control, RAM access and butterfly operation work together in the way of assembly line. Combined with data buffer and parallel processing technology, working mechanism of butterfly operation is discussed. Floating point multiplier uses structure of parallel Booth encoding and three steps Wallace compression tree, independent fixed point adder and subtractor are used in designing floating point adder, so that operation can be completed in high speed. RAM R/W timing and operation parameters can be setted by register. Design has been implemented by Cyclone-Ⅱ series chip EP2C8Q208. At 200 MHz, using of external RAM, time of completing 1 024-point complex FFT is only 750 μs.
Keywords:FPGA  floating point FFT  butterfly operation  Booth encode  Wallace compression tree
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号