首页> 外文期刊>Microprocessors and microsystems >Reconfigurable Superconducting FFT Processor Using Bit-Slice Block Share Processing Unit
【24h】

Reconfigurable Superconducting FFT Processor Using Bit-Slice Block Share Processing Unit

机译:使用位切块块共享处理单元可重新配置超导FFT处理器

获取原文
获取原文并翻译 | 示例

摘要

We have proposed a reconfigurable high speed and very economical Rapid Single Flux Quantum (RSFQ) superconducting logic design based on the Fast Fourier Transform (FFT) Processor. We have designed a 256 - point FFT processor with the help of a bit-slicing block sharing unit. RSFQ is one of the superconducting device logics comprises of Josephson Junction. The computation complexity of this superconducting FFT is less when the number of points increased. We have proposed three different designs depending on the split radix FFT, the bit-serial radix 2 FFT, and the mixed radix FFT algorithms. The proposed design will slice the 256 - point FFT into eight 32 - point FFT each and each 32 - point FFT is divided into eight 4 - point FFT each for the reduction in hardware cost. For complex multiplication, the computation complexity of our design will be less than N/2 Log(2) N for the radix 2 algorithm based on the Block share processing Unit (BSPU) and further, it is reduced for split radix & mixed radix algorithms based on BSPU based RSFQ logic. Due to this, the speed of the processor is improvised compared to general FFT algorithm based semiconductor technology. we have computed and calculated the latency at 10 GHz for our designs. The main aim of this proposed design is to reduce the complex computation time and better performance of the processor with less hardware cost. This proposed design can furthermore continue to several N-2 - point by using synchronous clock tree.
机译:我们提出了一种基于快速傅里叶变换(FFT)处理器的可重新配置的高速和非常经济的快速单磁通量子(RSFQ)超导逻辑设计。我们已经设计了一个256点FFT处理器,借助位点切块共享单元。 RSFQ是超导设备逻辑之一,包括Josephsephson Jonction。当点数增加时,该超导FFT的计算复杂性较少。我们提出了三种不同的设计,具体取决于分割基数FFT,位串行基数2 FFT和混合的基数FFT算法。所提出的设计将将256点FFT切成八个32 - 点FFT,每个32点FFT分为八个4点FFT,每个用于降低硬件成本。对于复杂的乘法,我们的设计的计算复杂性将小于基于块共享处理单元(BSPU)的基数2算法的N / 2 log(2)n,进一步,对于分割基数和混合基数算法,减少了它基于BSPU的RSFQ逻辑。由此,与总体FFT算法的半导体技术相比,处理器的速度是简易的。我们已经计算并计算了10 GHz的延迟为我们的设计。这种提出的设计的主要目的是减少复杂的计算时间和更好的处理器性能,具有较少的硬件成本。通过使用同步时钟树,这种提出的设计还可以继续持续几个N-2点。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号