成功大學博碩士論文系統

簡易檢索 / 詳目顯示

回結果列表

研究生：	許績耀 Hsu, Chi-Yao
論文名稱：	使用可重組化FPGA於OFDM中之2048點即時FFT設計 Design of 2048-point Real-Time FFT of OFDM by Using Reconfigurable FPGA
指導教授：	賴源泰 Lai, Yen-Tai
學位類別：	碩士 Master
系所名稱：	電機資訊學院 - 電機工程學系 Department of Electrical Engineering
論文出版年：	2004
畢業學年度：	92
語文別：	英文
論文頁數：	53
中文關鍵詞：	快速傅立葉轉換、可重組化
外文關鍵詞：	reconfigurable, FFT
相關次數：	點閱：64 下載：2
分享至:	分享至facebook 分享至twitter

查詢本校圖書館目錄查詢臺灣博碩士論文知識加值系統勘誤回報

　　可重組化架構的出現開啟了一個新的實現應用的選擇，但也產生了一些新的在設計上的挑戰。在動態可重組化架構中，針對任意應用來說，選擇一個有效率的架構及選擇一個適合的可重組化方案是項複雜的工作。
　　因可重組化架構多使用可重組化現場可程式邏輯閘陣列來實現應用，故本研究嚐試使用現場可程式邏輯閘陣列來實現快速傅立葉轉換。在處理一個框架的時間中，有數個區塊依序被運算於相同的硬體上。我們提出一個分析用方程式來計算實現快速傅立葉轉換所需的最小硬體資源，同時可利用它來選擇適合的可重組化方案。

　　The growing adoption of reconfigurable architectures opens new implementation alternatives and creates new design challenges. In the case of dynamically reconfigurable architectures, the choice of an efficient architecture and reconfiguration scheme for an application is a complex task.
　　Since reconfigurable architectures use reconfigurable FPGA to implement applications, the research tries to use reconfigurable FPGA to implement FFT. During a frame duration, several blocks are computed sequentially on the same hardware. We provide analysis equations to compute needed minimal resources and to choose adaptive
reconfiguration schemes for FFT.

CONTENTS
ABSTRACT
CONTENTS
LIST　OF　FIGURES
LIST　OF　TABLES
CHAPTER1　Introduction……………………………………………………………………………………………………………………………1
CHAPTER2　Overview　of　FFT at　OFDM………………………………………………………………………………………………………3
1　Introduction……………………………………………………………………………………………………………………………………3
2　Basic　Concepts　of　FFT　Algorithms………………………………………………………………………………………………………4
2.1　DIF　FFT　Algorithms………………………………………………………………………………………………………………………5
2.2　Symmetry　Property　of　Twiddle　Factors…………………………………………………………………………………………………8
3　Classification　of　FFT　Algorithms…………………………………………………………………………………………………………9
3.1　Fixed-Radix　FFT　Algorithms………………………………………………………………………………………………………………9
3.1.1　Radix-2　DIF　FFT　Algorithm…………………………………………………………………………………………………………10
3.1.2　Radix-4　DIF　FFT　Algorithm…………………………………………………………………………………………………………10
3.1.3　Radix-8　DIF　FFT　Algorithm…………………………………………………………………………………………………………11
3.2　Split-Radix　FFT　Algorithms………………………………………………………………………………………………………………12
3.2.1　Split-Radix　2/4　Algorithm………………………………………………………………………………………………………………12
3.2.2　Split-Radix　2/8　Algorithm………………………………………………………………………………………………………………14
4　Radix-2/4/8　FFT　Algorithm…………………………………………………………………………………………………………………15
5　OFDM　Background……………………………………………………………………………………………………………………………………17
5.1　Hardware　Sharing　of　FFT　and　IFFT…………………………………………………………………………………………………19
CHAPTER3　Architectures　And　Design　Process　of　FFT……………………………………………………………………………………21
1　Introduction……………………………………………………………………………………………………………………………………21
2　Pipeline-Based　FFT　Architectures……………………………………………………………………………………………………………21
2.1　Single-Path　Delay-Feedback　Pipeline　Architecture…………………………………………………………………………………23
2.2　Multi-Path　Delay-Commutator　Pipeline　Architecture…………………………………………………………………………………25
2.3　Comparison　of　Pipeline　Architectures…………………………………………………………………………………………………26
3　Design　Process　of　FFT……………………………………………………………………………………………………………………27
3.1　Processing　Element　of　Radix-2/4/8　FFT　Algorithm…………………………………………………………………………………27
3.2　Complex　Multiplications　in　Butterfly　PE……………………………………………………………………………………………32
3.3　Complex　Multiplications　outside　Butterfly　PE………………………………………………………………………………………33
CHAPTER4　Reconfigurable　Architecture　And　Analysis　Equations………………………………………………………………………35
1　Introduction……………………………………………………………………………………………………………………………………35
2　Type　of　Reconfiguration　and　Comparison　of　Different　Systems…………………………………………………………………36
4　Analysis　Equations……………………………………………………………………………………………………………………………39
CHAPTER5　Partition　Strategy　on　FFT…………………………………………………………………………………………………………43
1　ARDOISE　limits………………………………………………………………………………………………………………………………43
2　Real　Time　Constraint　of　FFT……………………………………………………………………………………………………………44
3　FFT　Application………………………………………………………………………………………………………………………………44
4　Partition　Strategy………………………………………………………………………………………………………………………………46
CHAPTER6　Conclusions……………………………………………………………………………………………………………………………………49
REFERENCES……………………………………………………………………………………………………………………………………………50
                                    

