Sphere decoding for multiprocessor architectures

被引:4
|
作者
Qi, Q. [1 ]
Chakrabarti, C. [1 ]
机构
[1] Arizona State Univ, Dept Elect Engn, Tempe, AZ 85287 USA
来源
2007 IEEE WORKSHOP ON SIGNAL PROCESSING SYSTEMS, VOLS 1 AND 2 | 2007年
关键词
sphere decoding; architecture; multiprocessor;
D O I
10.1109/SIPS.2007.4387516
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Motivated by the need for high throughput sphere decoding for multiple input-multiple-output (MIMO) communication systems, we propose a parallel depth-first sphere decoding (PDSD) algorithm that provides the advantages of both parallel processing and rapid search space reduction. The PDSD algorithm is designed for efficient implementation on programmable multi-processor platforms. We investigate the trade-off between the throughput and computation overhead when the number of processing elements is 2, 4 and 8, for a 4 x 4 16-QAM system across a wide range of SNR conditions. Through simulation, we show that PDSD can offer significant throughput improvement without incurring substantial computation overhead by selecting the appropriate number of processing elements according to specific SNR conditions.
引用
收藏
页码:50 / 55
页数:6
相关论文
共 50 条
  • [31] A BALANCED SUBMATRIX MERGING ALGORITHM FOR MULTIPROCESSOR ARCHITECTURES
    CHU, E
    GEORGE, A
    PARALLEL COMPUTING, 1992, 18 (01) : 1 - 10
  • [32] Communication/Synchronisation mechanism for Multiprocessor on Chip Architectures
    Zertal, Soraya
    Timsit, Claude
    Chatti, Majed
    ISCC: 2009 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, VOLS 1 AND 2, 2009, : 1096 - +
  • [33] Hardening Architectures for Multiprocessor System-on-Chip
    Aviles, Pablo M.
    Garcia-Astudillo, Luis A.
    Entrena, Luis
    Garcia-Valderas, Mario
    Martin-Holgado, Pedro
    Morilla, Yolanda
    Lindoso, Almudena
    IEEE TRANSACTIONS ON NUCLEAR SCIENCE, 2024, 71 (08) : 1887 - 1895
  • [34] On the expected complexity of sphere decoding
    Hassibi, B
    Vikalo, H
    CONFERENCE RECORD OF THE THIRTY-FIFTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, VOLS 1 AND 2, 2001, : 1051 - 1055
  • [35] Reduced Complexity Sphere Decoding
    Li, Boyu
    Ayanoglu, Ender
    2011 7TH INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE (IWCMC), 2011, : 147 - 151
  • [36] Faster Recursions in Sphere Decoding
    Ghasemmehdi, Arash
    Agrell, Erik
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (06) : 3530 - 3536
  • [37] On the complexity of sphere decoding for MSDD
    Pauli, Volker
    Lampe, Lutz
    2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 932 - +
  • [38] 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
  • [39] Reduced complexity sphere decoding
    Li, Boyu
    Ayanoglu, Ender
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2011, 11 (12): : 1518 - 1527
  • [40] Enabling Sphere Decoding for SCMA
    Vameghestahbanati, Monirosharieh
    Bedeer, Ebrahim
    Marsland, Ian
    Gohary, Ramy H.
    Yanikomeroglu, Halim
    IEEE COMMUNICATIONS LETTERS, 2017, 21 (12) : 2750 - 2753