Encoding process, Computer Networking

Assignment Help:

Encoding Process

c= uG

u: binary data sequence of length 4( input)

G: Generator matrix which is 7*4

c: Codeword

 

 

797_Encoding Process.png

Decoding Process

s= rHT

r: received data sequence of length 7 ( input) H: Parity-Check Matrix

s: Syndrome to check error-position

 

 

1855_Encoding Process1.png

If some output values of the encoding and decoding multiplication is over than 1, the value should be changed into remainder on division of itself by 2.  (Ex: (4 2 1 ) => (0 0 1))

 

s(Syndrome) detect error position. We can know the single-error-bit position in the table below.

234_Encoding Process2.png

Fig. Decoding table for Hamming code(7,4)

If s is [0 0 0] and r= [0 1 0 0 0 1 1], it supposes that there is no error and transmitted data is [0 0 1 1]. If s is [0 1 0] and r = [1 0 1 0 0 1 0], it supposes that 2th bit is corrupted, so r should be changed to [1 1 1 0 0 1 0], and transmitted data is lower 4bits, [0 0 1 0].


Related Discussions:- Encoding process

Differentiate lan and wan, Question 1 Differentiate LAN and WAN Questi...

Question 1 Differentiate LAN and WAN Question 2 Explain the TCP/IP Reference Model with diagram Question 3 Describe Circuit switching and message switching Question

Synchronization in factor causing , Synchronization Multiple processors...

Synchronization Multiple processors need synchronization with each other while implementing a parallel algorithm. That is, the task running on processor X might have to wait fo

Write down the purpose of arp?, Address Resolution Protocol resolves the MA...

Address Resolution Protocol resolves the MAC address if the IP address is known. It is a layer 3 protocol.

Show the congestion avoidance in tcp, Q. Show the Congestion avoidance in T...

Q. Show the Congestion avoidance in TCP? Slow Start (SS) & Additive Increase (AI) (AI=Congestion Avoidance) start with the congestion window (cwnd) = max segment si

System deadlock in shared programme structures, System Deadlock A dead...

System Deadlock A deadlock refers to the situation when simultaneous processes are holding resources and preventing each other from completing their implementation. The fol

No retransmission - transport layer, No Retransmission This  protocols...

No Retransmission This  protocols  will not  through  the correctly received packets  but buffers than  and send  acknowledgment  for those packets. Thus  retransmission of th

Perfect shuffle permutation-concept of permutation network, Perfect Shuffle...

Perfect Shuffle Permutation This was advised by Harold Stone (1971). Consider N objects each characterized by n bit number say  X n-1, X n-2, X 0    (N is chosen such that N

Process switching and fast switching, Process Switching It applies the...

Process Switching It applies the brute force method to switch packets wih consumption of large amount of CPU time List of items are needed when switching packets Routing

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd