Scribd
Upload
119 views14 pages

LBC Decoding PDF

The document discusses parity check matrices and how they enable error detection and correction in linear block codes. A parity check matrix H corresponds to a generator matrix G, and allows checking if codewords generated by G satisfy certain parity check conditions. The syndrome of a received vector r is computed by multiplying r with the transpose of H. By looking up the syndrome in a standard array, the error pattern can be identified and corrected. An example decoding of a (6,3) code is provided to demonstrate this process.

Uploaded by

Rama Ardiansyah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
119 views14 pages

LBC Decoding PDF

The document discusses parity check matrices and how they enable error detection and correction in linear block codes. A parity check matrix H corresponds to a generator matrix G, and allows checking if codewords generated by G satisfy certain parity check conditions. The syndrome of a received vector r is computed by multiplying r with the transpose of H. By looking up the syndrome in a standard array, the error pattern can be identified and corrected. An example decoding of a (6,3) code is provided to demonstrate this process.

Uploaded by

Rama Ardiansyah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

Parity-Check Matrix

 Parity-check matrix H enable us to decode


 For (k*n) generator matrix G, there exist an (n-k)*n
matrix H

1
Parity-Check Matrix
 It’s easy to verify that for each codeword U,
generated by G and the H T
 1 0  0 
 0 1  0 
 
   0 
 
T  0 0  1 
UH  p1 , p 2 , ..., p n  k , m 1 , m 2 , ..., m k  p11 p 21  p 1,( n  k ) 
 
 p 21 p 2 ,( n  k ) 
  
 
 p k1 pk2 p k ,( n  k ) 
 p1  p1 , p 2  p 2 , ..., p n  k  p n  k  0 No errors

 to check if each basis still has orthogonality


2
3
Syndrome Testing
 Misal r adalah received vector, r  U  e
dimana e  e1 , e2 ,..., en adalah pola error
 Syndrome r didefinisikan:
T
S  rH
T
 (U  e) H
 UH T  eH T
T
 eH
Sebuah Linear block code dapat mengkoreksi 2n-k-1 error
patterns sesuai denngan 2n-k-1 coset leader 4

Catat bahwa satu dari coset leader adalah zero vector


Syndrome Testing
 Sebagai contoh, jika
dikirimkan U  1 0 1 1 1 0
dan diterima r  0 0 1 1 1 0 1 0 0
error 0 1 0 
 Syndrome 
0 0 1
S13  rH   0 0 1 1 1 016 
T

1 1 0
0 1 1
 
1 0 1  63
 1 1  1 1  1  1 0 0

 Dan syndrome error pattern


S  eH T  1 0 0 0 0 0 H T  1 0 0 5
Error Correction
 Stand array : menunjukkan kemungkinan received
vector yang berisi semua correctable error
Coset leader k
2
=0

coset
2n  k

6
(n,k) standard array
Standard Array
 Coset : sejumlah bilangan yg mempunyai
common syndrome
S  (U i  e j ) H T  e j H T

 Coset leader : correctable error patterns


 Received vector r  U i  e j doesn’t mean the Tx
message is U i for sure except the error pattern is
ej

7
Error Correction Decoding
Prosedur
 Hitung syndrome r : S  rH T
 Temukan coset leader : ej
 Corrected codeword : U  r  ej

8
Contoh (6,3) code Corrected codeword

Standard
array
untuk (6,3)
code

Error pattern Received vector


1 0 0
0 1 0 

0 0 1
S  ej  
1 1 0
0 1 1
  9
 1 0 1 
Example for (6,3) code
 Asumsi dikirim U  1 0 1 1 1 0
diterima r   0 0 1 1 1 0
 Syndrome
S  0 0 1 1 1 0 H T  1 0 0

 Dari look-up table eˆ  1 0 0 0 0 0


Uˆ  r  eˆ
 0 0 1 1 1 0 1 0 0 0 0 0
1 0 1 1 1 0

10
The same as transmitted codeword !!
Rangkaian Syndrom

11
Decoder Umum Linear Block
Code

12
Decoding Circuit (7,4) Linear
Block Code

13
Conclusion
 Linear block code is easy to implement
 Will be extended to space-time block
code
 Still some other kinds of code to
introduce …

14

You might also like