An Achievable Rate for the Multiple Level Relay Channel
Conference Paper
Overview
Identity
Additional Document Info
View All
Overview
abstract
A coding scheme was proposed and an achievable rate formula for the multiple relay channel, was proved. The coding scheme avoided some inconvenient techniques and the rate formula was proved in a recursive constraint form. The capacity of some relay channels under fading was obtained. The achievable rate formula for the discrete memoryless case was stated. The results show that the coding scheme is simple and can be easily extended to the multiple level relay case.
name of conference
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.