Sphere decoding algorithm for multiuser detection in a distributed antenna system

Sphere decoding algorithm for multiuser detection in a distributed antenna system

In this paper, the impact of initial search radius on the complexity and performance of a sphere decoding algorithm is investigated for different user positions within a distributed antenna system. In a distributed antenna system, users can take up random positions within the cell clusters. The channel matrix can therefore take up in nitely different forms. In the presented work, a distributed antenna system with three different user positions in the cooperating cells is considered by employing different channel matrices. The effect on the complexity and performance of the sphere decoder due to the choice of the initial sphere radius is investigated for these user positions. It is shown that the signal lattice volume changes considerably for different user positions within the cells. A dynamic radius allocation algorithm is proposed in which the behavior is exploited by dynamically adjusting the initial sphere radius based on the knowledge of the channel path gain matrix. The simulation results show that the proposed algorithm results in a considerable reduction in the complexity of the sphere decoder in a distributed antenna system. Additionally, the performance of the sphere decoder in different coupling scenarios within the distributed antenna system has been investigated for a different number of candidates. It is shown that the performance of cell edge users can be considerably enhanced with high channel diversity, which otherwise could severely deteriorate the overall system performance.

___

  • [1] Khattak S, Rave W, Fettweis G. On the impact of user positions on multiuser detection in distributive antenna systems. In: European Wireless Conference; 1{4 April 2007; Paris, France.
  • [2] Chow P, Karim A, Fung V, Dietrich C. Performance advantages of distributed antennas in indoor wireless commu- nication systems. In: IEEE Vehicular Technology Conference; 8{10 June 1994; Stockholm, Sweden. New York, NY, USA: IEEE. pp. 1522-1526.
  • [3] Sklavos A, Weber T, Maniatis I, Costa E, Haas H, Schulz E. Interference suppression in multi-user OFDM systems by antenna diversity and joint detection. In: Proceedings of the COST 273 Workshop; 15{17 October 2001; Bologna, Italy.
  • [4] Khattak S, Rave W, Fettweis G. Multiuser turbo detection in a distributed antenna system. In: 15th IST Mobile & Wireless Communications Summit; 4{8 June 2006; Mykonos, Greece.
  • [5] Khattak S, Rave W, Fettweis G. SIC based multi-user turbo detector for non gray mapping in distributed antenna systems. In: 9th International Symposium on Wireless Personal Multimedia Communications; 17{20 September 2006; San Diego, CA, USA.
  • [6] Vikalo H, Hassibi B. On the sphere-decoding algorithm II. Generalizations, second-order statistics, and applications to communications. IEEE T Signal Proces 2005; 53: 2819-2834.
  • [7] Pohst M. On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications. ACM SIGSAM Bulletin 1981; 15: 37-44.
  • [8] Viterbo E, Biglieri E. A universal decoding algorithm for lattice codes. In: 14eme Colloque sur le Traitement du Signal et des Images; 13{16 September 1993; Juan-les-Pins, France. pp. 607-610.
  • [9] Viterbo E, Boutros J. A universal lattice code decoder for fading channels. IEEE T Inform Theory 1999; 45: 1639-1642.
  • [10] Damen O, Chkeif A, Bel ore JC. Lattice code decoder for space-time codes. IEEE Commun Lett 2000; 4: 161-163.
  • [11] Fincke U, Pohst M. Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Math Comput 1985; 44: 463-471.
  • [12] Schnorr CP, Euchner M. Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math Program 1994; 66: 181-199.
  • [13] Wubben D, Bohnke R, Kuhn V, Kammeyer KD. MMSE extension of V-BLAST based on sorted QR decomposition. In: Vehicular Technology Conference; 6{9 October 2003; Orlando, FL, USA. New York, NY, USA: IEEE. pp. 508-512.
  • [14] Zimmermann E, Rave W, Fettweis G. On the complexity of sphere decoding. In: 7th International Conference on Wireless Personal and Multimedia Communications; 12{15 September 2004; Abano Terme, Italy.
  • [15] El-Khamy M, Medra M, ElKamchouchi HM. Reduced complexity list sphere decoding for MIMO systems. Digit Signal Process 2014; 25: 84-92.
  • [16] Li LA, de Lamare RC, Burr AG. Successive interference cancellation aided sphere decoder for multi-input multi- output systems. EURASIP J Wirel Comm 2016; 1: 1-16.
  • [17] Albreem MA, Salleh MF. Radius selection for lattice sphere decoder-based block data transmission systems. Wirel Netw 2016; 22: 655-662.
  • [18] Khattak S, Rave W, Fettweis G. Distributed iterative multiuser detection through base station cooperation. EURASIP J Wirel Comm 2008; 1: 390489.
  • [19] Mrinalee S, Garg HP, Mathur G, Yadav RP. Improved radius selection in sphere decoder for MIMO System. In: International Conference on Computing for Sustainable Global Development; 5{7 March 2014; New Delhi, India. New York, NY, USA: IEEE. pp. 161-165.
  • [20] Shahnaz KV, Ali CK. A sphere decoding algorithm for underdetermined OFDM/SDMA uplink system with an effective radius selection. In: El-Alfy EM, Thampi SM, Takagi H, Piramuthu S, Hanne T, editors. Advances in Intelligent Informatics. Cham, Switzerland: Springer International Publishing, 2015. pp. 169-177.
  • [21] Babai L. On Lovasz' lattice reduction and the nearest lattice point problem. Combinatorica 1986; 6: 1-13.
  • [22] Hochwald BM, Ten Brink S. Achieving near-capacity on a multiple-antenna channel. IEEE T Comm 2003; 51: 389-399.
  • [23] Marsch P, Zimmermann E, Fettweis G. Improved methods for search radius estimation in sphere detection based MIMO receivers. In: 14th IST Mobile and Wireless Communications Summit; 29{23 June 2005; Dresden, Germany.
Turkish Journal of Electrical Engineering and Computer Sciences-Cover
  • ISSN: 1300-0632
  • Yayın Aralığı: Yılda 6 Sayı
  • Yayıncı: TÜBİTAK