2015/12/24 1 Error Correction Code (2) Fire Tom Wada Professor, Information Engineering, Univ. of...

23/04/21 1

Error Correction Code (2)

Fire Tom Wada

Professor, Information Engineering, Univ. of the Ryukyus

223/04/21

Two major FEC technologies1. Reed Solomon code (Block Code)

2. Convolutional code

3. Serially concatenated code

SourceInformation

ReedSolomon

CodeInterleaving

ConvolutionCode

ConcatenatedCoded

Goes to Storage, Transmission

Concatenated

323/04/21

(n, k) Block Code

Time t information block it is coded to time t code wt. k : information length n : code length Code Rate : R=k/n

Information

code wt-2

n bitE

423/04/21

Convolutional Code

Time t code wt is determined by past K information. K : Constraint length Code Rate : R=k/n

Information

code wt-2

Constraint length K

523/04/21

Simple Convolutional Coder

210 iii121110 ccc

222120 ccc

iDDiiic

　 D is delay operator

　 c1t, c2t depends on not only current it bu also past it-1, it-2

623/04/21

Simple Convolutional Coder(2)

Time t 0 1 2 3 4 5

it 1 1 0 0 1 0

F1=it-1 0 1 1 0 0 1

F2=it-2 0 0 1 1 0 0

c1t 1 1 1 1 1 0

c2t 1 0 0 1 1 1

If input information is “110010” then

Output code is “11 10 10 11 11 01”.

Constraint length K=3, R=1/2

723/04/21

State Transition Diagram Number of State: 4

Time t 0 1 2 3 4 5

it 1 1 0 0 1 0

F1=it-1 0 1 1 0 0 1

F2=it-2 0 0 1 1 0 0

c1t 1 1 1 1 1 0

c2t 1 0 0 1 1 1

823/04/21

State Transition Diagram(2)

Time t 0 1 2 3 4 5

it 1 1 0 0 1 0

F1=it-1 0 1 1 0 0 1

F2=it-2 0 0 1 1 0 0

c1t 1 1 1 1 1 0

c2t 1 0 0 1 1 1

In each time t, a traveler stays in one state.

And move to different state cycle by cycle.

923/04/21

Trellis Diagram Convert the State transition diagram to 2D diagram

Vertical axis : states Horizontal axis : time

states

1023/04/21

Encoding in Trellis Input information determines

a path in Trellis Each Branch outputs 2bit code.

Time t 0 1 2 3 4 5

it 1 1 0 0 1 0

F1=it-1 0 1 1 0 0 1

F2=it-2 0 0 1 1 0 0

c1t 1 1 1 1 1 0

c2t 1 0 0 1 1 1

t=0 t=1 t=2 t=3 t=4 t=5

1123/04/21

Punctured Convolutional Code The example Encoder has Code Rate R=1/2 Punctured Convolutional Code means that one

or some code output is removed. Then Code Rate can be modified

punctured

original

1223/04/21

Merit of Punctured Code Larger code rate is better. Using Punctured technology,

1. When communication channel condition is good, weak error correction but high code rate can be chosen.

2. When communication channel condition is bud, strong error correction but low code rate can be chosen.

3. This capability can be supported by small circuit change.One coder or decoder can be used for several code rate addaptively

1323/04/21

R=2/3 example

3210 iiii1413121110 ccccc

2423222120 ccccc

2313221221112010: CCCCCCCCpuncturedNon

232212212010: CCCCCCPunctured

3210 iiii

1423/04/21

Viterbi Decode Viterbi Decode is one method of Maximum likelihood

decoding for Convolutional code. Maximum likelihood decoding

Likelihood function is P(xi|r): Probability of seding xi under the condition of receiving r

N messagex1, x2, x3, …, xN

Sender take one message and send it out!

