Parallelization of Sphere-Decoding Methods

被引:0
|
作者
Trujillo, Rafael A. [1 ,2 ]
Vidal, Antonio M. [1 ]
Garcia, Victor M. [1 ]
Gonzalez, Alberto [3 ]
机构
[1] Univ Politecn Valencia, Dept Sistemas Informat & Computac, Camino Vera S-N, Valencia 46022, Spain
[2] Univ Ciencias Informat, Dept Tecn Programac, Havana, Cuba
[3] Univ Politecn Valencia, Dept Commun, E-46022 Valencia, Spain
关键词
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Sphere-Decoding (SD) methods are branch-and-bound-like techniques used for optimal detection of digital communications signals over in wireless MIMO (Multiple input Multiple Output) channels. These methods look for the optimal solution in a tree of partial solutions; the size of the tree depends on the parameters of the problem (dimension of the channel matrix, cardinality of the alphabet), and such search can be much more expensive depending on these parameters. This search often has to be carried out in real time. This paper presents parallel versions of the Sphere-Decoding method for different, parallel architectures with the goal of reducing the computation time.
引用
收藏
页码:2 / +
页数:2
相关论文
共 50 条
  • [1] Decoding OvTDM with sphere-decoding algorithm
    Key Laboratory of Information Processing and Intelligent Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China
    J. China Univ. Post Telecom., 2008, 4 (35-39):
  • [2] Sphere-Decoding of OvTDM
    Zhao, Dongfeng
    Li, Daoben
    Jin, Xin
    PROCEEDINGS OF 2007 INTERNATIONAL WORKSHOP ON SIGNAL DESIGN AND ITS APPLICATIONS IN COMMUNICATIONS, 2007, : 22 - 25
  • [4] Infinity-Norm Sphere-Decoding
    Seethaler, Dominik
    Boelcskeu, Helmut
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 2002 - 2006
  • [5] Tail Behavior of Sphere-Decoding Complexity in Random Lattices
    Seethaler, D.
    Jalden, J.
    Studer, C.
    Boelcskei, H.
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 729 - +
  • [6] On the sphere-decoding algorithm I. Expected complexity
    Hassibi, B
    Vikalo, H
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2005, 53 (08) : 2806 - 2818
  • [7] Modified sphere-decoding algorithm in the complex domain of MIMO system
    Zhao, Dong-Feng
    Jin, Xin
    Li, Dao-Ben
    Tianjin Daxue Xuebao (Ziran Kexue yu Gongcheng Jishu Ban)/Journal of Tianjin University Science and Technology, 2009, 42 (04): : 368 - 372
  • [8] An Improved Sphere-decoding Algorithm for V-BLAST System
    Huang, Gengsheng
    Zheng, Hui
    Shen, Jing
    Xue, Yongfei
    FOURTH INTERNATIONAL CONFERENCE ON WIRELESS AND OPTICAL COMMUNICATIONS, 2016, 9902
  • [9] Performance and Complexity Analysis of Infinity-Norm Sphere-Decoding
    Seethaler, Dominik
    Boelcskei, Helmut
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (03) : 1085 - 1105
  • [10] Reduced Latency ML Polar Decoding via Multiple Sphere-Decoding Tree Searches
    Husmann, Chistopher
    Nikolaou, Panagiotis Chatzi
    Nikitopoulos, Konstantinos
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2018, 67 (02) : 1835 - 1839