Patent US4602152A successfully refreshed from Google Patents.
US4602152A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Bar code information source and method for decoding same
Assignee: Texas Instruments Inc
•
Filing: 1983-05-24
•
Granted: 1986-07-22
•
Expires: 2003-05-24
Abstract
Abstract There is disclosed a method and apparatus for decoding coded information such as may be provided by a printed bar code. The coded information is segmented into a plurality of words, each having more bits than the number of bits appearing in the corresponding decoded word. The bits of each coded word are subdivided into at least two partial coded words. Each of these partial coded words is then decoded and the decoded versions for all the partial coded words combined so as to yield the decoded word. In the preferred embodiment the method of combination is summation of the decoded partial coded words.
Inventors
- 👤 Ashok Dittakavi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 15:34
CPC Classifications
G; G06; G06K; G06K7/00; G06K7/10; G06K7/14; G06K7/1404; G06K7/146; G06K7/1491
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
235 words
A bar code information source for providing coded data comprising: a support material providing a surface on which coded data is to be disposed; bar code means disposed on the surface of said support material and defining a plurality of data bar spaces adapted to provide bar code data to be retrieved, said plurality of data bar spaces differing in appearance as between dark and light regions and in width dependent upon the information content represented thereby; said plurality of data bar spaces being arranged in a plurality of respective multibit binary words of bar code, each word having a predetermined number of bits of data; each respective multibit binary word as provided by said plurality of data bar spaces being defined by a plurality of multibit binary partial words including a first partial word having a first preselected number of the most significant bits of data and representative of a first numerical value and at least another partial word having a second preselected number of the least significant bits of data and representative of another numerical value; and the numerical values represented by said plurality of partial words defining a respective multibit binary word upon being combined being representative of a decoded version of the corresponding multibit binary word having a plurality of bits reduced in number as compared to said predetermined number of bits of data constituting the respective word of bar code.
Claim 2
Dependent Claim
235 words
A bar code information source for providing coded data comprising: a support material providing a surface on which coded data is to be disposed; bar code means disposed on the surface of said support material and defining a plurality of data bar spaces adapted to provide bar code data to be retrieved, said plurality of data bar spaces differing in appearance as between dark and light regions and in width dependent upon the information content represented thereby; said plurality of data bar spaces being arranged in a plurality of respective multibit binary words of bar code, each word having a predetermined number of bits of data; each respective multibit binary word as provided by said plurality of data bar spaces being defined by a plurality of multibit binary partial words including a first partial word having a first preselected number of the most significant bits of data and representative of a first numerical value and at least another partial word having a second preselected number of the least significant bits of data and representative of another numerical value; and the numerical values represented by said plurality of partial words defining a respective multibit binary word upon being combined being representative of a decoded version of the corresponding multibit binary word having a plurality of bits reduced in number as compared to said predetermined number of bits of data constituting the respective word of bar code.
Claim 3
Dependent Claim
81 words
A bar code information source as set forth in claim 1, wherein said data bar spaces comprise first bar spaces of relatively narrow width and second bar spaces of relatively wide width as compared to said first bar spaces of relatively narrow width; said first bar spaces being representative of one binary value, and said second bar spaces being representative of the other binary value; and said first bar spaces substantially predominating in number as compared to said second bar spaces.
Claim 4
Dependent Claim
43 words
A bar code information source as set forth in claim 2, wherein only bar code words with the predetermined number of bits of data in which a preponderance of said first bar spaces occurs as compared to said second bar spaces are present.
Claim 5
Dependent Claim
31 words
A bar code information source as set forth in claim 3, wherein said first bar spaces are respectively representative of "one", and said second bar spaces are respectively representative of "zero".
Claim 6
Independent Claim
299 words
A method of decoding a bar code comprising a plurality of data bar spaces adapted to provide bar code data to be retrieved, wherein said data bar spaces differ in appearance as between dark and light regions and in width dependent upon the information content represented thereby, said plurality of data bar spaces being arranged in respective words of bar code each having a predetermined number of bits of data; said method comprising the steps of: dividing respective words of bar code into a plurality of partial words including a first partial word having a first preselected number of the most significant bits of data and at least another partial word having a second preselected number of the least significant bits of data; addressing a first lookup table having a plurality of addresses, each of which is defined by said first preselected number of bits, with said first partial words to derive an output from said first lookup table corresponding to the address as determined by said first preselected number of the most significant bits of data of said first partial word; addressing at least another lookup table having a plurality of addresses, each of which is defined by said second preselected number of bits, with said another partial word to derive an output from said another lookup table corresponding to the address as determined by said second preselected number of the least significant bits of data of said another partial word; and summing all of the outputs from said lookup tables corresponding to the addresses as determined from said plurality of partial words defining a respective word to produce a resultant decoded address having a plurality of bits reduced in number as compared to said predetermined number of bits of data constituting the respective word of bar code.
Claim 7
Independent Claim
299 words
A method of decoding a bar code comprising a plurality of data bar spaces adapted to provide bar code data to be retrieved, wherein said data bar spaces differ in appearance as between dark and light regions and in width dependent upon the information content represented thereby, said plurality of data bar spaces being arranged in respective words of bar code each having a predetermined number of bits of data; said method comprising the steps of: dividing respective words of bar code into a plurality of partial words including a first partial word having a first preselected number of the most significant bits of data and at least another partial word having a second preselected number of the least significant bits of data; addressing a first lookup table having a plurality of addresses, each of which is defined by said first preselected number of bits, with said first partial words to derive an output from said first lookup table corresponding to the address as determined by said first preselected number of the most significant bits of data of said first partial word; addressing at least another lookup table having a plurality of addresses, each of which is defined by said second preselected number of bits, with said another partial word to derive an output from said another lookup table corresponding to the address as determined by said second preselected number of the least significant bits of data of said another partial word; and summing all of the outputs from said lookup tables corresponding to the addresses as determined from said plurality of partial words defining a respective word to produce a resultant decoded address having a plurality of bits reduced in number as compared to said predetermined number of bits of data constituting the respective word of bar code.
Claim 8
Dependent Claim
104 words
A method of decoding a bar code as set forth in claim 5, wherein said data bar spaces comprise first bar spaces of relatively narrow width and second bar spaces of relatively wide width as compared to said first bar spaces of relatively narrow width; representing one binary value by each of said first bar spaces; representing the other binary value by each of said second bar spaces; and arranging the bar code data such that said first bar spaces substantially predominate in number as compared to said second bar spaces prior to the division of respective words of bar code into partial words.
Claim 9
Dependent Claim
53 words
A method of decoding a bar code as set forth in claim 6, further including employing only words of bar code with said predetermined number of bits of data in which a preponderance of one binary value occurs in the bits of data defining the word as compared to the other binary value.
Claim 10
Dependent Claim
37 words
A method of decoding a bar code as set forth in claim 7, wherein each of said first bar spaces is respectively representative of "one", and each of said second bar spaces is respectively representative of "zero".
References Cited (Backward Citations)
US4091270A
Cited
US4128737A
Cited
US4214125A
Cited
US4209844A
Cited
US4130730A
Cited
US4337375A
Cited
US4308455A
Cited
US4398059A
Cited
US4488678A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1989-07-21 | 1990-01-20 | 1990-07-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1993-07-21 | 1994-01-20 | 1994-07-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1997-07-21 | 1998-01-20 | 1998-07-22 | $7700.00 | Window Closed / Lapsed |