一个基于洛朗级数的矩阵的灵活实现，16点快速傅里叶和哈特利变换

2010 VI Southern Programmable Logic Conference (SPL) Pub Date : 2015-02-20 DOI:10.1109/SPL.2010.5483017

R. Oliveira, Hélio M. de Oliveira, R. Souza, E. J. P. Santos

{"title":"一个基于洛朗级数的矩阵的灵活实现，16点快速傅里叶和哈特利变换","authors":"R. Oliveira, Hélio M. de Oliveira, R. Souza, E. J. P. Santos","doi":"10.1109/SPL.2010.5483017","DOIUrl":null,"url":null,"abstract":"This paper describes a flexible architecture for implementing a new fast computation of the discrete Fourier and Hartley transforms, which is based on a matrix Laurent series. The device calculates the transforms based on a single bit selection operator. The hardware structure and synthesis are presented, which handled a 16-point fast transform in 65 nsec, with a Xilinx SPARTAN 3E device.","PeriodicalId":372692,"journal":{"name":"2010 VI Southern Programmable Logic Conference (SPL)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A flexible implementation of a matrix Laurent series-based 16-point fast Fourier and Hartley transforms\",\"authors\":\"R. Oliveira, Hélio M. de Oliveira, R. Souza, E. J. P. Santos\",\"doi\":\"10.1109/SPL.2010.5483017\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes a flexible architecture for implementing a new fast computation of the discrete Fourier and Hartley transforms, which is based on a matrix Laurent series. The device calculates the transforms based on a single bit selection operator. The hardware structure and synthesis are presented, which handled a 16-point fast transform in 65 nsec, with a Xilinx SPARTAN 3E device.\",\"PeriodicalId\":372692,\"journal\":{\"name\":\"2010 VI Southern Programmable Logic Conference (SPL)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-02-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 VI Southern Programmable Logic Conference (SPL)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPL.2010.5483017\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 VI Southern Programmable Logic Conference (SPL)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPL.2010.5483017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

本文描述了一种灵活的结构，用于实现一种新的快速计算离散傅里叶变换和哈特利变换，它是基于矩阵劳伦级数。该设备基于单个比特选择运算符计算变换。介绍了在Xilinx SPARTAN 3E设备上，在65nsec内处理16点快速变换的硬件结构和综合。

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

查看原文本刊更多论文

A flexible implementation of a matrix Laurent series-based 16-point fast Fourier and Hartley transforms

This paper describes a flexible architecture for implementing a new fast computation of the discrete Fourier and Hartley transforms, which is based on a matrix Laurent series. The device calculates the transforms based on a single bit selection operator. The hardware structure and synthesis are presented, which handled a 16-point fast transform in 65 nsec, with a Xilinx SPARTAN 3E device.

求助全文

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

来源期刊

2010 VI Southern Programmable Logic Conference (SPL)

自引率

0.00%

发文量