A modified sorted-QR decomposition algorithm for parallel processing in MIMO detection
暂无分享,去创建一个
[1] Hyunseok Lee,et al. A Novel Detection Algorithm Using the Sorted QR Decomposition Based on Log-Likelihood Ratio in V-BLAST Systems , 2006, 2006 International Conference on Wireless Communications, Networking and Mobile Computing.
[2] Wai Ho Mow,et al. A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).
[3] Jinkuan Wang,et al. Parallel MIMO detection algorithm based on householder transformation , 2007, 2007 International Symposium on Intelligent Signal Processing and Communication Systems.
[4] Andreas Peter Burg,et al. VLSI Implementation of a High-Speed Iterative Sorted MMSE QR Decomposition , 2007, 2007 IEEE International Symposium on Circuits and Systems.
[5] P. Balsara,et al. A Fixed-Point Implementation for QR Decomposition , 2006, 2006 IEEE Dallas/CAS Workshop on Design, Applications, Integration and Software.
[6] Hsin-Lei Lin,et al. JQRPSD Detection with Low Complexity for SDM MIMO Wireless Communication System , 2007, 2007 International Symposium on VLSI Design, Automation and Test (VLSI-DAT).
[7] Zhongfeng Wang,et al. Improved k-best sphere decoding algorithms for MIMO systems , 2006, 2006 IEEE International Symposium on Circuits and Systems.
[8] E. J. Kontoghiorghes,et al. Stable parallel algorithms for computing and updating the QR decomposition , 1993, Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation.
[9] Linda M. Davis. Scaled and decoupled Cholesky and QR decompositions with application to spherical MIMO detection , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..