Bar code decoding using moving averages to break the (n,k) code barrier for UPC, EAN Code 128 and others
AssigneeCIAS, Inc.
InventorsErnst van Haagen, Leonard Storch, Leonard Frank
Life of this patent
Estimating the term…
Loading patent…
AssigneeCIAS, Inc.
InventorsErnst van Haagen, Leonard Storch, Leonard Frank
Estimating the term…
The new generic bar code decoder system described, with its multistage error correcting, is far more powerful than dedicated reference decode algorithms for popular linear and two dimensional bar codes. For example: the 1-7 and 2-8 EAN and UPC character substitution problems are 100% solved (because EAN and UPC become 100% self-checking with the new decoder); the ink spread tolerance improves, especially for EAN, UPC, Code 128 and Code 16K; far greater levels of random systematic edge noise are tolerated and decoded; even many spike edge errors greater than 0.50.times. module can be corrected; and, generous levels of acceleration are tolerated. These are all the ways bar code scanning data gets distorted. Using this new generic decoder system, the ultimate linear binary coded binary bar code with error correcting, BCB, also described, performs dramatically better than any other, despite being more compact. Computer simulation testing of the generic bar code decoder has already been conducted on BCB and UPC timing count scan data records that were distorted with various levels of ink spread, noise, spikes and acceleration using new bar code testbench software, all of which is also described including test results, to show the advances that have been made in bar code science.
A method of decoding a bar coded representation of characters, which includes a plurality of bar elements separated by space elements of detectably different characteristics, and in which the bar and space elements have one or more different module widths and are separated by edges defining transitions between adjacent elements, comprising the steps of:
A method of decoding a bar coded representation of characters, which includes a plurality of bar elements separated by space elements of detectably different characteristics and in which the bars and spaces have one or more different widths and are separated by edges defining transitions between adjacent elements, and in which at least one element is known, comprising the steps of:
A method of decoding at least one bar coded representation of a character which includes a plurality of bar elements separated by space elements of detectably different characteristics and in which the bar and space elements have one or more different widths, comprising the steps of:
A method of decoding a bar coded representation of characters, which includes a plurality of bar elements separated by space elements of detectably different characteristics, and in which the bar and space elements have one or more different module widths and are separated by edges defining transitions between adjacent elements, characters being coded according to bar code convention having logic structure, comprising the steps of:
A method of decoding a bar coded representation of characters, which includes a plurality of bar elements separated by space elements of detectably different characteristics, and in which the bar and space elements have one or more different module widths and are separated by edges defining transitions between adjacent elements, one or more of edges being mislocated more than other said edges, comprising the steps off
A method of decoding a bar coded representation of characters, which includes a plurality of bar elements separated by space elements of detectably different characteristics, and in which the bar and space elements have one or more different module widths and are separated by edges defining transitions between adjacent elements, comprising the steps of:
A method of decoding a bar coded representation of characters, which includes a plurality of bar elements separated by space elements of detectably different characteristics, and in which the bar and space elements have one or more different module widths and are separated by edges defining transitions between adjacent elements, comprising specified processing parameters and the processing steps of:
Dependencies are inferred from the claim text.