• Title/Summary/Keyword: Schnorr-Euchner (SE) sphere decoder

Search Result 3, Processing Time 0.016 seconds

Reduced Complexity Schnorr-Euchner Sphere Decoders in MIMO Applications

  • Le Minh-Tuan;Pham Van-Su;Mai Linh;Yoon Gi-Wan
    • Journal of information and communication convergence engineering
    • /
    • v.4 no.2
    • /
    • pp.79-83
    • /
    • 2006
  • We present two techniques based on lookup tables to reduce complexity of the well-known Schnorr-Euchner (SE) sphere decoder (SD) without introducing performance degradation. By the aid of lookup tables, the computational loads caused by the SE enumeration and decision feedback are reduced at the cost of higher storage capacity. Simulation results are provided to verify performance and complexity of the proposed decoders.

Reduced Complexity Schnorr-Euchner Sphere Decoders in MIMO Applications

  • Le Minh-Tuan;Pham Van-Su;Linh Mai;Yoon Gi-Wan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.120-124
    • /
    • 2006
  • We present two techniques based on lookup tables to reduce complexity of the well-known Schnorr-Euchner (SE) sphere decoder (SD) without introducing performance degradation. By the aid of lookup tables, the computational loads caused by the SE enumeration and decision feedback are reduced at the cost of higher storage capacity. Simulation results are provided to verify performance and complexity of the proposed decoders.

  • PDF

A Parallel Collaborative Sphere Decoder for a MIMO Communication System

  • Koo, Jihun;Kim, Soo-Yong;Kim, Jaeseok
    • Journal of Communications and Networks
    • /
    • v.16 no.6
    • /
    • pp.620-626
    • /
    • 2014
  • In this paper, we propose a parallel collaborative sphere decoder with a scalable architecture promising quasi-maximum likelyhood performance with a relatively small amount of computational resources. This design offers a hardware-friendly algorithm using a modified node operation through fixing the variable complexity of the critical path caused by the sequential nature of the conventional sphere decoder (SD). It also reduces the computational complexity compared to the fixed-complexity sphere decoder (FSD) algorithm by tree pruning using collaboratively operated node operators. A Monte Carlo simulation shows that our proposed design can be implemented using only half the parallel operators compared to the approach using an ideal fully parallel scheme such as FSD, with only about a 7% increase of the normalized decoding time for MIMO dimensions of $16{\times}16$ with 16-QAM modulation.