Appeal No. 2003-1111
Application No. 09/164,088
Next, a review of Yoshioka confirms that the reference
relates to a data processor with improved address translation
method (col. 1, lines 9-12). Although the reference describes
the process of replacing missed information from one of the banks
(col. 5, lines 31-46), using a replacement software for the bank
to be replaced (col. 7, lines 18-30), the disclosed banks are not
the same as the claimed dependence bank structure. Therefore,
contrary to the Examiner’s characterization, we find that the
replacement algorithm of Yoshioka is unrelated to a dependence
bank structure, as recited in claim 1 and described in
Appellants’ disclosure. Similarly, we note the Examiner’s
struggle in reading the claimed “dependency code” on the “SV bit”
of Yoshioka by reasoning that “it [SV bit] indicates whether the
virtual page depends on single or multiple virtual page support”
(answer, page 8). This is not what the skilled artisan would
have understood to be the meaning of the claimed “dependency
code,” as described in the specification.
Narayan and Barth, on the other hand, relate to a mask
decoder circuit and initialization of DRAMs, respectively.
Although we agree with the Examiner that some kind of memory
banks or sense amplifiers are described by these two references,
we do not find any specific teaching in either of them that would
have been related to the claimed dependency code. Furthermore,
6
Page: Previous 1 2 3 4 5 6 7 8 9 Next
Last modified: November 3, 2007