|国家预印本平台
首页|迭代注水算法求解高斯矢量信道和容量研究

迭代注水算法求解高斯矢量信道和容量研究

Research of Iterative Water-Filling for Gaussian Vector Channel Sum Capacity

中文摘要英文摘要

本文总结了迭代注水算法在求解高斯矢量信道和容量中的应用。首先给出了在单用户高斯矢量信道中注水算法的求解过程,然后总结了用于计算高斯矢量多址信道和容量迭代注水算法,最后分析了基于迭代注水求解总功率约束的高斯矢量广播信道和容量的优化算法。

his paper makes a survey of iterative water-filling algorithm for solving Gaussian vector channel sum capacity. First, it presents water-filling procedure for single-user Gaussian vector channel, and then makes a summary of iterative water-filling for Gaussian vector multi-access channel, at last, makes a analysis of optimal solution based on iterative water-filling algorithm for Gaussian vector broadcast channel with a sum power constraint.

冯春燕、曾志民、郭彩丽、张天魁

通信无线通信广播

高斯矢量信道广播信道,多址信道,迭代注水算法

Gaussian vector channelBroadcast channelMulti-access channelIterative water-filling

冯春燕,曾志民,郭彩丽,张天魁.迭代注水算法求解高斯矢量信道和容量研究[EB/OL].(2006-07-11)[2025-08-11].http://www.paper.edu.cn/releasepaper/content/200607-143.点此复制

评论