{"title":"Systolic Variable Length Architecture for Discrete Fourier Transform in Long Term Evolution","authors":"C. V. Niras, Vinu Thomas","doi":"10.1109/ISED.2012.47","DOIUrl":null,"url":null,"abstract":"A novel design for the implementation of the 2M x 3P x 5Q point Discrete Fourier Transform (DFT) computation for Single Carrier-Frequency Division Multiple Access (SC-FDMA) systems as defined by the Long Term Evolution standard is proposed. The design is based on the Systolic Architecture. The decomposition of the DFT computation into factors of two, three, four and five is implemented by a recursive invocation of the Cooley-Tukey Algorithm, with the individual DFTs within each Cooley Tukey iteration implemented using the Winograd Fourier Transform Algorithm (WFTA). The proposed architecture is superior to the Intellectual Property (IP) cores proposed by Xilinx R in that the clock frequency requirements are reduced by a factor of up to 5.2 (approx), resulting in significant savings in the total power dissipation.","PeriodicalId":276803,"journal":{"name":"2012 International Symposium on Electronic System Design (ISED)","volume":"225 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Symposium on Electronic System Design (ISED)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISED.2012.47","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
A novel design for the implementation of the 2M x 3P x 5Q point Discrete Fourier Transform (DFT) computation for Single Carrier-Frequency Division Multiple Access (SC-FDMA) systems as defined by the Long Term Evolution standard is proposed. The design is based on the Systolic Architecture. The decomposition of the DFT computation into factors of two, three, four and five is implemented by a recursive invocation of the Cooley-Tukey Algorithm, with the individual DFTs within each Cooley Tukey iteration implemented using the Winograd Fourier Transform Algorithm (WFTA). The proposed architecture is superior to the Intellectual Property (IP) cores proposed by Xilinx R in that the clock frequency requirements are reduced by a factor of up to 5.2 (approx), resulting in significant savings in the total power dissipation.