請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/30638完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 吳安宇(An-Yeu Wu) | |
| dc.contributor.author | YU-JU CHO | en |
| dc.contributor.author | 卓余儒 | zh_TW |
| dc.date.accessioned | 2021-06-13T02:10:55Z | - |
| dc.date.available | 2010-09-27 | |
| dc.date.copyright | 2007-07-03 | |
| dc.date.issued | 2007 | |
| dc.date.submitted | 2007-06-25 | |
| dc.identifier.citation | [1] ETSI, “Digital Video Broadcasting (DVB); Transmission System for Handheld Terminals (DVB-H),” EN 302 304 V1.1.1, Jun. 2004.
[2] ETSI, “Digital Video Broadcasting (DVB); Framing structure, channel coding, and modulation for digital terrestrial television,” EN 300 744 V1.5.1, Jun. 2004. [3] ETSI, “Digital Video Broadcasting (DVB); Specification for Service Information (SI) in DVB systems,” EN 300 468 V1.6.1, Jun. 2004. [4] ETSI, “Digital Video Broadcasting (DVB); DVB specification for data broadcasting,” EN 301 192 V1.4.1, Jun. 2004. [5] ETSI: “Digital Video Broadcasting (DVB); DVB mega-frame for Single Frequency Network (SFN) synchronization,” TS 101 191 V1.4.1, Jun. 2004. [6] W. Y. Zou and Y.-Y. Wu, “COFDM: An Overview,” IEEE Trans. on Broadcast., vol.41, pp.1-8, Mar. 1995. [7] C. Herrero, and P. Vuorimaa, “Delivery of digital television to handheld devices,” in IEEE Int. Symp. on Wireless Commun. Syst., pp.240-244, Sept. 2004. [8] M. Kornfeld, “DVB-H - the emerging standard for mobile data communication,” in IEEE Int. Symp. on Consum. Electron., pp.193-198, Sept. 2004. [9] J. W. Cooley and J. W. Tukey, “An Algorithm for Machine Computation of Complex Fourier Series,” Mathematics of Computation, vol.19, pp.297-301, April 1965. [10] W.-C. Yeh and C.-W. Jen, “High-Speed and Low-Power Split-Radix FFT,” IEEE Trans. on Signal Process., vol.51, pp. 864-874, March 2003. [11] S. Bouguezel, M. O. Ahmad and M.N.S. Swamy, “An efficient split-radix FFT algorithm,” in Proc. IEEE Int. Symp. on Circuits and Syst., vol.4, pp. IV-65 - IV-68, May 2003 [12] W. Li and L. Wanhammar, “A Pipeline FFT Processor,” in IEEE Workshop on Signal Process. Syst., pp. 654-662, 1999. [13] S. He and M. Torkelson, “A new approach to pipeline FFT processor,” in Proc. of Int. Parallel Process. Symp., pp.766-770, April 1996. [14] B.M. Baas, “A Low-Power High-Performance, 1024-Point FFT Processor,” IEEE J. of Solid-State Circuits, vol.34, no.3, pp.380-387, Mar 1999. [15] R. N. Bracewell, The Fourier Transform and Its Applications, 2nd ed. New York: McGraw-Hill, 1986. [16] G.L. DeMuth, “Algorithms for defining mixed radix FFT flow graphs,” IEEE Trans. on Acoust., Speech, and Signal Process., vol.37, pp.1349-1358, Sept. 1989. [17] B.G. Jo, M.H. Sunwoo, “New continuous-flow mixed-radix (CFMR) FFT Processor using novel in-place strategy,” IEEE Trans. on Circuits Syst., vol.52, pp. 911-919, May 2005. [18] E.H. Wold, A.M. Despain, “Pipelined and parallel-pipeline FFT processors for VLSI Implementation,” IEEE Trans. on Comput., pp.414-426, May 1984. [19] L.R. Rabiner, B. Gold, Theory and Application of Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, Inc., 1975. [20] S. He and M. Torkelson, “Designing pipeline FFT processor for OFDM (de)modulation,” in Proc. of Int. Symp. on Signal, Systems, and Electronics, pp.256-262, 1998. [21] H.-F. Lo, M.-D. Shieh, C.-M. Wu, ”Design of an efficient FFT processor for DAB system,” in Proc. IEEE Int. Symp. on Circuits and Syst., vol.4, pp.654-657, May 2001. [22] E. Bidet, D. Castelain, C. Joanblanq, P. Senn, “A fast single-chip implementation of 8192 complex point FFT,” IEEE J. of Solid-State Circuits, vol.30, pp.300-305, March 1995. [23] S. Saponara, L. Serafini, L. Fanucci, “Low-Power FFT/IFFT VLSI Macro Cell for Scalable Broadband VDSL Modem,” in Proc. IEEE Int. Workshop on System-on-Chip for Real-Time Applications, pp.161-166, Jun. 2003. [24] Y. Chen, Y.-W. Lin, and C.-Y. Lee, “A Block Scaling FFT/IFFT Processor for WiMAX Applications,” in Proc. IEEE Asian Solid-State Circuits Conf., pp.203-206, Nov. 2006. [25] L. G. Johnson, ”Conflict free memory addressing for dedicated FFT hardware,” IEEE Tran. Circuits Syst., vol.39, pp.312-316, May 1992. [26] R. B. Perlow and T. C. Denk, ” Finite Word-length for VLSI FFT Processors,” in Proc. IEEE Asilomar Conf. on Signals, Systems and Computers, vol.2, pp.1227-1231, Nov. 2001. [27] Y.-W. Lin, H.-Y. Liu, and C.-Y. Lee, “A Dynamic Scaling FFT Processor for DVB-T Applications,” IEEE J. of Solid-State Circuits, vol.39, no.11, pp.2005-2013, Nov. 2004. [28] L.Jia, Y.Gao, J. Isoaho, and H. Tenhunen, “A New VLSI-Oriented FFT Algorithm and Implementation,” in Proc. IEEE Int. ASIC Conf., pp.337-341, Sep. 1998. [29] J.-C. Kuo, C.-H. Wen, C.-H. Lin, and A.-Y. Wu, “VLSI Design of a Variable-Length FFT/IFFT Processor for OFDM-Based Communication Systems,” EURASIP J. on Applied Signal Process., vol.2003, no.13, pp.1306-1316, Dec. 2003. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/30638 | - |
| dc.description.abstract | 快速傅利葉轉換被廣泛運用在正交分頻多工通訊系統中,如手持式數位視訊廣播(Digital Video Broadcasting for Handheld terminals, DVB-H)系統等,作為解調變的核心。在手持式數位視訊廣播系統中需要低功率及可運算三種長度的快速傅利葉轉換處理器。
在本篇論文中,首先,我們提出一個適用於手持式數位視訊廣播系統的快速傅利葉轉換處理器,我們使用一種乒乓式(ping-pong)記憶體階層式架構,以降低存取主記憶體的次數,並可在減低最大功率的前提下,增加最少的快取記憶體,達到降低總功率消耗,並配合關閉不需使用的記憶體單元,以減低在不同傅利葉轉換長度時,不必要的記憶體功率消耗。 此外,我們設計出一個位址產生器,可提供處理三種長度傅利葉轉換計算所需存取的所有記憶單元的位址,並使用交錯(Interleaving)位址來處理主記憶體及快取記憶體會遭遇到的資料衝突。 接著,我們提出有效係數設計方法,透過共用(Sharing)及內插後共用(Interpolation-then-Sharing)係數的方式,在可損失的信號對量化雜訊比(Signal-to-Quantized-Noise Ratio, SQNR)範圍內,有效降低所需係數的面積。以此方法可有效降低我們67%的係數儲存單元面積,而在做8192點快速傅利葉運算時,SQNR只損失0.6dB。 在本論文的最後,我們使用TSMC 0.18μm製程實現了一個符合手持式數位視訊廣播系統的快速傅利葉轉換處理器的超大型積體電路(VLSI)設計實例,晶片核面積為1.886×1.886mm2,最高工作頻率為86MHz,能在805μs內運算完8192點,其功率消耗為75.31mW;在運算符合DVB-H系統所需的8192、4096、2048點傅利葉轉換的工作頻率分別為79MHz、75MHz與71MHz,功率消耗分別為67.01mW、53.16mW與39.45mW。 | zh_TW |
| dc.description.abstract | Fast Fourier transform (FFT) is widely adopted as the demodulation kernel in the OFDM systems such as Digital Video Broadcasting – transmission system for Handheld terminals (DVB-H) system, etc. In the DVB-H system, a low power and variable-length FFT processor is required.
In this thesis, we firstly propose an FFT processor that reduces the power consumption by exploiting the ping-pong cached-memory architecture to decrease the access to main memory, and timely turning off the unused memory partitions to save energy in different sizes of the FFT. Second, we design the triple-mode address generator to handle the address mapping of all storages in the three-size of FFT computations, and it includes the interleaving method to avoid data conflicts. Then we propose two cost-efficient twiddle-factor coefficient design methods, “Sharing” and “Interpolation-then-Sharing”, to reduce the area of coefficient storages within the allowable loss of Signal-to-Quantized-Noise Ratio (SQNR). By using these methods, the area occupied by coefficient storage can be reduced by 67%. In 8192-point FFT, these modifications only cause 0.6dB loss of SQNR. In the end of this thesis, we implement our proposed FFT processor for DVB-H system with TSMC 0.18μm 1P6M CMOS technology. The core size is 1.886×1.886mm2. The minimum latency to operate 8192-point FFT is 805μs with 86MHz clock rate. And the power consumption is 75.51mW. For DVB-H system, it processes the 8192, 4096, and 2048-point FFT with clock rates of 79MHz, 75MHz, and 71MHz, and consumes of 67.01mW, 53.16mW, and 39.45mW, respectively. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-13T02:10:55Z (GMT). No. of bitstreams: 1 ntu-96-R92943104-1.pdf: 4128657 bytes, checksum: edf1ab04c99efc6967eba9fe0e2d3f5a (MD5) Previous issue date: 2007 | en |
| dc.description.tableofcontents | Abstract v
Contents vii List of Figures xi List of Tables xv CHAPTER 1 INTRODUCTION 1 1.1 DVB-Handheld (DVB-H) System Overview 1 1.1.1. FFT/IFFT in DVB-H System 4 1.2 Motivation and Goal 6 1.3 Organization of the Thesis 8 CHAPTER 2 REVIEW OF FFT ALGORITHM AND ARCHITECTURE 9 2.1 FFT Algorithm 9 2.1.1. Radix-r FFT Algorithm 10 2.1.2. Mixed-radix FFT Algorithm 12 2.1.3. Split-radix FFT Algorithm 12 2.1.4. Summary 13 2.2 FFT Architecture 13 2.2.1. Pipelined Architectures 14 2.2.2. Array-based FFT Architecture 16 2.2.3. Memory-based FFT Architectures 17 2.2.4. Cached-memory Architecture 19 2.2.4.1. Cached-FFT Algorithm 20 2.2.5. Comparison 26 2.3 Summary 27 CHAPTER 3 PROPOSED FFT PROCESSOR DESIGN 29 3.1 Architectural Design 29 3.2 Algorithmic Design 33 3.3 Fixed-point Simulation 37 3.4 Hardware Design 40 3.4.1. Address Generator 40 3.4.2. Processing Element 47 3.4.3. Storage Partition Design 49 3.4.4. Control Unit 51 3.5 Summary 52 CHAPTER 4 PROPOSED COST-EFFICIENT TWIDDLE-FACTOR COEFFICIENT DESIGN 55 4.1 Review of Twiddle-factor Coefficient Design 55 4.2 Proposed Cost-efficient Twiddle-factor Coefficient Design 57 4.3.1. Algorithmic Design 57 4.3.2. Hardware Design 62 4.3 Simulation Results 63 4.4.1. Fixed-point Simulation 63 4.4.2. Simulations of Area and Power Consumption 72 4.4 Discussion 75 4.5 Summary 75 CHAPTER 5 VLSI IMPLEMENTATION 77 5.1 Chip Block Diagram 77 5.2 IC Design Flow 79 5.3 Chip Summary 81 5.4 Comparison 82 CHAPTER 6 CONCLUSION AND FUTURE WORK 85 BIBLIOGRAPHY 87 | |
| dc.language.iso | en | |
| dc.subject | 旋轉因子 | zh_TW |
| dc.subject | 快速傅利葉轉換 | zh_TW |
| dc.subject | 手持式數位視訊廣播 | zh_TW |
| dc.subject | FFT | en |
| dc.subject | Twiddle factor | en |
| dc.subject | DVB-H | en |
| dc.title | 適用於手持式數位視訊廣播系統之快速傅利葉轉換處理器設計 | zh_TW |
| dc.title | Design of a Fast Fourier Transform Processor for DVB-Handheld System | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 95-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 曹恆偉(Hen-Wai Tsao),盧奕璋(Yi-Chang Lu) | |
| dc.subject.keyword | 快速傅利葉轉換,手持式數位視訊廣播,旋轉因子, | zh_TW |
| dc.subject.keyword | FFT,DVB-H,Twiddle factor, | en |
| dc.relation.page | 88 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2007-06-26 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 電子工程學研究所 | zh_TW |
| 顯示於系所單位: | 電子工程學研究所 | |
文件中的檔案:
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-96-1.pdf 未授權公開取用 | 4.03 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。
