On computing the minimum distance for faster than Nyquist signaling
暂无分享,去创建一个
[1] Henry J. Landau,et al. On the minimum distance problem for faster-than-Nyquist signaling , 1988, IEEE Trans. Inf. Theory.
[2] Gerard J. Foschini. Performance bound for maximum-likelihood reception of digital data , 1975, IEEE Trans. Inf. Theory.
[3] A. D. Wyner. Upper bound on error probability for detection with unbounded intersymbol interference , 1975, The Bell System Technical Journal.
[4] Sergio Verdú,et al. Minimum probability of error for asynchronous Gaussian multiple-access channels , 1986, IEEE Trans. Inf. Theory.
[5] D. Hajela. On faster than nyquist signaling: computing the minimum distance , 1990 .
[6] A. Ingham. Some trigonometrical inequalities with applications to the theory of series , 1936 .
[7] G. David Forney. Lower Bounds on Error Probability in the Presence of Large Intersymbol Interference , 1972, IEEE Trans. Commun..
[8] G. J. Foschini,et al. Contrasting performance of faster binary signaling with QAM , 1984, AT&T Bell Laboratories Technical Journal.