Hans Journal of Wireless Communications , 2016, 6(6), 123-133

Published Online December 2016 in Hans. http://www.hanspub.org/journal/hjwc

http://dx.doi.org/10.12677/hjwc.2016.66016

A Survey on Faster-Than-Nyquist
Signaling
Chongyan Zuo, Lenan Wu
School of Information Science & Engineering, Southeast University, Nanjing Jiangsu

Received: Nov. 26th, 2016; accepted: Dec. 9th, 2016; published: Dec. 15th, 2016

Copyright 2016 by authors and Hans Publishers Inc.

This work is licensed under the Creative Commons Attribution International License (CC BY).
http://creativecommons.org/licenses/by/4.0/
Open Access

Abstract
In digital communication system, the Nyquist criterion states that the symbol rate must satisfy the
Nyquist criterion in order to achieve transmission without intersymbol interference. However, in
1975, Mazo found that in band-limited Additive White Gaussian Noise channel, the normalized
minimum Euclidean distance does not decrease when the symbol rate exceeds within 25% of the
Nyquist rate and name it as Faster-Than-Nyquist signaling (FTN). In this paper, we first introduce
the history of FTN transmission, analyze the Mazo limit of FTN system, and finally compare the
capacity of FTN and Nyquist rate transmission. Simulation result shows that when the transmitted
pulse has excessive bandwidth, FTN transmission can achieve higher capacity than transmission
under Nyquist rate.

Keywords
Faster-Than-Nyquist Signaling (FTN), Intersymbol Interference (ISI), Constrained Capacities

(FTN)

20161126201612920161215

: , . (FTN)[J]. , 2016, 6(6): 123-133.

http://dx.doi.org/10.12677/hjwc.2016.66016


1975Mazo25%
Faster-Than-Nyquist signaling (FTN)
FTNFTNMazoFTN
FTN

(FTN)

1.
[1](ISI)
ISI
1975 Mazo [2](AWGN) 25%
Faster-Than-Nyquist signaling (FTN)
FTN ODFM [3]
[4] FTN FTN Mazo
FTN
sinc FTN

2. (FTN)
1965 Tufts [5]
1968 Saltzberg [6]
ISI FTN Saltzberg

97% 107 Saltzberg ISI
1973 SALZ [7] FTN
1975 [2] Mazo FTN
25%1995 [8] FTN
sinc [9]
FTN FTN 1
dB 2000 FTN Rusek
AndersonRusek [10] FTN [11]
FTN

2009 Rusek Anderson [12]
FTN sinc FTN
Yoo Cho [13] FTN
FTN [14]

124


[15][16]

3. FTN Mazo
1975MazoISI
M-aryAWGN
FTN
sincPAM an {1,1}
N2
=s (t ) an gT ( t nT ) (1)
n = N1

Mazo
N2
=s (t ) an gT ( t nT ) (2)
n = N1

0 < < 1 gT ( t n T ) ISI

Mazo (Mazo limit)

2

