Various space-time block codes over different modulation techniques using a new sphere decoder

  • Authors

    • Priyanka Mishra Sam Higginbottom University of Agriculture, Technology and Sciences
    • Mehboob UL-Amin University of Kashmir
    • C K. Shukla Sam Higginbottom University of Agriculture, Technology and Sciences
    https://doi.org/10.14419/ijet.v7i4.18631

    Received date: August 30, 2018

    Accepted date: October 4, 2018

    Published date: December 29, 2018

  • Multiple Input Multiple Output (MIMO), Orthogonal Space Time Block Codes (OSTBC), Rotated QOSTBC, Sphere Decoder (SD), Maximal Likelihood (ML), Vertical-Bell Laboratories Layered Space-Time (V-BLAST).

  • Abstract

    In this paper, a detailed analysis based on the combination of spatial multiplexing and space time coding techniques under Rayleigh fading channel constraint in MIMO wireless communication systems is presented. The decoding algorithms of V-BLAST and Sphere Decoder are analyzed and their performance is evaluated using different Orthogonal Space-Time Block Codes techniques, with quasi and rotated quasi-orthogonal space-time block codes. The BER vs SNR curves of all the proposed algorithms have been verified for all modulation schemes including 64 QAM, 16QAM, QPSK and BPSK. A modified K and K1 Sphere decoder are proposed for the significant reduction of BER at higher modulation schemes. BER for 64 QAM modulation is calculated at optimum SNR of 20 dB and it has been shown, it gets significantly reduces when our proposed decoding algorithms are applied.

  • References

    1. C. Jiang, H. Zhang, D. Yuan, and H. Chen, “A low complexity de-coding scheme for quasi-orthogonal space-time block coding,” in Proc. IEEE Sens. Array Multichannel Signal Process. Workshop, Jul. 2008, pp. 9–12. https://doi.org/10.1109/SAM.2008.4606813.
    2. L. He and H. Ge, “Fast maximum likelihood decoding of quasi-orthogonal space-time codes,” in Proc. Asilomar Conf. Signals, Syst. Comput.,Monterey, CA, USA, Nov. 2003, vol. 1, pp. 1022– 1026.
    3. J. Leuschner and S. Yousefi, “A new sub-optimal decoder for quasi-orthogonal space-time block codes,” IEEE Commun. Lett. vol. 12, no. 8, pp. 548–550, Aug. 2008. https://doi.org/10.1109/LCOMM.2008.080471.
    4. T. Mao and M. Motani, “STBC-VBLAST for MIMO wireless communication systems,” in Proc. of Int. Conf. on Communications, vol.4, pp. 2266-2270, May 2005.
    5. J. Leuschner and S. Yousefi, “On the ML Decoding of Quasi-Orthogonal Space-Time Block Codes via Sphere Decoding and Ex-haustive Search,” IEEE Commun. Lett. vol. 7, no. 11, pp. 4088–4093, Nov. 2008.
    6. S. J. Alabed, J. M. Paredes, and A. B. Gershman, “A low complexi-ty decoder for quasi-orthogonal space time block codes,” IEEE Trans. Wireless Commun., vol. 10, no. 3, pp. 988–994, Mar. 2011. https://doi.org/10.1109/TWC.2011.010411.101263.
    7. S. M. Alamouti, ”A simple transmit diversity technique for wireless communications”, IEEE Journal on Selected Areas in Communica-tions,vol. 16, no. 8, October 1998, pp. 1451-1458. https://doi.org/10.1109/49.730453.
    8. V. Tarokh, H. Jafarkhani, and A. R. Calderbank, “Space-time block codes from orthogonal designs,” IEEE Trans. Inform. Theory, vol. 45, pp. 1456–1467, July 1999. https://doi.org/10.1109/18.771146.
    9. L. He and H. Ge, “A New Full-Rate Full-Diversity Orthogonal Space-Time Block Coding Scheme,” IEEE Communications Letters, vol. 7, pp. 590–592, December 2003. https://doi.org/10.1109/LCOMM.2003.821316.
    10. W. Su and X. Xia, “Quasi-orthogonal space–time block codes with full diversity,” in Proc. IEEE Global Telecommun. Conf. (GLOBECOM),Taipei,Taiwan, R.O.C., 2002, pp. 1098–1102. https://doi.org/10.1117/12.453833.
    11. Lori A. Dalton and Costas N. Georghiades, “A Full-Rate, Full-Diversity Four-Antenna Quasi-Orthogonal Space-Time Block Code” , IEEE Transactions on wireless communications, vol. 4, no. 2,pp.363-366,march2005. https://doi.org /10.1109/ TWC. 2004. 842945.
    12. H. Jafarkhani, “A quasi orthogonal space-time block code,” IEEE Transactions on Communications, vol. 49, pp. 1–4, Jan. 2001. https://doi.org/10.1109/26.898239.
    13. A. Y.-C Peng, I.-M. Kim, and S. Yousefi, “Low-complexity sphere decoding algorithm for quasi-orthogonal space-time block codes,” IEEE Trans. Commun., vol. 54, no. 3, pp. 377–382, Mar. 2006. https://doi.org/10.1109/TCOMM.2006.869881.
    14. A. Ahmadi, S. Talebi and M. Shahabinejad, “A New Approach to Fast Decode Quasi-Orthogonal Space-Time Block Codes”, IEEE Transactions on wireless communications, vol. 14, no. 1,pp. 165-176, january 2015. https://doi.org/10.1109/TWC.2014.2334615.
    15. V. Tarokh, A. Naguib, N. Seshadri and A. R. Calderbank, “Space-time block codes from orthogonal designs,” IEEE Transactions on Information Theory, vol. 45, pp. 1456–1467, July 1999. https://doi.org/10.1109/18.771146.
    16. Y. Ding, Y.Wang, J. F .Diouris, “Simplified Robust fixed complexi-ty sphere decoder”,19th European Signal Processing Conference ,Barcelona, Spain, August 29 - September 2,pp.116-120, 2011.
    17. Y. Ding, Y.Wang, J. F .Diouris, “Robust fixed complexity sphere decoder”, IEEE GLOBECOM 2010, Miami,Florida, USA, 2010. https://doi.org/10.1109/GLOCOM.2010.5684114.
    18. Z. Zhenchuan, C. Bo, “A Precoding Scheme for STBC-VBLAST System”, Wireless Communications, Networking and Mobile Com-puting (WiCOM), 2011, 7th International Conference on 23-25 Sept. 2011, 978-1-4244-6252-0/11/$26.00 ©2011 IEEE.
    19. R. Y. Chang, S. J. Lin, W. H. Chung, “Efficient Implementation of the MIMO Sphere Detector:Architecture and Complexity Analysis”, IEEE Transactions on vehicular technology, vol. 61, no. 7,pp.3291-3294,september2012. https:// doi.org /10.1109 /TVT. 2012.2204075.
    20. L. Yazhen, G. Jing, W. Chao, “Research on Quasi-orthogonal space-time block code”, 2nd International Conference on Consumer Elec-tronics, Communications and Networks (CECNet),2012,pp: 530 – 532 https://doi.org/10.1109/CECNet.2012.6202083.
    21. Thakur, N.S.; Thakur, S.S.; Gogoi, A.K.,“Few More Quasi-Orthogonal Space-Time Block Codes for Four Transmit Antennas” IEEE Intern. Conference on Computational Intelligence and Com-munication Networks (CICN), vol. 47, pp. 367-374, Oct.2011. https://doi.org/10.1109/CICN.2011.78.
    22. Xie Wu, Cao Jia-nian and Yang Rui, “Design and analysis of low complexity quasi-orthogonal space-time block code,” The fourth IEEE Conference on Industrial Electronics and Applications, 25-27, May 2009.
    23. L. Azzam and E. Ayanoglu, “Real-valued maximum likelihood de-coder for quasi-orthogonal space-time block codes,” IEEE Tran. Commun., vol. 57, no. 8, pp. 2260–2263, Aug. 2009. https://doi.org/10.1109/TCOMM.2009.08.070470.
    24. C. Sanchis-Borras J. M. Molina Garcia-Pardo, M. Lienard, P. Degauque and L. Juan LLacer, “Performance of QSTBC and VBLAST Algorithms for MIMO Channels in Tunnels”, IEEE An-tennas Wirel. Propag. Lett. vol. 29, pp. 906 – 909, 2010.
    25. V. Kostina, S. Loyka, “Optimum Power and Rate Allocation for Coded V-BLAST: Average Optimization,” IEEE Trans. Comm., v. 59, no. 3, pp. 877-887, Mar. 2011. https: //doi.org /10.1109 /TCOMM.2011.010411.090561.
    26. Rana R, Rathod J. Performance Analysis of Different Channel Esti-mation Techniques with Different Modulation for VBLAST MMSE MIMO-OFDM System. International Conference on Wireless Com-munications, Signal Processing and Networking. 2016 March;p.236-39.Crossrefhttps://doi.org/ 10.1109/ WiSPNET.2016 .7566127.
    27. Gurpreet Singh, Priyanka Mishra and Rahul Vij,“Performance Eval-uation of ML-VBLAST MIMO decoder using different antenna con-figuration using Ricean and Rayleigh Channel”, 2013 International Conference on Communication Systems and Network Technolo-gies,978-0-7695-4958-3/13 $26.00 © 2013 IEEE https://doi.org/10.1109/CSNT.2013.46.
    28. J. Cortez, R. Palacio.J. C. R.-Pacheco, E. R. Ibarra, “A Very Low Complexity Near ML Detector Based on QRD-M Algorithm for STBC-VBLAST Architecture”, in Proc. of 7th IEEE Latin-American Conference on Communications (LATIN-COM),November 2015, Peru.
    29. Y.Ding, N. Li, Y. Wang, S. Feng, and H. Chen, “Widely Linear Sphere Decoder in MIMO Systems by Exploiting the Conjugate Symmetry of Linearly Modulated Signals”,IEEE Transactions on signal processing, vol. 64, no. 24, 6428-6442,Dec. 15, 2016. https://doi.org/10.1109/TSP.2016.2598317.
    30. L.G. Barbero, and J.S. Thompson, ”A Fixed-Complexity MIMO Detector Based on the Complex Sphere Decoder,” in 7th IEEE Workshop on Signal Processing Advances in Wireless Communica-tions (SPAWC ’06), Cannes, France, July 2006, pp. 1-5. https://doi.org/10.1109/SPAWC.2006.346388.
    31. T. G. Markiewicz, “Faster than Sphere (Decoder). A Demodulation Algorithm for Multidimensional Constellations”, Wireless Communi-cation Systems (ISWCS), pp. 136-142, 20 Oct., 2016, https://doi.org/10.1109/ISWCS.2016.7600889.
    32. R. Vij, P. Mishra, G. Singh, “Performance Evaluation of Compari-son of Sphere Decoder with OtherEqualization Techniques on 2x2 MIMO Systems Using Rayleigh and Rician Flat Fading Chan-nels”,2014 Fourth International Conference on Communica-tion Systems and Network Technologies, 2014,pp: 182 - 186, https://doi.org/10.1109/CSNT.2014.44.
    33. V. Tarokh, N. Seshadri, and A. R. Calderbank, “Space time codes for high data rate wireless communication: performance analysis and code construction,” IEEE Trans. Inform. Theory, vol. 44, pp. 744–765, Mar.1998. https://doi.org/10.1109/18.661517.
    34. P. Mishra, G. Singh, R. Vij,G. Chandil, “BER Analysis of Alamouti Space Time Block Coded 2x2 MIMO Systems using Rayleigh Dent Mobile Radio Channel” ,2013 IEEE 3rd international Advance com-puting conference (IACC) Page(s):154 – 158.
    35. P. W.Wolniansky, G. J. Foschini, G. D. Golden, and R. A. Valen-zuela,“V-BLAST: An architecture for realizing very high data rates over the rich-scattering wireless channel,” in Proc. URSI Symp., Sep.1998,pp.295–300. https://doi.org/10.1109/ISSSE.1998.738086.
    36. S. Kundu, W. Su, D. A. Pados, and M. J. Medley, “Fast maxi-mumlikelihood decoding of 4 × 4 full-diversity quasi-orthogonal STBCs with QAM signals,” in Proc. IEEE Global Telecommun. Conf., Dec. 2010, pp. 1–5.
    37. E. Viterbo and J. Boutros, “A universal lattice code decoder for fad-ing channels,” IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1639–1642,Jul. 1999. https://doi.org/10.1109/18.771234.
    38. V. Tarokh, H. Jafarkhani, and A. Calderbank, “Space-time block coding for wireless communications: performance results," IEEE J. Sel. Areas Commun., vol. 17, pp. 451-460, Mar. 1999. https://doi.org/10.1109/49.753730.
    39. M. O. Damen, A. Chkeif, and J.-C. Belfiore, “Lattice code decoder for space-time codes,” IEEE Comm. Lett., vol. 4, no. 5, pp. 161–163, May 2000. https://doi.org/10.1109/4234.846498.
    40. D. Choi, C. Chae, and T. Jung, “Design of new minimum decoding complexity quasi-orthogonal space-time block code for 8 transmit an-tennas,”in IEEE International Symposium on Signal Processing and Information Technology, Dec. 2007, pp. 674–677. https://doi.org/10.1109/ISSPIT.2007.4458135.
    41. M. Pohst., “On the computation of lattice vectors of minimal length,successive minima and reduced bases with applications”, ACM SIGSAM Bulletin, 15(1):37-44, 1981. https:// doi.org /10.1145/1089242.1089247.
    42. U. Fincke and M. Pohst, “Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analy-sis”,Mathematics of Computation, 44(1 ):463-471, 1985. https://doi.org/10.1090/S0025-5718-1985-0777278-8.
    43. G.Ginis and J.M.Cioffi, “On the relationship between V-BLAST and GDFE,” IEEE Communications letters, vol. 5, pp. 364-366, September 2001. https://doi.org/10.1109/4234.951378.
    44. M.Varanasi and T.Guess, “Optimum decision feedback multiuser equalization with successive decoding achieves the total capacity of the Gaussian multiple-access channel,” Conference Record of the Thirty- First Asilomar Conference on signals, Systems and comput-ers, vol. 2, pp. 1405-1409, Nov-2-5 1997. https://doi.org/10.1109/ACSSC.1997.679134.
    45. C.Windpassinger and RF.H Fischer, “Low-complexity need-Maximum Likelihood detection and precoding for MIMO systems” in ITW 2003, Paris, France, March 31-April-4, 2003.
    46. Conway, J. H. and Sloane, N. J. A. Sphere Packings, Lattices and Groups.Springer-Verlag, 1999. https://doi.org/10.1007/978-1-4757-6568-7.
    47. Agrell, E., Eriksson, T., Vardy, A. and Zeger, K. Closest point search in lattes.IEEE Trans. on Information Theory, 48(8): Aug. 2002, 2201–14. https://doi.org/10.1109/TIT.2002.800499.
    48. Coveyou, R. R. and MacPherson, R. D. Fourier analysis of unifor random number generators. Journal Assoc. Comput. Mach., 14: Jan. 1967, 100–19. https://doi.org/10.1145/321371.321379.
    49. Dieter, U. How to calculate shortest vectors in a lattice. Math. of Compute.29: July 1975, 827–33. https://doi.org/10.1090/S0025-5718-1975-0379386-6.
    50. Helfrich, B. Algorithms to construct Minkowski reduced and Hermie reduced lattice bases. Theor. Comput. Sci., 41(2-3): 1985, 25–39.
    51. Kannan, R. Minkowski’s convex body theorem and integer pro-gramming. Math. Oper. Res., 12: Aug. 1987, 415–40. https://doi.org/10.1287/moor.12.3.415.
    52. Pohst, M. On the computation of lattice vectors of minimal length successive minima and reduced bases with applications. ACM SIG-SAMBull., 15: Feb. 1981, 37–44. https: //doi.org/ 10.1145/ 1089242.1089247.
    53. Damen, O., Chkeif, A. and Belfiore, J.-C. Lattice code decoder for space-time codes. IEEE Communications Letters, 4(5): May 2000, 161–3. https://doi.org/10.1109/4234.846498.
    54. Horn, A. H. and Johnson, C. R. Matrix Analysis. Cambridge Univer-sity Press, 1999.
    55. Fincke, U. and Pohst, M. Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Math. Comput., 44: Apr. 1985,463–71. https://doi.org/10.1090/S0025-5718-1985-0777278-8.

  • Downloads

  • How to Cite

    Mishra, P., UL-Amin, M., & K. Shukla, C. (2018). Various space-time block codes over different modulation techniques using a new sphere decoder. International Journal of Engineering and Technology, 7(4), 4282-4289. https://doi.org/10.14419/ijet.v7i4.18631