Appeal No. 2002-1994
Application No. 09/364,449
in said group” as bit selection of Thatcher. The Examiner’s
position with regard to the reading of the stored data in its
reorganized format and the benefits of remapping of Thatcher
(answer, page 8), is supported by the reference teaching wherein
the selection of bit 0 of byte 31 requires traveling across only
32 bits instead of the entire cache line 256 bits (col. 5, lines
10-25).
Additionally, we remain unconvinced by Appellants’ argument
(brief, page 9) that the claimed “each group of the plurality of
groups is operable for reading a data value from a corresponding
storage unit is said group” does not read on the organization of
bytes in Thatcher (grouping all the bit 0s of each byte
together, all of the bit 1s of each byte together, etc.) (Col.
3, lines 27-48). In fact, Thatcher does show that each group
(word) is operable for reading a data value from a corresponding
storage unit (bit) in said group, which is disclosed as the
specific scheme of data selection requiring minimal wiring (col.
3, lines 49-60). We also note that the organization of data
based on interleaving bytes of the bus, similar to data
organization of Thatcher, is described in Appellants’
specification in support of the claims wherein lines for byte 0
are coupled to the 0 byte of cache group 0, lines for byte 01 is
7
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 12 Next
Last modified: November 3, 2007