Académique Documents
Professionnel Documents
Culture Documents
C. E. Shannon, Communication in the presence of Noise, Proceeding of the IRE, vol. 37, no.1, pp. 10-21, Jan, 1949.
Fourier
We can divide the band into a large number of small bands, with N (f ) approximately constant in each
M. L. Doeltz, E. T. Heald and D. L. Martin, Binary data transmission techniques for linear systems, Proc. IRE, vol. 45, pp. 656-661, May 1957.
First system known as Kineplex (50 years ago!) for military purposes in the band [1.830Mhz].
Joseph Fourier, 1768-1830 The basic idea used the Fourier transform but the success was limited due to the high cost of orthogonal analog lters.
4
A. Peled and A. Ruiz, Frequency domain data transmission using reduced computational complexity algorithms, in Proc. IEEE Int. Conf. Acoustics, Speech and Signal Processing, Apr. 1980, pp. 964-967 B. Hirosaki, An Orthogonally multiplexed QAM system using the discrete Fourier Transform, IEEE Trans. Commun,. vol. Com-29, pp. 982-989, Jul. 1981 The modulator was based on the FFT and had well celebrated features thanks to Cooley (IBM) and Tukey (Princeton) in 1965. But how does one cope with frequency selective channels?
OFDM Afterwards
WO9004893, oct, 1989, First worldwide patent introducing the guard interval in OFDM
Tristan de Couasnon, Supelec then TH-CSF The idea is based on the use of a guard interval. The unexploited guard interval trades complexity for performance but this is exactly the degree of freedom we need We have to exploit it!
6
MODULATOR
S(k)
S0(k) S1(k)
DEMODULATOR
rig(k)
P=S P=S
ig r0 (k) ig rD 1(k)
s( k )
s0 (k ) s1 (k ) s2 (k )
sig(k)
sig (k) 0 sig 1 (k) D sig (k) D
r(k)
r0(k) r1(k) r2(k)
R( k )
R0(k)
C0
sn
SN
1(
k)
sN
D (k )
s(t)
bn
C(k)
r ( t)
RN
rN 1(k)
1( )
CN
sN 1 (k )
sig 1 (k) P
modulation
demodulation
Some mathematics..
(1)
(1) xN L+1
. . .
xN (1) x1 . . . (1) xN
(1)
(N +L)1
we let
(1) xN =
(1) x1
. . .
N 1
xN
(1)
H = FN
(1) s1
. . .
N 1
sN
(1)
= FN sN
(1)
Some mathematics...
rBS1 = CN +LxN +L + n Here, CN +L CN (N +L) represents the OFDM complex channel matrix of the channel between the kth user Uk and the j th base station BSj , (k,j) (k,j) h h0 0 0 L . ... ... ... . 0 . (k,j) CN +L = . ... ... ... . . 0 (k,j) (k,j) 0 0 hL h0 N (N +L)
(k,j)
(1,1)
(1)
Some mathematics...
The received signal is processed by a FFT matrix FN . At BS1 , we can write the outcome signal yBS1 as follows FN CN +LxN +L = FN CN FN sN = HdiagsN (1,1) (1,1) (1,1) h0 0 hL h1 . . ... ... ... . . . . (1,1) (1,1) ... ... h hL L = . ... ... ... . 0 . . ... ... ... . . 0 (1,1) (1,1) 0 0 hL h0
(1,1) (1) (1,1) H (1) (1) (1)
where
CN
(1,1)
N N
and
(1) Hdiag
10