Abstract: A method for generating a phone provisioning configuration file comprising obtaining a first file, the first file including one or more keys corresponding to phone provisioning configurations; obtaining a set of variables and at least one set of data values from a second file, the data values corresponding to the phone provisioning configurations of at least one phone; determining whether a number of the data values in the at least one set of data values corresponds to a number of the variables; and generating at least one phone provisioning configuration file corresponding to the data values based on the first file, when the number of data values in the at least one set of data values corresponds to the number of variables.

Abstract: A method and apparatus are provided for efficiently encoding source data in radio frequency identification (RFID) systems. The encoded source data may also provide additional functionality such as data error detection and correction. A source data encoding and decoding method for a RFID system having a RFID transponder comprises the steps of obtaining the source data, encoding to provide more efficient data encodation that may also include data error detection and error correction, writing the encoded source data to a RFID transponder, reading the encoded source data from the RFID transponder, and decoding the encoded source data to recover the original source data. The encoding may utilize bar code symbology algorithms or a non-Full ASCII enhanced functionality character set.

Abstract: A method and apparatus are provided for efficiently encoding source data in radio frequency identification (RFID) systems. The encoded source data may also provide additional functionality such as data error detection and correction. A source data encoding and decoding method for a RFID system having a RFID transponder comprises the steps of obtaining the source data, encoding to provide more efficient data encodation that may also include data error detection and error correction, writing the encoded source data to a RFID transponder, reading the encoded source data from the RFID transponder, and decoding the encoded source data to recover the original source data. The encoding may utilize bar code symbology algorithms or a non-Full ASCII enhanced functionality character set.

Abstract: A universal data input device includes a processor coupled to memory and a two-dimensional or area imager. One or more additional data input modules input wireless (e.g., RF), audio (e.g., voice), card or other data. Software performed by the processor receives the input data, and in one embodiment, receives voice commands. A task manager instructs an application layer to execute appropriate applications based on the voice command, and routes data to the appropriate applications.

Abstract: A plurality of scan lines is used to detect characteristic features of a checkerboard structure or similar pattern structure of symbology within a field of view. The scan lines cross leading edges of the symbology which provides signals to a plurality of processors. The processors detect instances wherein sequential leading edges exhibit angular shifts corresponding to a pattern of the symbology. A further processor is used to detect when a coincidence of these angular shifts occur, thereby providing an indication of the location of the symbology within the field of view.

Abstract: A method and apparatus locates edges of patterns in a stored image, such as edges of start/stop patterns of machine-readable symbols (e.g., PDF 417 symbols). The present invention first divides the stored image into analysis regions and samples each region using a 16-beam star pattern. The beam patterns are analyzed to detect for edges that may correspond to edges of start/stop patterns of the symbol. Coast lines, or elongated edges, of the detected edges are analyzed for parallelism and minimal length to filter out any spurious detected edges. Thereafter, the coast lines are analyzed to confirm that a start or stop pattern has been located. A second start/stop pattern is thereafter located, boundary points are determined at a periphery of the symbol, and finally the symbol is analyzed for its geometric shape to confirm that the located boundary points conform to an accepted geometry for this symbol.

Abstract: A bar code reading system capable of reconstructing irregularly damaged bar codes includes an input device such as an omnidirectional or CCD scanner, processors for determining whether the bar code symbol has been damaged, and a decoder. The scanner initially scans the bar code to determine the symbology that governs the bar code. Once the symbology has been obtained, an expected length for each symbol can be calculated. The scanner then individually scans each symbol and compares the symbol's length to its expected length. If the lengths differ by a significant amount, the symbol is assumed to be damaged and information about the elements of each symbol are stored in memory. The scanner then scans in a reverse direction and stores information about the symbol in memory. A processor then determines all of the possible permutations of element widths from the stored information. Each permutation is checked against all possible decoded symbols until a single, decodable symbol is found.

Abstract: A method and apparatus for resizing digital or stored images initially retrieves a one-dimensional sample of the image, such as a line of pixels. A final image size D is determined so that the absolute value of the original sample size M-2.sup.N *D is a minimum, and where N is an integer greater than or equal to 0. The discrete series of pixels in the line are then converted to a continuous function under a cubic convolution interpolation technique. From the continuous function, intermediate pixel values are determined. Pyramid filtering is employed to filter the intermediate pixel values to a final series of pixel values D. The routine is performed along the opposite dimension so as to alter the size of a two-dimensional stored image.

