CAJ | 학술논문

针对现有贪婪算法应用的高复杂性，提出了一种在误比特率（BER）和功率一定的前提下，最大化传输速率的低复杂度比特和功率分配算法。对系统模型和贪婪算法进行了简要介绍，对贪婪算法和新提出的算法进行了仿真，通过仿真结果可以看出，新提出的算法不仅满足系统的误比特率要求，在传输速率上和贪婪算法几乎相同，但却大大地降低了计算复杂度。
침대현유탐람산법응용적고복잡성，제출료일충재오비특솔（BER）화공솔일정적전제하，최대화전수속솔적저복잡도비특화공솔분배산법。대계통모형화탐람산법진행료간요개소，대탐람산법화신제출적산법진행료방진，통과방진결과가이간출，신제출적산법불부만족계통적오비특솔요구，재전수속솔상화탐람산법궤호상동，단각대대지강저료계산복잡도。
Because of the high complexity of the greedy algorithm, a low-complexity bit and power allocation algorithm under the condition of certain BER and power is proposed in the paper. Firstly the system model and greedy algorithm is introduced, and then simulation results about the proposed algorithm and the greedy are given. The performances of the proposed algorithm and greedy algorithm are almost the same, while the computational complexity of the proposed algorithm is much lower than that of the greedy algorithm.