it uses a simple fixed structure of pointers for computing parity stripes the disadvantage is the need to store and handle the incoming data stripes plus the parity stripes referring to fig5 a and 5b diagrams illustrating an alternate method of parity generation are depicted in accordance with a preferred embodiment of the present invention fig5 a and 5b depict the u201c light u201d method of parity generation as with the previous method the data block is split into n stripes s 1 s n however unlike the heavy method the data is not physically stored after it is read instead the data is read and thrown away the data is read stripe by stripe while intermediate parity values are computed again there are positive diagonal p 1 straight p 0 and negative diagonal parities p u2212 1 in fig5 a incoming data is being read from the 11 th section s 4 11 501 in data stripe s 4 and intermediate parity values are being computed and stored to the 15 th section p 1 15 502 of parity stripe p 1 the 11 th section p 0 11 503 of parity stripe p 0 and the 14 th section p u2212 1 34 504 of parity stripe p u2212 1 the xor operation is.