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

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

Design and Implementation of Efficient Symbol Detector for MIMO Spatial Multiplexing Systems

MIMO 공간 다중화 시스템을 위한 효율적인 심볼 검출기의 설계 및 구현

  • 정윤호 (한국항공대학교 항공전자및정보통신공학부)
  • Published : 2008.10.25
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we propose an efficient symbol detection algorithm for multiple-input multiple-output spatial multiplexing (MIMO-SM) systems and present its design and implementation results. By enhancing the performance of the first detected symbol which causes error propagation, the proposed algorithm achieves a considerable performance gain as compared to the conventional sorted QR decomposition (SQRD) based detection and the ordered successive detection (OSD) algorithms. The bit error rate (BER) performance of the proposed detection algorithm is evaluated by the simulation. In case of 16QAM MIMO-SM system with 4 transmit and 4 receive ($4{\times}4$) antennas, at $BER=10^{-3}$ the proposed algorithm obtains the gai improvement of about 2.5-13.5 dB over the conventional algorithms. The proposed detection algorithm was designed in a hardware description language (HDL) and synthesized to gate-level circuits using 0.18um 1.8V CMOS standard cell library. The results show that the proposed algorithm can be implemented without increasing the hardware costs significantly.

본 논문에서는 다중 입출력 (MIMO) 공간다중화 (spatial multiplelxing, SM) 시스템을 위한 효율적인 심볼 검출 알고리즘이 제안되고, 이의 최적 설계 및 구현 결과가 제시된다. 에러 전파 (error propagation)을 야기하는 첫 검출 심볼의 검출 성능을 개선시킴으로써, 제안된 알고리즘은 기존의 정렬된 QR 분해 (sorted QR decomposition, SQRD) 기반 알고리즘이나 정렬된 순차적 검출 (ordered successive detection, OSD) 알고리즘에 비해 성능 이득을 얻을 수 있다. 4개의 송수신 안테나를 갖는 16QAM MIMO-SM 시스템에 대한 성능 평가 결과, 제안된 알고리즘은 기존 알고리즘에 비해 $10^{-3}$의 EBR에서 약 2.5-13.5 dB의 성능 이득을 얻음을 확인하였다. 제안된 알고리즘은 하드웨어 설계 언어를 이용하여 설계 되었고, 0.18um CMOS 표준 셀 공정 라이브러리를 이용하여 합성 및 구현되었다. 구현결과, 제안된 알고리즘은 하드웨어의 큰 증가없이 구현 가능함을 확인할 수 있었다.

Keywords

References

  1. G. J. Foschini, "Layered space-time architecture for wireless communication in a fading environment using multi-element antennas," Bell Labs. Tech. J., vol. 1, pp. 41-59, 1996 https://doi.org/10.1002/bltj.2015
  2. Wong Kwan Wai, Chi-Ying Tsui, and R. Cheng, "A low complexity architecture of the V-BLAST system," IEEE Wireless Communications and Networking Conference (WCNC'00), vol. 1, pp. 310-314, Sep. 2000
  3. Y. Jung, J. Kim, S. Lee, H. Yoon and J. Kim, "Design and Implementation of MIMO-OFDM Baseband Processor for High-Speed Wireless LANs," IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 54, pp. 631-635, 2007 https://doi.org/10.1109/TCSII.2007.895330
  4. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inform. Theory, vol. 45, pp. 1639-1642, 1999 https://doi.org/10.1109/18.771234
  5. M.O. Damen, A. Chkeif and J.-C. Belfiore, "Lattice code decoder for space-time codes," IEEE Commun. Lett., vol. 4, pp. 161-163, 2000 https://doi.org/10.1109/4234.846498
  6. B.M. Hochwald and S. ten Brink, "Achieving near-capacity on a multiple-antenna channels," IEEE Trans. Commun., vol. 51, pp. 389-399, 2003 https://doi.org/10.1109/TCOMM.2003.809789
  7. B. Hassibi and H. Vikalo, "On sphere decoding algorithm, Part I: expected complexity, Part II: generalizations, second-order statistics, and applications to communications," submitted to IEEE Trans. Signal Processing, 2003
  8. O. M. Damen, H. E. Gamal and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," vol. 49, pp. 2389-2402, 2003 https://doi.org/10.1109/TIT.2003.817444
  9. J. Jalden and B. Ottersten, "An exponential lower bound on the expected complexity of sphere decoding," ICASSP'04, vol. 4, pp. 393-396, 2004
  10. H. Kawai, K. Higuchi, N. Maeda and M. Sawahashi, "Adaptive control of surviving symbol replica candidates in QRM-MLD for OFDM MIMO multiplexing," IEEE J. Sel. Areas Commun., vol. 24, pp. 1130-1140, 2006 https://doi.org/10.1109/JSAC.2005.864027
  11. C. Stuber, A. Burg and H. Bolcskei, "Soft- output sphere decoding: algorithms and VLSI implementation," IEEE J. Sel. Areas Commun., vol. 26, pp. 290-300, 2008 https://doi.org/10.1109/JSAC.2008.080206
  12. B. Hassibi, "An efficient square-root algorithm for BLAST," ICASSP'00, vol. 2, pp. 737-740, Jun. 2000
  13. D. Wubben, R. Bohnke, J. Rinas, V. Kuhn, and K. D. Kammeyer, "Efficient algorithm for decoding layered space-time codes," IEE Electron. Lett., vol. 37, no. 22, pp. 1348-1350, Oct. 2001 https://doi.org/10.1049/el:20010899
  14. J. Benesty, Y. Huang, and J. Chen, "A fast recursive algorithm for optimum sequential signal detection in a BLAST system," IEEE Trans. Signal Processing, vol. 51, no. 7, pp. 1772-1730, Jul. 2003
  15. H. Zhu, Z. Lei, and F. Chin, "An improved square-root algorithm for BLAST," IEEE Signal Processing Lett., vol. 11, no. 9, pp. 772-755, Sep. 2004 https://doi.org/10.1109/LSP.2004.833483
  16. D. Wubben, R. Bohnke, V. Kuhn, and K. D. Kammeyer, "MMSE extension of V-BLAST based on sorted QR decomposition," VTC'03- Fall, vol. 1, pp. 508-512, Oct. 2003
  17. B. Vucetic and J. Yuan, "Space-Time Coding," John Wiley & Sons, 2003