English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14284644      Online Users : 61
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU 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
    National Tsing Hua University Institutional Repository > 研究中心 > 電腦與通訊科技研發中心 > 技術報告 >  Low-complexity branch metric calculation for space-time trellis decoding


    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/13162


    Title: Low-complexity branch metric calculation for space-time trellis decoding
    Authors: Kia-Ting Shr
    Yuan-Hao Huang
    教師: 黃元豪
    Date: 2007
    Publisher: Institute of Electrical and Electronics Engineers Inc.
    Relation: Communications, 2007. APCC 2007. Asia-Pacific Conference on
    18-20 Oct. 2007 Page(s):73 - 76
    Keywords: low-complexity
    space-time trellis codes
    viterbi algorithm
    STTC
    Abstract: Viterbi algorithm is the basic technique for space-time trellis codes (STTC) decoding. The received information affected by the channel impairments can be corrected by the path record determined by accumulating the branch metrics in the state transitions. However, the computation complexity of the branch metric accumulation in STTC Vitebri decoding is extremely high in spite of the well error-correction capacity. Moreover, the computational complexity also increases significantly if the number of antennas and the order of modulation increase. To reduce the computational burden, we propose a new method to compute the branch metrics in the geometric view. The degree of complexity reduction is very impressive at sacrifice of a little degradation of coding gain. Furthermore, more complexity reduction can be achieved when more antennas and higher order of modulation are applied.
    Relation Link: http://ieeexplore.ieee.org/Xplore/dynhome.jsp
    URI: http://nthur.lib.nthu.edu.tw/handle/987654321/13162
    Appears in Collections:[電腦與通訊科技研發中心] 技術報告
    [通訊工程研究所] 會議論文
    [積體電路設計技術研發中心] 會議論文

    Files in This Item:

    File Description SizeFormat
    2030134030002.pdf2157KbAdobe PDF1022View/Open


    在NTHUR中所有的資料項目都受到原著作權保護,僅提供學術研究及教育使用,敬請尊重著作權人之權益。若須利用於商業或營利,請先取得著作權人授權。
    若發現本網站收錄之內容有侵害著作權人權益之情事,請權利人通知本網站管理者(smluo@lib.nthu.edu.tw),管理者將立即採取移除該內容等補救措施。

    SFX Query

    與系統管理員聯絡

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback