Computer Science – Information Theory
Scientific paper
2012-02-04
Computer Science
Information Theory
5 pages, 3 figures, submission to the 2012 IEEE International Symposium on Information Theory (ISIT 2012)
Scientific paper
We consider a distributed antenna system where $L$ antenna terminals (ATs) are connected to a Central Processor (CP) via digital error-free links of finite capacity $R_0$, and serve $L$ user terminals (UTs). This system model has been widely investigated both for the uplink and the downlink, which are instances of the general multiple-access relay and broadcast relay networks. In this work we focus on the downlink, and propose a novel downlink precoding scheme nicknamed "Reverse Quantized Compute and Forward" (RQCoF). For this scheme we obtain achievable rates and compare with the state of the art available in the literature. We also provide simulation results for a realistic network with fading and pathloss with $K > L$ UTs, and show that channel-based user selection produces large benefits and essentially removes the problem of rank deficiency in the system matrix.
Caire Giuseppe
Hong Song-Nam
No associations
LandOfFree
Reverse Compute and Forward: A Low-Complexity Architecture for Downlink Distributed Antenna Systems 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 Reverse Compute and Forward: A Low-Complexity Architecture for Downlink Distributed Antenna Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reverse Compute and Forward: A Low-Complexity Architecture for Downlink Distributed Antenna Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-329710