DMT of weighted Parallel Channels: Application to Broadcast Channel

Details DMT of weighted Parallel Channels: Application to Broadcast Channel DMT of weighted Parallel Channels: Application to Broadcast Channel

2008-07-24

arxiv.org/abs/0807.3913v1

Computer Science

Information Theory

Proceedings of the 2008 IEEE International Symposium on Information Theory, Toronto, ON, Canada, July 6 - 11, 2008

Scientific paper

In a broadcast channel with random packet arrival and transmission queues, the stability of the system is achieved by maximizing a weighted sum rate capacity with suitable weights that depend on the queue size. The weighted sum rate capacity using Dirty Paper Coding (DPC) and Zero Forcing (ZF) is asymptotically equivalent to the weighted sum capacity over parallel single-channels. In this paper, we study the Diversity Multiplexing Tradeoff (DMT) of the fading broadcast channel under a fixed weighted sum rate capacity constraint. The DMT of both identical and different parallel weighted MISO channels is first derived. Finally, we deduce the DMT of a broadcast channel using DPC and ZF precoders.

Affiliated with

Also associated with

No associations

Rating

DMT of weighted Parallel Channels: Application to Broadcast Channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with DMT of weighted Parallel Channels: Application to Broadcast Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and DMT of weighted Parallel Channels: Application to Broadcast Channel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-676940