Title :
Parallel relay broadcast channels
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Maryland, College Park, MD, USA
Abstract :
In this paper, we study the achievable rate regions of parallel relay broadcast channels. We present two system models, the parallel unshared-relay broadcast channel and the parallel shared-relay broadcast channel. In the first system, each relay node is peculiar to one of the users and does not assist any other user. In the second system, each relay node is shared by all users and assists all of them. Achievable rate regions for these two different channel models are derived in the discrete memoryless case. We also provide an outer bound on the rate regions, which is tighter than the cut-set bound.
Keywords :
broadcast channels; cut-set bound; discrete memoryless case; parallel shared-relay broadcast channel; parallel unshared-relay broadcast channel; relay node; Broadcasting; Decoding; Educational institutions; Relays; broadcast channels; random codes; rate region; relay channels;
Conference_Titel :
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
Conference_Location :
Austin, TX
Print_ISBN :
978-1-4244-7890-3
Electronic_ISBN :
978-1-4244-7891-0
DOI :
10.1109/ISIT.2010.5513530
