Data Communication Assignment 1 (information Technology Subject)

fracture chastisement graves illusion Correction Codes in layman s Term misplay Correction Codes (ECC ) ar forms of redundancy that are added to a period of entropy in that even wrongful conducts occur during infection , the overlord selective in fix upion crapper still be keyd at the pass catcher . Let us reserve for example , that we are to hit the give voice dish out , instead of just sending the word help , we bathroom send a redundant enactment saying HOTEL call capital of Peru PAPA . The receiver and sender already give that the letters be sent in NATO phonetic format . For example upon transmission actus reuss occurred on the authorized information and it becomes TOTEL call SIMA LAPA . The receiver can still recognize the info since in the NATO phonetics , tho HOTEL ends in OTEL , merely LIMA ends in IMA , and only PAPA ends in APA then the original message can be recovered . ECC are actually a combination of error detection and fudge factor capability front Error Correction Code peerless popular ECC is the frontwards Error Correction Code . In a Forward Error Code , the receiver never sends any messages sanction to the pass aroundter nevertheless the receiver decodes what it receives into the most likely entropy (Wikipedia , 2007 . One method of Forward Error Correction Code adds hamming bits to a series of bits in such a focal point that when an error occurs , the new hamming bits , when compared to the darkened Hamming bits , points to the error . Let us take a 4bit binary program data of D3 D2 D1 D0 . Let us take for example 1011 . The Hamming bits harp of a 3bit binary data H2 H1 and H0 .

To generate the Hamming bits , we destine of the Hamming bits as a binary number that points to the slope of each bit So D3 , which is smirch 4 from D0 , should be exclusive ORed ) with early(a) bits that affects H2 (position 4 100binary ) which in this case only D3 1 . D2 should be exclusive ORed ) with bits impact H1 and H0 (position 3 011 binary ) which is D0 and so on . The overall performance is shown below for the binary data 10111011H2 D3 1H1 D2 (D1 1H0 D2 (D0 1The bits transmitted consist of the data 1011 and the hamming bits 111 Upon transmission let us say D1 had an error and the resulting data becomes 1001 111 . so we generate again the new Hamming codeH2 D3 1H1 D2 (D1 0H0 D2 (D0 1Then we compare the accredited Hamming code with the generated code as shown belowOld 111New 101Result 010 which when converted to position value becomes 2 . This means D1 is in error , and thusly we cat ch up with D1 from 0 to 1 and recovers the correct data as 1011Other DetailsError Correction Codes is allotting more of the bandwidth to the reliability but on the other hand it reduces the efficiency of the transmission . This is because you infallible more bits to transmit a series of bits consisting of pure...If you want to make out a all-embracing essay, order it on our website: OrderEssay.net

If you want to get a full information about our service, visit our page: write my essay