[1] Alan V. Oppenheim, Ronald W. Schafer,“Discrete-Time Signal Processing Second Edition.” Prentice-Hall International, Inc., 1999.

[2] A. M. Despain, “Fast Fourier transform using CORDIC iterations.” IEEE Trans.
Comput., Vol. C-23, No. 10 pp. 933-1001, Oct. 1974.

[3] Atmel Corporation, “AT40k 5k-50k Gates Coprocessor FPGA with FreeRAM.” 2002.

[4] Bingham J. A., “Multicarrier modulation for data transmission: an idea whose time
has come.” IEEE Commun. Mag., Vol. 28, No. 7, pp.5-14, May.1990.

[5] Baas B.M., “A low-power, high-performance 1024-point FFT processor.” IEEE
Journal of Solid-State Circuits, Vol. 34, No. 3, pp. 380-387, Mar. 1999.

[6] Bi G. and Jones. E. V., “A pipelined FFT processor for word-sequential data.” IEEE
Trans. on Acoustics, Speech and Signal Processing, Vol. 37, No. 12, pp. 1982-1985,
Dec. 1989.

[7] Bourguiba R., Demigny D. and Kessal L., “Dynamic configuration: a new paradigm
applicated to real time image analysis.” Microelectronics, 1998. ICM '98.
Proceedings of the 10th International Conference, pp. 25-28, 14-16 Dec. 1998.

[8] Cimini L. J., “Analysis and simulation of a digital mobile channel using orthogonal
frequency division multiplexing.”, IEEE Trans. Commun., Vol. 33, No. 7, pp. 665-675,
Jul. 1985.

[9] Cetin E., R.C.S. Morling and Kale Izzet, “An integrated 256-point complex FFT
processor for real-time spectrum analysis and measurement.” IEEE Proceedings of
Instrumentation and Measurement Technology Conference, Vol. 1, pp. 96-101,
Ottawa, Canada, 19-21 May 1997.

[10] Demigny D., Kessal L., Bourguiba R. and Boudouani N., “How to use high speed
reconfigurable FPGA for real time image processing.” Computer Architectures for
Machine Perception, 2000. Proceedings of 5th IEEE International Workshop, pp.
240-246, 11-13 Sept. 2000.

