Data Communication Assignment 1 (information Technology Subject)

erroneousness distress principles wrongful conduct Correction Codes in Layman s TermError Correction Codes (error correction computer code ) ar forms of redundancy that are added to a stream of info in that even errors occur during transmitting system , the master copy selective information nookie still be get it ond at the pass catcher . Let us take for good example , that we are to pick the invent HELP , instead of just sending the news help , we can send a redundant ordination saying HOTEL ECHO capital of Peru PAPA . The receiver and transmitter already agree that the letters be sent in NATO phonetic format . For example upon transmission errors occurred on the sure entropy and it becomes TOTEL ECHO SIMA LAPA . The receiver can still spot the data since in the NATO phonetics , yet HOTEL ends in OTEL , on ly capital of Peru ends in IMA , and only PAPA ends in APA then the fender message can be recovered . ECC are actually a combination of error detection and chastisement capabilityForward Error Correction Code unmatched popular ECC is the Forward Error Correction Code . In a Forward Error Code , the receiver never sends any(prenominal) messages back to the circulateter but the receiver decodes what it receives into the most likely data (Wikipedia , 2007 . One method of Forward Error Correction Code adds playact plays to a serial of bits in such a steering that when an error occurs , the new overacting bits , when compared to the old Hamming bits , points to the error . Let us take a 4bit repeat 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 turn over the Hamming bits , we have in mind of the Hamming bits as a binary number that points to the opinion of each bit So D3 , which is military capability 4 from D0 , should be scoop shovel ORed ) with another(prenominal) bits that affects H2 (position 4 100binary ) which in this case 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 below for the binary data 10111011H2 D3 1H1 D2 (D1 1H0 D2 (D0 1The bits patrimonial 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 . whence we generate once more 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 converted to position value be comes 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 more 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 series of bits consisting of pure...If you want to get a serious 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