On the sphere-decoding algorithm I. Expected complexity
暂无分享,去创建一个
[1] Mohamed Oussama Damen,et al. Lattice code decoder for space-time codes , 2000, IEEE Communications Letters.
[2] M. Ajtai. The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract) , 1998, STOC '98.
[3] Babak Hassibi,et al. An efficient square-root algorithm for BLAST , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).
[4] Stephen C. Milne,et al. Infinite Families of Exact Sums of Squares Formulas, Jacobi Elliptic Functions, Continued Fractions, and Schur Functions , 2000, math/0008068.
[5] Yuri Gurevich,et al. Average Case Completeness , 1991, J. Comput. Syst. Sci..
[6] Stephen Wolfram,et al. The Mathematica Book , 1996 .
[7] Ravi Kannan,et al. Improved algorithms for integer programming and related lattice problems , 1983, STOC.
[8] U. Fincke,et al. Improved methods for calculating vectors of short length in a lattice , 1985 .
[9] Emanuele Viterbo,et al. A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.
[10] Marvin I. Knopp,et al. Modular Functions In Analytic Number Theory , 1970 .
[11] Michael E. Pohst,et al. On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications , 1981, SIGS.
[12] M. Stephanov,et al. Random Matrices , 2005, hep-ph/0509286.
[13] Minoru Wakimoto,et al. Integrable Highest Weight Modules over Affine Superalgebras and Appell's Function , 2001 .
[14] Thomas C. Hales. Sphere packings, I , 1997, Discret. Comput. Geom..
[15] Miklós Ajtai,et al. The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract) , 1998, STOC '98.
[16] Leonid A. Levin,et al. Average Case Complete Problems , 1986, SIAM J. Comput..
[17] A. Edelman. Eigenvalues and condition numbers of random matrices , 1988 .
[18] Thomas L. Marzetta,et al. Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading , 2000, IEEE Trans. Inf. Theory.
[19] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[20] A. Korkine,et al. Sur les formes quadratiques , 1873 .
[21] Stephen P. Boyd,et al. Integer parameter estimation in linear models with applications to GPS , 1998, IEEE Trans. Signal Process..
[22] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .
[23] Gerard J. Foschini,et al. Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas , 1996, Bell Labs Technical Journal.
[24] Jeffrey C. Lagarias,et al. Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice , 1990, Comb..
[25] Jie Wang,et al. Average-case computational complexity theory , 1998 .
[26] Ivars Peterson. Surprisingly square: Mathematicians take a fresh look at expressing numbers as the sums of squares , 2001 .
[27] E. Biglieri,et al. A universal decoding algorithm for lattice codes , 1993 .
[28] N. J. A. Sloane,et al. Sphere Packings, Lattices and Groups , 1987, Grundlehren der mathematischen Wissenschaften.
[29] R. Muirhead. Aspects of Multivariate Statistical Theory , 1982, Wiley Series in Probability and Statistics.
[30] Babak Hassibi,et al. High-rate codes that are linear in space and time , 2002, IEEE Trans. Inf. Theory.
[31] Gene H. Golub,et al. Matrix computations , 1983 .
[32] Charles R. Johnson,et al. Topics in Matrix Analysis , 1991 .