中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/9620
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 67783/67783 (100%)
Visitors : 23077636      Online Users : 373
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


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


    Title: 正交多工正交振幅調變之快速傅力葉轉換實現;FFT Realization of OMOAM Signals
    Authors: 王錦華;Jin-Hua Wang
    Contributors: 電機工程研究所
    Keywords: 正交分頻多工;快速傅力葉轉換;正交多工正交振幅調變;OMOAM;FFT;IFFT;OFDM
    Date: 2003-06-05
    Issue Date: 2009-09-22 11:51:56 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 本論文擬對一新型調變家族—正交多工正交振幅調變訊號[10]在數位傳輸實現上做一探究。此一調變家族既使在不同時限(time-limited)基底建構下,仍可將正交多工正交振幅調變訊號表示為一系列相同頻率間隔、相互正交之子載波,經由對應資料振幅調變的形式。這樣的結果便可類比於正交分頻多工(Orthogonal Frequency-Division Multiplexing)的調變方式,因而藉此引進離散反傅力葉轉換(Inverse Discrete Fourier Transform)來完成基頻數位調變,並訴諸快速傅力葉轉換演算法來降低運算複雜度。使用上述方法實現的正交多工正交振幅調變,送入快速傅力葉轉換的輸入資料在某些基底不全選擇的情況中有許多數值為零的資料。因此可在基數-2之快速傅力葉演算法中加入檢查機制,進一步節省運算量。論文並探討在不同基底、不同參數選擇的調變下所能減少的運算複雜度,且推論各參數調整與所能節省複雜度之間的趨勢關係。 A digital realization of a novel modulation family called orthogonally multiplexed orthogonally amplitude-modulated (OMOAM) signals [10] is investigated in this thesis. Even if can be constructed by different time-limited basis sets, OMOAM signals can be represented by data-amplitude-modulated subcarriers which have equal frequency spacing and are orthogonal to each other. This result is analogous with the modulation scheme of the orthogonal frequency-division multiplexing. Therefore, the inverse discrete Fourier transform is applied to process digital baseband modulation and can be implemented by the IFFT algorithm to reduce computational complexity. Realized as mention above, OMOAM feeds many zero-valued data into IFFT in some cases when not all of the bases are chosen. Consequently, a checking mechanism can be involved in the radix-2 FFT algorithm to reduce computational complexity more. The amount of reduced complexity is discussed when OMOAM signals are constructed in different basis sets with different parameters. And the performance trend related to each parameter is inferred.
    Appears in Collections:[Graduate Institute of Electrical Engineering] Electronic Thesis & Dissertation

    Files in This Item:

    File SizeFormat
    0KbUnknown451View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明