ETRI Journal

Electronics and Telecommunications Research Institute (한국전자통신연구원)
권호 표지
DOI QR코드

DOI QR Code

Performance Analysis of Layer Pruning on Sphere Decoding in MIMO Systems

  • Karthikeyan, Madurakavi (Department of Electronics and Communication Engineering, Pondicherry Engineering College) ;
  • Saraswady, D. (Department of Electronics and Communication Engineering, Pondicherry Engineering College)
  • Received : 2013.11.20
  • Accepted : 2014.01.22
  • Published : 2014.08.01
Download PDF
⟨ Previous Next ⟩

Abstract

Sphere decoding (SD) for multiple-input and multiple-output systems is a well-recognized approach for achieving near-maximum likelihood performance with reduced complexity. SD is a tree search process, whereby a large number of nodes can be searched in an effort to find an estimation of a transmitted symbol vector. In this paper, a simple and generalized approach called layer pruning is proposed to achieve complexity reduction in SD. Pruning a layer from a search process reduces the total number of nodes in a sphere search. The symbols corresponding to the pruned layer are obtained by adopting a QRM-MLD receiver. Simulation results show that the proposed method reduces the number of nodes to be searched for decoding the transmitted symbols by maintaining negligible performance loss. The proposed technique reduces the complexity by 35% to 42% in the low and medium signal-to-noise ratio regime. To demonstrate the potential of our method, we compare the results with another well-known method - namely, probabilistic tree pruning SD.

Keywords

References

  1. G.J. Foschini and M.J. Gans, "On Limits of Wireless Communication in a Fading Environment when Using Multiple Antennas," Wireless Pers. Commun., vol. 6, no. 3, Mar. 1998, pp. 311-335. https://doi.org/10.1023/A:1008889222784
  2. I.E. Telatar, "Capacity of Multi-antenna Gaussian Channels," European Trans. Telecommun., vol. 10, no. 6, Nov. 1999, pp. 585-595. https://doi.org/10.1002/ett.4460100604
  3. U. Fincke and M. Pohst, "Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis," Math. Comput., vol. 44, 1985, pp. 463-471. https://doi.org/10.1090/S0025-5718-1985-0777278-8
  4. C.P. Schnorr and M. Euchner, "Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems," Math. Programm., vol. 66, no. 1-3, Aug. 2, 1994, pp. 181-199. https://doi.org/10.1007/BF01581144
  5. E. Viterbo and J. Boutros, "A Universal Lattice Code Decoder for Fading Channels," IEEE Trans. Inf. Theory, vol. 45, no. 5, July 1999, pp. 1639-1642. https://doi.org/10.1109/18.771234
  6. B. Hassibi and H. Vikalo, "On the Sphere-Decoding Algorithm I. Expected Complexity," IEEE Trans. Signal Proc., vol. 53, no. 8, Aug. 2005, pp. 2806-2818. https://doi.org/10.1109/TSP.2005.850352
  7. Z. Ma et al., "Stopping Criterion for Complexity Reduction of Sphere Decoding," IEEE Commun. Lett., vol. 13, no. 6, June 2009, pp. 402-404. https://doi.org/10.1109/LCOMM.2009.090112
  8. R. Gowaikar and B. Hassibi, "Efficient Statistical Pruning for Maximum Likelihood Decoding," Proc. Int. Conf. Acoust., Speech Signal Process., vol. 5, Apr. 6-10, 2003, pp. 49-52.
  9. B. Shim and I. Kang, "On Further Reduction of Complexity in Tree Pruning Based Sphere Search," IEEE Trans. Commun., vol. 58, no. 2, Feb. 2010, pp. 417-422. https://doi.org/10.1109/TCOMM.2010.02.080340
  10. R. Gowaikar and B. Hassibi, "Statistical Pruning for Near- Maximum Likelihood Decoding," IEEE Trans. Signal Process., vol. 55, no. 6, June 2007, pp. 2661-2675. https://doi.org/10.1109/TSP.2006.890912
  11. B. Shim and I. Kang, "Sphere Decoding with a Probabilistic Tree Pruning," IEEE Trans. Signal Process., vol. 56, no. 10, Oct. 2008, pp. 4867-4878. https://doi.org/10.1109/TSP.2008.923808
  12. K.J. Kim and J. Yue, "Joint Channel Estimation and Data Detection Algorithms for MIMO-OFDM System," Asilomar Conf. Signals, Syst. Comput., Pacific Grove, CA, USA, vol. 2, Nov. 3-6, 2002, pp. 1857-1861.
  13. K. Higuchi et al., "Likelihood Function for QRM-MLD Suitable for Soft-Decision Turbo Decoding and its Performance for OFCDM MIMO Multiplexing in Multipath Fading Channel," Personal, Indoor Mobile Radio Commun., Barcelona, Spain, Sept. 5-8, 2004, pp. 1142-1148.
  14. E. Agrell et al., "Closest Point Search in Lattices," IEEE Trans. Inf. Theory, vol. 48, no. 8, Aug. 2002, pp. 2201-2214. https://doi.org/10.1109/TIT.2002.800499
  15. M.O. Damen, H.Gamel, and G. Caire, "On Maximum-Likelihood Detection and the Search for the Closest Lattice Point," IEEE Trans. Inf. Theory, vol. 49, no. 10, Oct. 2003, pp. 2389-2402. https://doi.org/10.1109/TIT.2003.817444
  16. Y.S. Cho et al., "MIMO-OFDM Wireless Communications with MATLAB," Singapore: John Wiley & Sons (Asia) Pte. Ltd., 2010, pp. 317-371.

Cited by

  1. Parallel decoding for lattice reduction-aided MIMO Receiver vol.24, pp.None, 2014, https://doi.org/10.3906/elk-1503-136