ERROR DETECTION USING STANDARD FCS ALGORITHM

3 visualizzazioni (ultimi 30 giorni)
garry
garry il 10 Nov 2014
Commentato: garry il 11 Nov 2014
AT THE GENERATOR:-
INPUT 1:- (k bit) message pattern of 0's and 1's as a line of ASCII text.
INPUT 2:- (n+1 bit) generator pattern of 0's and 1's also in ASCII .
1] Now firstly according to FCS algorithm; we have to pad n zeroes to the k-bit message pattern. For example if our original message pattern is of 4 bits (k=4) i.e 1100 and generator pattern is of 4 bits (n+1=4) i.e. 1101; then we have to pad 3 zeroes (as n=3) to our original message pattern.
So our " NEW MESSAGE PATTERN":- 1100 000 (k+n bits)
2] Now we have to perform XOR division of this new message pattern and our Generator pattern.
So summarizing we need to perform XOR Division of our " NEW MASSAGE PATTERN " ; (now consisting of k-bit message and n-zeroes) and " Generator Pattern " (n+1 bits) .
3] In the remainder we obtain n- FCS bits which we replace by the n-zeroes of the " NEW MESSAGE PATTERN " to obtain the final TRANSMITTED PATTERN at the generator.
The OUTPUT should be a standard output line of ASCII text with " k+n " 0's and 1's representing the message to be transmitted (including the original k-bit message + the n-bit FCS bits).
Also represent the TRANSMITTED PATTERN in a Polynomial form.
I have solved a problem which can also be referred to in the attached flyer.
  4 Commenti
Mostra 2 commenti meno recenti
garry
garry il 11 Nov 2014
heyyy "M H"...
Did u try the code in matlab..??
I could understand the Code partially in java.

Accedi per commentare.

Accedi per rispondere a questa domanda.

Risposte (0)

Categorie

Scopri di più su MATLAB Code Analysis in Help Center e File Exchange

Tag

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by