V-BLAST系统近似最优检测算法研究
|
摘要
贝尔实验室垂直分层空时结构(V-BLAST)是一种追求复用的多天线系统,它能实现很可观的传输速率。因此,它是未来宽带通信系统的重要备选技术。
V-BLAST系统的整体性能和接收机检测算法密切相关。众所周知,最大似然检测是最优的检测算法。然后,它的复杂度随着发送天线的数目增加而指数增长,这妨碍了它在实际系统中的使用。因此,我们很有必要找到低复杂度的近似最优接收机检测算法。
本论文中主要介绍了三类近似最优算法及其改进算法：并行检测算法(PD),固定复杂度的球译码算法(SD)，以及自适应选择幸存路径算法(ASESS)。
目前的并行检测算法有一个通病-它们把部分最大似然检测得到的所有路径等同处理,直到最终的欧氏距离判决。在并行检测算法部分,基于广义并行删除检测算法(GPIC),我们提出了两种简化算法。它们能够提前终止表现很差的路径,也只用后干扰删除处理那些概率较高的错误图样。之后,我们又提出了一种新的部分判决反馈的并行检测算法。计算机仿真表明三种新算法都能在性能和复杂度之间很好的折中。
在固定复杂度的球译码部分,我们引入逐层剪枝的思想,提出了一种简化的固定复杂度的球译码算法。计算及仿真表明在8发8收,16QAM调制的V-BLAST系统中,简化算法的复杂度只有原算法的37%，并且几乎没有性能损失。
在自适应选择幸存路径算法部分,我们提出了一种改进算法。它能在只增加很少复杂度的情况下,是检测性能大幅提升。它的优越性是因为它总能找到最优的M条路径,而原算法只能找到较好的M条路径。
Vertical Bell Laboratories layered space-time (V-BLAST) architecture is a promising multiple-input multiple-output (MIMO) system, which mainly focuses on multiplexing and can provide high speed data rate. Thus, it is an important technique in future broadband wireless communication system.
The overall performance of V-BLAST system is crucially related to the detection algorithm at the receiver. As is well known, the maximum likelihood detection (MLD) yields the optimal detection performance. However, it suffers from an exponential complexity with the number of transmit antennas, making it infeasible for high-dimensional V-BLAST systems. Therefore, it is of great significance to develop low-complexity detection algorithms for near-optimal detection for V-BLAST system.
This thesis mainly deals with three types of near-optimal detection algorithms: parallel detection (PD), fixed-complexity sphere decoder (FSD) and adaptive selection of surviving symbol replica candidates (ASESS) algorithm.
Nevertheless, the existing PD algorithms have a common drawback in equally handling all the branches obtained via partial MLD (PMLD) till reaching the final minimum Euclidean distance (MED) decision. In the PD part, two simplified algorithms are developed from a recently proposed generalized parallel interference cancellation (GPIC) algorithm, by means of early termination of the inferior parallel branches and only dealing with error patterns with high probability. Then, another novel PD with partial decision feedback is developed. Simulation results demonstrate that all the three novel algorithms can approach the near-optimal performance with low complexity.
In the FSD part, a simplified fixed-complexity sphere decoder (SFSD) with much lower computational cost than that of the original FSD is developed for signal detection in V-BLAST system, by pruning the inverted tree layer by layer. Simulation results on a 16-QAM system with 8 transmit and 8 receive antennas show that the SFSD can attain the near-optimal performance with a cost that is about 37% of the counterpart of the original FSD.
In the ASESS part, an improved ASESS detector achieving much performance gain compared with the original ASESS detector at the cost of almost the same computational complexity is investigated. The superiority of the improved ASESS algorithm over the original one is because it always finds out the M optimum paths while the original one can pick out merely M fine paths at each level.
V-BLAST系统的整体性能和接收机检测算法密切相关。众所周知,最大似然检测是最优的检测算法。然后,它的复杂度随着发送天线的数目增加而指数增长,这妨碍了它在实际系统中的使用。因此,我们很有必要找到低复杂度的近似最优接收机检测算法。
本论文中主要介绍了三类近似最优算法及其改进算法：并行检测算法(PD),固定复杂度的球译码算法(SD)，以及自适应选择幸存路径算法(ASESS)。
目前的并行检测算法有一个通病-它们把部分最大似然检测得到的所有路径等同处理,直到最终的欧氏距离判决。在并行检测算法部分,基于广义并行删除检测算法(GPIC),我们提出了两种简化算法。它们能够提前终止表现很差的路径,也只用后干扰删除处理那些概率较高的错误图样。之后,我们又提出了一种新的部分判决反馈的并行检测算法。计算机仿真表明三种新算法都能在性能和复杂度之间很好的折中。
在固定复杂度的球译码部分,我们引入逐层剪枝的思想,提出了一种简化的固定复杂度的球译码算法。计算及仿真表明在8发8收,16QAM调制的V-BLAST系统中,简化算法的复杂度只有原算法的37%，并且几乎没有性能损失。
在自适应选择幸存路径算法部分,我们提出了一种改进算法。它能在只增加很少复杂度的情况下,是检测性能大幅提升。它的优越性是因为它总能找到最优的M条路径,而原算法只能找到较好的M条路径。
Vertical Bell Laboratories layered space-time (V-BLAST) architecture is a promising multiple-input multiple-output (MIMO) system, which mainly focuses on multiplexing and can provide high speed data rate. Thus, it is an important technique in future broadband wireless communication system.
The overall performance of V-BLAST system is crucially related to the detection algorithm at the receiver. As is well known, the maximum likelihood detection (MLD) yields the optimal detection performance. However, it suffers from an exponential complexity with the number of transmit antennas, making it infeasible for high-dimensional V-BLAST systems. Therefore, it is of great significance to develop low-complexity detection algorithms for near-optimal detection for V-BLAST system.
This thesis mainly deals with three types of near-optimal detection algorithms: parallel detection (PD), fixed-complexity sphere decoder (FSD) and adaptive selection of surviving symbol replica candidates (ASESS) algorithm.
Nevertheless, the existing PD algorithms have a common drawback in equally handling all the branches obtained via partial MLD (PMLD) till reaching the final minimum Euclidean distance (MED) decision. In the PD part, two simplified algorithms are developed from a recently proposed generalized parallel interference cancellation (GPIC) algorithm, by means of early termination of the inferior parallel branches and only dealing with error patterns with high probability. Then, another novel PD with partial decision feedback is developed. Simulation results demonstrate that all the three novel algorithms can approach the near-optimal performance with low complexity.
In the FSD part, a simplified fixed-complexity sphere decoder (SFSD) with much lower computational cost than that of the original FSD is developed for signal detection in V-BLAST system, by pruning the inverted tree layer by layer. Simulation results on a 16-QAM system with 8 transmit and 8 receive antennas show that the SFSD can attain the near-optimal performance with a cost that is about 37% of the counterpart of the original FSD.
In the ASESS part, an improved ASESS detector achieving much performance gain compared with the original ASESS detector at the cost of almost the same computational complexity is investigated. The superiority of the improved ASESS algorithm over the original one is because it always finds out the M optimum paths while the original one can pick out merely M fine paths at each level.
引文
[1]I. E. Telatar, "Capacity of Multi-antenna Gaussian Channels," AT&T Bell Laboratories, Tech. Memo, June.1995.
[2]G J.Foschini, "Layered Space-Time Architecture for Wireless Communication in a Fading Environment When using Multi-element Antennas," Bell Labs Tech. J., vol.1, no.2, pp.4 1-59, Autumn,1996.
[3]G.J. Foschini and M. J. Gans, "On limits of wireless communication in a fading Environment when using multiple antennas," Wireless Pers. Commun., vol.6, no.3, pp. 311-335, Mar.1998.
[4]P. W. Wolniansky, G. J. Foschini, G. D. Golden, et al, "V-BLAST:an architecture for realizing very high data rates over the rich-scattering wireless channel," in Proc, ISSSE, Pisa, Italy, Sept. 1998.
[5]M. Sellathurai and S. Haykin, "Turbo-BLAST for wireless communications:theory and experiments," IEEE J. Select. Areas Commun., vol.50, no.10, pp.2538-2546,O ct.2002.
[6]V Tarokh, N. Seshadri, and A. R. Calderbank, "Space-time codes for high data rate wireless communication:performance criterion and code construction," IEEE Trans. Inform. Theory, vol.44, pp.74 4-765, Mar.1998.
[7]S. M. Alamouti, "A simple transmit diversity technique for wireless communications," IEEE J Select. Areas Commun, vol.16, pp.1451-1458, Oct.1998.
[8]V Tarokh, H. Jafarkhani, and A. R. Calderbank, "Space-time block codes from orthogonal designs," IEEE Trans. Inform. Theory, vol.45, pp.1456-1467, July,1999.
[9]T. Keller and L. Hanzo, "Adaptive multicarrier modulation:a convenient frame work for time-frequency processing in wireless communications," Proceedings of the IEEE, vol.88, no.5, pp.611-640, May,2000.
[10]S. K. Lai, R. S.Cheng, K. BenLetaief,et al, "Adaptive trellis coded MQAM and Power optimization for OFDM transmission," in Proc. IEEE VTC'99, Houston, TX, May.1999.
[11]D.P. Palomarand, M..A. Lagunas, "Joint transmit-receive space-time equalization in s patially c orrelated MIMO channels:a beamforming a pproach," IEEEJ Select Areas Commun., vol.21, no.5, pp.730-743, June,2003.
[12]J.C hung, C.H wang, K.Kim, et al, "A random beamforming technique in MIMO systems exploiting multiuser diversity," IEEE J Select. Areas Commun., vol.21, no.5, pp.84 8-855, June,2003.
[13]Z. Zhou, B. Vucetic, M. Dohler, et al, "MIMO systems with adaptive modulation," IEEE Trans. Vehicular Technology, vol.54, no.5, pp.1828-1842, Sept.2005.
[14]Z. Zhou a nd B. Vucetic, "Design of adaptive modulation using imperfect CSI in MIMO systems," IEE Electron. Lett., vol.40, no.17, pp.1073-1075, Aug.2004.
[15]P.X ia, S. Zhou and G. B. G iannakis, "Adaptive MIMO-OFDM based on partial Channel state information," IEEE Trans. Signal Processing, vol.52, no.1, pp.202-213, Jan.2004.
[16]Z. Hu, G Zhu, Y Xia, et al, "Multiuser subcarrier and bit allocation for MIMO-OFDM systems w ith perfect and partial channel information," in Proc. IEEE WCNC'04, March 2004, pp.1188-1193.
[17]H. Sampath and A. Paulraj, "Linear preceding for space-time coded systems with known fading correlations," IEEE Commun. Lett., vol.6, no.6, pp.239-241, June 2001.
[18]L.Dai, S. Sfarand, K.B. Letaief, "Optimal Antenna Selection Based on Capacity Maximization for MIMO Systems in Correlated Channels," IEEE Trans. Commun, vol.54, no.3, pp. 563-573, March,2006.
[19]V Tarokh and H. Jafarkhani, "A differential detection scheme for transmit diversity," IEEE J. Select.Areas Commun.,vol.18,pp.1169-1174, July 2000.
[20]B. M. Hochwald and T. L. Marzetta, "Unitary space-time modulation for multiple-antenna communication in Rayleigh flat-fading," IEEE Trans. Inform. Theory, vol.46, pp.543-564, Mar.2000.
[21]Y. Li and Z. Luo, "Parallel detection for V-BLAST system," in Proc. IEEE Int. Conf. Commun., vol.1, pp.340-344.2002.
[22]Zhendong Luo, Siyang Liu, Ming Zhao, and Yuanan Liu, "Generalized parallel interference cancellation algorithm for V-BLAST systems," in Proc. IEEE Int. Conf. Commun., vol.7, pp. 3207-3212. Jun.2006.
[23]Zhendong Luo, Siyang Liu, Ming Zhao, and Yuanan Liu, "Generalized parallel interference cancellation with near-optimal detection performance," IEEE Trans. Signal Processing, vol. 56, no.1, pp.304-312. Jan.2008.
[24]E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Clostest point search in lattices," IEEE Trans. Inf. Theory, vol.48, no.8, pp.2201-2214, Aug.2002.
[25]M. O. Damen, H. El Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inf. Theory, vol.49, no.10, pp.2389-2402, Oct. 2003.
[26]W. Zhao and G. B. Giannakis, "Sphere decoding algorithms with improved radius search," IEEE Trans. Commun., vol.56, no.6, pp.1104-1109, Jul.2005.
[27]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.
[28]R. Gowaikar and Hassibi, "Statistical pruning for near-maximum likelihood decoding," IEEE Trans. Signal Process., vol.55, no.6, pp.2661-2675, Jun.2007.
[29]B. Shim and I. kang, "Sphere decoding with probabilistic tree pruning," IEEE Trans. Signal. Prcess., vol.56, no.10, pp.4867-4878, Oct.2008.
[30]K. J. Kim, J. Yue, R. A. Iltis, and J. D. Gibson, "A QRD-M/Kalman Filter-Based Detection and Channel Estimation Algorithm for MIMOOFDM Systems," IEEE Trans. Wireless Commun., vol.4, pp.710-721, Mar.2005.
[31]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.
[32]H. Kawai, K. Higuchi, N. Maeda, and M. Sawahashi, "Adaptive Control of Surviving Symbol Replica Candidates in QRM-MLD for OFDM Multiplexing", IEEE J. Sel. Areas Commun., vol. 24, no.6, pp.1130-1140, Jun.2006.
[33]K. Higuchi, H. Kawai, N. Maeda, and M. Sawahashi, "Experiments on Real-Time 1-Gb/s Packet Transmission Using MLD-Based Signal Detection in MIMO-OFDM Broadband Radio Acess," IEEE J. Sel. Areas Commun., vol.24, no.6, pp.1141-1153, Jun.2006.
[34]D. L. Milliner and J. R. Barry, "A Layer-Adaptive M algorithm for Multiple-Input Multiple-Output Channel Detection", in Proc. IEEE Signal Processing Advances in Wireless Communications (SPAWC'07), Jun.2007, pp.1-5.
[35]L. G. Barbero and J. S. Thompson, "Fixing the Complexity of the Sphere Decoder for MIMO Detection," in IEEE Trans. Wireless Commun., vol.7, no.6, pp.2131-2142. June.2008.
[36]J. Cha, J. Ha, and J. Kang, "Low-complexity iterative QRD-M detection algorithm for V-BLAST systems", Electron. Lett., vol.43, pp.1374-1376, Nov.2007.
[37]A. Okawado, R. Matsumoto, and T. Uyematsu, "Near ML dection using Dijkstra's algorithm with bounded list size over MIMO channels", in Proc. IEEE Int. Symp. Information Theory (ISIT'08), Toronto, Ontario, Canada, Jul.2008.
[38]S. R. Lee, T. An, H. G. Kang, and L. Song, "A metric-first Scheme for MIMO signal decoding with branch length threshold," in Proc. IEEE Vehicular Tech. Conf. (VTC'08 fall), Calgary, Canada, Sept.2008.
[39]K. Su, I. Berenguer, I.Wassell, and X. Wang, "Efficient maximumlikehood decoding of spherical lattice codes," in IEEE Trans. Commun., vol.57, no.8, pp.2290-2300. Aug.2009
[1]G. J. Foschini, "Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas," Bell Labs Tech. J., vol.1, no.2, pp.41-59, 1996.
[2]P. W. Wolniansky, G. J. Foschini, G. D. Golden, et al, "V-BLAST:an architecture for realizing very high data rates over the rich-scattering wireless channel," in Proc, ISSSE, Pisa, Italy, Sept. 1998.
[3]G. D. Golden, G. J. Foschini, R. A. Valenzuela, and P. W. Wolniansky, "Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture," Electron. Lett., vol.35, no.1. pp.14-16, Jan.1999.
[4]R. A. Valenzuela, G. J. Foschini, G. D. Golden, "Simplified processing for high spectral efficiency wireless communication employing multi-element arrays," IEEE J. Select. Areas Commun., vol.17, no.11. pp.1841-1852.1999.
[5]E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Clostest point search in lattices," IEEE Trans. Inf. Theory, vol.48, no.8, pp.2201-2214, Aug.2002.
[6]M. O. Damen, H. El Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inf. Theory, vol.49, no.10, pp.2389-2402, Oct. 2003.
[7]W. Zhao and G. B. Giannakis, "Sphere decoding algorithms with improved radius search," IEEE Trans. Commun., vol.56, no.6, pp.1104-1109, Jul.2005.
[8]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.
[9]R. Gowaikar and Hassibi, "Statistical pruning for near-maximum likelihood decoding," IEEE Trans. Signal Process., vol.55, no.6, pp.2661-2675, Jun.2007.
[10]B. Shim and I. kang, "Sphere decoding with probabilistic tree pruning," IEEE Trans. Signal. Prcess., vol.56, no.10, pp.4867-4878, Oct.2008.
[11]K. J. Kim, J. Yue, R. A. Iltis, and J. D. Gibson, "A QRD-M/Kalman Filter-Based Detection and Channel Estimation Algorithm for MIMOOFDM Systems," IEEE Trans. Wireless Commun., vol.4, pp.710-721, Mar.2005.
[12]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.
[13]H. Kawai, K. Higuchi, N. Maeda, and M. Sawahashi, "Adaptive Control of Surviving Symbol Replica Candidates in QRM-MLD for OFDM Multiplexing", IEEE J. Sel. Areas Commun., vol. 24, no.6, pp.1130-1140, Jun.2006.
[14]K. Higuchi, H. Kawai, N. Maeda, and M. Sawahashi, "Experiments on Real-Time 1-Gb/s Packet Transmission Using MLD-Based Signal Detection in MIMO-OFDM Broadband Radio Acess," IEEE J. Sel. Areas Commun., vol.24, no.6, pp.1141-1153, Jun.2006.
[15]D. L. Milliner and J. R. Barry, "A Layer-Adaptive M algorithm for Multiple-Input Multiple-Output Channel Detection", in Proc. IEEE Signal Processing Advances in Wireless Communications (SPAWC'07), Jun.2007, pp.1-5.
[16]L. G. Barbero and J. S. Thompson, "Fixing the Complexity of the Sphere Decoder for MIMO Detection," in IEEE Trans. Wireless Commun., vol.7, no.6, pp.2131-2142. June.2008.
[17]J. Cha, J. Ha, and J. Kang, "Low-complexity iterative QRD-M detection algorithm for V-BLAST systems", Electron. Lett., vol.43, pp.1374-1376, Nov.2007.
[18]A. Okawado, R. Matsumoto, and T. Uyematsu, "Near ML dection using Dijkstra's algorithm with bounded list size over MIMO channels", in Proc. IEEE Int. Symp. Information Theory (ISIT'08), Toronto, Ontario, Canada, Jul.2008.
[19]S. R. Lee, T. An, H. G. Kang, and L. Song, "A metric-first Scheme for MIMO signal decoding with branch length threshold," in Proc. IEEE Vehicular Tech. Conf. (VTC'08 fall), Calgary, Canada, Sept.2008.
[20]K. Su, I. Berenguer, I.Wassell, and X. Wang, "Efficient maximumlikehood decoding of spherical lattice codes," in IEEE Trans. Commun., vol.57, no.8, pp.2290-2300. Aug.2009.
[1]Y. Li and Z. Luo, "Parallel detection for V-BLAST system," in Proc. IEEE Int. Conf. Commun., vol.1, pp.340-344.2002.
[2]Zhendong Luo, Siyang Liu, Ming Zhao, and Yuanan Liu, "Generalized parallel interference cancellation algorithm for V-BLAST systems," in Proc. IEEE Int. Conf. Commun., vol.7, pp. 3207-3212. Jun.2006.
[3]Zhendong Luo, Siyang Liu, Ming Zhao, and Yuanan Liu, "Generalized parallel interference cancellation with near-optimal detection performance," IEEE Trans. Signal Processing, vol. 56, no.1, pp.304-312. Jan.2008.
[4]Cong Xiong, Xin Zhang, He Wang, Kai Wu, Li Chen, and Dacheng Yang, "Simplified Generalized Parallel Interference Cancellation Algorithm for Near-Optimal V-BLAST Detection", in Proc. IEEE Wireless Commun. and Networking Conf.(WCNC'09), Budapest, Hungary, Apr.2009.
[5]Cong Xiong, Xin Zhang, "Parallel Detection Algorithm with Selective Interference Cancellation for V-BLAST Systems", in Proc. IEEE Int. Conf. Commun.(ICC'09), Dresden, Germany, Jun.2009.
[6]J. Jalden, L. G. Barbero, B. Ottersten, and J. S. Thompson, "Full diversity detection in MIMO systems with a fixed-complexity sphere detector," in Proc. IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP'07), vol.3, pp.49-5Honolulu, HI, Apr. 2007.
[7]A. Ben-Israel and T. Greville, Generalized Inverses:Theory and Applications. New York: Wiley,1997.
[8]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.1722-1730, Jul.2003.
[9]D. W. Waters and J. R. Barry, "The chase family of detection algorithms for multiple-input multiple-output channels," in Proc. IEEE Global Telecomm. Conf. (GLOBECOM)., vol.4, pp. 2635-2639.2004.
[10]D. W. Waters and J. R. Barry, "Partial decision-feedback detection for multiple-input multiple-output channels," in Proc. IEEE Int. Conf. Commun.., vol.4, pp.2668-2672.2004.
[11]Cong Xiong, Xin Zhang, Kai Wu, and Dacheng Yang, "An Efficient Parallel Algorithm with Partial Decision Feedback for Near-Optimal MIMO Detection", in Proc. IEEE Global Telecomm. Conf(GLOBECOM'09), Honolulu, Hawaii, USA, Nov.2009.
[12]R. Narasimhan, "Spatial multiplexing with transmit antenna and constellation selection for correlated MIMO fading channels," IEEE Trans. Signal Processing, vol.51, no.11, pp. 2829-2838. Nov.2003.
[13]D. Tse and P. Viswanath, Fundamentals of Wireless Communication. Cambridge:Cambridge University Press,2005.
[14]A. Khoshnevis and A. Sabharwal, "On diversity and multiplexing gain of multiple antenna systems with transmitter channel information," in Proc. Allerton Conference on Communication, Control and Computing, Monticello, IL, Oct.2004.
[1]E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Clostest point search in lattices," IEEE Trans. Inf. Theory, vol.48, no.8, pp.2201-2214, Aug.2002.
[2]M. O. Damen, H. El Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inf. Theory, vol.49, no.10, pp.2389-2402, Oct. 2003.
[3]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.
[4]J. Jalden, L. G. Barbero, B. Ottersten, and J. S. Thompson, "Full diversity detection in MIMO systems with a fixed-complexity sphere detector," in Proc. IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP'07), vol.3, Honolulu, HI, Apr.2007, pp. 49-52.
[5]L. G. Barbero and J. S. Thompson, "Fixing the complexity of the sphere decoder for MIMO detection," IEEE Trans. Wireless Commun., vol.7, no.6, pp.2131-2142, June 2008.
[6]J. Jalden, L. G. Barbero, B. Ottersten, and J. S. Thompson, "The error probability of the fixed-complexity sphere decoder," IEEE Trans. Signal Processing, vol.57, pp.2711-2720, Jul. 2009.
[7]K. J. Kim, J. Yue, R. A. Iltis, and J. D. Gibson, "A QRD-M/Kalman filter-based detection and channel estimation algorithm for MIMO-OFDM systems," IEEE Trans. Wireless Commun., vol.4, pp.710-721, Mar.2005.
[8]Z. Guo and P. Nilsson, "Algorithm and implementation of the K-best sphere decoding for MIMO detection," IEEE J. Select. Areas Commun., vol.24, no.3, pp.491-503, Mar.2006.
[9]Cong Xiong, Xin Zhang, Kai Wu, and Dacheng Yang, "A Simplified Fixed-Complexity Sphere Decoder for V-BLAST Systems", IEEE Communications Letters, vol.13, no.8, pp. 582-584, Aug.2009.
[10]Selection algorithm, From Wikipedia-A free web encyclopedia. [Online]. Available: http://en.wikipedia.org/wiki/Selection algorithm
[11]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, no.6, Jun.2006
[12]Sheng Lei, Cong Xiong, Xin Zhang, and Dacheng Yang, "Adaptive Control of Surviving Branches for Fixed-Complexity Sphere Decoder", accepted by IEEE Vehicular Tech. Conf.(VTC'10-Spring), Taipei, Taiwan, China, May.2010.
[13]X. Wu and J. S. Thompson, "Accelerated sphere decoding for multipleinput multiple-output systems using an adaptive statistical threshold," IET Signal Process., vol.3, no.6, pp.433-444. Nov.2009.
[14]B. Shim and I. Kang, "Sphere decoding with a probabilistic tree pruning," IEEE Trans. Signal Process., vol.56, no.10, pp.4867-4878, Oct.2008.
[15]B. Shim and I. Kang, "On radius control of tree-pruning sphere decoder," in Proc. Int. Conf. Acoust., Speech, Signal Process. (ICASSP'09), Taipei, Taiwan, Apr.2009, pp.2469-2472.
[16]Sheng Lei, Cong Xiong, Xin Zhang, and Dacheng Yang, "An Efficient Statistical Pruning Algorithm for Fixed-Complexity Sphere Decoder", submitted to IEEE ISIT'2010.
[1]K. J. Kim, J. Yue, R. A. Iltis, and J. D. Gibson, "A QRD-M/Kalman Filter-Based Detection and Channel Estimation Algorithm for MIMO-OFDM Systems," IEEE Trans. Wireless Commun.., vol.4., pp.710-721, Mar.2005.
[2]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.
[3]H. Kawai, K. Higuchi, N. Maeda, and M. Sawahashi, "Adaptive Control of Surviving Symbol Replica Candidates in QRM-MLD for OFDM Multiplexing", IEEE J. Sel. Areas Commun., vol. 24, no.6, pp.1130-1140, Jun.2006.
[4]J. Cha, J. Ha, and J. Kang, "Low-complexity Iterative QRD-M Detection Algorithm for V-BLAST Systems", Electron. Lett., vol.43, pp.1374-1376, Nov.2007.
[5]A. Okawado, R. Matsumoto, and T. Uyematsu, "Near ML dection using Dijkstra's algorithm with bounded list size over MIMO channels", in Proc. IEEE Int. Symp. Information Theory (ISIT'08), Jul.2008, pp.2202-2205.
[6]S. Nagayama and T. Hattori, "A Proposal of RM QRM-MLD with independent Aadaptive Control of Surviving Symbol Replica Candidates for MIMO-OFDM System", in IEEE Proc. Vehicular Tech. Conf. (VTC'07 fall), Oct.2007, pp.452-456.
[7]Y. L. C. de Jong and T. J. Willink, "Iterative Tree Search Detection for MIMO Wireless Systems", IEEE Trans. Commun., vol.53, no.6, pp.930-935, Jun.2005.
[8]K. Higuchi, H. Kawai, N. Maeda, and M. Sawahashi, "Adptive selection of surviving symbol replica candidates based on maximum reliability in QRM-MLD for OFCDM MIMO multiplexing", in Proc. IEEE Global Telecomm. Conf. (GLOBECOM'04), Nov.2004, pp. 2480-2486.
[9]K. Higuchi, H. Kawai, N. Maeda, and M. Sawahashi, "Experiments on Real-Time 1-Gb/s Packet Transmission Using MLD-Based Signal Detection in MIMO-OFDM Broadband Radio Acess," IEEE J. Sel. Areas Commun., vol.24, no.6, pp.1141-1153, Jun.2006.
[10]D. L. Milliner and J. R. Barry, "A Layer-Adaptive M algorithm for Multiple-Input Multiple-Output Channel Detection", in IEEE Proc. Signal Processing Advances in Wireless Communications (SPAWC'07), Jun.2007.
[11]T. Detert, "An Efficient Fixed Complexity QRD-M Algorithm for MIMO-OFDM using Per-Survivor Slicing", in IEEE Proc. Int. Symp. Wireless Commun. Systems (ISWCS'07), Oct. 2007, pp.572-576.
[12]Cong Xiong, Xin Zhang, Hua Wu, Dacheng Yang, "An Improved ASESS Detector for MIMO Systems", submitted to IEEE Communications. Letters
[13]J. Kerttula, M.Myllyl a, and M. Juntti, "Implementation of a K-best based MIMO-OFDM detector algorithm", in Proc. European Sign. Proc. Conf., Poznan, Poland, Sept.2007, pp. 2149-2153.
[2]G J.Foschini, "Layered Space-Time Architecture for Wireless Communication in a Fading Environment When using Multi-element Antennas," Bell Labs Tech. J., vol.1, no.2, pp.4 1-59, Autumn,1996.
[3]G.J. Foschini and M. J. Gans, "On limits of wireless communication in a fading Environment when using multiple antennas," Wireless Pers. Commun., vol.6, no.3, pp. 311-335, Mar.1998.
[4]P. W. Wolniansky, G. J. Foschini, G. D. Golden, et al, "V-BLAST:an architecture for realizing very high data rates over the rich-scattering wireless channel," in Proc, ISSSE, Pisa, Italy, Sept. 1998.
[5]M. Sellathurai and S. Haykin, "Turbo-BLAST for wireless communications:theory and experiments," IEEE J. Select. Areas Commun., vol.50, no.10, pp.2538-2546,O ct.2002.
[6]V Tarokh, N. Seshadri, and A. R. Calderbank, "Space-time codes for high data rate wireless communication:performance criterion and code construction," IEEE Trans. Inform. Theory, vol.44, pp.74 4-765, Mar.1998.
[7]S. M. Alamouti, "A simple transmit diversity technique for wireless communications," IEEE J Select. Areas Commun, vol.16, pp.1451-1458, Oct.1998.
[8]V Tarokh, H. Jafarkhani, and A. R. Calderbank, "Space-time block codes from orthogonal designs," IEEE Trans. Inform. Theory, vol.45, pp.1456-1467, July,1999.
[9]T. Keller and L. Hanzo, "Adaptive multicarrier modulation:a convenient frame work for time-frequency processing in wireless communications," Proceedings of the IEEE, vol.88, no.5, pp.611-640, May,2000.
[10]S. K. Lai, R. S.Cheng, K. BenLetaief,et al, "Adaptive trellis coded MQAM and Power optimization for OFDM transmission," in Proc. IEEE VTC'99, Houston, TX, May.1999.
[11]D.P. Palomarand, M..A. Lagunas, "Joint transmit-receive space-time equalization in s patially c orrelated MIMO channels:a beamforming a pproach," IEEEJ Select Areas Commun., vol.21, no.5, pp.730-743, June,2003.
[12]J.C hung, C.H wang, K.Kim, et al, "A random beamforming technique in MIMO systems exploiting multiuser diversity," IEEE J Select. Areas Commun., vol.21, no.5, pp.84 8-855, June,2003.
[13]Z. Zhou, B. Vucetic, M. Dohler, et al, "MIMO systems with adaptive modulation," IEEE Trans. Vehicular Technology, vol.54, no.5, pp.1828-1842, Sept.2005.
[14]Z. Zhou a nd B. Vucetic, "Design of adaptive modulation using imperfect CSI in MIMO systems," IEE Electron. Lett., vol.40, no.17, pp.1073-1075, Aug.2004.
[15]P.X ia, S. Zhou and G. B. G iannakis, "Adaptive MIMO-OFDM based on partial Channel state information," IEEE Trans. Signal Processing, vol.52, no.1, pp.202-213, Jan.2004.
[16]Z. Hu, G Zhu, Y Xia, et al, "Multiuser subcarrier and bit allocation for MIMO-OFDM systems w ith perfect and partial channel information," in Proc. IEEE WCNC'04, March 2004, pp.1188-1193.
[17]H. Sampath and A. Paulraj, "Linear preceding for space-time coded systems with known fading correlations," IEEE Commun. Lett., vol.6, no.6, pp.239-241, June 2001.
[18]L.Dai, S. Sfarand, K.B. Letaief, "Optimal Antenna Selection Based on Capacity Maximization for MIMO Systems in Correlated Channels," IEEE Trans. Commun, vol.54, no.3, pp. 563-573, March,2006.
[19]V Tarokh and H. Jafarkhani, "A differential detection scheme for transmit diversity," IEEE J. Select.Areas Commun.,vol.18,pp.1169-1174, July 2000.
[20]B. M. Hochwald and T. L. Marzetta, "Unitary space-time modulation for multiple-antenna communication in Rayleigh flat-fading," IEEE Trans. Inform. Theory, vol.46, pp.543-564, Mar.2000.
[21]Y. Li and Z. Luo, "Parallel detection for V-BLAST system," in Proc. IEEE Int. Conf. Commun., vol.1, pp.340-344.2002.
[22]Zhendong Luo, Siyang Liu, Ming Zhao, and Yuanan Liu, "Generalized parallel interference cancellation algorithm for V-BLAST systems," in Proc. IEEE Int. Conf. Commun., vol.7, pp. 3207-3212. Jun.2006.
[23]Zhendong Luo, Siyang Liu, Ming Zhao, and Yuanan Liu, "Generalized parallel interference cancellation with near-optimal detection performance," IEEE Trans. Signal Processing, vol. 56, no.1, pp.304-312. Jan.2008.
[24]E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Clostest point search in lattices," IEEE Trans. Inf. Theory, vol.48, no.8, pp.2201-2214, Aug.2002.
[25]M. O. Damen, H. El Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inf. Theory, vol.49, no.10, pp.2389-2402, Oct. 2003.
[26]W. Zhao and G. B. Giannakis, "Sphere decoding algorithms with improved radius search," IEEE Trans. Commun., vol.56, no.6, pp.1104-1109, Jul.2005.
[27]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.
[28]R. Gowaikar and Hassibi, "Statistical pruning for near-maximum likelihood decoding," IEEE Trans. Signal Process., vol.55, no.6, pp.2661-2675, Jun.2007.
[29]B. Shim and I. kang, "Sphere decoding with probabilistic tree pruning," IEEE Trans. Signal. Prcess., vol.56, no.10, pp.4867-4878, Oct.2008.
[30]K. J. Kim, J. Yue, R. A. Iltis, and J. D. Gibson, "A QRD-M/Kalman Filter-Based Detection and Channel Estimation Algorithm for MIMOOFDM Systems," IEEE Trans. Wireless Commun., vol.4, pp.710-721, Mar.2005.
[31]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.
[32]H. Kawai, K. Higuchi, N. Maeda, and M. Sawahashi, "Adaptive Control of Surviving Symbol Replica Candidates in QRM-MLD for OFDM Multiplexing", IEEE J. Sel. Areas Commun., vol. 24, no.6, pp.1130-1140, Jun.2006.
[33]K. Higuchi, H. Kawai, N. Maeda, and M. Sawahashi, "Experiments on Real-Time 1-Gb/s Packet Transmission Using MLD-Based Signal Detection in MIMO-OFDM Broadband Radio Acess," IEEE J. Sel. Areas Commun., vol.24, no.6, pp.1141-1153, Jun.2006.
[34]D. L. Milliner and J. R. Barry, "A Layer-Adaptive M algorithm for Multiple-Input Multiple-Output Channel Detection", in Proc. IEEE Signal Processing Advances in Wireless Communications (SPAWC'07), Jun.2007, pp.1-5.
[35]L. G. Barbero and J. S. Thompson, "Fixing the Complexity of the Sphere Decoder for MIMO Detection," in IEEE Trans. Wireless Commun., vol.7, no.6, pp.2131-2142. June.2008.
[36]J. Cha, J. Ha, and J. Kang, "Low-complexity iterative QRD-M detection algorithm for V-BLAST systems", Electron. Lett., vol.43, pp.1374-1376, Nov.2007.
[37]A. Okawado, R. Matsumoto, and T. Uyematsu, "Near ML dection using Dijkstra's algorithm with bounded list size over MIMO channels", in Proc. IEEE Int. Symp. Information Theory (ISIT'08), Toronto, Ontario, Canada, Jul.2008.
[38]S. R. Lee, T. An, H. G. Kang, and L. Song, "A metric-first Scheme for MIMO signal decoding with branch length threshold," in Proc. IEEE Vehicular Tech. Conf. (VTC'08 fall), Calgary, Canada, Sept.2008.
[39]K. Su, I. Berenguer, I.Wassell, and X. Wang, "Efficient maximumlikehood decoding of spherical lattice codes," in IEEE Trans. Commun., vol.57, no.8, pp.2290-2300. Aug.2009
[1]G. J. Foschini, "Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas," Bell Labs Tech. J., vol.1, no.2, pp.41-59, 1996.
[2]P. W. Wolniansky, G. J. Foschini, G. D. Golden, et al, "V-BLAST:an architecture for realizing very high data rates over the rich-scattering wireless channel," in Proc, ISSSE, Pisa, Italy, Sept. 1998.
[3]G. D. Golden, G. J. Foschini, R. A. Valenzuela, and P. W. Wolniansky, "Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture," Electron. Lett., vol.35, no.1. pp.14-16, Jan.1999.
[4]R. A. Valenzuela, G. J. Foschini, G. D. Golden, "Simplified processing for high spectral efficiency wireless communication employing multi-element arrays," IEEE J. Select. Areas Commun., vol.17, no.11. pp.1841-1852.1999.
[5]E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Clostest point search in lattices," IEEE Trans. Inf. Theory, vol.48, no.8, pp.2201-2214, Aug.2002.
[6]M. O. Damen, H. El Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inf. Theory, vol.49, no.10, pp.2389-2402, Oct. 2003.
[7]W. Zhao and G. B. Giannakis, "Sphere decoding algorithms with improved radius search," IEEE Trans. Commun., vol.56, no.6, pp.1104-1109, Jul.2005.
[8]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.
[9]R. Gowaikar and Hassibi, "Statistical pruning for near-maximum likelihood decoding," IEEE Trans. Signal Process., vol.55, no.6, pp.2661-2675, Jun.2007.
[10]B. Shim and I. kang, "Sphere decoding with probabilistic tree pruning," IEEE Trans. Signal. Prcess., vol.56, no.10, pp.4867-4878, Oct.2008.
[11]K. J. Kim, J. Yue, R. A. Iltis, and J. D. Gibson, "A QRD-M/Kalman Filter-Based Detection and Channel Estimation Algorithm for MIMOOFDM Systems," IEEE Trans. Wireless Commun., vol.4, pp.710-721, Mar.2005.
[12]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.
[13]H. Kawai, K. Higuchi, N. Maeda, and M. Sawahashi, "Adaptive Control of Surviving Symbol Replica Candidates in QRM-MLD for OFDM Multiplexing", IEEE J. Sel. Areas Commun., vol. 24, no.6, pp.1130-1140, Jun.2006.
[14]K. Higuchi, H. Kawai, N. Maeda, and M. Sawahashi, "Experiments on Real-Time 1-Gb/s Packet Transmission Using MLD-Based Signal Detection in MIMO-OFDM Broadband Radio Acess," IEEE J. Sel. Areas Commun., vol.24, no.6, pp.1141-1153, Jun.2006.
[15]D. L. Milliner and J. R. Barry, "A Layer-Adaptive M algorithm for Multiple-Input Multiple-Output Channel Detection", in Proc. IEEE Signal Processing Advances in Wireless Communications (SPAWC'07), Jun.2007, pp.1-5.
[16]L. G. Barbero and J. S. Thompson, "Fixing the Complexity of the Sphere Decoder for MIMO Detection," in IEEE Trans. Wireless Commun., vol.7, no.6, pp.2131-2142. June.2008.
[17]J. Cha, J. Ha, and J. Kang, "Low-complexity iterative QRD-M detection algorithm for V-BLAST systems", Electron. Lett., vol.43, pp.1374-1376, Nov.2007.
[18]A. Okawado, R. Matsumoto, and T. Uyematsu, "Near ML dection using Dijkstra's algorithm with bounded list size over MIMO channels", in Proc. IEEE Int. Symp. Information Theory (ISIT'08), Toronto, Ontario, Canada, Jul.2008.
[19]S. R. Lee, T. An, H. G. Kang, and L. Song, "A metric-first Scheme for MIMO signal decoding with branch length threshold," in Proc. IEEE Vehicular Tech. Conf. (VTC'08 fall), Calgary, Canada, Sept.2008.
[20]K. Su, I. Berenguer, I.Wassell, and X. Wang, "Efficient maximumlikehood decoding of spherical lattice codes," in IEEE Trans. Commun., vol.57, no.8, pp.2290-2300. Aug.2009.
[1]Y. Li and Z. Luo, "Parallel detection for V-BLAST system," in Proc. IEEE Int. Conf. Commun., vol.1, pp.340-344.2002.
[2]Zhendong Luo, Siyang Liu, Ming Zhao, and Yuanan Liu, "Generalized parallel interference cancellation algorithm for V-BLAST systems," in Proc. IEEE Int. Conf. Commun., vol.7, pp. 3207-3212. Jun.2006.
[3]Zhendong Luo, Siyang Liu, Ming Zhao, and Yuanan Liu, "Generalized parallel interference cancellation with near-optimal detection performance," IEEE Trans. Signal Processing, vol. 56, no.1, pp.304-312. Jan.2008.
[4]Cong Xiong, Xin Zhang, He Wang, Kai Wu, Li Chen, and Dacheng Yang, "Simplified Generalized Parallel Interference Cancellation Algorithm for Near-Optimal V-BLAST Detection", in Proc. IEEE Wireless Commun. and Networking Conf.(WCNC'09), Budapest, Hungary, Apr.2009.
[5]Cong Xiong, Xin Zhang, "Parallel Detection Algorithm with Selective Interference Cancellation for V-BLAST Systems", in Proc. IEEE Int. Conf. Commun.(ICC'09), Dresden, Germany, Jun.2009.
[6]J. Jalden, L. G. Barbero, B. Ottersten, and J. S. Thompson, "Full diversity detection in MIMO systems with a fixed-complexity sphere detector," in Proc. IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP'07), vol.3, pp.49-5Honolulu, HI, Apr. 2007.
[7]A. Ben-Israel and T. Greville, Generalized Inverses:Theory and Applications. New York: Wiley,1997.
[8]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.1722-1730, Jul.2003.
[9]D. W. Waters and J. R. Barry, "The chase family of detection algorithms for multiple-input multiple-output channels," in Proc. IEEE Global Telecomm. Conf. (GLOBECOM)., vol.4, pp. 2635-2639.2004.
[10]D. W. Waters and J. R. Barry, "Partial decision-feedback detection for multiple-input multiple-output channels," in Proc. IEEE Int. Conf. Commun.., vol.4, pp.2668-2672.2004.
[11]Cong Xiong, Xin Zhang, Kai Wu, and Dacheng Yang, "An Efficient Parallel Algorithm with Partial Decision Feedback for Near-Optimal MIMO Detection", in Proc. IEEE Global Telecomm. Conf(GLOBECOM'09), Honolulu, Hawaii, USA, Nov.2009.
[12]R. Narasimhan, "Spatial multiplexing with transmit antenna and constellation selection for correlated MIMO fading channels," IEEE Trans. Signal Processing, vol.51, no.11, pp. 2829-2838. Nov.2003.
[13]D. Tse and P. Viswanath, Fundamentals of Wireless Communication. Cambridge:Cambridge University Press,2005.
[14]A. Khoshnevis and A. Sabharwal, "On diversity and multiplexing gain of multiple antenna systems with transmitter channel information," in Proc. Allerton Conference on Communication, Control and Computing, Monticello, IL, Oct.2004.
[1]E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Clostest point search in lattices," IEEE Trans. Inf. Theory, vol.48, no.8, pp.2201-2214, Aug.2002.
[2]M. O. Damen, H. El Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inf. Theory, vol.49, no.10, pp.2389-2402, Oct. 2003.
[3]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.
[4]J. Jalden, L. G. Barbero, B. Ottersten, and J. S. Thompson, "Full diversity detection in MIMO systems with a fixed-complexity sphere detector," in Proc. IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP'07), vol.3, Honolulu, HI, Apr.2007, pp. 49-52.
[5]L. G. Barbero and J. S. Thompson, "Fixing the complexity of the sphere decoder for MIMO detection," IEEE Trans. Wireless Commun., vol.7, no.6, pp.2131-2142, June 2008.
[6]J. Jalden, L. G. Barbero, B. Ottersten, and J. S. Thompson, "The error probability of the fixed-complexity sphere decoder," IEEE Trans. Signal Processing, vol.57, pp.2711-2720, Jul. 2009.
[7]K. J. Kim, J. Yue, R. A. Iltis, and J. D. Gibson, "A QRD-M/Kalman filter-based detection and channel estimation algorithm for MIMO-OFDM systems," IEEE Trans. Wireless Commun., vol.4, pp.710-721, Mar.2005.
[8]Z. Guo and P. Nilsson, "Algorithm and implementation of the K-best sphere decoding for MIMO detection," IEEE J. Select. Areas Commun., vol.24, no.3, pp.491-503, Mar.2006.
[9]Cong Xiong, Xin Zhang, Kai Wu, and Dacheng Yang, "A Simplified Fixed-Complexity Sphere Decoder for V-BLAST Systems", IEEE Communications Letters, vol.13, no.8, pp. 582-584, Aug.2009.
[10]Selection algorithm, From Wikipedia-A free web encyclopedia. [Online]. Available: http://en.wikipedia.org/wiki/Selection algorithm
[11]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, no.6, Jun.2006
[12]Sheng Lei, Cong Xiong, Xin Zhang, and Dacheng Yang, "Adaptive Control of Surviving Branches for Fixed-Complexity Sphere Decoder", accepted by IEEE Vehicular Tech. Conf.(VTC'10-Spring), Taipei, Taiwan, China, May.2010.
[13]X. Wu and J. S. Thompson, "Accelerated sphere decoding for multipleinput multiple-output systems using an adaptive statistical threshold," IET Signal Process., vol.3, no.6, pp.433-444. Nov.2009.
[14]B. Shim and I. Kang, "Sphere decoding with a probabilistic tree pruning," IEEE Trans. Signal Process., vol.56, no.10, pp.4867-4878, Oct.2008.
[15]B. Shim and I. Kang, "On radius control of tree-pruning sphere decoder," in Proc. Int. Conf. Acoust., Speech, Signal Process. (ICASSP'09), Taipei, Taiwan, Apr.2009, pp.2469-2472.
[16]Sheng Lei, Cong Xiong, Xin Zhang, and Dacheng Yang, "An Efficient Statistical Pruning Algorithm for Fixed-Complexity Sphere Decoder", submitted to IEEE ISIT'2010.
[1]K. J. Kim, J. Yue, R. A. Iltis, and J. D. Gibson, "A QRD-M/Kalman Filter-Based Detection and Channel Estimation Algorithm for MIMO-OFDM Systems," IEEE Trans. Wireless Commun.., vol.4., pp.710-721, Mar.2005.
[2]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.
[3]H. Kawai, K. Higuchi, N. Maeda, and M. Sawahashi, "Adaptive Control of Surviving Symbol Replica Candidates in QRM-MLD for OFDM Multiplexing", IEEE J. Sel. Areas Commun., vol. 24, no.6, pp.1130-1140, Jun.2006.
[4]J. Cha, J. Ha, and J. Kang, "Low-complexity Iterative QRD-M Detection Algorithm for V-BLAST Systems", Electron. Lett., vol.43, pp.1374-1376, Nov.2007.
[5]A. Okawado, R. Matsumoto, and T. Uyematsu, "Near ML dection using Dijkstra's algorithm with bounded list size over MIMO channels", in Proc. IEEE Int. Symp. Information Theory (ISIT'08), Jul.2008, pp.2202-2205.
[6]S. Nagayama and T. Hattori, "A Proposal of RM QRM-MLD with independent Aadaptive Control of Surviving Symbol Replica Candidates for MIMO-OFDM System", in IEEE Proc. Vehicular Tech. Conf. (VTC'07 fall), Oct.2007, pp.452-456.
[7]Y. L. C. de Jong and T. J. Willink, "Iterative Tree Search Detection for MIMO Wireless Systems", IEEE Trans. Commun., vol.53, no.6, pp.930-935, Jun.2005.
[8]K. Higuchi, H. Kawai, N. Maeda, and M. Sawahashi, "Adptive selection of surviving symbol replica candidates based on maximum reliability in QRM-MLD for OFCDM MIMO multiplexing", in Proc. IEEE Global Telecomm. Conf. (GLOBECOM'04), Nov.2004, pp. 2480-2486.
[9]K. Higuchi, H. Kawai, N. Maeda, and M. Sawahashi, "Experiments on Real-Time 1-Gb/s Packet Transmission Using MLD-Based Signal Detection in MIMO-OFDM Broadband Radio Acess," IEEE J. Sel. Areas Commun., vol.24, no.6, pp.1141-1153, Jun.2006.
[10]D. L. Milliner and J. R. Barry, "A Layer-Adaptive M algorithm for Multiple-Input Multiple-Output Channel Detection", in IEEE Proc. Signal Processing Advances in Wireless Communications (SPAWC'07), Jun.2007.
[11]T. Detert, "An Efficient Fixed Complexity QRD-M Algorithm for MIMO-OFDM using Per-Survivor Slicing", in IEEE Proc. Int. Symp. Wireless Commun. Systems (ISWCS'07), Oct. 2007, pp.572-576.
[12]Cong Xiong, Xin Zhang, Hua Wu, Dacheng Yang, "An Improved ASESS Detector for MIMO Systems", submitted to IEEE Communications. Letters
[13]J. Kerttula, M.Myllyl a, and M. Juntti, "Implementation of a K-best based MIMO-OFDM detector algorithm", in Proc. European Sign. Proc. Conf., Poznan, Poland, Sept.2007, pp. 2149-2153.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |