Journal of the Institute of Electronics Engineers of Korea TC (대한전자공학회논문지TC)

The Institute of Electronics and Information Engineers (대한전자공학회)
권호 표지

An Efficient K-BEST Lattice Decoding Algorithm Robust to Error Propagation for MIMO Systems

다중 송수신 안테나 시스템 기반에서 오차 전달을 고려한 효율적인 K-BEST 복호화 알고리듬

  • Published : 2005.07.01
Download PDF
⟨ Previous Next ⟩

Abstract

A K-Best algerian is known as optimal for implementing the maximum-likelihood detector (MLD), since it has a fixed maximum complexity compared with the sphere decoding or the maximum-likelihood decoding algorithm. However the computational complexity of the K-Best algrithm is still prohibitively high for practical applications when K is large enough. If small value of K is used, the maximum complexity decreases but error flooring at high SNR is caused by error propagation. In this paper, a K-reduction scheme, which reduces K according to each search level, is proposed to solve error propagation problems. Simulations showed that the proposed scheme provides the improved performance in the bit error rate and also reduces the average complexity compared with the conventional scheme.

K-Best 알고리듬은 일정한 최대 복잡도를 가지기 때문에 ML (Maximum Likelihood) 수신기나 sphere decoding 수신기에 비해 실시간 구현에 적합한 알고리듬으로 알려져 있다. 그러나 ML 수신기에 가까운 성능을 내기 위해 충분히 큰 K값을 적용할 경우 여전히 높은 복잡도를 가지게 되며, 구현에 좀 더 적합하도록 작은 K값을 적용할 경우, 최대 복잡도는 낮아지는 반면오차 전달(error propagation)에 의해 높은 SNR 영역에서 에러 플로링(error flooring)이 발생하는 문제점이 있다. 본 논문에서는 이러한 오차 전달 문제를 해결하기 위해 각 레벨 별로 K값을 감소시키는 K-reduction 기법을 제안하였으며, 모의 실험을 통해 연산량 및 비트 오차 확률 측면에서 이득이 있음을 확인하였다.

Keywords

References

  1. A. Paulraj, R. Nabar and D. Gore, 'Introduction to space-time wireless communications,' Cambridge, U. K.: Cambridge Univ. Press, 2003
  2. P. W. Wolniansky, G. J. Foschini, G. D. Golden, and Valenzuela, 'V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel,' in Proc. 1998 URSI International Symposium on Signals, Systems, and Electronics, pp, 295-300, Sep. 1998 https://doi.org/10.1109/ISSSE.1998.738086
  3. E. Viterbo and J. Boutros, 'A unversal lattice code decoder for fading channels,' IEEE Trans. on Inform. Theory, vol. 45, pp. 1639-1642, July 1999 https://doi.org/10.1109/18.771234
  4. K. Wong, C. Tsui, R. S. Cheng, and W. Mow, 'A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels,' in IEEE International Symposium on Circuits and Systems (ISCAS), vol. 3, pp. III-273 - III-276, May 2002 https://doi.org/10.1109/ISCAS.2002.1010213
  5. A. M. Chan and I. Lee, 'A new reduced-complexity sphere decoder for multiple antenna systems,' IEEE Int Conf. on Comm. pp. 460-464, Apr. 2002 https://doi.org/10.1109/ICC.2002.996896
  6. M. O. Damen, H. E. Gamal, and G. Caire, 'On maximum-likelihood detection and the search for the closest lattice point,' IEEE Trans. on Inform. Theory, vol. 49, pp. 2389-2402, Oct. 2003 https://doi.org/10.1109/TIT.2003.817444