发表机构
Imperial College London; The Chinese University of Hong Kong（帝国理工学院; 香港中文大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
该研究针对原始菱形中继信道，运用Csiszár–Körner–Marton求和恒等式和Gallager型识别推导改进上界，在离散无记忆信道上严格优于割集界等，在高斯信道上与现有强化上界一致，评估了改进效果。
AI 中文摘要
我们研究原始菱形中继信道的容量，通过运用Csiszár–Körner–Marton求和恒等式和Gallager型识别，推导得出了一个相较于现有上界更优的改进上界。对于高斯原始菱形中继信道，我们证明所提上界与Wu、Özgür、Peleg和Shamai提出的现有强化高斯上界一致；对于离散无记忆信道，该上界可严格优于割集界和现有上界，我们结合不同信道实例以及译码转发/压缩转发时分内界评估了这种改进效果。
英文摘要
We study the capacity of the primitive diamond relay channel and derive an improved upper bound compared with existing upper bounds by employing the Csiszár--Körner--Marton sum identity and Gallager-type identification. For Gaussian primitive diamond relay channels, we show that our proposed bound coincides with the existing strengthened Gaussian upper bound of Wu, Özgür, Peleg, and Shamai. For discrete memoryless channels, our bound can be strictly tighter than both the cut-set bound and the existing upper bound, and we assess the improvement using different channel instances, together with a decode--forward/compress--forward time-sharing inner bound.