Abstract: A method and apparatus for resizing or processing images initially retrieves a one-dimensional sample of the image, such as a line of pixels. The image can be of a machine-readable symbol, or other data. A moving window having, for example, five pixels, includes a center "hard core" and four surrounding pixels. Two or more structural sets or multisets are applied to the window to produce a set of pixels greater than the set of pixels in the original image. For example, the center pixel is repeated three times, while immediately adjacent left and right pixels are repeated twice. Thus, a series of nine pixels results. The resulting nine pixels are then sorted based on descending gray scale levels. The n-th largest pixels is selected, such as the third largest. The image is updated, the window moved, and the method repeats again. Pyramid filtering, cubic convolution interpolation, or other techniques can be used to reduce the size of an image, and more complex windows and structural sets can be employed.

Abstract: A bar code symbol reading system includes a memory for storing a plurality of reading gate locations, each reading gate location defining coordinates for a reading gate area surrounding one of the bar code symbols. The memory also stores a lookup table containing an identifier for the object and a pointer to configuration data relating each reading gate for the object to a specific component on the object. The object is scanned by a charge-coupled device scanner for scanning each bar code symbol according to the stored reading gate locations. A processor determines the identifier for each object and relates each read bar code symbol to a component on the object based on the configuration data.

Abstract: A method and apparatus locates edges of patterns in a stored image, such as edges of bars or finder patterns of machine-readable symbols. The present invention first selects an edge point or pixel within a stored image. A dominant direction is determined therefrom by examining a region surrounding the selected point. A smaller window is then examined around the edge point to derive a hexadecimal code based on binary values of pixels which surround the edge point. The hexadecimal code is compared to a table of codes, where each code maps to a similar window and identifies a next edge point. The process continues in the dominant direction until the entire edge is located. Circuitry for rapidly performing the its location of patterns in a stored image, such as ages of bars of finder patterns of machine-readable symbols.

Abstract: A method and apparatus scans or images a machine-readable symbol to produce several reflectance profiles therefrom. The profiles are averaged to produce an averaged profile. Weighted coefficients for each profile are then computed based on the averaged profile. Using the weighted coefficients, a weighted profile from each of the profiles is then produced. Low pass filtering is applied to the weighted profile to filter noisy or gray level signals therefrom. The resulting filtered profile is transformed using a non-linear technique to enhance high amplitude signals, but suppress low amplitude signals. The resulting transform signal is stretched over the range of reflectance values. The resulting stretched signal is then decoded using, for example, techniques for decoding profiles that fail to resolve narrow (1-wide) elements in the machine-readable symbol.

Abstract: A method and apparatus for locating and decoding machine-readable symbols is provided. The present invention stores an image of the symbol and locates all Jordan curves having an angular length less than .pi. within the image of the symbol. The present invention finds and selects all convex Jordan curves from the set of all Jordan curves found within the stored image. The present invention determines equations of a pair of tangent lines from end points of each convex Jordan curve and determines an equation of a center line for each pair of tangent lines. The present invention determines a point of intersection of the center lines, and based on the point of intersection, locates a center point of a finder pattern of the symbol. The present invention confirms that the located center point is indeed the center of the finder pattern, and thereafter decodes the symbol.

Abstract: A method and apparatus for locating and decoding machine-readable symbols is provided. In a preferred embodiment, an image of the symbol is stored and a sampling path through the stored image is selected. The sampling path represents a reflectance signal profile formed through the symbol. Characteristic or critical points are selected along the profile, including minimum and maximum points of peaks and valleys in the profile. Distances between the centers of peaks and valleys are determined. The present invention locates a defined portion of the symbol, such as a finder pattern, by locating a predetermined series of measured distances, such as a series of adjacent, substantially equal distances. After having located the finder pattern, the present invention determines the location of the symbol within the stored image, and thereafter decodes the symbol.

Abstract: A method and apparatus is described which provides improved error correction for reading a PDF417 or other machine-readable symbol having a data region with symbol characters representing encoded data. A processor receives the encoded data read from the PDF417 symbol and executes an error correction routine. The error correction routine includes a two dimensional discrete Fourier transform with a reduced number of arithmetic operations. The transform is a variant of the Good-Thomas FFT performed over the Galois field GF(929), and includes a set of first index values i.sub.1 (consisting of all integers from 0 to 28 inclusive) and a second set of index values i.sub.2 (consisting of all integers from 0 to 31 inclusive). For a given first index value, the transform is performed only over a subset of the second index values. The subset of second index values is the first k values of a sequence given by i.sub.1 +29*r, where r=0, 1, 2, . . . , 31, and k is the minimum of values 31 and ?b/29!+1.