Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

On the minimum distance problem for faster-than-Nyquist signaling

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mazo, J.E. ; AT&T Bell Lab., Murray Hill, NJ, USA ; Landau, H.

The authors reconsider the problem of determining the minimum distance between output sequences of an ideal band-limiting channel that are generated by uncoded binary sequences transmitted at a rate exceeding the Nyquist rate. For signaling rates up to about 25% faster than the Nyquist rate, it is shown that the minimum distance does not drop below the value which it would have in the ideal case wherein there is not intersymbol interference. Mathematically, the problem is to decide if the best L2 Fourier approximation to the constant 1 on the interval (-σπ, σπ), 0<σ⩽1, using the functions exp(inx), n>0, with coefficients restricted to be =1 or =0, occurs when all coefficients are zero. This is shown to be optimal for 0.802...⩽σ⩽1

Published in:

Information Theory, IEEE Transactions on  (Volume:34 ,  Issue: 6 )