[11] El-bay Bourennane, Sophie Bouchoux, Johel M., Michel Paindavoine and S.
Bouillant, “Cost comparison of image rotation implantations on static and dynamic
reconfigurable FPGAs.” Acoustics, Speech, and Signal Processing, 2002.
Proceedings. (ICASSP '02). IEEE International Conference on, Vol. 3, pp. 3176-3179,
13-17 May 2002.

[12] E. Bidet Castelain, Joanblanq C. and Senn P., “A fast single -chip implementation of
8192 complex point FFT.” IEEE Journal of Solid-State Circuits, Vol. 30, No. 3, pp.
300-305, Mar. 1995.

[13] Gold Ben and Bially T., “Parallelism in fast Fourier transform hardware.” IEEE
Transactions on Audio and Electroacoustics, Vol. 21, No. 1, pp. 5-16, Feb. 1973.

[14] Garcia J., Michell J. A. and Buron A. M., “VLSI configurable delay commutator for
a pipeline split radix FFT architecture.” IEEE Trans on. Signal Processing, Vol. 47,
No. 11, pp. 3098-3107, Nov. 1999.

[15] Jung-yeol Oh, Jae-sang Cha, Seong-kweon Kim and Myoung-seob Lim,
“Implementation of orthogonal frequency multiplexing modem using radix-n pipeline
fast Fourier transform (FFT) processor.” Jpn. J. Appl. Phys. Vol. 42, part 1, No. 4B,
pp. 1-6, April 2003.

[16] Jung-yeol Oh and Myoung-seob Lim, “A radix-24 SDF pipeline FFT processor for
OFDM modulation.” Jpn. J. Appl. Phys. 2003.

[17] J. W. Cooley and J. W. Tukey, “An algorithm for machine computation of complex
Fourier series.” Math. Computation, Vol. 19, pp. 297-301, April 1965.

[18] Kessal L., Demigny D., Boudouani N. and Bourguiba R., “Reconfigurable hardware
for real time image processing.” Image Processing, 2000. IEEE Proceedings. 2000
International Conference, Vol. 3 , pp. 110 – 113, 10-13 Sept. 2000.

[19] Lihong Jia, Yonghong Gao, Jouni Isoaho and Hannu Tenhunen, “A new
VLSI-oriented FFT algorithm and implementation.” IEEE ASIC Conference 1998.
Proceedings of 11th Annual IEEE International, pp. 337-341, 13-16 Sept. 1998.

[20] Michael J. Wirthlin and Brad L. Hutchings, “Improving functional density using
run-time circuit reconfiguration.” IEEE Transactions on Very Large Scale Integration
(VLSI) Systems, Vol. 6, No. 2, pp. 247-256, June 1998.

[21] Mauricio Ayala-R., Rodrigo B. Nogueira, Carlos H. Llanos, Ricardo P. Jacobi and
Reiner W. Hartenstein, “Modeling a reconfigurable system for computing the FFT in
place via rewriting-logic.” IEEE Proceedings of the 16th Symposium on Integrated
Circuits and Systems Design (SBCCI’03), 2003.

[22] Pierre Duhamel, “Implementation of split-radix FFT algorithms for complex, real,
and real-symmetric data.” IEEE Transactions on Acoustics, Speech and Signal
Processing, Vol. ASSP-34, No. 2, April 1986.

[23] Riad Bourguiba, Didier Demigny, Mamoud Karabernoy and Lounis Kessal,
“Designing a new architecture for real time image analysis with dynamically
configurable FPGAs.” Proceedings IEEE – IMACS Computational Engineering in
Systems Applications, Nabeul Hammamet, Tunisia, IEEE Systems Man and
Cybernetics, pp. 739-743, May 1998.

[24] Richards Mark A., “On hardware implementation of the split-radix FFT.” IEEE
Transactions on Acoustics, Speech and Signal Proceeding, Vol. 36, No. 10, pp.
1575-1581, Oct. 1988.

[25] Shousheng He and Torkelson M., “A new approach to pipeline FFT processor.”
Parallel Processing Symposium, 1996, Proceedings of IPPS '96, The 10th International
IEEE, pp.766-770, 15-19 April 1996.

[26] Shousheng He and Torkelson M., “Design and implementation of a 1024-point
pipeline FFT processor.” IEEE Custom Integrated Circuits Conference, 1998,
Proceedings of IEEE 1998, pp. 131-134, 11-14 May 1998.

[27] Shousheng He and Torkelson M., “Designing Pipeline FFT Processor for OFDM
(de)Modulation.” Signals, Systems, and Electronics, 1998. ISSSE 98. IEEE URSI
International Symposium, pp. 257-262, 29 Sept.-2 Oct. 1998.

[28] Wen-Chang Yeh and Chein-Wei Jen, “High-speed and low-power split-radix FFT.”
IEEE Transactions on Signal Proceeding, Vol. 51, No. 3, pp. 864-874, March 2003.

[29] Yeong-Terng Lin, “Design and implementation of a variable-length FFT processor
for OFDM systems.” N.T.U., Master Thesis, June 2001.

校內：2005-07-12公開
校外：2005-07-12公開

簡易檢索 / 詳目顯示

相關論文