首页> 外文会议>Vehicular Technology Conference (VTC Spring), 2012 IEEE 75th >M-PSK Codebook Based Clustered MIMO-OFDM SDMA with Efficient Codebook Search
【24h】

M-PSK Codebook Based Clustered MIMO-OFDM SDMA with Efficient Codebook Search

机译:基于M-PSK码本的高效码本搜索集群MIMO-OFDM SDMA

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we consider a channel quantization problem that selects the best codeword representing a group of consecutive subcarriers (cluster) in multiuser MIMO-OFDM systems. The clustering is required to reduce the amount of feedback information in practical OFDM systems. Based on $M$-PSK based codebooks, we propose a new codeword search algorithm for the clustered MIMO-OFDM with complexity of O(2^{N_T}) compared to the complexity of O(M^{N_T}) for conventional exhaustive search, where $N_T$ denotes the number of transmit antennas. Through simulations, the proposed clustered codeword selection scheme for the multiuser MIMO-OFDM shows up to 54% performance improvement in throughput compared with the conventional MIMO-OFDM system that performs the channel quantization only on predetermined pilot subcarriers.
机译:在本文中,我们考虑了一种信道量化问题,该问题会在多用户MIMO-OFDM系统中选择代表一组连续子载波(群集)的最佳码字。需要群集以减少实际OFDM系统中的反馈信息量。基于基于$ M $ -PSK的码本,与传统穷举算法的O(M ^ {N_T})复杂度相比,我们提出了一种新的针对MIMO-OFDM的码字搜索算法,其复杂度为O(2 ^ {N_T})搜索,其中$ N_T $表示发射天线的数量。通过仿真,与仅在预定导频子载波上执行信道量化的传统MIMO-OFDM系统相比,针对多用户MIMO-OFDM提出的群集码字选择方案在吞吐量上可提高多达54%的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号