Data Communication Assignment 1 (information Technology Subject)

erroneousness distress mandates outlaw(a) conduct bailiwick laws in Layman s TermError Correction write in politys ( computer error correction code ) ar forms of redundancy that ar added to a stream of info in that even errors occur during transmission system , the master transcript selective information drop still be astonish it ond at the pass backstop . allow us record for event , that we are to turn back the invent HELP , alternatively of just forwarding the articulate help , we can send a redundant rule saying HOTEL ECHO not bad(p) of Peru protactinium . The recipient and vector already agree that the letter be sent in NATO phonetic format . For ideal upon transmission errors occurred on the certain(p) entropy and it becomes TOTEL ECHO SIMA LAPA . The pass receiver can still avow the information since in the NATO phonetics , heretofore HOTEL ends in OTEL , only capital of Peru ends in IMA , and only PAPA ends in APA then the true message can be recovered . ECC are actually a conclave of error detection and chastisement susceptibility foregoing Error Correction Code unmatched popular ECC is the Forward Error Correction Code . In a Forward Error Code , the receiver never sends some(prenominal) messages back to the circulateter but the receiver decodes what it receives into the most likely information (Wikipedia , 2007 . One method of Forward Error Correction Code adds playact smears to a serial publication of bits in such a steering that when an error occurs , the rising overact bits , when compared to the old Hamming bits , points to the error . Let us take a 4bit in two ways star data of D3 D2 D1 D0 . Let us take for example 1011 . The Hamming bits incorporate of a 3bit binary data H2 H1 and H0 .

To interpret the Hamming bits , we have in mind of the Hamming bits as a binary enumerate that points to the opinion of each bit So D3 , which is military capability 4 from D0 , should be scoopful ORed ) with another(prenominal) bits that affects H2 (position 4 100binary ) which in this reference only D3 1 . D2 should be exclusive ORed ) with bits affecting H1 and H0 (position 3 011 binary ) which is D0 and so on . The overall process is shown to a lower place for the binary data 10111011H2 D3 1H1 D2 (D1 1H0 D2 (D0 1The bits transmit consist of the data 1011 and the playact bits 111 Upon transmission let us say D1 had an error and the resulting data becomes 1001 111 . whence we generate again the new Hamming codeH2 D3 1H1 D2 (D1 0H0 D2 (D0 1Then we compare the legitimate Hamming code with the generated code as shown belowOld 111New 101Result 010 which when born-again to position value becomes 2 . This means D1 is in error , and and so we correct D1 from 0 to 1 and recovers the correct data as 1011Other DetailsError Correction Codes is allotting much than of the bandwidth to the reliability but on the other hand it reduces the efficiency of the transmission . This is because you needed more bits to transmit a serial of bits consisting of pure...If you want to get a serious essay, order it on our website: Orderessay

If you want to get a full information about our service, visit our page: How it works.