628 TRANSACTIONS

IEEE O N COMMUNICATION TECHNOLOGY, VOL. COM-19, NO. 5 , OCTOBER 1971

Data Transmission by Frequency-Division Multiplexing

Using the Discrete Fourier Transform
S. B. W E I N S T E I N , MEMBER, IEEE, AND PAUL M. EBERT, MEMBER, IEEE

AZisfracf-The lourief transformdata commtdcationsystem

i6 a realization of freqbency-division multiplexing (FDM) in which
discrete Fourier transforms are computed as part of the modulation
and demodulation processes. In addition to eliminating the banks
of subcarrier oscillators and coherefit demodulatorsusually required
in FDM systems, a completely digital implementation can be built
around a special-purpose computer, performingthe fast Fourier
transform. In this paper, the system is described and the effects of
linearchanneldistoriion are investigated. Signal design criteria
and equalization algorithmsare derived and explained. A differential
phase modulation scheme is presented that obviates any equaliza-
tion.

I. INTRODUCTION
tl\ A r\ A * r : as COS(IOllt/T)
W W W W U T

ATA ARE usually sent as a serial pulse train, but

therehas longbeen interestinfrequency-divi-
sion mult.iplexing with overlapping subchannels
as a means of avoiding equalization, combating impulsive
noise, and making fuller use of the available bandwidth.
These “parallel da.ta” systems, in which emh member of
a sequence of N digits modulates a subcarrier, have been +I 1
studied in [2] and [4].Multitone systems are widely used
. a0
I T
and have proved to be effective in [3], [SI, and [9]. Fig. (C)
1 compares the transn~issions of a serial and a parallel
Fig. 1 . Comparison of waveforms in serial and paralleldat.a
system. transmission systems. (a) Serial stream of six binary digits.
For alargenumber of channels,the arrays, of sinu- (b) Typical appearance of baseband
serial transmission.
(c)Typicalappearance of waveforms thataresummed to
soidal generators and coherent demodulators required in create para,llel data signals.
parallel systems become unreasonably expensive and com-
plex. However, it can be shown [ l ] t h a t a multitone data
subchanneismaybeusedinsimpletransformations of
signal is effect,ively the Fourier trans.form of the origina.1
the receiver output data .to produce, excellent estimates
serial data train, and that the bank of coherent deniodu-
of the original data. Further, a simple equalization algo-
lators is effectively an inverse Fourier trans’form genera-
rithm will minimize mean-square distortion on each sub-
tor.Thispoint of viewsuggests a completelydigita’l
channel,anddifferentialencoding of t’heoriginaldata
modembuiltaroundaspecial-purposecomputerper-
may make it possible to avoidequalizationaltogether.
formingthe fast Fouriertransform(FFT).Fourier
transform techniques, although not necessarily the signal 11. FREQUENCY-DIVISION MULTIPLEXING AS A DISCRETE
format described in this, paper, have been incorporated TRANSFORMATION
into several military d a h communicationsystems [5]-
Considera ‘data sequence (d,,, d l , . . ., d,- where
[71. each d, is a complex number.d,, = a,, + jb,.
Because each subchannel covers only a small fraction
If a discreteFouriertransform (DFT) is performed
of theoriginalbandwidth,equalizat’ionispotentially
onthevector {2dn}n,0N-1,theresultis a vector S =
simpler than for a serial system. In particular, for very
(S,,, S1, . . . , S,,- 1) of iV complexnumbers,with
narrow subchannels, soundings made at the centersof the
N-1 N-1
8, = 2dne-i(2*nm/N) - 2 dne-j2=fntm,
n=O n-0
Pa.per approvedbytheDataCommunicationsCommittee of
theIEEECommunication Technology Group for publication m = 0 , 1, . . . , N - 1, (1)
after presentation a.t the 19871 IEEE International Conference on where
Communications,Montreal, Que., Canada,June 14-16. Manu-
script received January 15,1971 ; revised March 29, 1971.
The authors are with the Advanced Data Communicat.ions
Department, Bell TelephoneLaboratories,Holmdel, N. J .

Authorized licensed use limited to: Tomsk State University. Downloaded on May 28,2022 at 05:18:44 UTC from IEEE Xplore. Restrictions apply.
AN5 WEINSTEIN EBERT: TRANSMISSION BY FREQUENCY-DIVISION MULTIPLEXING 629
' A
t, = m At
and A t is an arbitrarily chosen interval. The real part
of the vectorX has components
(3) SOURCE
dn'an+i&.
n=O,I, ...,N-l
-
- DFT
:(REAL PART
-: ONLY)
.LOW- y(t)
PASS . :
FILTER

DISTORTIONLESS CHANNEL
N- 1

Y, = 2
,,=O
(a, cos 2nj,t, + 6, sin 2nfntm),
m = 0, 1, , N - 1. (4)
If thesecomponentsareapjdiedto a low-passfilter a t
timeintervals, A t , asignal is obtained that closely ap-
Fig. 2. Fouriertransformcommunicationsystem in absence of
proximates the frequency-division multiplexed signal channeldistortion.
N- 1

y(t) = 2
%=n
(a, cos 2 ~ f , t + b, sin 2nf,t),
0 _< t _< N A t . (Fi)
A hlock diagram of the communication system in which
y ( t ) is the trammitted signal appearsin Fig. 2.
Demodulation at. t.he receiver is carried out via a dis-
crete Fourier transformatid of a vector of samples of
the received signal.Becauseonlythe rea.1 part of the
Fourier transform has been transmitted, it is necessary to
sample twice as fast as expected, i.e., a t intervals A t / 2 .
When there is no channel distortion, the receiver DFT
operates on the 2N samples

Y, = y(k 9) = 2 (u,, cos 2~

2mk
+ b,sin __
2N
0, 1, . * . , . 2 N - 1,
K = (6) 'n-2 !WI 'n fn+ I 'n+2

where definitions (2) a n i (3) have been substituted into Fig. 3. Power dtnsity spectra of subchannel components of y ( t )
(4). The DFT yields
+ 2N--1 111. EQUALIZATION SOUNDINGS
BY USE OF CHANNEL

l = O
J2%,
a, - j b , , 1 = I , 2, . . * , N - 1
=1
irrelevant,
where the equality
1 > N - 1,
has been employed.Theoriginaldata a[ and b, are
available(exceptfor 1 = 0 ) as the real and imaginary
conlponents, respectively, of z l , as indicated in Fig. 2. A
synchronizing signal is reciuired, but one or several chan-
nels of the transnlitted signal can readily be utilized for
this purpose.
Because the sinusoidal components of the parallel data
signal y ( t ) aretruncated in time,thepowerdensity
spectrum of y ( t ) consis'ts of [sin ( f ) / f ] "shaped spectra,
as sketched in Fig. 3. Nevertheless, the data on the dif-
ferentsubchannelscan be completely separated by the
DFT operation of (7). This will not be exactlytrue
when linearchanneldistortionaffectsthereceived
nal, hut it will be shown later that a modest reduction in
transmission rate eliminatesmost. interferences.
Exceptfortheaddedlinearchanneldistortionand
final equalizer, the Fourier transform data communica-
tion systeni shown in Fig. 4 is identical to that of Fig. 2.
(7) Ideally,thediscreteFouriertransformationinthere-
ceiver should be replaced by another linear transforma-
tion,derivedin 1111, which minimizes theerrorinthe
receiver output. However, it is preferable, if possible, t o
retainthe DFT withits"fast"implementationsand
carry out suboptimal but adequate correctional transfor-
mationsatth2receiverout<put.Thesystem of Fig. 4
performs this approximate equalization.
Consider the waveforma t t h ereceiver input,
r(t) = Y ( t ) * W , (9)
wheretheasterisk deliotcs convolution.Thiswaveform
is a collection of truncated sinusoids modified by a. linear
filter. If the sinusoid cos 2Tf,,t were not truncated, then
the result of passing i t through a channel with transfer
function H ( f ) wouldbe H , cos(2~f,t +,,) , where +
sig- The sinusoids in the transmitted signal y ( t ) [see (5) 3
are truncated to the interval ( 0 , N A t ) , so that the nth
subchannelmustaccommodate a [sin N T ( ~- f n ) A t ] /

Authorized licensed use limited to: Tomsk State University. Downloaded on May 28,2022 at 05:18:44 UTC from IEEE Xplore. Restrictions apply.
630 IEEE TRANSACTIONS O N COMMUNICATION TECHNOLOGY, OCTOBER 1971
SOURCE
:(REAL PART -Low- Y(t) Equations (13a-c) describea 2 X 2 transformation
dn*an+ibn. OFT e PASS :
n=O,l, N-I ..., :ONLY1 FILTER to be performed on each of the DFT outputs z I , I = 1, 2,
* , N - 1. Forareasonablylarge N andatypical
communication channel, the approximation of H ( f ) by
I a constant over each subchannel, which leads-to (13a-c) ,
.",.. - may be adequate. However, linear rather than constant
A approximations to the amplitude and phase of the chan-
SAMPLE i
AT
INTERVALS-
.
DFT - * TRANSFORMATION
EOUALIZATION f
7bn nel transfer function as it affects each subchannel wave-
kAt/2 formaremuchclosertoreality.Thefollowingsection
Fig. 4 . Fourier
trmsform communicati.on
system including examines the consequences of theseapproximations. It
' linear
channel
distortion
and
final
equalization.
is shown that the truncated subchannel sinusoids are de-
layed by differing amounts, and that distortion is con-
[ h T r (- f f n ) A t ] spectrum instead of the impulse at fn, centra-ted at the on-off transitions of thesewaveforms.
which would correspond to a pure sinusoid. However, if Further, the magnitude of the distortion is, proportional
l / ( N A t ) is smallconlparedwiththetotaltransmission totheabruptness of thetransitions.Hence a "guard
bandwidth, then H ( f ) does not change significantly over space," consisting of a modest increase in the signai dur-
thesubchannelandanapproximate express,ion for the ation together with a smoothing of the on-off transitions,
received signal r ( t ) is will eliminate most interference among channels and be-
N-1 tween adjacent
transmission
blocks.Theindividual
r(t) 2
n=1
Hn[an COS (27rfat + 4n) channels can then hc equalized in accord with (13a-c).

+ b, sin (W,t + 4Jl + 2H0an IV. APPROXIMATE ANALYSIS

CHANNEL
OF THE EFFECTS
DISTORTION
OF

N- 1
= 2
n= 1
H,[(a, cos 4, + b, sin &) cos 27rf,t Thetransmittedsignal y ( t ) as givenby(5)exists
only on the interval (0, NAt), so that each suhchannel
+ ( b , cos 4" - a, sin +J sin 27rfnt] must, as noted earlier, accommodate a sin f/f type spec-
trum. As suggested in t,he last section, let this spectrum
+ 2H0ao, 0 5 t 5 N A,?. (11) he narrowed by increasing the signal duration t o some
As indicated in Fig. 4, r ( t ) is sampled at times k: (At/2) , T > N A t and requiring gradual rather than abrupt roll-
k = 0, 1, . . 2N - 1, and the samples { r k } are applied
e ,
offs of the transmitted waveform. S'pecifically, the trans-
toadiscreteFouriertransformer.Theoutput of the mitted signal will be redefined :IS
DFT is
2N-1

El
o.

2Hoao, 1 =.o
H,[at cos 4, b, sin + - H , [ b , cos 4,
- a, sin +,I, 1 = 1, 2, . . . , N - 1 (12)
irreievant, 1>N-1.
o l t < T
Estimates of nl and b, are obt,ained from the computa-
ions

6, =
1
-
H,
[ R e (2,) cos 4, + Im (z,) sin +1]
10 elsewhere.

(15)
The "window function" g, ( t ) is. sketched in Fig.5.
When y ( t ) is pa.ssed through.the channel filter with
1 = 1, 2, e . . ,N - 1. (13a) impulse response h ( t ), the received signal is
Tn complex notation, the appropriate computationis

&,- j6, = w,z,, (13b)

where

Authorized licensed use limited to: Tomsk State University. Downloaded on May 28,2022 at 05:18:44 UTC from IEEE Xplore. Restrictions apply.
WEINSTEIN AND EBERT:TRANSMISSION BY FREQUENCY-DIVISIONMULTIPLEXING 63 1

--io1
I i TiZOT

Fig. 5 . Window g.(t) multiplyingallsubchannelsinusoidsin

transmitted signal.

where
p ( t ) = 2h(t) * g&) cos 2af,t
qb'n)(t)= 2h(t) * g,(t) sin 2nfnt. (17)
I n Appendix I, linear approximations to t.he amplitude
and phase of H ( f ) around f = *f,, result in the follow-
ing approximate expression for qa(n)( t ).
Fig. 6. Linearapproximations to amplitudeand phase of H ( f )
qn(n)(t)
E 2Hn COS Y27rfnt + +.]ga(t - PJ
+
in relation to spectra G,,(f - fn) and Ga(f 1.n).

r Z N SAMPLES-
I

where ( H N , is thechannelsounding a t frequency f n ,

and LY,and Pn aretheslopesat f = fn of thelinear
approximationstoamplitudeandphase of H ( f ) , as
shown in Fig. 6. A similar expression resulte for q b ( n()t ). Fig. 7 . Shiftedversions of g,(t) corresponding tosubchannels
The first term on the right-hand side of (18) is the 7zth wit.h minimumandmaximumdelayandlocations of samples
taken by receiver. Here t,,,, = min, fin, L a x = rnax,%
cosine elementinthetransmittedsignal (14), except 6".
that it is modified by a channel sounding ( H a , &) and
subjectedtoanenvelopedelay Pa. Interblockinterfer- N-1
encecanresult if adelayedsinusoidfrom a previous
block impinges on the current sampling period. The sec-
r(t) E 2
n=1
Hn[a, cos (2nfnt + 4,J + bn sin (27rfnt+ 4JI
ond term is distortion arising from the amplitude varia-
tions of H ( f ) , and it is a potential source of interchannel
+ 2Hoao, to 5 t 5 to + ( 2 N - 1) 5.
At
(23)

interference.Suppose,however,that T is largeenough Exceptfortheshifteddomain of definition, ( 2 3 ) is

so that identical t,o ( l l ) ,which led to ( 1 3 ) for retrieval of the
data. It can be shown that initiating sampling of r ( t )
T > ( 2 N - 1)
At
y + max (PJ
n
- min ( A ) ,
n
(19)
a t t = t,)instead of a t t = 0 is equivalent t.o incrementing
each phase +[ by f l t,, rad in the equalization equations
as pictured in Fig. 7. Then for all n there exists a t,ime (13).
to > max /3 ,such that Intuitively, r ( t ) reduces to ( 2 3 ) becauselineardis-
tortion delays different spectral components by different
At
d
- g,(t
dt
- pn) = 0, to 5 t I (2N - 1) + to. (20)
anlounts and responds to abrupt transitions with "ring-
ing." If the subchannel waveforms, are examined during
Fig. 7 shows where the interval ( t o ,to ( 2 N - 1) ( A t ] + an interval when they are all present, and
off transitions liewell
if all the on-
outsidethisinterval,thenthe
2 ) ) is locatedwithrespecttotheminimumandmaxi-
mum valuesof the time shift&. Thus, waveforms will look like the collection of sinusoids de-
scribed by ( 5 ) . The linear approximations to amplitude
q.'")(t) "= 2 H , cos (27rf"t + +"), and phase of H ( f ) restrict the ringing from the transi-
tionperiods t,o thoseperiodsthemselves. Inpractice,
the ringing can be expected to die out very rapidly out-
side of the transition periods. This use o f a guard space
By a similar derivation, is a commontechnique,as,forexample,describedin

~~("'(2) 2H, sin (2af,t + 4,J, VI.

MEAN-SQUARE
Ti. ALGORITHMFOR MIXIMIZING
to 5t i to + -2--
( 2 N - 1) A t
. (22) DISTORTION
Under the assumption supported by the results of the
Therefore,substituting ( 2 1 ) and ( 2 2 ) into (16) (except last section that interchannel interference is negligible, a
for n = O ) , simple algorithm can be devised for determination of the

Authorized licensed use limited to: Tomsk State University. Downloaded on May 28,2022 at 05:18:44 UTC from IEEE Xplore. Restrictions apply.
632 IEEETRANSACTIONS ON COMMUNICATION TECHNOLOGY, OCTOBER 1971
parameters cos +!/HI andsin + J H , oneachchannel, implernent,ation of (30)is showninFig. S. Theinitial
whichminimizemean-squaredistortionwhen usedin value of 56 is probably best obtained from crude channel
thetransformation of (13a-c).Because of propagation soundings, or specified as some "typical" vector quantity.
delay and the' presence of noise, these parameters may It is expected that the first round of adjustments, made
notexactlycorrespondto a sounding of the I t h sub- at the end of the first block transmission, will suffice t o
carrierchannel.The w e of anautomaticequalization reduce the error toa low level, if it is not already low with
procedure based on the minimum mean-square distortion the initial value of T. At At = 0.5 ms, the length of one
algorithm leads to accurate demodulation without hav- blockbeforeaddition of a guardspace will varyfrom
ingtomake precisechannelsoundings.Further,the about 8 ms (16 subchannels) to about 64 ms (128 sub-
algorithmcanworkadaptivelyafteraninitialcoarse channels). This block length, plus the guard space neces-
adjustment. sary to minimize interference, is a transmission delay that
The receiver produces estimates d l and 6, according to cannot be avoided.
the formulas Theequalizationalgorithmgivenhereonlyequalizes
distortionduetocochannelinterference(channelson
d , = TI, R e 2 , + T,, Im 2, thesamefrequency)andcompletelyignoresinterchan-
6, = T,, R e 2 , - T , , I m Z , , (24) ne1 interference. An unpublished analysis by the authors
shows that for this equalizer, the interchannel interfer-
whichresemble(13a-c),except thatthe T coefficients encebecomes arbitrarilysmallasthenumber of sub-
areto bechosen t o nlinilnize theestimationerr0r.l channels increases. This is true even without any of the
Mean-square distortion is defined by signal modification described in Section IV.
VI. TRANSMISSION
WITHOUT EQUALIZATION

We have shown that for narrow subchannels the chan-

N- 1
nel can be equalized by multiplying zz, the receiver out-
= E
2=1
[(TI,.R e 2, + T,, . I m Z , - a,)' put for the Zth subcarrier channel, by a number w1[see
(13c) 1 . This is simply compensation for attenuation and
+ (T,,.Re 2, - T , , . I m 2 , - b,)'], (25) phase shift in that particular subchannel. The interfer-
where ence among subchannels is made small by using a guard
time and smooth transitions between blocks.
For binary transmission, the attenuation need not be
compensated,and if differentialphasetransmission be-
tweensubchannelsisused,nophaseequalization is
It is shown in Appendix I1 that E is a convex function of needed. In order for this technique to, work, the differ-
the vector F , where ence in phase of the transmission channel transfer func-
tion H ( f ) between adjacent subchannels should be small.
Assume this is the case and let
Thus a steepest descent algorithm is sure to converge to dn = (an - jbJdn-1, (30)
thevector yielding the
minimum
mean-square dis-
tortion. where a, and b,, are binary information digits on the nth
The l,,,th components of the gradient of E with respect subchannel. For the first block transmission, do is neces-
t o T are sarily a fixed reference. At the output. of the DFT in the
receiver, form the product
(VE),, " - E[2e,,
= __ R e 2, - 2elb I m Z,]
Z,Z,-~* = h,d,h,-l*d~-l*

= (a, - jb,) lhnl' ldn-ll'

The steepest descent algorithm makes changesat the end

+ (a, - jbn)hn(hn-,*- hn* Idn-lI',

of each block transmission in a direction opposite t o t h e n = 1, 2, ... , N - 1, (31)

gradient:
where h, = H ( f , ) is the complex channel transfer func-
ATll = - k [ e , , R e 2, - e l b I m Z , ] tion at the center frequency of the nth subchannel. The
last part of (31) is t.he information signal times an un-
AT,, = --k[el, I m 2 , + elbR e Z,], (29) known amplitude term, plus, an error term depending on
where k controls the step size. A blockdiagram of the h, - h,, - 1. Forbinarytransmission,theinformation
signalcan be reliablyrecovered if the second term is
The vector T and its subscrbted comDonentsshould not he
less than half of the first term. Thisis equivalent to say-
confused
with durat,ion ?' used
the signal eailier. ing
that
the
phase of h does not
changeby
morethan

Authorized licensed use limited to: Tomsk State University. Downloaded on May 28,2022 at 05:18:44 UTC from IEEE Xplore. Restrictions apply.
W E I N S T E I N A N D EBERT : TRANSMISSION BY FREQUENCY-DIVISION
MULTIPLEXING 633

Fig. 8. AutomaticequalizerforFouriertransformreceiver. One

such apparatus is requirctl for each of the ( 7 1 - 1) usable out-
pnts of the discrete Fourier transformer.

30"betweenthecenters of adjacentsubchanncls.Be-
cause a,,and b, are binary, (a7,- j b , ) may be recovered
bydetermining which quadrant of the complex plane
contains z , ~ , -, even though h, is unknown.
For the second and a11 subsequent block transmissions,
do can carry information by comparing it with do from
the previous T-second t.ransmission,i.e.,

do current = (a, - jbo)& Drevious. (32)

APPENDIXI Thus

RECEIVED
SIGNALUNDER LINEARAPPROXIMATIONS
TO na(nl(t) 2 ~ cos
, pTf,t + 4n]sa(1- p,)
AMPLITUDEA N D PHASEOF THE CHANNELTRANSFER
FUNCTION + >sin [W,t + &I d g,(t - P,). (41)
The received signal is given by (16) as
This approxinlation appears as (19) in the main body of
+ b,dn)(t)l,
N-1

r(t> = c
*=O
bnqa(")(t) (33) thispaper.Asimilarderivationyieldsananalogousap-
to prosimation q b ( a()t ).
where
APPENDIXI1
q a y t ) = 2h(t) * [ga(t) cos (2Tf"t)l
CONVEXITY ERROR
OF MEAN-SQUARE
qb(")(t) = 2h(t) * [g,(t) sin (27rfnt)]. (34) The mean-square error hasbeen defined as
Restrictingattentionforthetimebeingto q,(") ( t ) , N- 1
the Fourier transform of this function is E(?) = E
1=1
{ [ T IRe
, z, + T,, Tm x , - all2
Qa(n)(f) H(f)[Ga(f - fn)
= Ga(f fall, +
(35) + + [T,, R e x , - T,, I m x, - b , ] ' } , (42)
where G a ( f ) is theFouriertransform of the "window
function" ga ( t ). We now make linear approximations to where the vector T is defined as
the amplitude and phase of H ( f ) as they affect the sep- T = (TI,, Tzl, T z z , Tzz, . ~ *7 .I j l ( N - 1 ) ) T ~ ( N - I ) )(43)
.
aratespectra Ga(f - f n ) and G(f + f n ) in (35). For
G,(f - f,!), the approximation is Taking a single term of the sum, we have

H ( f ) s [H, + a,(f - f,~)]e'i"-B~cr-r~", (36) TIz2(Re

z,), + T2,'(Irn x,)' + 2 R e 2, I m x l T l l T P l
and for G, (f + fn) the approximation is - R e zL
2al[TlL + T,, I m x , J + a,' + T2,'(Re x J 2
H ( f ) e [H, - a,(f - fn)]e-i[+n+Pn(f+fn)l . (37) + TzZ2(Imx,)' - 2 R e x , I m z,T,,T,,
Thevalidity of theseapproximationsdependsonthe - 2b,[T,, R e x , - T,, I m x , ] + b,'
narrowness of G,(f) and the size of f n , as illustrated in
Fig.6.Onecanalwaysselectawindowfunction ga(t)
= (T,: + T,,') + 2T,,(b, I m x , - a, Re z l )
Jz,~'
for which theapproximations of (36)and(37)lead - 2Tz,(a, I m x , + 6, Re x , ) + a,' + b,',

Authorized licensed use limited to: Tomsk State University. Downloaded on May 28,2022 at 05:18:44 UTC from IEEE Xplore. Restrictions apply.
634 IEEE TRANSACTIONS O N COMMUNICATION TECHNOLOGY,
VOL. COM-19, NO. 5, OCTOBER 1971
which is the sum of functions
and is thus [9l J. 1,. Holsinger,
“Digital
communication
over fixed time-
continuouschannelswithmemory,withspecialapplications
itself. Since E(T)is the sum of convex functions, it too is to telephonechannels.” M.I.T.Res.Lab.Electron.,Cam-
convex. bridge, Rep. 430,1964.

ACKNOWLEDGMENT
The authors are indebted to J. E. Mazo for comments S. B. Weinstein (S’59-M’66) wasbornin
onapproximationtechniques,andto .J. Salzforearlier NewYork, N. Y.,onNovember25,1938.
He received the B.S. degree from the Massa-
work on this project. chusetts Institnte of Technology, Cambridge,
in 1960, the M S . degree from the University
REFERENCES of Michigan,AnnArbor,in1962,and the
Ph.D. degreefrom the University of
111 J. Salz anti S. B. Weinstein,“Fouriertransformcommunica- California, Berkeley, in 1966.
tion
system?”presented a t the Ass. Comput,.
MaFhinery Upon finishinghis graduatestudieshe
Conf.ComputersandCommunication,PineMountain, Gn., worked for approximately one year with the
Oct. 1969.
121 B. R . Sa,lzberg. “Performance of an efficient, paralleldata Philips Research Laboratories in Eindhoven,
transmissionsystem,” IEEE Tmns. C o r n m w ~ .Technol., vol. the Netherlands, beforejoining the Advanced Data Communica-
COM-15, Dec. 1967. pp. 505-811. tions Department, at Bell Telephone Laboratories, Holmdel, N. J.,
C31 M. L. Doelz, E. T. Heald, and D. L. Martin, “Binary data in 1968. He works in thy areas of st,atislical communication theory
transmissiontechniquesforlinearsystems,” R o c . IRE, vol. and data commnnications.
45: May 1957. pp, 656-661.
C4l R. W. Chang and R. A. Gibby, “A theoretics1 study of per-
formance of anorthogonalmultiplexingdata t.ransmission
scheme,” I E E E Trans. Co.mm,,un. Tecknol., vol. COM-16, Paul M. Ebert (M’60) was born in Madison,
Aug. 1965, pp. 529-540’.
- .~ E. N . Powersand M. S. Zimmermnn.“TADIM-Adigital
r5! Wis., onDecember30,1935.Hereceived
implementation of a multichannel datamodem,” presented the B.S. degree from the University of
at thc 1968 IEEE Int. Conf.Communicntions,Philadelphia, Wisconsin, Madison, in1958, and the M.S.
Pa. and Sc D. degreesfrom theMassachusetts
161 W. W . Ahhott, R. C. Benoit, Jr.: and R. A . Northrup, “An Institl1te of Technology,Cambridge,in
all-digitalndaptlvedatamodem,”presenkd at, the IEEE 1962 and 1965, respectively.
ComputersandCommunicationConf.,Rome, N . Y., 1969. From1958 to 1960hewas a member of
171 W. W . Ahhott, I,. W. Blocker,and G. A.Bailey,“Adaptive the AirborneCommunicationsDivision at
data modem.” . Page
- Commun. Eng..,- . Inc., RADC-TR-69-296, the Radio Corporation of America, Camden,
Sept. 1069.
[SI M.S. Zimmermsnand A . L. Kirsch.“The AN/GSC-10 N. J. Since1965he hi5 been a member of
(KATHRYN) variableratedatamodemfor HF radio,” the Advanced Data Communications Department, Bell Telephone
IEEE T m n s . Cornmun. Technol., vol.COM-15,Apr. 1967, Laboratories, Holmclel, N. J. He has worked in the fields of informa-
pp. 197-204. tion theory, coding, and digital filtering.

Eye Pattern for the Binary Noncoherent Receiver

Abstract-The assessment of imperfect channels indatatrans- I. INTRODUCTION

mission usually involves noise considerations.
Channel imperfections
are related to system performanceby determining the increase in USEFUL design met.hod for determining the ef-
carrier-to-noiseratiorequiredtomaintain a fixed error rate. The fect of channel distortions on a linearly modu-
impairment is determined by examining the “eye” pattern, which
shows the effective reduction in signal amplitude caused by inter-
htedanddemodulatedsignal is to use the
symbol interference. eye-openingcriterion,whichbasicallydeterminesthe
This paper derives the eye function for thebinaryquadratic dist.ance from the decision threshold for the worst data
receiver. Thebinary instantaneous frequencydiscriminator,the sequence. This distance allows the designer t o determine
differentialphase shiftreceiver, andthenoncoherentfrequency- the increa.se incarrierpowernecessarytocorrectfor
shiftkeying (FSK) receiverimplementedusing thedifference of
two envelopes are binary quadraticreceivers. this distortion.
The eye pattern is easily obtained by computation using the eye With the noncoherent quadra.tic receiver i t is difficult
function. toperformaconlparableanalysis.Thus,in t.he pre-
liminary treatment of such systems i t is conlmon t o as-
Pa.per n,pproved by the Data Communicat,ions CommitLee of the sume t h a t t.he noisepoweris that obtained through a
IEEE CommunicationTechnologyGroupforpuhlicationafter filterwithabandwidthequaltothesignalingspeed,
presentation a t the 1970 IEEE International Conference on Com-
municntions, San Francisco, Calif., June 8-10, Manuscript received whereas the signal is undist.orted. It is then necessary t o
September 22,19870. determinetheincreaseincarrier-to-noise ( C / N ) ra.tio
The author is with Bell-NorthernResearch,
Ottawa,
Ont.,
Cnnadn. that wouldbenecessary withtheactualchannel. To

Authorized licensed use limited to: Tomsk State University. Downloaded on May 28,2022 at 05:18:44 UTC from IEEE Xplore. Restrictions apply.