An Efficient Statistical Pruning Algorithm for Fixed-Complexity Sphere Decoder
暂无分享,去创建一个
[1] Giuseppe Caire,et al. On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.
[2] Björn E. Ottersten,et al. On the complexity of sphere decoding in digital communications , 2005, IEEE Transactions on Signal Processing.
[3] Byonghyo Shim,et al. On further reduction of complexity in tree pruning based sphere search , 2010, IEEE Transactions on Communications.
[4] Björn E. Ottersten,et al. The Error Probability of the Fixed-Complexity Sphere Decoder , 2009, IEEE Transactions on Signal Processing.
[5] Byonghyo Shim,et al. Sphere Decoding With a Probabilistic Tree Pruning , 2008, IEEE Transactions on Signal Processing.
[6] J. S. Thompson,et al. Accelerated sphere decoding for multipleinput multiple-output systems using an adaptive statistical threshold , 2009 .
[7] Hyuncheol Park,et al. An Efficient QRD-M Algorithm Using Partial Decision Feedback Detection , 2006, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers.
[8] Reinaldo A. Valenzuela,et al. Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture , 1999 .
[9] Cong Xiong,et al. A simplified fixed-complexity sphere decoder for V-BLAST systems , 2009, IEEE Communications Letters.
[10] John S. Thompson,et al. Fixing the Complexity of the Sphere Decoder for MIMO Detection , 2008, IEEE Transactions on Wireless Communications.