LTE上行链路的混合基数管道FFT处理器

2016 IEEE International Symposium on Consumer Electronics (ISCE) Pub Date : 2016-09-01 DOI:10.1109/ISCE.2016.7797369

Jinkyu Kim, Juyeob Kim, Joohyun Lee, Kyoungrok Cho

{"title":"LTE上行链路的混合基数管道FFT处理器","authors":"Jinkyu Kim, Juyeob Kim, Joohyun Lee, Kyoungrok Cho","doi":"10.1109/ISCE.2016.7797369","DOIUrl":null,"url":null,"abstract":"This paper presents a pipelined fast Fourier transform (FFT) processor consisting of radix-2, 3 and 5 for prime-sized discrete Fourier transform (DFT). The FFT processor does not require memory storing the twiddle factors or complex multiplications. It is adaptable for 34 kinds of the FFT length with a trivial multiplications and multiplexing of data in the LTE uplink. The proposed architecture reduces hardware complexity 32 %, and shows 737 Mbps throughput.","PeriodicalId":193736,"journal":{"name":"2016 IEEE International Symposium on Consumer Electronics (ISCE)","volume":"4 31","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A mixed-radix pipeline FFT processor with trivial multiplications for LTE uplink\",\"authors\":\"Jinkyu Kim, Juyeob Kim, Joohyun Lee, Kyoungrok Cho\",\"doi\":\"10.1109/ISCE.2016.7797369\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a pipelined fast Fourier transform (FFT) processor consisting of radix-2, 3 and 5 for prime-sized discrete Fourier transform (DFT). The FFT processor does not require memory storing the twiddle factors or complex multiplications. It is adaptable for 34 kinds of the FFT length with a trivial multiplications and multiplexing of data in the LTE uplink. The proposed architecture reduces hardware complexity 32 %, and shows 737 Mbps throughput.\",\"PeriodicalId\":193736,\"journal\":{\"name\":\"2016 IEEE International Symposium on Consumer Electronics (ISCE)\",\"volume\":\"4 31\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Symposium on Consumer Electronics (ISCE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCE.2016.7797369\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Symposium on Consumer Electronics (ISCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCE.2016.7797369","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

针对素数离散傅里叶变换(DFT)，提出了一种由基数2、3和5组成的流水线式快速傅里叶变换(FFT)处理器。FFT处理器不需要内存来存储旋转因子或复杂的乘法。它适用于34种FFT长度，在LTE上行链路中具有少量的数据乘法和复用。该架构降低了32%的硬件复杂度，吞吐量达到737mbps。

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

查看原文本刊更多论文

A mixed-radix pipeline FFT processor with trivial multiplications for LTE uplink

This paper presents a pipelined fast Fourier transform (FFT) processor consisting of radix-2, 3 and 5 for prime-sized discrete Fourier transform (DFT). The FFT processor does not require memory storing the twiddle factors or complex multiplications. It is adaptable for 34 kinds of the FFT length with a trivial multiplications and multiplexing of data in the LTE uplink. The proposed architecture reduces hardware complexity 32 %, and shows 737 Mbps throughput.

求助全文

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

来源期刊

2016 IEEE International Symposium on Consumer Electronics (ISCE)

自引率

0.00%

发文量