研究生: |
彭聖揚 Peng, Sheng-Yang |
---|---|
論文名稱: |
適用於3GPP-LTE資源區塊排列之低耗能128~2048/1536點部分快速傅立葉轉換器 Energy-Efficient 128~2048/1536-point partial FFT processor with resource-block permutation for 3GPP-LTE |
指導教授: |
黃元豪
Huang, Yuan-Hao |
口試委員: | |
學位類別: |
碩士 Master |
系所名稱: |
電機資訊學院 - 通訊工程研究所 Communications Engineering |
論文出版年: | 2010 |
畢業學年度: | 98 |
語文別: | 英文 |
論文頁數: | 89 |
中文關鍵詞: | 快速傅立葉轉換器 、資源區塊分配 、3GPP-LTE |
外文關鍵詞: | FFT processor, resource block allocation, cached-memory FFT |
相關次數: | 點閱:2 下載:0 |
分享至: |
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
在現代行動通訊系統中採用了所謂正交分頻多工擷取(OFDMA)的技術。在一個OFDMA的系統中,次載波被分成多個資源區塊(resource block)且分配給多個使用者使用,根據第三代合作夥伴計劃-長期演進技術(3GPP-LTE)的規格當中,一個resource block單位內有12個次載波,對於使用者只會使用到一個OFDM symbol中的部份次載波,所以我們不需要把完整的OFDM符元(symbol)計算出來,假如能根據使用者所分配到的resource block,把對應的載波計算出來,則將能有效率地減少功率的消耗與運算的時間。在本研究當中,我們提出一套能根據不同resource block的使用方式。此外我們發現在3GPP TS36.213的規格中所定義的resource block的分配方式也是相同的原理。所以我們設計一個以記憶體為基礎的快速傅立葉轉換處理器(cached-memory-based FFT),只運算分配給使用者需要的部份。根據處理器的特性,設計出對應的演算法,會根據不同的分配方式來調整。依據3GPP-LTE的規格,我們設計了一個可以支援128點到2048點的快速傅立葉轉換處理器,其中特別的地方是FFT為1536點的運算,不同於一般的FFT點數為2的冪次方,在1536點內需要做radix-3 butterfly的處理,因此我們採用了一個處理運算元(processing element)以butterfly為radix-22的架構下,加入控制使得可以支援radix-3 butterfly的運算。而twiddle factor乘法器佔據了全部butterfly運算中很大的運算比例,所以為了降低功率的消耗,我們採用了一個能根據FFT運算中信號的動態範圍和使用之不同constellation跟FFT點數做調整之功率可感知的乘法器。此外,我們採用Block-floating point 的架構來增進cached-FFT處理器的SQNR(signal-to-quantization-noise-ratio),使得整體的性能提升。最後,我們使用TSMC 18的技術實現硬體實作。根據設計的cached-FFT處理器,最多可以降低功率消耗到原先完整FFT運算的64.38%。
In communication systems with the orthogonal frequency division access (OFDMA) technology, multiple users can share the same bandwidth offered by only one base station, which means the resource allocation technique is highly emphasized. Since each user allocates partial bandwidth, power consumption can be reduced by performing partial fast Fourier transform (FFT). In this work, we proposed the algorithm of resource block allocation technique. According to the proposed algorithm, we designed a low-cost and low-power FFT structure based on cached memory; besides, a scalable and power-aware processing element was adopted for twiddle factor multiplication. The proposed butterfly processor can support the radix-3 operation in order to perform 1536-point FFT in the mode 5 of the 3GPP long term
evolution (3GPP-LTE) standard. Moreover, the block-floating point (BFP) algorithm was applied to acquire better signal-to-quantization-noise ratio (SQNR). Since the energy dissipation is correlated with operational cycles, we proposed a reconfigurable architecture of the FFT processor which is capable of reducing operational cycles by switching controlling circuits depending on different conditions. Finally, the cached-FFT processor was implemented with TSMC 0.18um 1P6M CMOS technology, and the measurement of energy dissipation ranged from 1.23 to
4.24nJ per FFT point.
[1] T. Chiueh and P. Tsai, OFMA Baseband Receiver Design for Wireless Communi-cations. Wiley, 2007.
[2] S. He and M. Torkelson, “Designing pipeline fft processor for ofdm (de)modulation,"in Signals, Systems, and Electronics, 1998. ISSSE 98. 1998 URSI International Symposium on, Sep-2 Oct 1998, pp. 257–262
[3] S. Lee and S.-C. Park, “Modified sdf architecture for mixed dif/dit fft,”in Communication Technology, 2006. ICCT ’06. International Conerence on, Nov. 2006, pp. 1–5
[4] C.-P. Fan, M.-S. Lee, and G.-A. Su, “A low multiplier and multiplication costs 256-point fft implementation with simplified radix-24 sdf architecture,”in Circuits and Systems, 2006. APCCAS 2006. IEEE Asia Pacific Conference on, Dec. 2006, pp. 1935–1938
[5] Y.-W. Lin, H.-Y. Liu, and C.-Y. Lee, “A 1-gs/s fft/ifft processor for uwb applications," Solid-State Circuits, IEEE Journal of, vol. 40, no. 8, pp. 1726–1735, Aug 2005.
[6] B. Jo and M. Sunwoo, “New continuous-flow mixed-radix (cfmr) fft processor using novel in-place strategy," Circuits and Systems I: Regular Papers, IEEE Transac-
tions on, vol. 52, no. 5, pp. 911–919, May 2005
[7] J.-C. Kuo, C.-H. Wen, and A.-Y. Wu, “Implementation of a programable 64 2048-point fft/ifft processor for ofdm-based communication systems,” in Circuits and Systems, 2003. ISCAS ’03. Proceedings of the 2003 Internatonal Symposium on, vol. 2, May 2003, pp. II–121–II–124 vol
[8] B. Baas, “A low-power, high-performance, 1024-point fft proessor," Solid-State Circuits, IEEE Journal of, vol. 34, no. 3, pp. 380–387, Mar 1999
[9] C.-M. Chen, “Channel-aware low-power FFT processor for 3GPP-LTE OFDMA transmission,” Master’s thesis, National Tsing Hua University, Taii, Taiwan,2008.
[10] C.-M. Chen and Y.-H. Huang, “Partial cached-FFT algorithm for OFDMA communications,” in TENCON 2007 - 2007 IEEE Region 10 Conference, 30 2007-Nov.2 2007, pp. 1–4
[11] H. Sorensen and C. Burrus, “Efficient computation of the dft with only a subset of input or output points," Signal Processing, IEEE Transactions on, vol. 41, no. 3,
pp. 1184–1200, Mar 1993
[12] S. He and M. Torkelson, “Computing partial dft for comb specrum evaluation," Signal Processing Letters, IEEE, vol. 3, no. 6, pp. 173–175, Jun 1996
[13] B. Baas, “A generalized cached-fft algorithm," in Acoustics, Speech, and Signal Processing, 2005.Proceedings. (ICASSP '05). IEEE Interntional Conference on,vol. 5, March 2005, pp. v/89–v/92 Vol. 5
[14] Physical Layer Aspects for Evolved UTRA (release 7), 3rd Generation PartnershipProject (3GPP) TR 25.814 v.1.5.
[15] D. Elam and C. Lovescu, “A Block Floating Point Implementation for an N-point FFT on the TMS320C55X DSP,”in Application report of Texas Instruments, Sep.2003.
[16] J. W. Cooley and J. W. Tukey, “An algorithm for the machine calclation of complex fourier series," Mathematics of Computation, vol. 19, no. 90, pp. 297–301,1965.[Online]. Available: http://www.jstor.org/stable/2003354
[17] Evolved Universal Terrestrial Radio Access (E-UTRA); Physical layer procedures(release 8), 3rd Generation Partnership Project (3GPP) TS 36.213 v.8.5.0.
[18] Evolved Universal Terrestrial Radio Access (E-UTRA); Physical Channels and Modulation (release 8), 3rd Generation Partnership Project (3GPP) TS 36.211 v.8.3.0.
[19] M. Bhardwaj, R. Min, and A. Chandrakasan, “Quantifying and nhancing power awareness of vlsi systems," Very Large Scale Integration (VLSI) Systems, IEEE
Transactions on, vol. 9, no. 6, pp. 757–772, Dec 2001
[20] Y.-W. Lin, H.-Y. Liu, and C.-Y. Lee, “A dynamic scaling fft processr for dvb-t applications," Solid-State Circuits, IEEE Journal of, vol. 39, no. 11, pp. 2005–2013
Nov. 2004.
[20] Y.-W. Lin, H.-Y. Liu, and C.-Y. Lee, “A dynamic scaling fft processor for dvb-t applications,” Solid-State Circuits, IEEE Journal of, vol. 39, no. 11, pp. 2005–2013 Nov. 2004.
[21] T. Yu, C. Zhan, Y. Cho, C. Yu, and A. Wu, “Efficient Fast Fourier Transform Processor Design for DVB-H System,” in Proc. of 18-th VLSI/CAD Symposium 2007, Aug. 2007.
[22] J. Kuo, C.Wen, C. Lin, and A.Wu, “VLSI Design of A Variable-Length FFT/IFFT Processor for OFDM-Based Communication Systems,” EURASIP J. Appl. Signal Process., vol. 2003, pp. 1306–1316, 2003