( an )g
2 N2
d min +
dmin
2
= = 1) ( 2 )
min
(
(1)
an ( 2)
T ( t n T ) dt (3)
4 E n ,an an n = N1

1 1
sin ( t T ) T f ,
=gT ( t ) = , GT ( f ) 2T 2T (4)
t T 0

bn an( ) an( ) Parsevals theorem

=
1 2

2
N2
1 +
dmin bn GT ( f ) e j 2fnT df
4T bn 0
2
= min
n = N1
2
N2
1
= min
bn 0 8 n
=N
bn e jn d (5)
1

b
cn = n 2
K
2 1
= min 1 cn e jn d
1,0 2
K 0,cn =
n =1

N1 N 2 ci 0 l m K= m l e j l
(5) = 1 e jn [ , ]
K 2 K
1
min
1,0 2
K 0,cn =
1 cn e jn
=
df min
K 0,cn =
1,0
1 + =
cn2 1 (6)
= n 1= n 1

< 1 (5) matlab (5) K = 6

cn 1
1 FTN 0.8 1[17][18]
Mazo 0.802.. 1 0.8 d min
2
= 1
< 0.8 0.802.. 1

125


Figure 1. Normalized minimum Euclidian distance with increasing FTN

signaling rate
1. FTN

4. FTN
AWGN
r ( t ) sa ( t ) + n ( t )
= (7)
N2
N0
=
sa ( t ) an gT ( t nT ) FTN n ( t )
n = N1 2
T an

= r ( t ) h ( t k T ) dt
*
xk (8)

x = a g + (9)

h ( t m T ) h ( t n T ) dt h ( t k T ) g k [ k ]
g nm = *

ISI UngerBoeck [19]Forney

[20] Forney
y =a f + w (10)

f g ISI w Forney y
a W T 2WT
[21] 2WT N 0 2 AWGN

P
=C W log 2 1 + bits s (11)
WN 0

sinc

126


=sa ( t ) ak sin c ( t k 2W ) (12)
k =0

1
P H ( f )
2
ak T =
2W
( H ( f ) )
2

2P 2
H ( f ) df bits s
W
=
CPSD 0 log 2 1 + (13)
N0
sinc C sinc

FTN ak

CDT sup lim

Pa ( a ) N
1
N
(
I xN ; aN ) (14)

x = a g + Forney y x[22] ak
E a 2 = a2 ( )
1 a2
=CDT log 2 1 + G ( ) d (15)

2

2 0

G ( ) g k e j k =
f k e j k F ( )
2
= = (16)
k k

g k f k UngerBoeck Forney

h ( t m T ) h ( t n T ) dt Parsevals theorem
g nm = *

g k = H ( f ) e j 2k Tf df
2

2
1 2 T k j 2k Tf
= 1 2 T H f +
T
e df
k =

2 (17)
1 2 T k j 2k Tf
= 1 2T k
=
H f +
T
e df

1 1 2 T
H fo ( f ) e j 2k Tf df
2
= T
T 1 2 T

2

k
H fo ( f )
2
H f + , 1 2 T f 1 2 T
T
(18)
k =
1
H fo ( f ) Tg k H fo ( f )
2 2

T
G ( ) = g k e j k G ( ) 2
k

2
1
G ( ) = H fo (19)
T 2 T

127


FTN
1
CFTN C bit s (20)
T DT
a2 N
FTN P = AWGN 2 = 0
T 2

1 2 1
2

=CFTN
2 T 0 log 2 1 + a2
T
H fo d
2 T

1 2P
2

=
2 T 0 log 2 1 +
N0
H fo d
2 T
(21)


f =
2 T 1
2P 2
= 02 T log 2 1 + N H fo ( f ) df
0

= 1 CN N

1 2 PT
=CN log 2 1 + (22)
2T N0

[12]
4.1 h ( t ) sinc CFTN > CN h ( t ) = hsin c ( t ) CFTN = CN
sinc

1
4.2 h ( t ) W sinc = CFTN > CN
2WT
1
= FTN
2WT



T 0 (1 )
T

T T
)
G (= 1 sin (1 ) (1 + ) (23)
2 2 T T T

0 (1 + )
T

[ 0,1]
= 10% = 30%
(21)(22)
2 = 10% sinc
sinc
= 30%

FTN FTN

128


Figure 2. Constrained capacity of raised cosine pulse with 1 Hz bandwidth

2. 1 Hz

T W sinc h ( t ) P/N0 CFTN CN

C CFTN CN C
1 2 PT
=CN log 2 1 +
2T N0
2P 2
H ( f ) df
W
CFTN log 2 1 +
= (24)
N0
0

P
= C W log 2 1 +
N 0W
H(f ) H ( f ) df = 1
W

2 2
W

C CN C C CFTN C
LN = = 1 N LFTN = = 1 FTN
C C C C
lim LN lim LFTN
P N 0 P N 0

LN
CN
lim LN = 1 lim
P N 0 P N 0 C
1 2 PT
log 2 1 +
= 1 lim
2T N0
P N 0 P
W log 2 1 +
N 0W (25)
1
log 2 S + log 2 + 2T
= 1 lim
1 S
S 2WT 1 1
log 2 S + log 2 +
S W
1
= 1
2WT

129


H ( f ) H ( f ) > 0, f < W LFTN

CFTN
lim LFTN = 1 lim
P N 0 P N 0 C
2P 2
H ( f ) df
W
0 log 2 1 +
= 1 lim N0
P N 0 P
W log 2 1 +
N 0W
1 2
W log 2 S + log 2 + 2 H ( f ) df
W
S = P N0
= 1 lim
0
S (26)
S 1 1
W log 2 S + W log 2 +
S W

= lim
W
0 (
log 2 2 H ( f )
2
) df
S W log 2 S
=0
1
sinc W = C N = C LN = 0
2T
sinc
1
W> lim LN > 0 FTN
2T P N 0

lim LFTN = 0 FTN

P N 0

= 10% = 30%
P
(23)
N0

Figure 3. Channel capacity loss as a function of 2P N 0

3. 2P N 0

130


3
1 1 1
lim LN = 1 =
P N 0 2WT 2WT 1 +

lim LN = (27)
P N 0 1+
= 10% = 30% lim LN _10% = 0.091 lim LN _ 30% = 0.23
P N 0 P N 0

= 10% = 30% LFTN 0

FTN FTN sinc

5.
FTN FTN
FTN
FTN

FTN [23] [24]

FTN

(References)
[1] Barry, J.R., Lee, E.A. and Messerschmitt, D.G. (2003) Digital Communication. Springer Science & Business Media,
Norwell, MA.
[2] Mazo, J.E. (1975) Faster-Than-Nyquist Signaling. The Bell System Technical Journal, 54, 1451-1462.
https://doi.org/10.1002/j.1538-7305.1975.tb02043.x
[3] Rusek, F. and Anderson, J.B. (2009) Multistream Faster Than Nyquist Signaling. IEEE Transactions on Communica-
tions, 57, 1329-1340. https://doi.org/10.1109/TCOMM.2009.05.070224
[4] Colavolpe, G. (2011) Faster-Than-Nyquist and Beyond: How to Improve Spectral Efficiency by Accepting Interfe-
rence Giulio Colavolpe. 37th European Conference and Exhibition on Optical Communication, Geneva, 18-22 Sep-
tember 2011, 1-25.
[5] Tufts, D.W. (1965) Nyquists Problem: The Joint Optimization of Transmitter and Receiver in Pulse Amplitude Mod-
ulation. Proceedings of the IEEE, 53, 248-259. https://doi.org/10.1109/PROC.1965.3682
[6] Cahn, C. (1971) Worst Interference for Coherent Binary Channel (Corresp.). IEEE Transactions on Information
Theory, 17, 209-210.
[7] Salz, J. (1973) Optimum Mean-Square Decision Feedback Equalization. The Bell System Technical Journal, 52, 1341-
1373. https://doi.org/10.1002/j.1538-7305.1973.tb02023.x
[8] Wang, C.-K. and Lee, L.-S. (1995) Practically Realizable Digital Transmission Significantly below the Nyquist Band-
width. IEEE Transactions on Communications, 43, 166-169. https://doi.org/10.1109/26.380028
[9] Liveris, A.D. and Georghiades, C.N. (2003) Exploiting Faster-Than-Nyquist Signaling. IEEE Transactions on Com-
munications, 51, 1502-1511. https://doi.org/10.1109/TCOMM.2003.816943
[10] Rusek, F. (2007) Partial Response and Faster-Than-Nyquist Signaling. Lund University, Lund.
[11] Rusek, F. and Anderson, J.B. (2005) The Two Dimensional Mazo Limit. Proceedings of International Symposium on
Information Theory, Adelaide, 4-9 September 2005, 970-974.
[12] Rusek, F. and Anderson, J.B. (2009) Constrained Capacities for Faster-Than-Nyquist Signaling. IEEE Transactions on
Information Theory, 55, 764-775. https://doi.org/10.1109/TIT.2008.2009832
[13] Yoo, Y.G. and Cho, J.H. (2010) Asymptotic Optimality of Binary Faster-Than-Nyquist Signaling. IEEE Communica-
tions Letters, 14, 788-790. https://doi.org/10.1109/LCOMM.2010.072910.100499
[14] Kanaras, I., Chorti, A., Rodrigues, M.R.D., et al. (2009) Spectrally Efficient FDM Signals: Bandwidth Gain at the Ex-
pense of Receiver Complexity. IEEE International Conference on Communications, Piscataway, NJ, 14-18 June 2009,
1-6.

131


[15] Tipsuwannakul, E., Karlsson, M. and Andrekson, P.A. (2012) Exploiting the Faster-Than-Nyquist Concept in Wave-
length-Division Multiplexing Systems Using Duobinary Shaping. ResearchGate, 1, 8.
[16] Sen, P., Aktas, T. and Yilmaz, A.O. (2014) A Low-Complexity Graph-Based LMMSE Receiver Designed for Colored
Noise Induced by FTN-Signaling. IEEE Wireless Communications and Networking Conference (WCNC), Istanbul, 6-9
April 2014, 642647.
[17] Mazo, J.E. and Landau, H.J. (1988) On the Minimum Distance Problem for Faster-Than-Nyquist Signaling. IEEE
Transactions on Information Theory, 34, 1420-1427. https://doi.org/10.1109/18.21281
[18] Hajela, D. (1990) On Computing the Minimum Distance for Faster than Nyquist Signaling. IEEE Transactions on In-
formation Theory, 36, 289-295. https://doi.org/10.1109/18.52475
[19] Ungerboeck, G. (1974) Adaptive Maximum-Likelihood Receiver for Carrier-Modulated Data-Transmission Systems.
IEEE Transactions on Communications, 22, 624-636. https://doi.org/10.1109/TCOM.1974.1092267
[20] Forney, G. (1972) Maximum-Likelihood Sequence Estimation of Digital Sequences in the Presence of Intersymbol In-
terference. IEEE Transactions on Information Theory, 18, 363-378. https://doi.org/10.1109/TIT.1972.1054829
[21] Shannon, C.E. (2001) A Mathematical THEORY of communication. ACM SIGMOBILE Mobile Computing and Com-
munications Review, 5, 3-55. https://doi.org/10.1145/584091.584093
[22] Shamai, S., Ozarow, L.H. and Wyner, A.D. (1991) Information Rates for a Discrete-Time Gaussian Channel with In-
tersymbol Interference and Stationary Inputs. IEEE Transactions on Information Theory, 37, 1527-1539.
https://doi.org/10.1109/18.104314
[23] Sasahara, H., Hayashi, K. and Nagahara, M. (2016) Symbol Detection for Faster-than-Nyquist Signaling by Sum-of-
Absolute-Values Optimization. IEEE Signal Processing Letters, 23, 1853-1857.
[24] Ishihara, T. and Sugiura, S. (2016) Frequency-Domain Equalization Aided Iterative Detection of Faster-than-Nyquist
Signaling with Noise Whitening. IEEE International Conference on Communications (ICC), Kuala Lumpur, 22-27
May 2016, 1-6.

1. (QQ)
2.
3. 24
4.
5.
6.
7.

http://www.hanspub.org/Submission.aspx
hjwc@hanspub.org

132