MCM FFT处理器的设计

Proceedings 1997 IEEE Multi-Chip Module Conference Pub Date : 1997-02-04 DOI:10.1109/MCMC.1997.569349

R. Rozier, F. Kiamilev

{"title":"MCM FFT处理器的设计","authors":"R. Rozier, F. Kiamilev","doi":"10.1109/MCMC.1997.569349","DOIUrl":null,"url":null,"abstract":"We present the design of a parallel high-speed chipset for computing an 8,192-point (or less) 1-D complex fast Fourier transform (FFT). The chipset is composed of two chips-an FFT processing engine (FFTP) with on-chip twiddle factor generation and a random-access data storage element (FFTRAM). This chipset can be efficiently connected on an MCM to form a high-performance FFT calculation system.","PeriodicalId":412444,"journal":{"name":"Proceedings 1997 IEEE Multi-Chip Module Conference","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Design of an MCM FFT processor\",\"authors\":\"R. Rozier, F. Kiamilev\",\"doi\":\"10.1109/MCMC.1997.569349\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present the design of a parallel high-speed chipset for computing an 8,192-point (or less) 1-D complex fast Fourier transform (FFT). The chipset is composed of two chips-an FFT processing engine (FFTP) with on-chip twiddle factor generation and a random-access data storage element (FFTRAM). This chipset can be efficiently connected on an MCM to form a high-performance FFT calculation system.\",\"PeriodicalId\":412444,\"journal\":{\"name\":\"Proceedings 1997 IEEE Multi-Chip Module Conference\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-02-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1997 IEEE Multi-Chip Module Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MCMC.1997.569349\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1997 IEEE Multi-Chip Module Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MCMC.1997.569349","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们提出了一种并行高速芯片组的设计，用于计算8,192点(或更少)的1-D复杂快速傅里叶变换(FFT)。该芯片组由两个芯片组成:具有片上旋转因子生成功能的FFT处理引擎(FFTP)和随机存取数据存储元件(FFTRAM)。该芯片组可以高效地连接到MCM上，形成高性能FFT计算系统。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Design of an MCM FFT processor

We present the design of a parallel high-speed chipset for computing an 8,192-point (or less) 1-D complex fast Fourier transform (FFT). The chipset is composed of two chips-an FFT processing engine (FFTP) with on-chip twiddle factor generation and a random-access data storage element (FFTRAM). This chipset can be efficiently connected on an MCM to form a high-performance FFT calculation system.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings 1997 IEEE Multi-Chip Module Conference

自引率

0.00%

发文量