References
- G. J. Foschini, 'Layered space-time architecture for wireless communication in fading environments when using multiple antennas,' BellLabs, Tech. J., Vol.2, pp.41-59, 1996
- G. J. Foschini Jr. and M. J. Gans, 'On limits of wireless communication in a fading environment when using multiple antennas,' Wireless Personal Commun., Mar. 1998
- S. A. Alamouti, 'A simple transmit diversity technique for wireless communication,' IEEE J. Select. Areas Commun., Vol.16, pp.1451-1458, Oct. 1998 https://doi.org/10.1109/49.730453
- P. W. Wolniansky, G. J. Foschini, G. D. Golden, and R. A. Valenzuela. 'V-BLAST: An architecture for realizing very high data-rates over the rich scattering widess ehannel,' IEEE ISSSE-98, Sep., 1998
- 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 https://doi.org/10.1109/18.771146
- T. L. Marzetta and B. M. Hochwald, 'Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading,' IEEE Trans. Inform. Theory, Vol.45, pp.139-157, Jan. 1999 https://doi.org/10.1109/18.746779
- C. P. Schnorr and M. Euchner,'Lattice basis reduction: Improving practical lattice basis reduction and solving subset sum problems,' Math. Programming, Vol.66, pp.181-199, 1994 https://doi.org/10.1007/BF01581144
- E. Viterbo and J. Boutros, 'A universal lattice code decoder for fading channel,' IEEE Trans. Inform. Theory, Vol.45, pp.1639-1642, July 1999 https://doi.org/10.1109/18.771234
- D. L. Ruyet, T. Bertozzi, and B. Ozbek, 'Breadth first algorithmsfor APP detectors over MIMO channels,' in Proc. IEEE Int. Conf. Commun., pp.926-930, Jun. 2004
- U. Fincke and M. Pohst, 'Improved methods for calculating vectors of short length in a lattice, including a complexity analysis,' Math. Comp., Vol.44, No.170, pp.463-471, Apr. 1985 https://doi.org/10.2307/2007966
- M. Pohst, 'On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications,' SIGSAM Bull., Vol.15, No.1, pp.37-44, Feb. 1981 https://doi.org/10.1145/1089242.1089247
- Bakak Hassibi and Haris Vikalo, 'On the Sphere-Decoding Algorithm I. Expected Complexity,' IEEE Trans. on Signal Processing, Vol.53, No.8, Aug. 2005
- M. O. Damen, H. El Gamal, and G. Caire, 'On maximum-likelihood detection and the search for the closest lattice point,' IEEE Transactions on Information Theory, Vol.49, No.10, pp.2389-2402, Oct. 2003 https://doi.org/10.1109/TIT.2003.817444
- Q. Liu and L. Yang, 'A novel method for initial radius selection of Sphere Decoding,' in Proc. IEEE VTC-Fall 2004, Sep. 2004
- Z. Guo and P. Nilson, 'Algorithm and Implementation of the K-best Sphere Decoding for MIMO detection,' IEEE Journal on Selected Areas in Communications, Vol.24, pp.491-503, March 2006 https://doi.org/10.1109/JSAC.2005.862402
- K.-W. Wong, C.-Y. Tsui, R. S.-K. Cheng, and W.-H. Mow, 'A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels,' IEEE ISCAS 2002, May 2002
- D. L. Ruyet, T. Bertozzi, and B. Ozbek, 'Breadth first algorithms for APP detectors over MIMO channels,' in Proc. IEEE Int. Conf. Commun., pp.926-930, Jun. 2004
- Y. L. de Jong and T. J.Willink, 'Iterative tree search detection for MIMO wireless systems,' IEEE VTC, Sep. 2002