x? rReceiver find the maximum conditional Probability

)|( rxP i

1523/04/21

Viterbi Decode(2) Branch metric is the Likelihood function of

each branch. -Ln{p(xk|ri)}

High possibility small valueExample : Hamming distance

Path metric is the sum of branch metrics along the possible TRELLIS PATH.

1623/04/21

Viterbi Decoding Example R=1/2, Receive 11 10 11 01 11 01 Calculate Each Branch metric (This time Hamming distance)

t=0 t=1 t=2 t=3 t=4 t=5 t=6

11Rece-ived 10 11 01 11 01

1723/04/21

Viterbi Decoding Example(2) Calculate Path metric in order to find minimum path metric

path. Until t=2

t=0 t=1 t=2 t=3 t=4 t=5 t=6

Lower path has smaller path metric,Then Take it!

1823/04/21

Viterbi Decoding Example(3) Calculate Path metric in order to find minimum path metric

path. Until t=6

t=0 t=1 t=2 t=3 t=4 t=5 t=6

1923/04/21

Viterbi Decoding Example(4)

1 1 2 2

t=0 t=1 t=2 t=3 t=4 t=5 t=6

Select Minimum Path Metric and get original information In this example, two minimum path

Upper path : 1 1 0 0 1 0 Lower path : 1 1 1 1 1 1

If we increase the time, we might find ONLY ONE MINIMUM PATH.

2023/04/21

Received signal has many level In the previous example, we have assumed the received

sequence is 11 10 11 01 11 01

Usually, received signal is analog (Many Levels) such as

SIGNAL LEVEL

01234567

6 5 6 3 5 4 3 6 6 6 2 7

2123/04/21

HARD DECISION

Hard Decision

1 1 1 0 1 1 0 1 1 1 0 1

SIGNAL LEVEL

01234567

6 5 6 3 5 4 3 6 6 6 2 7

HARDDECISIONOUTPUTS

Highly reliable 1

Low reliable 1 We have to distinguish!

Loosing Reliability Information by Hard Decision!

2223/04/21

Soft Decision Use soft decision metric

One Example

LEVEL 0 1 2 3 4 5 6 7

Branch Metric for ‘0’ 0 0 0 0 0 1 2 3

Difference -3 -2 -1 0 0 1 2 3

No effect on Viterbi decoding!

Looks like Erased or Punctured!

Reliable ‘0’ Reliable ‘1’

00 00(branch metric = 1 + 2 = 3)

LEVEL= 65

HOW TO COMPUTE BRANCH METRIC

2323/04/21

Soft Decision Viterbi

t=0 t=1 t=2 t=3 t=4 t=5 t=6

65LEVEL 63 54 36 66 27

LEVEL 0 1 2 3 4 5 6 7

Calculate Branch Metric based on Soft-Table

2423/04/21

Soft Decision Viterbi(2)Calculate Path metric in order to find minimum path metric path.Until t=6

t=0 t=1 t=2 t=3 t=4 t=5 t=6

65LEVEL 63 54 36 66 273

2523/04/21

Soft Decision Viterbi(3)

t=0 t=1 t=2 t=3 t=4 t=5 t=6

65LEVEL 63 54 36 66 27

Select Minimum Path Metric and get original information In this example : 1 1 0 0 1 0

2623/04/21

Summary 2 types of FEC

Block code such as RS Convolutional Code

Convolutional Code Code Rate Punctured

Viterbi Decoder : Maximum likelihood decoding Trellis Hard Decision vs. Soft Decision Branch Metric, Path Metric

2015/12/24 1 Error Correction Code (2) Fire Tom Wada Professor, Information Engineering, Univ. of...

Documents

Naoya Wada official website

20200408093850 - University of the Ryukyus

Acknowledgements - wada-ama.org

RICHARD H. MCLAREN INDEPENDENT PERSON WADA … · RICHARD H. MCLAREN INDEPENDENT PERSON WADA INVESTIGATION OF SOCHI ALLEGATIONS 16 July 2016 Via Email: Olivier.Niggli@wada-ama.org

SDG - Wada Ma Tpdap Abhiyan

The Ryukyus and the New, But Endangered, Languages of Japan

SapporoRubyKaigi02 t-wada LT

UNIVERSITY OF THE RYUKYUS - ryudai2nai.com

Introduction to OFDM - University of the Ryukyus

Fire Tom Wada Professor, Information Engineering, Univ. of the Ryukyus Chief Scientist at Magna Design Net, Inc wada@ie.u-ryukyu.ac.jp wada

Wada Information

Wada 2014 Annual Report

IPC 14.03 2010 MedicalandDoping Combined Presentation · • Consistent with the World Anti-Doping Agency (WADA) Code, WADA Prohibited List and the WADA Standards ... Microsoft PowerPoint

World Anti Doping Agency-WADA

play true - wada-ama.org

Bank of the Ryukyus Management Briefing for FY2014 › common › uploads-archives › 2016 › 02 › ... · 2018-03-06 · Bank of the Ryukyus Management Briefing for FY2014.

RICHARD H. MCLAREN INDEPENDENT PERSON WADA …€¦ · !i! RICHARD H. MCLAREN INDEPENDENT PERSON WADA INVESTIGATION OF SOCHI ALLEGATIONS 16 July 2016 Via Email: Olivier.Niggli@wada-ama.org

WADA Technical Document – TD2022EPO

2018 年度用 - University of the Ryukyus

Wada, Grace K., WADA, ISUKE,