Appeal No. 1998-1119
Application No. 08/482,924
Claims 63 and 77 through 81 stand rejected under 35
U.S.C. § 103(a) as being unpatentable over Burghard in view
of Knauft.
Reference is made to the brief and the answer for the
respective positions of the appellants and the examiner.
OPINION
The obviousness rejection of claims 63 and 77 through 81
is reversed.
The prior art portion of Burghard (column 1, lines 18
through 28) discloses that it is known to store parity bits
with data bits. The integrity of the data bits is determined
by generating a set of parity bits from the recovered data
bits and comparing the new parity bits with the previously
encoded parity bits. If the new parity bits are identical to
the previously encoded parity bits, then error free data is
recovered. In the preferred embodiment of Burghard (column 5,
lines 33 through 42), a previously encoded word is retrieved
from memory and decoded to provide a new set of parity bits.
The new parity bits are compared with the parity bits
retrieved from memory and, if there is complete agreement, the
data is assumed to be error free. If the two sets of parity
3
Page: Previous 1 2 3 4 5 6 7 8 9 Next
Last modified: November 3, 2007