Detailed Office Action
Notice of Pre-AIA or AIA Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
Abstract
Applicant is reminded of the proper language and format for an abstract of the disclosure. The abstract should be in narrative form and generally limited to a single paragraph on a separate sheet within the range of 50 to 150 words in length. The abstract should describe the disclosure sufficiently to assist readers in deciding whether there is a need for consulting the full patent text for details. The language should be clear and concise and should not repeat information given in the title. It should avoid using phrases which can be implied, such as, “The disclosure concerns,” “The disclosure defined by this invention,” “The disclosure describes,” etc. In addition, the form and legal phraseology often used in patent claims, such as “means” and “said,” should be avoided.
The use of the word “invention” in the abstract should be avoided.
Double Patenting
The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969).
A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b).
The filing of a terminal disclaimer by itself is not a complete reply to a nonstatutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13.
The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer.
Claims 1 – 19 provisionally rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1 - 19 of copending Application No. 19/323,934.
US Application Number 19/323,867
US Application Number 19/323,934
(Claim 1)
An apparatus for decoding, from a data stream, a sequence of integer values which are ordered in a strict monotonous manner, the apparatus configured for decoding from the data stream a predetermined integer value located at a predetermined position of the sequence of integer values; and for each position of the sequence of integer values which precedes the predetermined position, decoding, from the data stream, a first difference between an integer value residing immediately following the respective position and the integer value at the respective position, reduced by 1; and for each position of the sequence of integer values which is located following the predetermined position, decoding, from the data stream, a second difference between the integer value at the respective position and an integer value residing immediately preceding the respective position, reduced by 1,wherein the apparatus is configured for decoding, from the data stream, a third difference between a rank of the predetermined position and an integer-rounded half of the number of integer values; calculating the predetermined position based on the third difference and the number of integer values, and decoding from the data stream the third difference by decoding an unsigned integer using a variable length code; and retrieving the third difference by inverse mapping from the unsigned integer according to a predefined inverse mapping rule, wherein the apparatus is configured for decoding from the data stream the unsigned integer by use of an exponential Golomb code.
(Claim 1)
An apparatus for decoding, from a data stream, a sequence of integer values which are ordered in a strict monotonous manner, the apparatus configured for decoding from the data stream a predetermined integer value located at a predetermined position of the sequence of integer values; and for each position of the sequence of integer values which precedes the predetermined position, decoding, from the data stream, a first difference between an integer value residing immediately following the respective position and the integer value at the respective position, reduced by 1; and for each position of the sequence of integer values which is located following the predetermined position, decoding, from the data stream, a second difference between the integer value at the respective position and an integer value residing immediately preceding the respective position, reduced by 1,wherein the apparatus is configured for decoding from the data stream the predetermined integer value by decoding an unsigned integer via a variable length code; and retrieving the predetermined integer value by inverse mapping from the unsigned integer according to a predefined inverse mapping rule. wherein the apparatus is configured for decoding from the data stream the unsigned integer by use of an exponential Golomb code.
(Claim 2)
The apparatus according to claim 1, configured for decoding from the data stream the number of integer values of the sequence of integer values.
(Claim 2)
The apparatus according to claim 1, configured for decoding from the data stream the number of integer values of the sequence of integer values.
(Claim 3)
The apparatus according to claim 2, configured for decoding from the data stream the number of integer values of the sequence of integer values by use of a further variable length code.
(Claim 3)
The apparatus according to claim 2, configured for decoding from the data stream the number of integer values of the sequence of integer values by use of a further variable length code.
(Claim 4)
The apparatus according to claim 1, configured for decoding from the data stream an information revealing the predetermined position.
(Claim 4)
The apparatus according to claim 1, configured for decoding from the data stream an information revealing the predetermined position.
(Claim 5)
The apparatus according to claim 1, configured for, for each position of the sequence of positions which precedes the predetermined position, computing the integer value at the respective position by linearly combining the first difference, the integer value residing immediately following the respective position and one; and for each position of the sequence of positions which is located following the predetermined position, computing the integer value at the respective position by linearly combining the second difference, the integer value residing immediately preceding the respective position and one.
(Claim 6)
The apparatus according to claim 1, configured for, for each position of the sequence of positions which precedes the predetermined position, computing the integer value at the respective position by linearly combining the first difference, the integer value residing immediately following the respective position and one; and for each position of the sequence of positions which is located following the predetermined position, computing the integer value at the respective position by linearly combining the second difference, the integer value residing immediately preceding the respective position and one.
(Claim 6)
The apparatus according to claim 1, wherein the inverse mapping rule maps unsigned integers to signed integers in a manner so that even unsigned integers and odd unsigned integers are mapped onto separate ones of signed integers lower than 0 and signed integers greater than 0, respectively, with mapping zero onto zero and so that, for each signed integer, a first signed integer mapped onto the respective unsigned integer is, in magnitude, larger than or equal to, a second signed integer mapped onto an unsigned integer following the respective unsigned integer.
(Claim 6)
The apparatus according to claim 1, wherein the inverse mapping rule maps unsigned integers to signed integers in a manner so that even unsigned integers and odd un signed integers are mapped onto separate ones of signed integers lower than 0 and signed integers greater than 0, respectively, with mapping zero onto zero and so that, for each signed integer, a first signed integer mapped onto the respective unsigned integer is, in magnitude, larger than or equal to, a second signed integer mapped onto an unsigned integer following the respective unsigned integer.
(Claim 7)
The apparatus according to claim 1, configured for decoding from the data stream the predetermined integer value via a further variable length code.
(Claim 7)
The apparatus according to claim 6, configured for decoding from the data stream the third difference via a further variable length code.
(Claim 8)
The apparatus according to claim 1, configured for decoding from the data stream the predetermined integer value by decoding a second unsigned integer via a further variable length code; and retrieving the predetermined integer value by inverse mapping from the second unsigned integer according to a further predefined inverse mapping rule.
(Claim 9)
The apparatus according to claim 8, wherein the inverse mapping rule maps unsigned integers to signed integers in a manner so that even unsigned integers and odd un signed integers are mapped onto separate ones of signed integers lower than 0 and signed integers greater than 0, respectively, with mapping zero onto zero and so that, for each signed integer, a first signed integer mapped onto the respective unsigned integer is, in magnitude, larger than or equal to, a second signed integer mapped onto an unsigned integer following the respective unsigned integer.
(Claim 9)
The apparatus according to claim 1, wherein the inverse mapping rule maps unsigned integers to signed integers in a manner so that even unsigned integers and odd un signed integers are mapped onto separate ones of signed integers lower than 0 and signed integers greater than 0, respectively, with mapping zero onto zero and so that, for each signed integer, a first signed integer mapped onto the respective unsigned integer is, in magnitude, larger than or equal to, a second signed integer mapped onto an unsigned integer following the respective unsigned integer.
(Claim 10)
The apparatus according to claim 1, configured for decoding from the data stream the first difference via an exponential Golomb code.
(Claim 10)
The apparatus according to claim 1, configured for decoding from the data stream the first difference via an exponential Golomb code.
(Claim 11)
The apparatus according to claim 1, configured for decoding from the data stream the second difference via a further variable length code.
(Claim 11)
The apparatus according to claim 1, configured for decoding from the data stream the second difference via a further variable length code.
(Claim 12)
The apparatus according to claim 1, configured for decoding from the data stream the second difference via an exponential Golomb code.
(Claim 12)
The apparatus according to claim 1, configured for decoding from the data stream the second difference via an exponential Golomb code.
(Claim 13)
The apparatus according to claim 1, wherein the sequence of integer values is a codebook that is associated with parameters of a neural network.
(Claim 13)
The apparatus according to claim 1, wherein the sequence of integer values is a codebook that is associated with parameters of a neural network.
(Claim 14)
The apparatus according to claim 1, configured for reconstructing the decoded sequence of integer values to a plurality of floating point values from a set of quantization levels which are defined by the sequence of integer values and a floating point quantization parameter.
(Claim 14)
The apparatus according to claim 1, configured for reconstructing the decoded sequence of integer values to a plurality of floating point values from a set of quantization levels which are defined by the sequence of integer values and a floating point quantization parameter.
(Claim 15)
The apparatus according to claim 14, configured for decoding from the data stream, for each of the plurality of floating point values, a quantization index pointing to the associated integer value within the sequence of integer values which, according to the floating point quantization parameter, is associated with a quantization level onto which the respective floating point value was quantized.
(Claim 15)
The apparatus according to claim 14, configured for decoding from the data stream, for each of the plurality of floating point values, a quantization index pointing to the associated integer value within the sequence of integer values which, according to the floating point quantization parameter, is associated with a quantization level onto which the respective floating point value was quantized.
(Claim 16)
The apparatus according to claim 15, configured for decoding the quantization index from the data stream based on a rank difference of a first rank of the position of the associated integer value within the sequence of integer values and the rank of the predetermined position.
(Claim 16)
The apparatus according to claim 15, configured for decoding the quantization index from the data stream based on a rank difference of a first rank of the position of the associated integer value within the sequence of integer values and the rank of the predetermined position.
(Claim 17)
The apparatus according to claim 15, configured for decoding from the data stream the rank difference by debinarizing the number using a binarization code from a binary string of one or more bins and context-adaptive binary arithmetic decoding the one or more bins.
(Claim 17)
The apparatus according to claim 15, configured for decoding from the data stream the rank difference by debinarizing the number using a binarization code from a binary string of one or more bins and context-adaptive binary arithmetic decoding the one or more bins.
(Claim 18)
An apparatus for encoding, into a data stream, a sequence of integer values which are ordered in a strict monotonous manner, the apparatus configured for encoding into the data stream a predetermined integer value located at a predetermined position of the sequence of integer values; and for each position of the sequence of integer values which precedes the predetermined position, calculating a first difference between an integer value residing immediately following the respective position and the integer value at the respective position, reduced by 1; and encoding the first difference into the data stream; and for each position of the sequence of integer values which is located following the predetermined position, calculating a second difference between the integer value at the respective position and an integer value residing immediately preceding the respective position, reduced by 1; and encoding the second difference into the data stream, wherein the apparatus is configured for calculating a third difference between a rank of the predetermined position and a integer-rounded half of the number of integer values, encoding the third difference into the data stream, and encoding into the data stream the third difference by mapping the third difference onto an unsigned integer according to a predefined mapping rule; and encoding the unsigned integer using a variable length code, wherein the apparatus is configured for encoding into the data stream the unsigned integers by use of an exponential Golomb code.
(Claim 18)
An apparatus for encoding, into a data stream, a sequence of integer values which are ordered in a strict monotonous manner, the apparatus configured for encoding into the data stream a predetermined integer value located at a predetermined position of the sequence of integer values; and for each position of the sequence of integer values which precedes the predetermined position, calculating a first difference between an integer value residing immediately following the respective position and the integer value at the respective position, reduced by 1; and encoding the first difference into the data stream; and for each position of the sequence of integer values which is located following the predetermined position, calculating a second difference between the integer value at the respective position and an integer value residing immediately preceding the respective position, reduced by 1; and encoding the second difference into the data stream, wherein the apparatus is configured for encoding into the data stream the predetermined integer value by mapping the predetermined integer value onto an unsigned integer according to a predefined mapping rule; and encoding the unsigned integer using a variable length code, and wherein the apparatus is configured for encoding into the data stream the unsigned integers by use of an exponential Golomb code.
(Claim 19)
A method for decoding, from a data stream, a sequence of integer values which are ordered in a strict monotonous manner, comprising decoding from the data stream a predetermined integer value located at a predetermined position of the sequence of integer values; and for each position of the sequence of integer values which precedes the predetermined position, decoding, from the data stream, a first difference between an integer value residing immediately following the respective position and the integer value at the respective position, reduced by1;andfor each position of the sequence of integer values which is located following the predetermined position, decoding, from the data stream, a second difference between the integer value at the respective position and an integer value residing immediately preceding the respective position, reduced by 1,the method further comprising: decoding, from the data stream, a third difference between a rank of the predetermined position and an integer-rounded half of the number of integer values; calculating the predetermined position based on the third difference and the number of integer values, and decoding from the data stream the third difference by decoding an unsigned integer using a variable length code; and retrieving the third difference by inverse mapping from the unsigned integer according to a predefined inverse mapping rule, wherein the method comprises decoding from the data stream the unsigned integers by use of an exponential Golomb code.
(Claim 19)
A method for decoding, from a data stream, a sequence of integer values which are ordered in a strict monotonous manner, comprising decoding from the data stream a predetermined integer value located at a predetermined position of the sequence of integer values; and for each position of the sequence of integer values which precedes the predetermined position, decoding, from the data stream, a first difference between an integer value residing immediately following the respective position and the integer value at the respective position, reduced by 1; and for each position of the sequence of integer values which is located following the predetermined position, decoding, from the data stream, a second difference between the integer value at the respective position and an integer value residing immediately preceding the respective position, reduced by 1,the method further comprising: decoding from the data stream the predetermined integer value by decoding an unsigned integer via a variable length code; and retrieving the predetermined integer value by inverse mapping from the unsigned integer according to a predefined inverse mapping rule. wherein the method comprises decoding from the data stream the unsigned integer by use of an exponential Golomb code.
Although the conflicting claims are not identical, they are not patentably distinct from each other because “a limitation on a claim can broadly be thought of then as its ability to make a meaningful contribution to the definition of the invention in a claim. In other words, language that is not functionally interrelated with the useful acts, structure, or properties of the claimed invention will not serve as limitation” See In re Gulack, 217 USPQ 401 (CAFC 1983). It would have been obvious to one of ordinary skill in the art at the time the invention was made to use the US Application Number 19/323,934 disclosure to perform the same function as US application 19/323,867 and one ordinary skilled in the art would recognize that both US Application Numbers 19/323,934 and UA Application Number 19/323,867 would perform the same function, work equally well and achieve the same end result.
This is a provisional nonstatutory double patenting rejection because the patentably indistinct claims have not in fact been patented.
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to JEAN BRUNER JEANGLAUDE whose telephone number is (571)272-1804. The examiner can normally be reached Monday-Thursday 7:00 AM-5:00 PM.
Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice.
If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Dameon Levi can be reached at 571-272-2105. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000.
/JEAN B JEANGLAUDE/Primary Examiner, Art Unit 2845