Advanced Search
Volume 33 Issue 12
Jan.  2012
Turn off MathJax
Article Contents
Lv Lei , Zhang Zhong-Pei. Low Complexity Codeword Search Algorithms Base on Subspace Distance[J]. Journal of Electronics & Information Technology, 2011, 33(12): 2990-2994. doi: 10.3724/SP.J.1146.2011.00627
Citation: Lv Lei , Zhang Zhong-Pei. Low Complexity Codeword Search Algorithms Base on Subspace Distance[J]. Journal of Electronics & Information Technology, 2011, 33(12): 2990-2994. doi: 10.3724/SP.J.1146.2011.00627

Low Complexity Codeword Search Algorithms Base on Subspace Distance

doi: 10.3724/SP.J.1146.2011.00627
  • Received Date: 2011-06-26
  • Rev Recd Date: 2011-09-14
  • Publish Date: 2011-12-19
  • Two subspace distance calculation algorithms are proposed for codeword search of limited feedback precoding multi-user MIMO systems. The equivalence of subspace distance and chordal distance are first proved, then the complexity of chordal distance calculation and proposed two subspace distance calculation algorithms are analyzed. Simulation results verify that subspace distance calculation algorithms cost fewer operations. Further more the proper one of two proposed algorithms can be chosen based on different hardware implementations and transmitting antenna numbers.
  • loading
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (2662) PDF downloads(938) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return