首页> 外文期刊>Information Theory, IEEE Transactions on >Distortion Minimization in Gaussian Layered Broadcast Coding With Successive Refinement
【24h】

Distortion Minimization in Gaussian Layered Broadcast Coding With Successive Refinement

机译:具有连续细化的高斯分层广播编码中的失真最小化

获取原文
获取原文并翻译 | 示例
           

摘要

A transmitter without channel state information wishes to send a delay-limited Gaussian source over a slowly fading channel. The source is coded in superimposed layers, with each layer successively refining the description in the previous one. The receiver decodes the layers that are supported by the channel realization and reconstructs the source up to a distortion. The expected distortion is minimized by optimally allocating the transmit power among the source layers. For two source layers, the allocation is optimal when power is first assigned to the higher layer up to a power ceiling that depends only on the channel fading distribution; all remaining power, if any, is allocated to the lower layer. For convex distortion cost functions with convex constraints, the minimization is formulated as a convex optimization problem. In the limit of a continuum of infinite layers, the minimum expected distortion is given by the solution to a set of linear differential equations in terms of the density of the fading distribution. As the number of channel uses per source symbol tends to zero, the power distribution that minimizes expected distortion converges to the one that maximizes expected capacity.
机译:没有信道状态信息的发射机希望通过缓慢衰落的信道发送延迟受限的高斯源。源代码以叠加的层进行编码,每一层依次完善前一个描述。接收器对信道实现所支持的层进行解码,并将源重构到失真为止。通过在源层之间最佳分配发射功率,可以将预期失真最小化。对于两个源层,当首先将功率分配给较高层直到功率上限(仅取决于信道衰落分布)时,分配是最佳的。如果有的话,所有剩余功率都分配给下层。对于具有凸约束的凸失真代价函数,将最小化公式化为凸优化问题。在无限层的连续性的极限中,根据衰落分布的密度,一组线性微分方程的解给出了最小的预期失真。随着每个源符号使用的信道数趋于零,使预期失真最小的功率分布收敛到使预期容量最大化的功率分布。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号