• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Communications >Recursive Construction of Minimum Euclidean Distance-Based Precoder for Arbitrary-Dimensional MIMO Systems
【24h】

Recursive Construction of Minimum Euclidean Distance-Based Precoder for Arbitrary-Dimensional MIMO Systems

机译：任意维MIMO系统基于最小欧氏距离的预编码器的递归构造

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The objective of maximizing the minimum Euclidean distance between two received data vectors via real-valued linear precoding is considered for multiple-input multiple-output (MIMO) systems with arbitrary dimensions. Assuming that perfect channel state information (CSI) is available at both the transmitter side and the receiver side, a novel low-complexity precoding algorithm is proposed to recursively construct the full-rank, the rank-deficient and the rank-one precoders with respect to particular channel realization. From the lattice theoretical perspective, the full-rank precoder is generated by using well-known dense packing lattices, which can also be recursively involved into the construction of higher-dimensional rank-deficient precoders. Moreover, the optimal solution is clearly figured out for the specific case of rank-one precoder. The closed-form expression of the achievable minimum distance is obtained and the analytical results reveal the performance bounds for different rank-constraint precoders. Simulation results validate the efficiency of the proposed precoder as compared with the state of the art.
机译：对于具有任意尺寸的多输入多输出（MIMO）系统，考虑了通过实值线性预编码最大化两个接收到的数据向量之间的最小欧几里得距离的目标。假设在发送方和接收方都可以使用完美的信道状态信息（CSI），则提出了一种新颖的低复杂度预编码算法，以递归方式构造全秩，秩不足和秩一的预编码器。特定渠道的实现。从晶格理论的角度来看，全秩预编码器是通过使用众所周知的密集堆积晶格生成的，也可以将其递归地包含在高维秩不足的预编码器的构造中。而且，对于秩预编码器的特定情况，清楚地找到了最佳解决方案。获得了可达到的最小距离的闭式表达式，分析结果揭示了不同秩约束预编码器的性能界限。与现有技术相比，仿真结果验证了所提出的预编码器的效率。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号