Throughput optimisation for energy harvesting transmitter with partial instantaneous channel state information and finite-alphabet inputs

Throughput optimisation for energy harvesting transmitter with partial instantaneous channel state information and finite-alphabet inputs
复制标题

具有部分瞬时信道状态信息和有限字母输入的能量收集发射机的吞吐量优化

DOI:
10.1049/iet-com.2015.0532
复制
发表时间:
2016-03
期刊:
影响因子:
1.6
通讯作者:
Chengshan Xiao
Chengshan Xiao
中科院分区:
计算机科学4区
文献类型:
--
作者:
Xiaodong Zhu;Weiliang Zeng;Chengshan Xiao

文献摘要

参考文献

被引文献

相似文献

具有能量收集器的无线通信系统由于其能够改善系统操作时间而吸引了很多关注。关于如何最大化多个时隙上的互信息的总和(即吞吐量)已经进行了广泛的研究。然而,大多数研究集中在具有高斯输入和单天线的能量收集发射机。本文研究了多输入多输出(MIMO)信道上具有因果能量约束的能量收集发射机的吞吐量最大化问题。与已有的研究不同,本文研究了有限字母输入和部分瞬时信道状态信息(CSI)的MIMO系统。具体地,发射机知道整个信道帧的统计CSI以及当前时隙的瞬时CSI。这种情况下的预编码器设计是关于多个预编码矩阵的棘手的优化问题。作者的分析表明,这个困难的预编码问题可以等价地转化为一组标量优化子问题的发射功率。为了解决这些子问题,提出了一种基于动态规划的有效算法。分析了算法的性能,仿真结果验证了算法的有效性.
Wireless communication systems with energy harvester are attracting much attention due to their ability to improve the system operation time. Extensive research has been carried out on how to maximise the sum of mutual information over multiple time slots (i.e. the throughput). However, most research focuses on the energy harvesting transmitter with Gaussian inputs and single antenna. This study considers the throughput maximisation problem for an energy harvesting transmitter with causal energy constraint over multiple-input multiple-output (MIMO) channels. Different from existing works, the authors consider the MIMO system with finite-alphabet inputs and partial instantaneous channel state information (CSI). Specifically, the transmitter knows the statistical CSI of the entire channel frame as well as the instantaneous CSI of current time slot. The precoder design in this scenario is an intractable optimisation problem with respect to multiple precoding matrices. The authors’ analysis shows that this difficult precoding problem can be equivalently transformed into a set of scalar optimisation subproblems with respect to the transmit power. To solve these subproblems, an efficient algorithm based on the dynamic programming is proposed. The authors analyse the performance of the proposed algorithm, and simulation results validate its effectiveness.
DOI: 10.1109/jsac.2011.110921
发表时间: 2011-09-01
影响因子: 16.4
作者:
Ozel, Omur;Tutuncuoglu, Kaya;Yener, Aylin
通讯作者: Yener, Aylin
DOI: 10.1109/tit.2005.860424
发表时间: 2006-01-01
影响因子: 2.5
作者:
Palomar, DP;Verdú, S
通讯作者: Verdú, S
DOI: 10.1109/tsp.2012.2188717
发表时间: 2012-06
影响因子: 5.4
作者:
Weiliang Zeng;C. Xiao;Mingxi Wang;Jianhua Lu
通讯作者: Weiliang Zeng;C. Xiao;Mingxi Wang;Jianhua Lu
DOI: 10.1109/tit.2006.876220
发表时间: 2006-07-01
影响因子: 2.5
作者:
Lozano, Angel;Tulino, Antonia M.;Verdu, Sergio
通讯作者: Verdu, Sergio
DOI: --
发表时间: 1995-05
期刊: --
影响因子: --
作者:
D. Bertsekas
通讯作者: D. Bertsekas