Reverse compute and forward: A low-complexity architecture for downlink distributed antenna systems
Authors:
- 1 July 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1147-1151
Abstract
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 K 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 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.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Compute-and-Forward: Harnessing Interference Through Structured CodesIEEE Transactions on Information Theory, 2011
- Integer-forcing linear receivers2010
- Downlink Multicell Processing with Limited-Backhaul CapacityEURASIP Journal on Advances in Signal Processing, 2009
- Superposition coding for side-information channelsIEEE Transactions on Information Theory, 2006
- A close-to-capacity dirty paper coding schemeIEEE Transactions on Information Theory, 2005
- Lattice basis reduction: Improved practical algorithms and solving subset sum problemsMathematical Programming, 1994
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- Matroids and the greedy algorithmMathematical Programming, 1971