Appeal No. 2002-1777 Page 9
Application No. 08/953,219
in a data stream to indicate the end of one data segment and the beginning of another."
(Appeal Br. at 23.)
Independent claim 28 specifies in pertinent part the following limitations: "writing
selected segment location information into a selected packet by identifying first and last
segments in the selected packet, and writing the segment location information into a
location in the selected packet that is separate from the first and last segments." Giving
the independent claim its broadest, reasonable construction, the limitations require
writing data corresponding to the first and last segments of a packet of data into the
packet at a location separate from the first and last segments.
Sotheran's Figure 33 "shows the start and the end of a token." Col. 8, l. 18. The
reference explains that "[t]okens . . . consist of one or more words of (binary) digital
data," col. 26, ll. 11-12; "[e]ach token consists of a series of binary bits separated into
one or more blocks of token words." Col. 25, ll. 59-61. "Furthermore, the bits fall into
one of three types: address bits (A), data bits (D), or an extension bit (E)." Id. at ll. 62-
63. Regarding the latter, "an extension bit is transmitted along with the address and
data fields in each token so that a processing stage can pass on a token (which can be
of arbitrary length) without having to decode its address at all." Col. 27, ll. 6-9. "When
a stage encounters a token word whose extension bit is LOW (a '0'), it is known to be
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 12 Next
Last modified: November 3, 2007