Professional Documents
Culture Documents
2015/9/18 Yuh-Ming Huang CSIE, NCNU 1
2015/9/18 Yuh-Ming Huang CSIE, NCNU 1
2015/9/18 Yuh-Ming Huang CSIE, NCNU 1
課程目標: 本課程主要介紹錯誤更正碼之編
碼理論, 其可用來作數據資料"傳輸"及"儲存"
之錯誤更正控制.
2 Es
Si (t ) cos 2 f0t i , 0 t T ,
T
where i 2 (i -1) / M for 1 i M .
E/N0 (dB)
2015/9/18 Yuh-Ming Huang CSIE, NCNU Introduction 11
/******AWGN (transfer information to receive sequence)******/
void awgn_channel(double Y, double R, char information[], double receive[], int size){// Y: SNR(dB) R: code rate
double u1,u2;
double r_max;
int i;
i = 0;
#ifdef PC
r_max = RAND_MAX;
#endif
while (i < size){
#ifdef PC
u1 = rand()/r_max;
u2 = rand()/r_max;
#else
u1 = drand48();
u2 = drand48();
#endif
receive[i] = sqrt(-2 * log(u1)) * cos(2 * Pi * u2);
i++;
if (i<size) {
receive[i] = sqrt(-2 * log(u1)) * sin(2 * Pi * u2);
i++;
}
}
Code structure-based
Source Coding
- # of bits per unit time is minimized
- Non-ambiguous decoding
Channel Coding
- Encoder : to combat the noisy environment in which
code words must be transmitted or stored.
- Decoder : that minimize the probability of
decoding error
Compression Control
Coding Cryptography
And
Network Security
K bits n bits
。。。 。。。
Encoder
K bits n bits
。。。 。。。
Encoder
previous
m
blocks
u0 u1 u2 u3
To channel
⊕ ⊕ ⊕
v0 v1 v2
v 100 1011
let u=(1 1 0 1 0 0 0 0 0)
v=(11,10,00,10,01,01,00,00,00)
u …0001011
v
…0001011
…0001011
⊕ …0001011
…0001011
…0001011
u=(…,m-1,m0,m1,…) …0001011
v=(…,C-1(1), C-1(2), C0(1), C0(2),
C1(1), C1(2),…)
g ( n ) L{ f ( n)} L{ f (k ) (n k )}
k
time
linear
f (k )L{ (n k )} f ( k )h( n k ) f ( n ) * h( n )
invariant
k k
Impulse response
……
P(
) Q-
1 P(1|1 1|0
)
1 1-p 1 P(Q-1
|1) Q-1
1-q1 s1 s2 q2
1- p1 1- p2
0 0 0 0
e.g. p2
p1
p1 ≈ 0
p2
p2 ≈ 0.5 p1
1 1 1 1
1- p1 1- p2
Figure 1.7 Simplified model of a channel with memory
e.g. radio channel : error bursts are caused by signal fading