최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기한국통신학회논문지. The Journal of Korea Information and Communications Society. 통신이론 및 시스템, v.36 no.1C, 2011년, pp.37 - 47
이명수 (성균관대학교 정보통신공학부) , 이영포 (성균관대학교 정보통신공학부) , 송익호 (한국과학기술원 전기및전자공학과) , 윤석호 (성균관대학교 정보통신공학부)
In this paper, we propose a novel ML decoding scheme based on the combination of depth- and breadth-first search methods on a partitioned tree for multiple input multiple output systems. The proposed scheme first partitions the searching tree into several stages, each of which is then searched by a ...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
G. D. Golden, G. J. Foschini, R. A. Valenzuela, and P. W. Wolniansky, "Detection algorithm and initial laboratory results using the V-BLAST space-time communication architecture," Electron. Lett., Vol.35, No.1, pp.14-16, Jan. 1999.
I. E. Telater, "Capacity of multi-antenna Gaussian channels," European Trans. Telecommun., Vol.10, pp.585-596, Nov./Dec. 1999.
H. Artes, D. Seethaler, and F. Hlawatsch, "Efficient detection algorithms for MIMO channels: a geometrical approach to approximate ML detection," IEEE Trans. Sig. Process., Vol.51, No.11, pp.2808-2820, Nov. 2003.
W. Zhao and G. B. Giannakis, "Reduced complexity closest point decoding algorithms for random lattices," IEEE Trans. Wireless Commun., Vol.5, No.1, pp.101-111, Jan. 2006.
T. H. Khine, K. Fukawa, and H. Suzuki, "Suboptimal algorithm of MLD using gradient signal search in direction of noise enhancement for MIMO channels," IEICE Trans. Commun., Vol.E90-B, No.6, pp.1424-1432, June 2007.
J. Li, F. F. Cao, and J. Yang, "Low-complexity algorithm for near-optimum detection of V-BLAST systems," IEEE Sig. Process. Lett., Vol.14, No.9, pp.593-596, Sep. 2007.
K. Higuchi, H. Kawai, N. Maeda, H Taoka, and M Sawahashi, "Experiments on real-Time 1-Gb/s packet transmission using MLD-based signal detection in MIMO-OFDM broadband radio access," IEEE J. Sel. Areas Commun., Vol.24, No.6, pp.1141-1153, June 2006.
L. Babai, "On Lovasz' lattice reduction and the nearest lattice point problem," Combinatorica, Vol.6, No.1, pp.1-13, Mar. 1986.
U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Comp., Vol.44, No.170, pp.463-471, Apr. 1985.
E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inform. Theory, Vol.45, No.5, pp.1639-1642, July 1999.
B. Hochwald and S. ten Brink, "Achieving near capacity on a multiple antenna channel," IEEE Trans. Commun., Vol.51, No.3, pp.389-399, Mar. 2003.
B. Hassibi and H. Vikalo, "On the sphere-decoding algorithm I. expected complexity," IEEE Trans. Sig. Process., Vol.53, No.8, pp.2806-2818, Aug. 2005.
J. Jalden and B. Ottersten, "On the complexity of sphere decoding in digital communications," IEEE Trans. Sig. Process., Vol.53, No.4, pp.1474-1484, Apr. 2005.
H. G. Kang, I. Song, J. Oh, J. Lee, and S. Yoon, "Breadth-first signal decoder (BSIDE): a novel maximum likelihood scheme for multi-input multi-output systems", IEEE Trans. Vehicle Technol., Vol.57, No.3, pp.1576-1584, Mar. 2008.
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.
G. Valiente, Algorithms on Trees and Graphs, Springer, 2002.
Z. Guo and P. Nilsson, "Algorithm and implementation of the K-best sphere decoding for MIMO detection," IEEE J. Sel. Areas Commun., Vol.24, No.3, pp.491-503, Mar. 2006.
G. H. Golub and C. F. Van Loan, Matrix Computations, Johns Hopkins University Press, 1996.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
Free Access. 출판사/학술단체 등이 허락한 무료 공개 사이트를 통해 자유로운 이용이 가능한 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.