US 6,422,476 B1Grant
Method, apparatus and character set for encoding and decoding data characters in data carriers, such as RFID tags
Issue Date:2002-07-23
•28 Claims
•9 Drawing Sheets
Abstract
A method, apparatus and computer-readable character set encodes a string of n-bit character codes corresponding to the data characters from an n-bit set of data characters in a data carrier as a string of m-bit character codes, where m is less than n. A method, apparatus and character set, decodes a string of m-bit character codes corresponding to the data characters from an m-bit set of data characters from a data carrier as a string of n-bit character codes, where m is less than n. The n-bit character set contains character codes corresponding to operations and operating modes such as compression modes to efficiently encode and decode data. The n-bit character set further includes character codes that indicate the presence or absence of companion data carries, and that standing alone or in combination with a modifier character code can indicate an operation to be performed on data in the companion data carrier.
Metadata
Assignee
- Intermec IP Corp.
Inventor
- H. Sprague Ackley
Application Information
Application Number:US 09/375,912
Filing Date:1999-08-17
Priority Date:1993-11-05
Art Unit:7
Classifications
IPC:
G06K 1906
Field of Search:
235492235449235382235380235494235375235493235486235487369109369 59
Patent Drawings (9 sheets)
Description
Cross-Reference to Related Applications
[0002] This application is a continuation-in-part of U.S. patent application Ser. No. 09/021,608, filed Feb. 10, 1998, now U.S. Pat. No. 6,326,886; U.S. patent application Ser. No. 08/999,613, filed Jan. 22, 1998, now U.S. Pat. No. 6,024,288, and U.S. patent application Ser. No. 08/914,324, filed Aug. 13, 1997, now U.S. Pat. No. 6,012,638; each of which was a continuation-in-part of U.S. patent application Ser. No. 08/842,644, filed Apr. 16, 1997, now U.S. Pat. No. 6,143,053; which was in turn a continuation-in-part of U.S. patent application Ser. No. 08/701,304, filed Aug. 21, 1996, now issued as U.S. Pat. No. 5,811,781; and which was in turn a continuation-in-part of U.S. patent application Ser. No. 08/295,382, filed Aug. 24, 1994, now issued as U.S. Pat. No. 5,557,092; which was in turn a continuation-in-part of U.S. patent application Ser. No. 08/147,376, filed Nov. 5, 1993, now abandoned. This application contains subject matter common to U.S. patent application Ser. No. 09/375,813, filed Aug. 17, 1999, entitled “COMPUTER READABLE CHARACTER SET FOR ENCODING DATA IN DATA CARRIERS, SUCH AS RFID TAGS” and to U.S. patent application Ser. No. 09/375,815, filed Aug. 17, 1999, entitled “METHOD, APPARATUS AND CHARACTER SET FOR ENCODING INFORMATION ABOUT ASSOCIATED DATA CARRIERS, SUCH AS RFID TAGS”.
Technical Field
[0003] This invention relates to computer-readable character sets for encoding human-readable data characters in a data carrier such as an RFID tag, optical tag or touch memory device.
Background of the Invention
[0004] Data carriers store computer-readable data or information as character codes that represent human-readable “data characters.” Data characters include not only human readable characters, but also include special function characters such as start, stop or shift characters that provide certain functional data. Each data character is represented by a unique character code. The character code is typically a number, the numbers being assigned from 0 through a largest number. The largest number is determined by the number of bits in a computer's data path or bus. The computer typically employs a binary representation of the character code, although humans find a decimal or hexadecimal representation more convenient. A set or mapping of data characters and their corresponding character codes is commonly referred to as a “character set.” The computer industry uses its own character encoding standards, for example, the American Standard Code for Information Interchange (ASCII) character set. Full ASCII defines a character set containing 128 data characters. Each data character in full ASCII is represented by a unique 7-bit character code (27=128).
[0005] The computer industry has grown beyond the limits of the full ASCII character set. As the computer markets have grown, the need has also arisen to support additional languages not defined by the full ASCII character set. New character sets were developed to accommodate clusters of characters in related languages. The original 7-bit full ASCII character set was expanded to 8 bits thus providing an additional 128 data characters. This additional 128 set of data characters (the “upper 128” or “extended ASCII”) allowed for additional characters present in the related romance languages (i.e., French, German, Spanish, etc.) to be represented.
[0006] As the computer markets grew internationally, however, even more languages were required to be included in the character set. Particularly, the Asian markets demand a character set, usable on computers, which support thousands of unique characters. To uniquely define each of these characters, a 16-bit encoding standard was required.
[0007] Several 16-bit (two byte) encoding standards such as Unicode, Big Five, GB, KOR, JISC-6226-1983, and others have recently been developed. The Unicode character encoding standard is a fixed-length, uniform text and character encoding standard. The Unicode standard can contain up to 65,536 characters, and currently contains over 28,000 characters mapping onto the world's scripts, including Greek, Hebrew, Latin, Japanese, Chinese, and Korean. The Unicode standard is modeled on the ASCII character set. Unicode character codes are consistently 16 bits long, regardless of language, so no escape sequence or control code is required to specify any character in any language. Unicode character encoding treats symbols, alphabetic characters, and ideographic characters identically, so that they can be used in various computer applications simultaneously and with equal facility. Computer programs using Unicode character encoding to represent characters, but which do not display or print text, can remain unaltered when new scripts or characters are introduced. New computer operating systems are beginning to support these comprehensive 16-bit code standards, e.g., WINDOWS NT, manufactured by Microsoft Corporation of Redmond, Washington.
[0008] Often, it will be desirable to encode and decode character strings consisting of a combination of romance language data characters, including Arabic numerals, and data characters, including numerals, from Asian languages. Since the 16-bit character sets such as Unicode, GB and JISC-6226-1983, usually contain the one byte character sets (8-bit, 7-bit), such as extended or full ASCII, as subsets thereof, each of the romance and Asian language data characters can be represented by a double byte data character code selected from one of the 16-bit character sets. The double byte data character codes can be directly encoded into a memory of a data carrier, such as an RFID, optical tag or touch memory device. It is also possible to decode data from the memory, producing a set of double byte data character codes representing the information stored in the data carrier.
[0009] The substitution of double byte character codes for single byte data characters and the subsequent encoding of the substituted double byte character codes into a data carrier can use significantly more memory than would otherwise have been used had all of the single byte data characters been directly encoded into the data carrier as single byte character codes. Memory use is critical in many automatic data collection applications, especially when RFID or optical tags are employed. Therefore, there is a need to more efficiently represent and store a combination of data characters selected from single byte and double byte character sets in data carriers and other memory devices.
Summary of the Invention
[0010] Under one aspect, a 6-bit character set 93i is defined to efficiently encode data characters. The character set employs single character codes and combinations of character codes to represent the 65,535 data characters of the 16-bit character sets. For example, the 93i character set includes a number of single character codes corresponding to “native” data characters and functions. The 93i character set further includes multiple shift characters to encode up to 128 data characters using pairs of character codes. The 93i character set also includes Extended Channel Interpretation, Numeric Mode, Word Mode, and Byte Mode compression schemes that employ character code combinations to encode the remaining data characters (at least 65,535), and that can result in even more efficient packing of data in a data string. Such compression schemes employ a set of variable values as part of an equation or equality. Efficient data packing can provide a number of benefits such as reducing the amount of memory required to store a given amount of information, or reducing the time required to transmit the information.
[0011] Under another aspect, a string of n-bit character codes is converted into a string of m-bit character codes, where m is less than n. For example, the n-bit character codes can be from a 16-bit character set (e.g., Unicode, GB, JISC-6226-1983), while the m-bit character codes are from a smaller character set (e.g., the 6-bit character set 93i). Customized m-bit character sets can be created for different applications, the customized m-bit character sets assigning single m-bit character codes to the data characters that predominate in the character strings (“native” data characters) common to the application. Thus, a significant proportion of the data characters represented by n-bit character codes can be represented by single m-bit character codes, resulting in a more effective packing of data in the string. This can be particularly advantageous where an external computer system employs a character set such as a 16-bit or 8-bit character set and the data must be stored in a relatively small amount of memory such as an RFID tag.
[0012] Under a further aspect, a string of m-bit character codes is converted into a string of n-bit character codes, where m is less than n. For example, a string of 6-bit character codes stored in a data carrier can be converted into a string of 16-bit character codes for use with a host computer operating with a 16-bit character set.
[0013] In yet an additional aspect, a writer such as an RF interrogator can encode the resulting m-bit character codes into a data carrier, such as an RFLD tag. Similarly, a reader such as an RF interrogator can decode m-bit character codes from the data carrier, creating an n-bit string of character codes corresponding to the data encoded in the data carrier. Thus, both romance and Asian language characters can be stored, read and manipulated in an efficient manner and the data can be used across a variety of platforms employing character sets of different sizes.
[0014] Additionally, the present invention embodies a computer-readable character set including functional data characters. These data characters, embedded in the character set, can cause a processor to execute a functions to control reading, writing, and/or manipulation of data. For example, the data characters can indicate a compression scheme for encoding or decoding a string of characters, such as Byte Mode, Numeric Mode, and Word Mode compressions schemes. Likewise, a Special Features Flag data character that can indicate the existence of a related or companion data carrier, typically located adjacent or near to the current data carrier. The Special Features Flag can additionally indicate a function or operation for a reader to perform.
Brief Description of the Drawings
[0015] FIG. 1 is a table showing character codes and associated data characters for an exemplary 93i character set under the present invention.
[0016] FIG. 2 is an example of a schema of a memory of a data carrier, such as an RFID tag, storing a number of n-bit character codes.
[0017] FIG. 3 is an example of a schema of a memory of a data carrier, such as an RFID tag, storing a number of m-bit character codes.
[0018] FIG. 4 is a table showing the full ASCII (7-bit) character set.
[0019] FIG. 5 is a block diagram of a memory device programming apparatus of the present invention.
[0020] FIG. 6 is an exemplary flow chart showing the basic steps performed by the programming apparatus of FIG. 4 for writing to memory devices under the exemplary embodiment.
[0021] FIG. 7 is a block diagram of a memory device reader of the present invention.
[0022] FIG. 8 is a flow chart showing the basic steps performed by the memory device reader of FIG. 6 for reading memory devices under the exemplary embodiment.
[0023] FIG. 9 is a table showing the mapping between data characters and character values in hexadecimal and binary for selected characters from the GB character set.
[0024] FIG. 10 is a block diagram of a data carrier and a companion data carrier.
[0025] FIG. 11 is a functional block diagram of an exemplary RFID tag.
Detailed Description of the Invention
[0026] As used generally herein, the following definitions apply: “data characters” refers to human readable characters, including symbols, numeric characters, alphabetic characters, pictographic and ideographic characters, as well as non-readable data, such as function codes, shift codes, etc.; “numeric string” refers to a sequence of numeric characters (e.g., decimal digits); “character codes” refers to a code, typically numeric, which refers to a data character within a set of character codes and corresponding data characters, such as ASCII, where “7-bit code” refers to an ASCII character code corresponding to a data character in the ASCII standard, and “16-bit code” or “16-bit character code” refers to a hexadecimal or decimal representation of a data character in a 16-bit character encoding standard, such as Unicode. For example, in the 16-bit character encoding standard Unicode, the data character “A” is represented by the 16-bit character code “0041” in hexadecimal notation and “65” in decimal.
[0027] FIG. 1 shows the character code assignments for each “native” data character (i.e., data characters that can be represented by a single character code) in a 93i character set. The 93i character set employs a 6-bit character code, and thus can be considered a 6-bit character set. Therefore, the 93i character set contains no more than 64 (26=64) native characters. The “Code” column in FIG. 1 represents the character code value in decimal notation for each of the corresponding data characters shown in the “Data Character” column. The 93i computer-readable character set is similar to the 93i machine-readable symbology disclosed in U.S. Pat. No. 5,557,092, and the applicant's currently pending and commonly assigned patent applications Ser. No. 08/842,644 filed on Apr. 16, 1997, and Ser. No. 08/914,324, filed on Aug. 19, 1997. In particular, the mapping between data characters and character codes in the symbology can be effectively employed in the character set.
[0028] While discussed in terms of decimal values, digital memories and processors typically employ a binary representation of the character codes to read, write, store and/or manipulate the corresponding data characters, as shown in the “Binary” column of FIG. 1. The value of the character codes are also employed in the various operating modes or data compression schemes discussed below. Computers typically represent data characters as definitions of printing and/or non-printing characters for display on a screen or for printing on a printer, e.g., bit-map, True-Type® (registered trademark of Apple Computer), and Post-Script® (registered trademark of Adobe Corporation) fonts.
[0029] Character sets typically employ a one-to-one mapping of data characters to character codes, and do not provide any character codes that map to functions or operations, such as shift codes or preceding codes. Thus, character sets capable of representing a large number of characters (i.e., greater than 256 characters) commonly employ 16-bit (double byte) characters codes. These character sets employ a double byte character code to represent each data character, even when the data character is present in a smaller character set, such as ASCII. The portion of the 93i character set shown in FIG. 1 includes ten character codes corresponding to functions and/or operations. For example, character codes 43-46 (decimal) correspond to shift operators, while character codes 46-50 correspond to different operating modes or compression schemes, as described below.
[0030] The 93i character set includes data characters (not shown) in addition to the native data characters shown in FIG. 1. These additional data characters are represented by respective combinations of character codes. For example, combinations composed of one of the character codes 43-46 (corresponding to one of the shift characters, Shift 1-Shift 4) and the other character codes 00-42 are assigned to a number of the data characters of the 16-bit character sets. Thus, the 93i character set is capable of representing at least 128 characters using single 6-bit character codes and combinations consisting of one 6-bit shift character code and one non-shift 6-bit character code. While additional shift character codes 43-46 can be assigned, such assignments reduce the number of non-shift character codes 00-42 available to pair with the shift character codes 43-46.
[0031] A variety of “compression” schemes can be employed to represent a larger number of data characters, and/or to represent data characters in a more compact manner. For example, compression schemes similar to the Extended Channel Interpretation, Word Mode, Byte Mode and Numeric Mode described in applicant's pending applications, Ser. Nos. 08/842,644 and 08/914,324 can be used to represent the at least 65,535 data characters typically found in the 16-bit character sets.
[0032] Under the Word Mode compression scheme, three 6-bit character codes are grouped so that their values encode a single 16-bit value. Thus, three 6-bit character codes (A, B, C) can encode Asian characters or 16-bit character codes (up to 65,536) under equation (1) below, where the sum of the equation is equal to the character code.
[0033] A*432+B*43+C (1)
[0034] Similar equations can be worked out for larger character sets, or for smaller character sets, for example 5-bit character sets.
[0035] Encoding 16-bit characters such as Asian characters in 18 total bits initially appears to be less efficient than simply using two 8-bit character codes. However, such an approach can be efficient where native data characters from a relatively small character set (<8 bits) predominate the information or data. For example, on average 90% of the data characters for a particular application can consist of native characters from a 6-bit character set. In such a case, employing single 6-bit character codes for 90% of the data characters and three 6-bit character codes for the remaining 10% of the data characters can be more efficient than employing two 8-bit character codes for 100% of the data characters.
[0036] Under the Byte Mode compression scheme, the 93i character set efficiently encodes strings of full or extended ASCII data or straight byte data. A “byte” typically refers to an 8-bit set of data. Under the following equation (2), a double-byte, or two 8-bit bytes., are encoded for each of three symbol characters:
[0037] A*432+B*43+C (2)
[0038] where A, B, and C are 93i symbol values between 0 and 42.
[0039] Under equation (2) two bytes having a combined value between 0 and 65,535 are encoded as two symbol characters (i.e., 216=65,536). Values resulting from equation (2) between 65,536 to 75,535 encode four digits, while values 75,535 to 76,535 encode three digits. As a result, the Byte Mode provides a 3- and 4-digit numeric compression method to improve the information density for encoding strings of numeric characters while in Byte Mode. Values resulting from equation (2) between 76,536 and 79,506 are not defined, and cause a reader to fail a decode and output an error signal. While three 6-bit character codes (18 bits) is not as efficient as two 8-bit character codes (16 bits), it is more efficient than the four 6-bit character codes (24 bits) that would normally be required to represent two bytes in a 6-bit character set. (A 6-bit character set requires at least two character codes to represent all of the 256 characters represented in an 8-bit character set.) As discussed above, the 6-bit character set can overall be efficient where native data characters predominate. One of the extra characters (53-64) can be used to shift into the Byte Mode compression scheme.
[0040] In yet another compression scheme, Numeric Mode, five numeric digits are represented by three 6-bit character codes, where the character codes each have a value within the range of 0-47. The five digit numeric string is produced by the equation
[0041] A*482+B*48+C (3)
[0042] where A, B and C are 93i character code values. When a string of digits is encoded which is greater than five, but not an exact multiple of five, the following four rules should apply. First, one digit more than a multiple of five in a string is directly encoded by a single 6-bit character code (values 00-09). Second, if the numeric string contains two more digits than a multiple of five, the last seven digits are separated into a set of four digits followed by a set of three digits, which are each represented as described by the third and fourth rules below. Third, if a numeric string contains three digits more than a multiple of five, the three digits at the end of the string are represented by two 6-bit character codes according to the equation
[0043] 48*A+B (4)
[0044] again, where A and B are 93i character code values. Fourth, if a numeric string contains four digits more than a multiple of five, the last four digits are encoded in three 6-bit character codes under equation (3) above, where the resulting value under equation (3) is between 100,000 and 109,999. One of the extra characters (53-64) can be used to shift into the Numeric Mode compression scheme.
[0045] In the 93i character set, character code values 47, 48, 49 and 50 cause the CPU to toggle into and out of Extended Channel Interpretation (“ECI”), Word Mode, Byte Mode and Numeric Mode, respectively. Additionally, other character code values can be used to shift into a 5-bit mode (alpha only), or a 10-bit mode (triple digits), or the set can employ a run length convention, such as a “group shift” that effects a predefined number of characters. It is important to note these character codes constitute overhead incurred in switching between modes, each mode switch requiring an extra character value 47-50. Switching modes is typically more efficient where strings of similar data characters occur in succession, for example where a string contains a number of consecutive non-native data characters. It is also important to note that existing character sets do not typically include character codes corresponding to functions, such as switching between compression modes. For example, full ASCII and extended ASCII already assign all of their available character codes to non-functional data characters. Similarly, existing character sets do not permit the switching from one representation to another (i.e., 16-bit→6-bit). Thus, while a processor could switch from 93i into an existing character set, such as ASCII or Unicode, the processor would be unable to switch back to the 93i character set.
[0046] FIG. 2 shows an exemplary schema of storing a number of n-bit character codes (n=16) in hexadecimal notation in a memory, along with the corresponding data characters shown beneath the respective n-bit character codes. Similarly, FIG. 3 shows an exemplary schema of storing a number of m-bit character codes (m=6) in decimal representation in a memory, along with the corresponding data characters shown beneath the respective m-bit character codes.
[0047] FIG. 4 shows the full ASCII character set and the corresponding 93i character code assignments for each of the ASCII data characters. The column “ASCII Code” in FIG. 3 represents the ASCII character code assigned to the respective data character shown in the column “ASCII Data Character.” The “93i” column includes the one or two 93i data characters that correspond to the respective ASCII data characters.
[0048] FIG. 5 shows an exemplary embodiment of a system that encodes a string of n-bit character codes into a memory as a string of m-bit character codes. The system includes a CPU 10, a memory 12 and secondary storage 14 coupled to the CPU 10. The CPU 10 is in data communication with a 16-bit host computer 16 and a writer 18. The writer 18 is of a type generally known which can program data carriers, such as an RF interrogator. The writer 18 will also typically be capable of reading from the data carrier. Those skilled in the art can select from any such writers which are suitable for use in the present invention. The CPU 10 is electrically coupled to a host computer 16, or other apparatus or applications, by a port or line 20.
[0049] The host computer 16 is generally capable of working only with an n-bit character set, such as 16-bit data character encoding standards (i.e., Unicode, JISC-6226-1983, Big Five, GB, or KSC 5609-1987). The JISC-6226-1983 standard is the Japan Industrial Standard Character set, mapping the kanji and katakana data characters into 16-bit codes. This data character standard is similar to Unicode in many respects, which, as noted above, includes the kanji and katakana data characters, among others.
[0050] The host computer 16 transmits a string of 16-bit character codes to the CPU 10 along the line 20. The string of 16-bit character codes can be or may have been generated from a keyboard 22 which is associated with the host computer 16 for entering data therein. When a key is depressed on the keyboard 22, the keystroke is converted into a “scan code” which is transmitted from the keyboard 22 to the device to which the keyboard is connected (e.g., the host computer 16). This scan code represents the particular key of the keyboard which has been depressed. The device to which the keyboard is connected translates the appropriate scan codes into corresponding character codes in the resident data character set, such as ASCII on an 8-bit machine or Unicode on a 16-bit machine.
[0051] Upon receipt of the string of 16-bit character codes, the CPU 10 executes a set of instructions 26 stored in the memory 12 to convert the character codes into an optimized set of m-bit character codes such as 6-bit character codes (i.e., 93i).
[0052] The writer 18 interprets these character codes and produces an appropriate signal to program the m-bit character codes into the memory device. For example, the writer 18 can generate an RF signal, including any required polling code, to program an RFID tag. As used herein, the term “RF” includes any frequency in the electromagnetic spectrum, but generally between 1 kHz and 100 GHz may be typical. Alternatively, the writer 18 can generate an optical signal to program an optical tag, or an electrical signal to program a touch memory device. Those skilled in the relevant art will recognize that the type of signal is determined by the type of memory device.
[0053] FIG. 6 shows exemplary steps performed by the CPU 10 under the set of instructions 26 for programming a memory device to encode a string of n-bit character codes corresponding to data characters from an n-bit character set as multiple m-bit character codes where m is less than n. In the example of FIG. 6, the data characters are: “9” “3” “i” “1” “2” “3” “4” “5” “A” “B” and “C” selected from the romance language characters, and a character selected from an Asian language represented in the GB character set which is approximately pronounced as “Bu” in Mandarin. FIG. 9 is a table which shows the data characters “1”, “A” and “Bu” along with their respective character values in the GB character set. The character values are composed of a first byte of seven binary digits and a second byte of seven binary digits. As shown in FIG. 9, each byte can be represented by two hexadecimal characters.
[0054] With continuing reference to FIG. 5, in step 100, the string of n-bit (16-bit) characters codes (i.e., “2A39 2A33 2A79 2A31 2A32 2A33 2A34 2A35 2A41 2A42 2A43 323B” Hexadecimal) is received from the host computer 16. The CPU 10 sequentially examines individual character codes and sets of the character codes to determine an efficient m-bit representation. For example the CPU 10 can “look ahead” to determine whether a particular character code is one of a consecutive sequence of similar character codes, such as character codes representing digits.
[0055] In step 102, the CPU 10 determines whether the character code is part of a string of digits. If the character code is part of a string of digits, the CPU 10 employs Numeric Mode 104 to efficiently encode the string of digits according to the rules explained above in reference to Numeric Mode and according to the teachings incorporated herein by reference. Thus, when the CPU 10 encounters a string “2A31 2A32 2A33 2A34 2A35” (Hexadecimal) corresponding to the consecutive data characters “1 2 3 4 5” (Decimal), the CPU 10 produces an output string “48 06 29 04 48” (Decimal). The first occurrence of the character code 48 toggles into Numeric Mode, while the second occurrence of the character code 48 toggles out of Numeric Mode. The character codes 06, 29, and 04 correspond to the variable values A, B and C, respectively, and thus the equality (3) produces the value 12,345 (Decimal). The individual digits of the value 12,345 produce the string “1” “2” “3” “4” “5.”
[0056] In step 106, the CPU 10 determines whether the n-bit character code corresponds to a native data character from the m-bit character set. For example, in the 93i character set (FIG. 1) each of the data characters 0-9 and A-Z, can be represented by a single 6-bit character code, having values 00-35, respectively. While 93i defines one exemplary character set, one skilled in the art can develop other character sets based on the teachings of the present application, that map the most frequently occurring characters to the single m-bit character codes. Where an n-bit character code corresponds to a native data character, the CPU 10 in step 108 produces a corresponding single m-bit character code. For example, each of the n-bit character codes “2A39” “2A33” “2A41” “2A42” “2A43” (Hexadecimal), corresponding to the data characters “9” “3” “A” “B” and “C”, respectively, is represented as the m-bit character codes “09” “03” “10” “11” and “12” (Decimal), respectively.
[0057] In step 110, the CPU 10 determines whether there are consecutive n-bit character codes that correspond to data characters that can be represented by pairs of m-bit character codes. If such exists, the CPU 10 in step 112 encodes such under the rules of Byte Mode, as explained above and in the teachings incorporated herein by reference.
[0058] In step 114, the CPU 10 determines whether the character code corresponds to a data character that can be represented by a combination such as a pair of m-bit character codes. If so, in step 116 the CPU 10 produces a combination of m-bit character codes corresponding to the data character. For example., the n-bit character code “2A79” corresponds to the data character “i”. While the data character “I” is native to the 93i character set, the data character “i” is represented by a shift data character SHIFT4 followed by the data character “I”. Thus, the CPU 10 produces the m-bit character code combination “46 18” (Decimal).
[0059] In step 118, the CPU 10 determines whether the character code corresponds to a data character that can only be represented in Word Mode. The CPU 10 in step 120 encodes the n-bit character code under the rules of Word Mode, as explained above and in the teaching incorporated herein by reference. For example, the n-bit character code 323B corresponds to an Asian data character that cannot be represented using the shift codes in the 93i character set. Thus, the equality (1) is set equal to the value of 323B (Hexadecimal) and solved for the variable values A=07, B=12, C=07. The CPU also produces the character code 50 corresponding to a toggle into Word Mode.
[0060] The CPU 10 can employ look-up tables or parsing techniques to relate n-bit character codes to single m-bit character codes and combinations of m-bit character codes. Since many of the 16-bit standards encode subsets of data characters, such as ASCII, at predefined offsets in memory, these data characters are easily identified using parsing techniques. Data parsing techniques are well known in the relevant art. For example, an n-bit character set can employ character codes that contain the value 2A (Hexadecimal) in the upper byte for every ASCII character, a value equal to the m-bit character code in the lower byte for data characters that are common to both the n-bit and m-bit character sets. As few as a single bit can be used to identify the character code for parsing. One skilled in the art will realize that it does not matter which set of character codes is parsed from the string or the manner in which the parsing is performed, so long as the character codes corresponding to the different character sets can be operated on separately.
[0061] FIG. 7 shows an exemplary embodiment of a system employing the inventive method for decoding a string composed of a plurality of 6-bit character codes. The system includes the CPU 10, memory 12 and secondary storage 14 coupled to the CPU 10. The CPU 10 is in data communication with the 16-bit host computer 16 and a reader 28. The reader 28 includes a device for reading information stored in a data carrier, such as an RF interrogator for reading an RFID tag. The reader 28 will also typcially be capable of writing to the data carrier. As used generally herein, the term “reader” refers to any device capable of reading a data carrier encoding information in a character set. Readers are known by those skilled in the art, and any such reader suitable for use in the present invention can be selected.
[0062] The reader 28 interrogates the RFID tag and determines the string of 6-bit character codes. The reader 28 transmits a string of 6-bit values to the CPU 10 along a line 30. The string of 6-bit values correspond to data characters encoded under a small character set, such as 93i. Upon receipt of the string, the CPU 10 executes a set of instructions 32 stored in the memory 12 to convert the 6-bit values into a set of character codes from a larger character set (e.g., 16-bit) for transmission to the host computer 16 along the line 20. Alternatively, the data can be transmitted between the reader 28, and, or the host computer 16 via a wireless link.
[0063] FIG. 8 shows an exemplary method performed by the CPU 10 under the set of instructions 32 for decoding the 6-bit values. In step 200, a string of 6-bit values is received from the reader 28. Each of the values correspond to a data character or function in the particular m-bit character set (e.g., 93i). The CPU 10 sequentially evaluates each of the 6-bit character codes and produces a string of 16-bit character codes.
[0064] In step 202, the CPU 10 examines a character code. In step 204, the CPU determines whether the character code corresponds to Numeric Mode. If the character code corresponds to Numeric Mode, in step 206 the CPU 10 solves the equality (3) employing the next three character codes as the variable values A, B, and C, respectively. The result (12,345) is converted digit-by-digit into corresponding n-bit character codes, producing the Hexadecimal string: “2A31 2A32 2A33 2A34 2A35.”
[0065] In step 208, the CPU 10 determines whether the character code corresponds to Byte Mode. If the character code corresponds to Byte Mode, in step 210 the CPU 10 solves the equality (2).
[0066] In step 212, the CPU 10 determines whether the character code corresponds to Word Mode. If the character code corresponds to Word Mode, in step 214 the CPU 10 solves the equality (1) employing the three character codes following the Word Mode character code. The resulting value is the corresponding n-bit character code, for example “323B” (Hexadecimal).
[0067] In step 216, the CPU 10 determines whether the character code corresponds to a shift character code. If the character code corresponds to a shift character, the CPU 10 in step 218 determines a single n-bit character code that corresponds to the same data character as the shifted m-bit character code. For example, the character code pair “46 18” corresponding to data character “i” in the m-bit character set. The corresponding character code from the n-bit character set is “2A79” (Hexadecimal).
[0068] In step 220, the CPU 10 can check to determine whether the character code corresponds to a valid single m-bit character code. If not an error handling routine can be entered in step 222, for example, to terminate processing and report the error to the user. Otherwise, the CPU 10 in step 224 can output an n-bit character code corresponding to the same data character as the m-bit character code.
[0069] The 93i character set includes a Special Features. Flag data character having character code “52” (Decimal) that indicates the existence of a companion data carrier (e.g., an associated data carrier) 34 (FIG. 10) or a function to be performed involving the companion data carrier 34. While in many cases the companion data carrier 34 will take the same form as the data carrier (e.g., both are RF tags) 36 (FIG. 10), the companion data carrier 34 can take a different form than the data carrier 36, for example, the RF tag may have an associated optical tag, touch memory device or machine-readable symbol.
[0070] The Special Features Flag can indicate the existence of a companion data carrier 34, for example causing the reader 28 to prompt the user to locate and read the companion data carrier 34. The detection of the Special Features Flag can cause the reader 28 to continue reading (e.g., continue interrogating with a RF signal) until the companion data carrier 34 is read. In a similar aspect, the detection of the Special Features Flag, or absence thereof, can cause the reader 28 to turn off or go into a power saving operating mode to conserve battery power.
[0071] Detection of the Special Features Flag can cause the reader 28 to generate an alert, for example where the data carrier 36. marks dangerous goods. Additionally, or alternatively, detection of the Special Features Flag can indicate a more complex operation, such as causing the reader 28 to perform an ordered concatenation or structured append on the data from the data carrier 36 and companion data carrier 34. Thus, data from two different data carriers 34, 36 can be joined in an ordered fashion. Detection of the Special Features Flag can also cause the reader 28 to download read information to a host computer or to require a security handshake with the reader 28 and/or user. Security handshaking is generally known in the art and need not be discussed in detail.
[0072] One or more “modifier” character codes can follow the initial Special Features Flag character code to identify the data carrier 36 as a member of a group of separate data carriers that together form one collective data carrier, or provide specific reader instructions to assist in the decode and data management of one or more companion data carriers 34. For example, the modifier character code can indicate the type of companion data character 34 where the data carrier 36 and companion data carriers 34 are of different types (e.g., RFID tag and touch memory). The modifier character code can also indicate a encoding scheme for data in the companion data carrier 34, or can indicate one of a number of operations that the reader 28 is to perform. Additionally, or alternatively, the Special Feature Flag character or the shift mode characters can be located at the end of the data, or at some predefined location within the string of data.
[0073] A passive RFID tag 300 is shown in block diagram form in FIG. 11. The RFID tag 300 includes a substrate 302 that carries an integrated circuit 304 and an antenna 306 coupled to the integrated circuit 304. The integrated circuit 304 includes logic 308, memory circuits 310, modulation circuits 312 and power circuits 314. The logic and memory circuits may be formed as digital circuits, while the modulation and power circuits may be formed as analog circuits, although such is not required.
[0074] The modulation circuits may form an RF detector and/or an RF emitter for respectively receiving, and transmitting (or transponding) a modulated signal through the antenna 306. The RF detector and the RF emitter can be integrally formed in the integrated circuit 304 as an RF transceiver, coupled to the common dipole antenna 306. Alternatively, the RF detector can take the form of an RF receiver and an RF transmitter, each coupled to a respective antenna (not shown).
[0075] The logic 308 can take the form of microcode or can be implemented as a hardwired circuit. The power circuits 314 converts an RF signal received at the antenna 306 to a DC voltage which powers up the logic 308 and transmits information and commands for storing and retrieving data to and from the memory circuits 310. The digital circuit generally executes all of the functions performed by the RFID tag 300, such as retrieving stored data from the memory circuits 310 and modulating the RF signal to transmit the retrieved data. A protective housing can enclose the components. While the RFID tag 300 shown is a passive device, a self-powered active device may employed. The logic 302, for example in the form of a programmed microprocessor or microcontroller, controls data transfer and electrical operation of the RFID tag 300 in a manner known in the art using a manufacture-identified protocol.
[0076] Although specific embodiments of, and examples for, the present invention have been described above for illustrative purposes, various equivalent modifications can be made without departing from the spirit and scope of the invention. For example, if the memory 12 is sufficiently large to contain all data required by the CPU 10 for encoding and decoding the data carriers, the secondary storage 14 is unnecessary and thus eliminated. Alternatively, the data required by the CPU 10 can be contained in the secondary storage 14, thus eliminating the need for a large memory 12 or the need for this memory entirely. One skilled in the art will appreciate that as used herein the terms memory and secondary storage can apply to any type of computer-readable media that can store data accessible by a computer including, but not limited to, a hard disk, optical disk, magnetic disk, magnetic cassettes, flash memory cards, digital video disks (“DVD”), RAMs, ROMs, smart cards, etc. Regarding the 93i character set, the character codes can be allocated to different data characters than as described above with respect to FIG. 1.
[0077] While the exemplary embodiment is often discussed in terms of double byte (16-bit) and single byte (8-bit) characters and codes, one skilled in the art will recognize that the system and methods disclosed will work for character sets that encode a smaller character set therein. That is, the method can be employed where the number of bits required to represent a character from a smaller character set is smaller than the number of bits required to represent a character from a larger character set that includes the characters of the smaller character set therein. The assignment of 8-bits to a byte and 16-bits to a word is a convenient convention for digital computers. The terms byte, single byte and double byte do not have to necessarily correspond to 8-bits and 16-bits, respectively. They could apply equally well to, for example 16-bit and 32-bit segments, or 5-bit and 10-bit segments. Alternatively, as used in the specification and claims, a double byte does not necessarily contain twice as many bits as a single byte. For example, a double byte system of 16-bit characters can encode a single byte system such as ASCII, which only requires 7-bits in the unextended version.
[0078] Additionally, the present invention can incorporate the teachings of the U.S. Patents and/or applications described herein to provide additional benefits and functionality. For example, commonly assigned U.S patent applications: U.S. Ser. No. 09/177,679, filed Oct. 22, 1998, and entitled “ERROR CORRECTION ENHANCEMENT FOR CODE 93i AND OTHER MACHINE-READABLE SYMBOLOGIES” (Atty. Docket No. 480062.628); and U.S. Ser. No. 09/228,467, filed Jan. 11, 1999, and entitled “METHOD AND APPARATUS FOR STORING INFORMATION IN A NUMBER OF MEMORY DEVICES, SUCH AS RFID TAGS” (Atty. Docket No. 480062.629). The U.S. Patents and applications cited above are incorporated herein by reference as if set forth in their entirety. Features of the present invention can be applied to other character sets. Furthermore, aspects of the method have been generally described herein as being incorporated into a 6-bit character set, 93i; alternatively, such aspects of the method can be employed in a smaller and/or larger character set, such as a 5-bit or 7-bit character set.
[0079] These and other changes can be made to the invention in light of the above detailed description. In general, in the following claims, the terms should not be construed to limit the invention to the specific embodiments disclosed in the specification and claims, but should be construed to include all apparatus, methods and character sets for directly encoding and decoding various data characters between different sized character sets and character sets that include character codes representing function, operations and/or shifting. Accordingly, the invention is not limited by the disclosure, but instead its scope is to be determined entirely by the following claims.
Claims
What is claimed is:
1. A method of encoding a string of data characters into a wireless, programmable RFID tag, comprising:
determining a number of n-bit character codes corresponding to the data characters in the string, the character codes selected from an n-bit set character set that maps a plurality of human readable data characters to respective n-bit character codes, where a subset of the human readable data characters form an m-bit character set that maps the human readable data characters in the subset to respective m-bit character codes, where m is less than n;
parsing the number of n-bit character codes to separate the n-bit character codes corresponding to the data characters in the subset from the n-bit character codes corresponding to the data characters not in the subset;
converting the parsed n-bit character codes corresponding to the data characters in the subset into corresponding m-bit character codes, and
outputting an output string of the m-bit character codes corresponding to data characters in the subset and the n-bit character codes corresponding to data characters not in the subset to program the RFID tag.
2. The method of claim 1 wherein outputting an output string includes operating an RF transmitter based on the character codes to program the RFID tag.
3. The method of claim 1 wherein parsing the number of n-bit character codes includes examining an at least one bit position of the n-bit character code for a predefined value.
4. The method of claim 1 wherein the n-bit character set is GB and the m-bit character set is ASCII, and wherein parsing the number of n-bit character codes includes examining the n-bit character codes for predefined string equal to Hexadecimal 2A.
5. The method of claim 1 wherein the n-bit character codes have 16 bits and the m-bit character codes have at most 8 bits.
6. The method of claim 1, further comprising:
inserting an m-bit character code proximate a string of n-bit character codes, the m-bit character code identifying a change from m-bit encoding to n-bit encoding.
7. The method of claim 1, further comprising:
inserting an n-bit character code proximate a string of m-bit character codes, the n-bit character code identifying a change from n-bit encoding to m-bit encoding.
8. A method of encoding a string of data characters into a memory, comprising:
determining a number of n-bit character codes corresponding to the data characters in the string, the character codes selected from an n-bit set character set that maps a plurality of human readable data characters to respective n-bit character codes, where a subset of the human readable data characters form an m-bit character set that maps the human readable data characters in the subset to respective m-bit character codes, where m is less than n; and
for at least one of the data characters in the string, substituting the respective m-bit character code for the n-bit character code of at least one of the data characters that is in the subset.
9. The method of claim 8, further comprising:
operating an RF transmitter based on the string of character codes including the n-bit character codes substituted for the m-bit character codes to program the memory device.
10. The method of claim 8, further comprising:
parsing the n-bit character codes to separate the n-bit character codes corresponding to characters in the m-bit set from the n-bit character codes of characters not in the m-bit character set.
11. The method of claim 8 wherein the n is equal to 16 and m is equal to or less than 8.
12. A method of decoding an input string of character codes from a wireless, programmable memory device, comprising:
receiving the input string of n-bit and m-bit character codes selected from an n-bit character set that maps a plurality of human readable data characters to respective n-bit character codes, and an m-bit character set that maps a subset of the plurality of human readable data characters to respective m-bit character codes, where m is less than n;
parsing the input string of n-bit and m-bit character codes to separate the n-bit character codes from the m-bit character codes;
converting the m-bit character codes into corresponding n-bit character codes; and
assembling the n-bit character codes corresponding to the data characters in the input string that are contained in the subset and the n-bit character codes corresponding to the data characters in the input string that are not contained in the subset into an output string of n-bit character codes.
13. The method of claim 12, further comprising:
transmitting an interrogation signal to the memory device;
receiving an RF response signal form the memory device; and
converting the RF response signal into the input string.
14. The method of claim 12 wherein parsing the input string includes checking at least one bit position in the character codes for a predetermined value to identify the m-bit characters from the n-bit characters.
15. The method of claim 12 wherein parsing the input string includes comparing the value of at least a portion of the character code to a predetermined value to identify the m-bit characters from the n-bit characters.
16. The method of claim 12 wherein parsing the input string includes comparing the value of a functional character code to a predetermined value to identify the m-bit characters from the n-bit characters.
17. The method of claim 12 wherein converting the m-bit character codes into corresponding n-bit character codes includes:
searching a conversion table of m-bit character codes to find the n-bit character code corresponding to a same human readable data character as the m-bit character code.
18. The method of claim 12 wherein converting the m-bit character codes into corresponding n-bit character codes includes:
searching a conversion table of m-bit character codes to find a portion of the n-bit character code corresponding to a same human readable data character as the m-bit character code; and
appending a base value to the portion of the corresponding n-bit character code to define the corresponding n-bit character code.
19. The method of claim 12 wherein converting the m-bit character codes into corresponding n-bit character codes includes:
searching a conversion table of m-bit character codes for an offset value corresponding to a same human readable data character as the m-bit character code; and
adding the offset value to a base value to define the corresponding n-bit character code.
20. The method of claim 12 wherein converting the m-bit character codes into corresponding n-bit character codes includes:
calculating the corresponding n-bit character code from a formula.
21. A method of decoding an input string of character codes from a wireless, programmable memory device, comprising:
receiving the input string of n-bit and m-bit character codes selected from an n-bit character set that maps a plurality of human readable data characters to respective n-bit character codes and an m-bit character set that maps a subset of the plurality of human readable data characters to respective m-bit character codes, where m is less than n; and
for at least one of the m-bit character codes in the input string, substituting the n-bit character code from the n-bit character set that corresponds to the same human readable data character as the at least one m-bit character code.
22. The method of claim 21, further comprising:
interrogating the memory device with an RF interrogation signal;
receiving an RF response signal form the memory device; and
converting the RF response signal into the input string.
23. The method of claim 21 wherein substituting the n-bit character code, includes:
searching a conversion table of m-bit character codes to find the n-bit character code corresponding to a same human readable data character as the m-bit character code.
24. The method of claim 21 wherein substituting the n-bit character code, includes:
searching a conversion table of m-bit character codes to find a portion of the n-bit character code corresponding to a same human readable data character as the m-bit character code; and
appending a base value to the portion of the corresponding n-bit character code to define the corresponding n-bit character code.
25. The method of claim 21 wherein substituting the n-bit character code, includes:
searching a conversion table of m-bit character codes for an offset value corresponding to a same human readable data character as the m-bit character code; and
adding the offset value to a base value to define the corresponding n-bit character code.
26. The method of claim 21 wherein substituting the n-bit character code, includes:
calculating the corresponding n-bit character code from a formula.
27. A computer readable medium whose contents cause a computer system to encode a string of data characters into a memory by:
determining a number of n-bit character codes corresponding to the data characters in the string, the character codes selected from an n-bit set character set that maps a plurality of human readable data characters to respective n-bit character codes, where a subset of the human readable data characters from an m-bit character set that maps the human readable data characters in the subset to respective m-bit character codes, where m is less than n; and
for at least one of the data characters in the string, substituting the respective m-bit character code for the n-bit character code of at least one of the data characters that is in the subset.
28. A computer readable medium whose contents cause a computer system to decode a string of data characters from a memory by:
receiving the input string of n-bit and m-bit character codes selected from an n-bit character set that maps a plurality of human readable data characters to respective n-bit character codes, and an m-bit character set that maps a subset of the plurality of human readable data characters to respective m-bit character codes, where m is less than n; and
for at least one of the m-bit character codes in the input string, substituting the n-bit character code from the n-bit character set that corresponds to the same human readable data character as the at least one m-bit character code.
Patent Citations (74)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3906460(A) | 1975-09-01 | Halpern | Examiner |
| US4056710(A) | 1977-11-01 | Shepardson et al. | Applicant |
| US4079482(A) | 1978-03-01 | Yeh | Applicant |
| US4307293(A) | 1981-12-01 | Lazzarotti et al. | Applicant |
| US4523087(A) | 1985-06-01 | Benton | Applicant |
| US4567361(A) | 1986-01-01 | Rosenthal | Applicant |
| US4575621(A) | 1986-03-01 | Dreifus | Applicant |
| US4589144(A) | 1986-05-01 | Namba | Applicant |
| US4701746(A) | 1987-10-01 | Ueda et al. | Examiner |
| US4727511(A) | 1988-02-01 | Sekiguchi | Examiner |
| US4728784(A) | 1988-03-01 | Stewart | Applicant |
| US4782221(A) | 1988-11-01 | Brass et al. | Applicant |
| US4786792(A) | 1988-11-01 | Pierce et al. | Applicant |
| US4792910(A) | 1988-12-01 | Lange | Applicant |
| US4794239(A) | 1988-12-01 | Allais | Applicant |
| US4810867(A) | 1989-03-01 | Speicher | Applicant |
| US4827395(A) | 1989-05-01 | Anders et al. | Applicant |
| US4841128(A) | 1989-06-01 | Gröttrup et al. | Applicant |
| US4845351(A) | 1989-07-01 | Hara et al. | Examiner |
| US4916296(A) | 1990-04-01 | Streck | Applicant |
| US4970712(A) | 1990-11-01 | Tsuruoka et al. | Examiner |
| US4980544(A) | 1990-12-01 | Winter | Applicant |
| US5025415(A) | 1991-06-01 | Masuyama et al. | Examiner |
| US5051569(A) | 1991-09-01 | Tsuruoka et al. | Examiner |
| US5097263(A) | 1992-03-01 | Delpech et al. | Applicant |
| US5128526(A) | 1992-07-01 | Yoshida | Applicant |
| US5184005(A) | 1993-02-01 | Ukai et al. | Applicant |
| US5204515(A) | 1993-04-01 | Yoshida | Applicant |
| US5216233(A) | 1993-06-01 | Main et al. | Applicant |
| US5280159(A) | 1994-01-01 | Schultz et al. | Applicant |
| US5298731(A) | 1994-03-01 | Ett | Applicant |
| US5324922(A) | 1994-06-01 | Roberts | Applicant |
| US5324927(A) | 1994-06-01 | Williams | Applicant |
| US5380998(A) | 1995-01-01 | Bossen et al. | Applicant |
| US5382784(A) | 1995-01-01 | Eberhardt | Applicant |
| US5387783(A) | 1995-02-01 | Mihm et al. | Applicant |
| US5389770(A) | 1995-02-01 | Ackley | Applicant |
| US5420403(A) | 1995-05-01 | Allum et al. | Applicant |
| US5434401(A) | 1995-07-01 | Bauser | Applicant |
| US5434572(A) | 1995-07-01 | Smith | Applicant |
| US5484997(A) | 1996-01-01 | Haynes | Applicant |
| US5489908(A) | 1996-02-01 | Orthmann et al. | Applicant |
| US5521601(A) | 1996-05-01 | Kandlur et al. | Applicant |
| US5528222(A) | 1996-06-01 | Moskowitz et al. | Applicant |
| US5539191(A) | 1996-07-01 | Ackley | Applicant |
| US5550547(A) | 1996-08-01 | Chan et al. | Applicant |
| US5552591(A) | 1996-09-01 | Bossen et al. | Applicant |
| US5553084(A) | 1996-09-01 | Ackley et al. | Applicant |
| US5557092(A) | 1996-09-01 | Ackley et al. | Applicant |
| US5563402(A) | 1996-10-01 | Reddersen et al. | Applicant |
| US5594228(A) | 1997-01-01 | Swartz et al. | Applicant |
| US5612531(A) | 1997-03-01 | Barkan | Applicant |
| US5619027(A) | 1997-04-01 | Ackley | Applicant |
| US5640002(A) | 1997-06-01 | Ruppert et al. | Applicant |
| US5673037(A) | 1997-09-01 | Cesar et al. | Applicant |
| US5761219(A) | 1998-06-01 | Maltsev | Applicant |
| US5763867(A) | 1998-06-01 | Main et al. | Applicant |
| US5764867(A) | 1998-06-01 | Sato | Examiner |
| US5767498(A) | 1998-06-01 | Heske, III et al. | Applicant |
| US5777310(A) | 1998-07-01 | Liu et al. | Applicant |
| US5811781(A) | 1998-09-01 | Ackley | Applicant |
| US6000613(A) | 1999-12-01 | Hecht et al. | Examiner |
| US6012638(A) | 2000-01-01 | Ackley et al. | Applicant |
| US6024289(A) | 2000-02-01 | Ackley | Applicant |
| US6149059(A) | 2000-11-01 | Ackley | Applicant |
| US6321981(B1) | 2001-11-01 | Ray et al. | Examiner |
| DE3330261 | 1985-03-01 | Applicant | |
| EP667592 | 1995-08-01 | Applicant | |
| FR2760209 | 1998-09-01 | Applicant | |
| JP404345868 | 1992-12-01 | Examiner | |
| JP10040329 | 1998-02-01 | Applicant | |
| WO95/12863 | 1995-05-01 | Applicant | |
| WO96/13803 | 1996-05-01 | Applicant | |
| WO98/47101 | 1998-10-01 | Applicant |
Non-Patent Literature (34)
- “Bar Code Compression Decompression,” IBM Technical Disclosure Bulletin 32:12, May 1990, pp. 228-290.Applicant
- AIM USA, “Uniform Symbology Specification Interleaved 2-of-5”, American National Standards Institute, Inc. Approved Aug. 16, 1995, pp.1-11.Applicant
- AIM USA, “Uniform Symbology Specification Codabar”, American National Standards Institute, Inc. Approved Aug. 16, 1995, pp.1-11.Applicant
- AIM USA, “Uniform Symbology Specification Code 93”, American National Standards Institute, Inc. Approved Aug. 16, 1995, pp. 1-10.Applicant
- AIM International, Inc., “International technical Specification—Symbology Identifiers”, Jun. 18, 1998, Document Version 1.0, pp. 1-17.Applicant
- AIM USA, “Uniform Symbology Specification Code 39”, American National Standards Institute, Inc. Approved Aug. 16, 1995, pp.1-11.Applicant
- AIM International, Inc., “International Symbology Specifications—Data Matrix,” Nov. 1996, pp. 1-95.Applicant
- AIM International, Inc., “International Symbology Specifications MaxiCode,” Nov. 1996, pp. 1-44.Applicant
- AIM USA, “Understanding 2D Symbologies,” Copyright 1999, pp.1-49.Applicant
- AIM USA, “Uniform Symbology Specification Code 128,” American National Standards Institute, Inc., Approved Aug. 16, 1995, pp. 1-12.Applicant
- AIM USA, “Uniform Symbology Specification Code 16K,” American National Standards Institute, Inc., Approved Aug. 16, 1995, pp. 1-17.Applicant
- AIM USA, “Uniform Symbology Specification Code 49,” American National Standards Institute, Inc., Approved Aug. 16, 1995, pp. 1-26.Applicant
- AIM USA, “Uniform Symbology Specification Code 93,” Apr. 1993, pp. 1-10.Applicant
- AIM USA, “Uniform Symbology Specification Code One,” Jul. 1994, pp. 1-32.Applicant
- AIM USA, “Uniform Symbology Specification PDF417,” Jul. 1994, pp. 1-34.Applicant
- Alphanumeric Data Compaction, Rev. C., Intermec Corporation, Everett, Washington, Jun. 1, 1992, 6 pages.Applicant
- Bar Code Print Quality—Guideline, ANSI X3.182-1990, pp. 1-29.Applicant
- Codablock F (128), Bar Coding—Symbology Specification—Codablock, ICS International AG, 1993, pp. 1-44.Applicant
- Dallas Semiconductor Corp., “50 Ways to Touch Memory,” pp. 1-72.Applicant
- Dallas Semiconductor Corp., “Dallas Takes the Memory Out of the Computer,” pp. 1-14.Applicant
- Dallas Semiconductor Corp., Book of DS199x Touch Memory Standards, Oct. 1992, pp. 1-159.Applicant
- IPC-2D Symbology Specification, Sep. 7, 1997, pp. 1-7.Applicant
- Extended Channel Interpretation (ECI) Assignments, Release 2, ECI Assignments, Aug. 1995, pp. 1-13.Applicant
- Information processing-8bit single-byte coded graphic character sets, Part 1: Latin alphabet No. 1, ISO 8859-1, Feb. 15, 1987 (E), pp. 1-7.Applicant
- Information processing-8 bit single-byte coded graphic character sets, Part 4: Latin alphabet No. 4, ISO 8859-4, Apr. 15, 1988 (E), pp. 1-5.Applicant
- IPC-13 Symbology Specification (preliminary), Sep. 4, 1997, pp. 1-10.Applicant
- IPC-14 Symbology Specification (preliminary), Sep. 1, 1997, pp. 1-9.Applicant
- Palmer,R.C., “Symbologies,” The Bar Code Book, 2d ed., Chapter 4, Helmers Publishing, Inc., New Hampshire, 1991, pp. 15-59.Applicant
- Schuessler, Using Extended Channel Interpretations (ECI's) for International Character Set Standardization, Scan-Tech Proceedings, Chicago, Illinois, Nov. 1996, pp. 294-305.Applicant
- The Unicode Standard Worldwide Character Encodeing, Ver. 1, vol. 1, The Unicode Consortium, Addison-Wesley Publishing Company, Inc., Massachusetts, pp. 1-6, 340.Applicant
- Walker, “ASCII-Based Compaction Eases Bar-Code Decoder's Work,” Electronic Design 30 (22):163-166, Oct. 1982.Applicant
- Patent Application No. 09/021/608 filed Feb. 10, 1998.Applicant
- Patent Application No. 09/375,815 filed Aug. 17, 1999.Applicant
- Patent Application No. 09/375,913 filed Aug. 17, 1999.Applicant