Journal of the Korea Institute of Information and Communication Engineering (한국정보통신학회논문지)

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

Depth-first branch-and-bound-based decoder with low complexity

검출 복잡도를 감소 시키는 Depth-first branch and bound 알고리즘 기반 디코더

  • Published : 2009.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, a fast sphere decoder is proposed for the joint detection of phase-shift keying (PSK) signals in uncoded Vertical Bell Laboratories Layered Space Time (V-BLAST) systems. The proposed decoder, PSD, consists of preprocessing stage and search stage. The search stage of PSD relies on the depth-first branch-and-bound (BB) algorithm with "best-first" orders stored in lookup tables. Simulation results show that the PSD is able to provide the system with the maximum likelihood (ML) performance at low complexity.

본 논문에서는 uncoded V-BLAST(Vertical Bell Laboratories Layered Space Time) 시스템에서 PSK 신호들을 joint-detection하기 위한 fast sphere decoder를 제안한다. 이른바 PSD라 불리는 제안된 디코더는 예비처리단계와 검색단계로 구성된다. PSD의 검색단계에서는 depth-first branch and bound 알고리즘을 통해 검출 후보가 되는 신호원들의 최상우선순위(best-first order)를 정하고 이 순위에 따라 신호를 검출하게 된다. 이 때 제안된 디코더는 최상우선순위(best-first order)를 정하는데 있어 계산복잡성을 줄이는 새로운 방법을 제안한다. 시뮬레이션 결과는 PSD에 의해 시스템의 복잡성은 줄이면서 시스템 성능은 ML과 동일하게 유지할 수 있음을 보여준다.

Keywords

References

  1. E. Viterbo and J. Boutros, 'A universal lattice code decoder for fading channels', IEEE Trans. Inform. Theory, vol. 45, pp. 1639-1642, July 1999 https://doi.org/10.1109/18.771234
  2. M.O. Damen, A. Chkeif, and J. Belfiore, 'Lattice code decoder for space-time codes', IEEE Commun. Lett., vol. 4, pp. 161-163, May 2000 https://doi.org/10.1109/4234.846498
  3. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, 'Closest point search in lattices', IEEE Trans. Inform. Theory, vol. 48, no. 8, pp. 2201-2214, Aug. 2002 https://doi.org/10.1109/TIT.2002.800499
  4. 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, Oct. 2003
  5. B. Hassibi and H. Vikalo, 'On the sphere-decoding algorithm I. Expected complexity', IEEE Trans. Signal Processing, vol. 53, no. 8, pp. 2806-2818, Aug. 2005 https://doi.org/10.1109/TSP.2005.850352
  6. A.M. Chan and I. Lee, 'A new reduced-complexity sphere decoder for multiple antenna systems', in Proc. IEEE Int. Conf. Commun., vol. 1, pp. 460-464, May 2002
  7. T. Cui and C. Tellambura, 'Joint channel estimation and data detection for OFDMsystems via sphere decoding', In IEEE Proc. Globecom'04, vol. 6, pp. 3656-3660, Dec. 2004
  8. B.M. Hochwald and S.T. Brink, 'Achieving nearcapacity on a multiple-antenna channel', IEEE Trans. Commun., vol. 51, no. 3, Mar. 2003
  9. D. Pham, K.R. Pattipati, P.K. Willett, and J. Luo, 'An improved complex sphere decoder for V-BLAST systems', IEEE Signal Process. Letter, vol. 11, no. 9, pp. 748-751, Sep. 2004 https://doi.org/10.1109/LSP.2004.833522
  10. J. Luo, K. Pattipati, P. Willett, and L. Brunel, 'Branchand-bound-based fast optimal algorithm for multiuser detection in synchronous CDMA', in Proc. IEEE Int. Conf. Commun., vol. 5, pp. 3336-3340, May 2003
  11. D. Wubben, R. Bohnke, J. Rinas, V. Kuhn, and K. D. Kammeyer, 'Effcient algorithm for decoding layered space-time codes', IEEE Electronics Letters, vol. 37, no.22, pp. 1348-1350, Oct. 2001 https://doi.org/10.1049/el:20010899