Due to the high complexity of the pairwise decoding algorithm and the poor performance of zero forcing（ ZF） /minimum mean square error（ MMSE） decoding algorithm, two low-complexity suboptimal decoding algorithms, ...
详细信息
Due to the high complexity of the pairwise decoding algorithm and the poor performance of zero forcing（ ZF） /minimum mean square error（ MMSE） decoding algorithm, two low-complexity suboptimal decoding algorithms, called pairwisequasi-ZF and pairwise-quasi-MMSE decoders, are proposed. First,two transmit signals are detected by the quasi-ZF or the quasiMMSE algorithm at the receiver. Then, the two detected signals as the decoding results are substituted into the two pairwise decoding algorithm expressions to detect the other two transmit signals. The bit error rate（ BER） performance of the proposed algorithms is compared with that of the current known decoding ***, the number of calculations of ZF, MMSE, quasi-ZF and quasi-MMSE algorithms is compared with each other. Simulation results showthat the BER performance of the proposed algorithms is substantially improved in comparison to the quasi-ZF and quasiMMSE algorithms. The BER performance of the pairwise-quasiZF（ pairwise-quasi-MMSE） decoder is equivalent to the pairwiseZF（ pairwise-MMSE） decoder, while the computational complexity is significantly reduced.
The performance of the graph-based scheduling for device-to-device communications overlaying cellular networks is studied. The graph-based scheduling consists of two stages, the frequency assignment stage and the time...
详细信息
The performance of the graph-based scheduling for device-to-device communications overlaying cellular networks is studied. The graph-based scheduling consists of two stages, the frequency assignment stage and the time slot scheduling stage. For such scheduling, a theoretical method to analyze the average spectrum efficiency of the D2D subsystem is proposed. The method consists of three steps. First, the frequency assignment stage is analyzed and the approximate formula of the average number of the D2D links which are assigned the same frequency is derived. Secondly, the time slot scheduling stage is analyzed and the approximate formula of the average probability of a D2D link being scheduled in a time slot is derived. Thirdly, the average spectrum efficiency of the D2D subsystem is analyzed and the corresponding approximate formula is derived. Analysis results show that the average spectrum efficiency of the D2D subsystem is approximately inversely linearly proportional to the second- order origin moment of the normalized broadcast radius of D2D links. Simulation results show that the proposed method can correctly predict the average spectrum efficiency of the D2D subsystem.
全双工系统能实现在同一时隙与同一频率传输数据,相比于半双工系统能大大地提升数据吞吐量和频谱效率。为了进一步提高全双工多输入多输出(Multi-input and multi-output,MIMO)中继系统传输速率,本文基于放大转发(Amplify-and-forward,...
详细信息
全双工系统能实现在同一时隙与同一频率传输数据,相比于半双工系统能大大地提升数据吞吐量和频谱效率。为了进一步提高全双工多输入多输出(Multi-input and multi-output,MIMO)中继系统传输速率,本文基于放大转发(Amplify-and-forward,AF)传输模式,在全双工双向中继系统中引入梯度下降算法,将用户发送端、接收端波束成形与中继端波束成形矩阵相结合设计一种最大化速率的交替迭代算法,并构造出一种最小均方误差(Minimum mean square error,MMSE)迭代算法作为初始条件,在此基础上推导出中继接收端与发射端的波束成形矩阵表达式。仿真结果表明,本文构造的交替迭代算法收敛速度快,而且相比于迫零、最小均方误差以及最大泄信噪比算法,和速率有显著提高。
暂无评论