Achieving a Vanishing SNR Gap to Exact Lattice Decoding at a Subexponential Complexity
暂无分享,去创建一个
[1] Amir Dembo,et al. Large Deviations Techniques and Applications , 1998 .
[2] J. Radon. Lineare scharen orthogonaler matrizen , 1922 .
[3] Amir K. Khandani,et al. On the Limitations of the Naive Lattice Decoding , 2010, IEEE Transactions on Information Theory.
[4] Joakim Jaldén,et al. DMT Optimality of LR-Aided Linear Decoders for a General Class of Channels, Lattice Designs, and System Models , 2009, IEEE Transactions on Information Theory.
[5] B. Sundar Rajan,et al. Full-diversity, high-rate space-time block codes from division algebras , 2003, IEEE Trans. Inf. Theory.
[6] Joakim Jaldén,et al. The complexity of sphere decoding perfect codes under a vanishing gap to ML performance , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.
[7] Emanuele Viterbo,et al. A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.
[8] Dirk Wübben,et al. Near-maximum-likelihood detection of MIMO systems using MMSE-based lattice reduction , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).
[9] Lutz H.-J. Lampe,et al. On the Complexity of Sphere Decoding for Differential Detection , 2007, IEEE Transactions on Information Theory.
[10] László Babai,et al. On Lovász’ lattice reduction and the nearest lattice point problem , 1986, Comb..
[11] Michael P. Fitz,et al. Iterative Sphere Detectors for Imperfect Channel State Information , 2011, IEEE Transactions on Communications.
[12] Gerald Matz,et al. Worst- and average-case complexity of LLL lattice reduction in MIMO wireless systems , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.
[13] Gregory W. Wornell,et al. Lattice-reduction-aided detectors for MIMO communication systems , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.
[14] Nigel Boston,et al. When is limited feedback for transmit beamforming beneficial? , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[15] Antonia Maria Tulino,et al. Random Matrix Theory and Wireless Communications , 2004, Found. Trends Commun. Inf. Theory.
[16] Sergey Loyka,et al. Finite-SNR Diversity-Multiplexing Tradeoff via Asymptotic Analysis of Large MIMO Systems , 2010, IEEE Transactions on Information Theory.
[17] Cong Ling,et al. On the Proximity Factors of Lattice Reduction-Aided Decoding , 2010, IEEE Transactions on Signal Processing.
[18] J. Jaldén,et al. General DMT optimality of LR-aided linear MIMO-MAC transceivers with worst-case complexity at most linear in sum-rate , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).
[19] Daniele Micciancio,et al. The hardness of the closest vector problem with preprocessing , 2001, IEEE Trans. Inf. Theory.
[20] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[21] Jacob Goldberger,et al. MIMO Detection for High-Order QAM Based on a Gaussian Tree Approximation , 2010, IEEE Transactions on Information Theory.
[22] Giuseppe Caire,et al. On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.
[23] Erik Agrell,et al. Faster Recursions in Sphere Decoding , 2009, IEEE Transactions on Information Theory.
[24] Wing-Kin Ma,et al. A Lagrangian dual relaxation approach to ML MIMO detection: Reinterpreting regularized lattice decoding , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
[25] Frédérique E. Oggier,et al. Perfect Space–Time Block Codes , 2006, IEEE Transactions on Information Theory.
[26] Lei Zhao,et al. Diversity and Multiplexing Tradeoff in General Fading Channels , 2006, 2006 40th Annual Conference on Information Sciences and Systems.
[27] P. Vijay Kumar,et al. Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff , 2006, IEEE Transactions on Information Theory.
[28] Giuseppe Caire,et al. Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels , 2004, IEEE Transactions on Information Theory.
[29] Alexandros G. Dimakis,et al. Near-Optimal Detection in MIMO Systems Using Gibbs Sampling , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.
[30] Joakim Jaldén,et al. Sphere Decoding Complexity Exponent for Decoding Full-Rate Codes Over the Quasi-Static MIMO Channel , 2011, IEEE Transactions on Information Theory.
[31] Lizhong Zheng,et al. Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.
[32] El-KhamyMostafa,et al. Performance of sphere decoding of block codes , 2009 .
[33] Helmut Bölcskei,et al. Tail behavior of sphere-decoding complexity in random lattices , 2009, 2009 IEEE International Symposium on Information Theory.
[34] B. Sundar Rajan,et al. A novel MCMC algorithm for near-optimal detection in large-scale uplink mulituser MIMO systems , 2012, 2012 Information Theory and Applications Workshop.
[35] Giuseppe Caire,et al. A unified framework for tree search decoding: rediscovering the sequential decoder , 2005, IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005..
[36] Helmut Bölcskei,et al. On the Complexity Distribution of Sphere Decoding , 2011, IEEE Transactions on Information Theory.
[37] Amir K. Khandani,et al. LLL Reduction Achieves the Receive Diversity in MIMO Decoding , 2006, IEEE Transactions on Information Theory.
[38] Andrew C. Singer,et al. Efficient Soft-Input Soft-Output Tree Detection via an Improved Path Metric , 2011, IEEE Transactions on Information Theory.
[39] Roger F. Woods,et al. Real-Valued Fixed-Complexity Sphere Decoder for High Dimensional QAM-MIMO Systems , 2011, IEEE Transactions on Signal Processing.
[40] N. H. Bingham,et al. LARGE DEVIATIONS TECHNIQUES AND APPLICATIONS , 1994 .
[41] Pramod Viswanath,et al. Approximately universal codes over slow-fading channels , 2005, IEEE Transactions on Information Theory.
[42] Alexander Vardy,et al. Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.
[43] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[44] Christopher Holden,et al. Perfect Space-Time Block Codes , 2004 .
[45] Babak Hassibi,et al. On the Performance of Sphere Decoding of Block Codes , 2009, 2006 IEEE International Symposium on Information Theory.
[46] Robert F. H. Fischer,et al. Low-complexity near-maximum-likelihood detection and precoding for MIMO systems using lattice reduction , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).
[47] Mohamed Oussama Damen,et al. Universal space-time coding , 2003, IEEE Trans. Inf. Theory.
[48] Helmut Bölcskei,et al. Performance and Complexity Analysis of Infinity-Norm Sphere-Decoding , 2010, IEEE Transactions on Information Theory.
[49] Lei Zhao,et al. Diversity and Multiplexing Tradeoff in General Fading Channels , 2006, IEEE Transactions on Information Theory.
[50] Cong Ling,et al. Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding , 2010, IEEE Transactions on Information Theory.
[51] Helmut Bölcskei,et al. Soft–Input Soft–Output Single Tree-Search Sphere Decoding , 2009, IEEE Transactions on Information Theory.