An achievable rate for the multiple level relay channel Conference Paper uri icon

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.

published proceedings

  • International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.

author list (cited authors)

  • Liang-Liang Xie, .., & Kumar, P. R

citation count

  • 5

complete list of authors

  • Kumar, PR

publication date

  • January 2004

publisher