Journal of the Institute of Electronics and Information Engineers (전자공학회논문지)

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

DOI QR Code

A Parallel Sphere Decoder Algorithm for High-order MIMO System

고차 MIMO 시스템을 위한 저 복잡도 병렬 구형 검출 알고리즘

  • Koo, Jihun (Dept. of Electrical and Electronic Engineering, Yonsei University) ;
  • Kim, Jaehoon (High-speed Railroad Systems Research Center, Korea Railroad Research Institute) ;
  • Kim, Yongsuk (Dept. of Electrical and Electronic Engineering, Yonsei University) ;
  • Kim, Jaeseok (Dept. of Electrical and Electronic Engineering, Yonsei University)
  • 구지훈 (연세대학교 전기전자공학부) ;
  • 김재훈 (한국철도기술연구원 첨단고속철도연구실) ;
  • 김용석 (건양대학교 창의융합대학) ;
  • 김재석 (연세대학교 전기전자공학부)
  • Received : 2013.11.05
  • Accepted : 2014.03.01
  • Published : 2014.05.25
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, a low complexity parallel sphere decoder algorithm is proposed for high-order MIMO system. It reduces the computational complexity compared to the fixed-complexity sphere decoder (FSD) algorithm by static tree-pruning and dynamic tree-pruning using scalable node operators, and offers near-maximum likelihood decoding performance. Moreover, it also offers hardware-friendly node operation algorithm through fixing the variable computational complexity caused by the sequential nature of the conventional SD algorithm. A Monte Carlo simulation shows our proposed algorithm decreases the average number of expanded nodes by 55% with only 6.3% increase of the normalized decoding time compared to a full parallelized FSD algorithm for high-order MIMO communication system with 16 QAM modulation.

본 논문에서는 고차 MIMO 시스템을 위한 저 복잡도의 병렬 구형 검출 알고리즘을 제안하였다. 제안된 알고리즘에서는 정적 가지치기와 가변 가능한 다수의 노드연산기에 의한 동적 가지치기 기법을 통해서 종래의 Fixed-complexity sphere decoder(FSD) 알고리즘 대비 더 낮은 복잡도를 갖게 되며, quasi-maximum likelihood 검출 성능을 보인다. 알고리즘과 함께 제안된 노드연산기 또한, 기존 구형검출기의 순차적 연산 구조를 갖는 노드 연산을 고정된 복잡도를 갖도록 제안하여 하드웨어 구현의 용이성을 제공한다. 16QAM 복조를 하는 고차 MIMO 무선통신의 몬테카를로 모의실험을 통해서, 종래의 저 복잡도를 갖는 FSD 알고리즘 대비, 제안된 알고리즘이 평균적으로 단 6.3%의 검출 시간이 증가되면서 평균 55% 탐색노드가 감소하여 연산 복잡도가 낮아지는 것을 보여주었다.

Keywords

References

  1. I. Telatar, "Capacity of multi-antenna Gaussian channels," Eur. Trans. Telecommun., vol. 10, no. 6, pp. 585-596, Dec. 1999. https://doi.org/10.1002/ett.4460100604
  2. E. Biglieri, G. Taricco, "Large-system analysis of multiple antenna system capacities," Journal of Communications and Networks, vol. 5, pp. 5764, Jun. 2003.
  3. F. Rusek, D. Persson, B.K. Lau, E.G. Larsson, T.L. Marzetta, O. Edfors and F. Tufvesson, "Scaling up MIMO: Opportunities and challenges with very large arrays," IEEE Signal Process. Mag., vol. 30, pp. 40-60. Jan. 2013.
  4. Jangyong Park, Minjoon Kim, Hyunsub Kim, and Jaeseok Kim, "A high performance MIMO detection algorithm for DL MU-MIMO with practical errors in IEEE802.11ac systems," in Proc. IEEE Int. Symp. Pers., Indoor, Mobile Radio Commun., Oct. 2013.
  5. M. O. Damen, H. E. Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inform. Theory, vol. 49, no.10, pp. 2389-2402, Oct. 2003. https://doi.org/10.1109/TIT.2003.817444
  6. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Computation, vol. 44, pp. 463-471, Apr. 1985. https://doi.org/10.1090/S0025-5718-1985-0777278-8
  7. C. P. Schnorr and M. Euchner, "Lattice basis reduction: Improved practical algorithms and solving subset sum problems," Math. Programming, vol. 66, pp. 181-191, Aug. 1994. https://doi.org/10.1007/BF01581144
  8. A.Burg, et al., "VLSI implementation of MIMO detection using the sphere decoding algorithm," IEEE Jour. Solid-State Circuits, vol. 40, no. 7, pp1566-1577, Jul. 2005. https://doi.org/10.1109/JSSC.2005.847505
  9. L. G. Barbero and J. S. Thompson, "Fixing the complexity of the Sphere Decoder for MIMO Detector, IEEE Trans. Wireless Commun., vol. 7, pp. 2131-2142, Jun. 2008. https://doi.org/10.1109/TWC.2008.060378
  10. J. Jald'en and B. Ottersten, "On the complexity of sphere decoding in digital communications," IEEE Trans. Signal Process., vol. 53, no. 4, pp. 1474-1484, Apr. 2005. https://doi.org/10.1109/TSP.2005.843746
  11. H. Jang, H. Lee, "Pruning potential prediction in Sphere decoding for MIMO detection," in Proc. IEEK Summer Conference, pp. 411-413, Jun. 2012.
  12. Portugal S., G. Yoon, C. Seo, I. Hwang, "Improvement of the Sphere Decoding Complexity through an Adaptive OSIC-SD System," Journal of IEEK, vol. 48, no. 3, pp. 13-18, 2011.3
  13. Han H, Oh S., "Computational Complexities of Sphere Decoding according to the Initial Radii," International Technical Conference on Circuits Systems, Computers and Communications, pp. 1125-1126, 2005.7
  14. K. Su, I. Berenger, I. J. Wassell and X. Wang, "Efficient maximum-likelihood decoding of spherical lattice codes," IEEE Trans. Commun., vol. 57, pp. 2290-2300, Aug. 2009. https://doi.org/10.1109/TCOMM.2009.08.070329