Probability-based static scaling optimization for fixed wordlength fft processors

NCUIR > administration > Office of Secretariat > journal & Dissertation > Item 987654321/104792

Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/104792

Title:	Probability-based static scaling optimization for fixed wordlength fft processors
Authors:	周景揚;Lin), 林步青(Bu-Ching;Shih), 石銘恩(Ming-En;Huang), 黃俊達(Juinn-Dar;Jou), 周景揚(Jing-Yang
Contributors:	秘書室
Keywords:	Algorithmics. Computability. Computer arithmetics;Algorithms;Applied sciences;Coding, codes;Computer science;control theory;systems;Decisions;Electronics;Exact sciences and technology;Format;Information, signal and communications theory;Integrated circuits;Integrated circuits by function (including memories and processors);Logic;Mathematical models;Optimization;Processors;Radiocommunications;Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices;Signal and communications theory;Telecommunications;Telecommunications and information theory;Theoretical computing;Wireless communication
Date:	2014-01-01
Issue Date:	2026-04-23 11:58:13 (UTC+8)
Publisher:	Institute of Information Science;Taipei: 社團法人中華民國計算語言學學會
Abstract:	摘要： The FFT processor serves as one of core components in numerous DSP-based systems, such as OFDM in modern wireless communication. While creating an FFT processor, key parameters, such as architecture, wordlength, and number format, must be all considered very carefully. In this paper, we propose an optimization flow that properly scales fixed-point numeric values at each butterfly stage to maximize the output SQNR under a fixed wordlength constraint. The proposed flow utilizes probability distribution to model the probabilistic behavior of the output signal at each stage. The computation errors due to quantization and saturation operations are statically analyzed before making scaling decisions. Therefore, without a need of time-consuming simulation, our method can efficiently determine the most appropriate number format for each stage and thus optimize the overall output SQNR. Besides, the proposed flow is capable of handling various FFT sizes, FFT algorithms, wordlengths, and input signal distributions. Experimental results indicate that the wordlength can be reduced about three bits for an 8K-point radix-2 memory-based FFT processor without compromise in the output SQNR. Furthermore, the FFT processor created using our static scaling optimization technique can produce a comparable output quality as the one equipped with an extra dynamic number scaling unit, which requires significantly more hardware logic. 出版者： Taipei: 社團法人中華民國計算語言學學會出版日期： 2014-07-01 出處： Journal of Information Science and Engineering, 2014-07, Vol.30 (4), p.991-1014 資源來源： Airiti Library (AL) 版權： 2015 INIST-CNRS 識別號： ISSN: 1016-2364 識別號： DOI: 10.6688/JISE.2014.30.4.4
Appears in Collections:	[Office of Secretariat] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	40	View/Open

社群 sharing

Loading...