On the minimum distance problem for faster-than-Nyquist signaling
On the minimum distance problem for faster-than-Nyquist signaling
复制标题
DOI：
10.1109/18.21281
复制
发表时间：
1988-11
期刊：
影响因子：
--
通讯作者：
J. Mazo;H. Landau
中科院分区：
文献类型：
--
作者：
J. Mazo;H. Landau
作者重新考虑了确定理想带限信道的输出序列之间的最小距离的问题，这些输出序列是由以超过奈奎斯特速率的速率传输的未编码二进制序列产生的。对于比奈奎斯特速率快约25%的信令速率，证明了最小距离不会低于在没有符号间干扰的理想情况下的值。在数学上，问题是确定当所有系数都为零时，是否发生对区间(-sigma pi，sigma pi)，0上的常数1的L/SUP2/傅立叶最佳逼近，其中系数被限制为=1或=0。这被证明是0.802的最佳选择。>；
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 L/sup 2/ Fourier approximation to the constant 1 on the interval (- sigma pi , sigma pi ), 0 0, with coefficients restricted to be =1 or =0, occurs when all coefficients are zero. This is shown to be optimal for 0.802... >