National Tsing Hua University Institutional Repository:Low-complexity branch metric calculation for space-time trellis decoding
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 54367/62174 (87%)
造访人次 : 14538313      在线人数 : 62
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    National Tsing Hua University Institutional Repository > 研究中心 > 電腦與通訊科技研發中心 > 技術報告 >  Low-complexity branch metric calculation for space-time trellis decoding


    题名: Low-complexity branch metric calculation for space-time trellis decoding
    作者: Kia-Ting Shr
    Yuan-Hao Huang
    教師: 黃元豪
    日期: 2007
    出版者: Institute of Electrical and Electronics Engineers Inc.
    關聯: Communications, 2007. APCC 2007. Asia-Pacific Conference on
    18-20 Oct. 2007 Page(s):73 - 76
    关键词: low-complexity
    space-time trellis codes
    viterbi algorithm
    摘要: 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.
    显示于类别:[電腦與通訊科技研發中心] 技術報告
    [通訊工程研究所] 會議論文
    [積體電路設計技術研發中心] 會議論文


    档案 描述 大小格式浏览次数
    2030134030002.pdf2157KbAdobe PDF1025检视/开启


    SFX Query


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