On faster than Nyquist signaling: Computing the minimum distance
Author:
- D HajelaDHD Hajela
- 31 October 1990
- journal article
- Published by Elsevier in Journal of Approximation Theory
- Vol. 63 (1) , 108-120
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On computing the minimum distance for faster than Nyquist signalingIEEE Transactions on Information Theory, 1990
- Minimum probability of error for asynchronous Gaussian multiple-access channelsIEEE Transactions on Information Theory, 1986
- Contrasting Performance of Faster Binary Signaling With QAMAT&T Bell Laboratories Technical Journal, 1984
- Faster-Than-Nyquist SignalingBell System Technical Journal, 1975
- Upper Bound on Error Probability for Detection With Unbounded Intersymbol InterferenceBell System Technical Journal, 1975
- Performance bound for maximum-likelihood reception of digital dataIEEE Transactions on Information Theory, 1975
- Lower Bounds on Error Probability in the Presence of Large Intersymbol InterferenceIEEE Transactions on Communications, 1972
- Some trigonometrical inequalities with applications to the theory of seriesMathematische Zeitschrift, 1936