Spectral shaping for faster-than-Nyquist signaling
暂无分享,去创建一个
[1] R. Gallager. Information Theory and Reliable Communication , 1968 .
[2] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[3] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[4] Fredrik Rusek,et al. Faster-Than-Nyquist Signaling , 2013, Proceedings of the IEEE.
[5] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[6] Gerhard Kramer,et al. Impact of spectrum sharing on the efficiency of Faster-Than-Nyquist signaling , 2014, 2014 IEEE Wireless Communications and Networking Conference (WCNC).
[7] Hidekazu Taoka,et al. Overview of Faster-Than-Nyquist for Future Mobile Communication Systems , 2013, 2013 IEEE 77th Vehicular Technology Conference (VTC Spring).
[8] Fredrik Rusek,et al. Constrained Capacities for Faster-Than-Nyquist Signaling , 2009, IEEE Transactions on Information Theory.
[9] Henry J. Landau,et al. On the minimum distance problem for faster-than-Nyquist signaling , 1988, IEEE Trans. Inf. Theory.
[10] Giulio Colavolpe,et al. Optimal Transmit Filters for ISI Channels under Channel Shortening Detection , 2013, IEEE Transactions on Communications.
[11] J. E. Mazo,et al. Faster than Nyquist Signaling: Algorithms to Silicon , 2014 .
[12] Yong Jin Daniel Kim,et al. Information rates of cyclostationary faster-than-nyquist signaling , 2011, 2011 12th Canadian Workshop on Information Theory.
[13] Upamanyu Madhow. Fundamentals of Digital Communication: References , 2008 .