|
[1] S. Jaeckel, L. Raschkowski, K. B¨orner, and L. Thiele, “Quadriga: A 3-d multi-cell channel model with time evolution for enabling virtual field trials,” IEEE transactions on antennas and propagation, vol. 62, no. 6, pp. 3242–3256, 2014. [2] D. Silver, J. Schrittwieser, K. Simonyan, I. Antonoglou, A. Huang, A. Guez, T. Hubert, L. Baker, M. Lai, A. Bolton et al., “Mastering the game of go without human knowledge,” nature, vol. 550, no. 7676, pp. 354–359, 2017. [3] K. Yu and B. Ottersten, “Models for mimo propagation channels: a review,” Wireless communications and mobile computing, vol. 2, no. 7, pp. 653–666, 2002. [4] D.W¨ubben, D. Seethaler, J. Jald´en, and G. Matz, “Lattice reduction,” IEEE Signal Processing Magazine, vol. 28, no. 3, pp. 70–91, 2011. [5] H. Yao and G. Wornell, “Lattice-reduction-aided detectors for mimo communication systems,” in Global Telecommunications Conference, 2002. GLOBECOM ’02. IEEE, vol. 1, 2002, pp. 424–428 vol.1. [6] M. Soltani, V. Pourahmadi, A. Mirzaei, and H. Sheikhzadeh, “Deep learning-based channel estimation,” IEEE Communications Letters, vol. 23, no. 4, pp. 652–655, 2019. [7] H. He, C.-K. Wen, S. Jin, and G. Y. Li, “A model-driven deep learning network for mimo detection,” in 2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP), 2018, pp. 584–588. [8] C. B. Browne, E. Powley, D. Whitehouse, S. M. Lucas, P. I. Cowling, P. Rohlfshagen, S. Tavener, D. Perez, S. Samothrakis, and S. Colton, “A survey of monte carlo tree search methods,” IEEE Transactions on Computational Intelligence and AI in Games, vol. 4, no. 1, pp. 1–43, 2012. [9] Y. H. Gan, C. Ling, and W. H. Mow, “Complex lattice reduction algorithm for lowcomplexity full-diversity mimo detection,” IEEE Transactions on Signal Processing, vol. 57, no. 7, pp. 2701–2710, 2009. [10] J. Jalden, D. Seethaler, and G. Matz, “Worst- and average-case complexity of lll lattice reduction in mimo wireless systems,” in 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, 2008, pp. 2685–2688. [11] A. Becker, N. Gama, and A. Joux, “Solving shortest and closest vector problems: The decomposition approach,” Cryptology ePrint Archive, 2013. [12] Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,” nature, vol. 521, no. 7553, pp. 436–444, 2015. [13] D. Silver, A. Huang, C. J. Maddison, A. Guez, L. Sifre, G. Van Den Driessche, J. Schrittwieser, I. Antonoglou, V. Panneershelvam, M. Lanctot et al., “Mastering the game of go with deep neural networks and tree search,” nature, vol. 529, no. 7587, pp. 484–489, 2016. [14] L. P. Kaelbling, M. L. Littman, and A. W. Moore, “Reinforcement learning: A survey,” Journal of artificial intelligence research, vol. 4, pp. 237–285, 1996. [15] K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2016, pp. 770–778. [16] D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” arXiv preprint arXiv:1412.6980, 2014. [17] C. Ling and N. Howgrave-Graham, “Effective lll reduction for lattice decoding,” in 2007 IEEE International Symposium on Information Theory, 2007, pp. 196–200. [18] K. He and J. Sun, “Convolutional neural networks at constrained time cost,” in Proceedings of the IEEE conference on computer vision and pattern recognition, 2015, pp. 5353–5360. |