Nothing Special   »   [go: up one dir, main page]

CN100361145C - Device for representation of data - Google Patents

Device for representation of data Download PDF

Info

Publication number
CN100361145C
CN100361145C CNB2005100589271A CN200510058927A CN100361145C CN 100361145 C CN100361145 C CN 100361145C CN B2005100589271 A CNB2005100589271 A CN B2005100589271A CN 200510058927 A CN200510058927 A CN 200510058927A CN 100361145 C CN100361145 C CN 100361145C
Authority
CN
China
Prior art keywords
data
label
coder
pct
point
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CNB2005100589271A
Other languages
Chinese (zh)
Other versions
CN1667648A (en
Inventor
西蒙·罗伯特·瓦尔姆斯利
保罗·拉普斯顿
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Silverbrook Research Pty Ltd
Original Assignee
Silverbrook Research Pty Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Silverbrook Research Pty Ltd filed Critical Silverbrook Research Pty Ltd
Priority claimed from PCT/AU2000/000757 external-priority patent/WO2002003321A1/en
Publication of CN1667648A publication Critical patent/CN1667648A/en
Application granted granted Critical
Publication of CN100361145C publication Critical patent/CN100361145C/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Landscapes

  • Editing Of Facsimile Originals (AREA)
  • Record Information Processing For Printing (AREA)
  • Printers Characterized By Their Purpose (AREA)

Abstract

The present invention describes a data expressing device which permits to use a specific coding proposal to code and print data into any shape. The device comprises a readable freeform fixing background determining the position and the direction of a data zone. The data comprises a plurality of points used for extracting and storing information through coding.

Description

Be used to represent the device of data
Present patent application is that application number is 00819713.X (PCT/AU00/00757), and the applying date is on June 30th, 2000, and invention and created name is divided an application for the patented claim of " have data embed data package template ".
Technical field
The present invention relates to a kind of data package template, label that data embed that have.
Particularly, but not exclusively, relate to a kind of data package template format structure or tag format structure (TFS) based on point.
Background technology
The whole bag of tricks relevant, system and device with the present invention be disclosed in following by applicant of the present invention or assignee in the common pending application of submitting on May 24th, 2000:
PCT/AU00/00518,PCT/AU00/00519,PCT/AU00/00520,PCT/AU00/00521,PCT/AU00/00523,
PCT/AU00/00524,PCT/AU00/00525,PCT/AU00/00526,PCT/AU00/00527,PCT/AU00/00528,
PCT/AU00/00529,PCT/AU00/00530,PCT/AU00/00531,PCT/AU00/00532,PCT/AU00/00533,
PCT/AU00/00534,PCT/AU00/00535,PCT/AU00/00536,PCT/AU00/00537,PCT/AU00/00538,
PCT/AU00/00539,PCT/AU00/00540,PCT/AU00/00541,PCT/AU00/00542,PCT/AU00/00543,
PCT/AU00/00544,PCT/AU00/00545,PCT/AU00/00547,PCT/AU00/00546,PCT/AU00/00554,
PCT/AU00/00556,PCT/AU00/00557,PCT/AU00/00558,PCT/AU00/00559,PCT/AU00/00560,
PCT/AU00/00561,PCT/AU00/00562,PCT/AU00/00563,PCT/AU00/00564,PCT/AU00/00566,
PCT/AU00/00567,PCT/AU00/00568,PCT/AU00/00569,PCT/AU00/00570,PCT/AU00/00571,
PCT/AU00/00572,PCT/AU00/00573,PCT/AU00/00574,PCT/AU00/00575,PCT/AU00/00576,
PCT/AU00/00577,PCT/AU00/00578,PCT/AU00/00579,PCT/AU00/00581,PCT/AU00/00580,
PCT/AU00/00582,PCT/AU00/00587,PCT/AU00/00588,PCT/AU00/00589,PCT/AU00/00583,
PCT/AU00/00593,PCT/AU00/00590,PCT/AU00/00591,PCT/AU00/00592,PCT/AU00/00594,
PCT/AU00/00595,PCT/AU00/00596,PCT/AU00/00597,PCT/AU00/00598,PCT/AU00/00516,
PCT/AU00/00517 and PCT/AU00/00511
The content of these common pending applications is incorporated herein for cross reference.
In addition, the whole bag of tricks relevant with the present invention, system and device are disclosed in the following common unsettled PCT application of being submitted to simultaneously by applicant of the present invention or assignee and the present invention: PCT/AU00/00754, PCT/AU00/00755 and PCT/AU00/00756.
The content of these common pending applications is incorporated herein for cross reference.
The PCT patented claim No.PCT/AU00/00517 that is entitled as " type face label coder " has special correlativity, and after this reference number PEC02 with us indicates.
Today, almost each article of buying from the shop all comprise the bar code of certain description on the packaging.Bar code provides a kind of method that makes things convenient for according to production code member sign article.The type that the accurate explanation of production code member is depended on bar code.Inventory status notification system still, must be encoded to the stock in the shop by themselves production code member scope of user definition more generally so that from the product coding of a company with not overlapping from the product coding of another company.
Bar code itself is specified with a large amount of forms.Older barcode format comprises with the form of lines and comes symbols displayed.The information that bar code comprises is described in the combination of black and white lines.Usually, form complete bar code two kinds of lines are arranged: symbol (information itself) and list separator piece are beneficial to the lines of optical identification.Though the information of different bar codes can change, the lines that are used for spacing block keep constant.Therefore, the lines that are used for spacing block can be regarded as the part of the constant constituent of bar code.
Bar code is read by special fetch equipment, as light pen, rifle formula reader and scanner, the data transfer that it extracted in computing machine so that further handle.
In order to help to guarantee that the data of being extracted can correctly be read, verification and be introduced into error-detecting as a kind of former (crude) form.Newer barcode format uses the redundancy encoding scheme, as Read-Solomon.As US5,591,956 is described, adopts such encoding scheme in the Aztec 2D bar code.Usually, the degree of redundancy encoding is at user option.
Two-dimensional bar is developed, and wherein information is encoded with two dimension, rather than is a series of lines with information stores, and wherein data are extracted from single dimension.The same with original bar code, the 2D bar code comprises information and constituent, to be used for better optical identification.The example of response (QR) sign indicating number (Quick Response Code) fast shown in Fig. 1, it is by Denso of Japan exploitation and at US5, and is open in 726,435.Notice that bar code elements is made up of two zones: data area (depending on the data that are stored in the bar code), and constant position probing pattern.By reader, constant position probing pattern is used to help positioning unit itself, and positioning unit border then is to allow the reference azimuth of reader determining unit.The orientation can be determined by the following fact: do not have the 4th angle pattern.
A problem relevant with the usable range of bar code is: the hardware that is used to produce these bar codes is to be exclusively used in this specific barcode format.Along with printer becomes more and more deep, the requirement of the real time print of these bar codes is increased day by day.
Summary of the invention
The purpose of this invention is to provide a kind of label coder, be used for being encoded by data printer prints, that formed by a plurality of points, the described data that are encoded comprise: the constant background pattern of arbitrary shape, and it is by a plurality of points or blank formation; And the data area of at least one arbitrary shape, wherein said data area comprises and is positioned at the locational data point of being determined by encoding scheme, and described encoding scheme is realized by described label coder; Described label coder exports encoded label data to printer, makes that be used for the background patterns of Print Label data and the point of data area is printed.
Description of drawings
For the present invention can more fully being understood and realizing that in practice only as an example, the preferred embodiments of the present invention will be described now in conjunction with the accompanying drawings, wherein:
Fig. 1 illustrates a kind of two-dimentional quick response codes of prior art;
Fig. 2 illustrates a kind of Netpage label background patterns;
Fig. 3 illustrates the data area in the Netpage label shown in Figure 2;
Fig. 4 is the zoomed-in view at the Netpage label of 1600dpi resolution reproduction.
Fig. 5 illustrates the effect of the output resolution ratio on the label composition;
Fig. 6 is illustrated in the data representation in the two-dimentional quick response codes;
Fig. 7 illustrates a simple 3x3 label construction; And
Fig. 8 is the version of amplification of the label of Fig. 7.
Embodiment
In this application, term tag is used for the combination of designation data and any other composition (as position probing pattern, white space, wait) on every side, and it must help maintenance, location or reading of data expressively.Therefore, label comprises following ingredients:
● at least one data area.The data area is the zone that is used for label.The label data zone comprises encoded data (optional is redundancy encoding, may be simple verification and).Data bit is placed in the data area by label coding scheme appointed positions.
● constant background patterns, it generally includes constant position probing pattern.This helps the label reader positioning label.They include the composition that helps locate, and under the situation of 2D label, can comprise orientation and perspective information.The constant background pattern also can comprise pattern, as white space around the data area, or the position probing pattern.These blank patterns are by guaranteeing there is not to disturb the coding of helping data between the data area.
For convenience of description, data package template will illustrate aspect the ordinary optical identification, as bar code scanner etc.To understand, this notion is suitable for tactile recognition equally, and or even voice recognition.
In most of label coding schemes, there is certain constant background patterns, but not everyly all necessarily needs it.For example, if the label data zone is centered on by physical space and reading device uses non-optical location mechanism (for example the surface physics to the data reader aligns), do not need the position probing pattern so.
Different label coding schemes has the label of different sizes, and the physical tag zone differently is assigned as constant position check pattern and data area.For example, QR sign indicating number as shown in Figure 1 has 3 fixed blocks 10 as the position probing pattern at the edge of label, and has data area 11 at remainder.On the contrary, the Netpage label construction shown in Fig. 2,3 and 4 comprises circular steady arm composition 20, orientation composition 21 and several data area.Fig. 2 illustrate one with the Netpage label constant background pattern of the irrelevant form of resolution.Fig. 3 is identical with Fig. 2, but has increased data area 30 for the Netpage label.Fig. 4 is the example of arranging and reproducing for the point of the 1600dpi of Netpage label.In Fig. 4, the single position of data is represented by many physics output points, to form piece in the data area.
The data area comprises the data that are used for label.The coded format that depends on label, the single position of data can be by some physical printed point expressions.The definite number of point will depend on that output resolution ratio and target read/scanning resolution.Fig. 5 illustrates according to the resolution effect on the part of the lines of traditional bar code.When with resolution R when reproduced, the lines part can be taken advantage of 5 high reproductions of point so that 2 points are wide.(2R) reproduces with 2 resolutions, and same lines will be represented by the point with twice on each dimension.
Again for example, for QR sign indicating number shown in Figure 1, single position is represented that by dark module or bright module the definite number of the point in wherein dark module or the bright module depends on reproduction resolution and target reads/scanning resolution.For example, with reference to figure 6, data module can be represented (all on60 are binary one, and perhaps all off61 are binary zero) by the square of print point.
Therefore, the single position of data can be represented by the shape of printing arbitrarily with Print Label.Minimum shape is single print point, and maximum shape is whole label itself in theory.For example, on two dimensions, constituted in grand o'clock by a plurality of print points.
A kind of desirable universal tag definition structure should allow to print shape arbitrarily from each generation of data.
The original number of given data bit and via reading/scanning mechanism is placed in the label of printing these to be used for the hope of follow-up retrieval, and the original number of position can be placed directly in the label, and perhaps they can carry out redundancy encoding with certain form.The definite form of redundancy encoding depends on the form of label.
The redundancy scheme that adopts in the placement of data bit in the data field of label and the encoding scheme is directly related.In 2D, data bit can put together, and makes burst error reach balanced on label data, and this is normally repairable.For example, all positions of Read-Solomon code word will be deployed on the whole label data zone, so that minimize the potential impact of burst error.
Because the shape and the size in data coding scheme and label data zone are closely related, and it is desirable to have a kind of general label format structure.This allows to use identical data structure and reproduces embodiment and reproduce various tag formats.
Tag format structure of the present invention (TFS) is a kind of data package template based on point.Its allows how the definition of the packet of the arbitrary shape that is made of point and definition be stored as point in the packet to data itself.TFS is optimised, so that label can be reproduced in real time.For each the some position in the label bounding box, TFS comprises clauses and subclauses.Each clauses and subclauses stipulates whether this point is the part that generally includes the constant background pattern of constant position check pattern, the perhaps part of the data component of label.
TFS is similar to bitmap in the following areas: for each the some position in the label bounding box, it comprises clauses and subclauses.Therefore, TFS has TagWidth clauses and subclauses of TagHeight x, wherein TagWidth and size coupling at the label bounding box of row on the dimension, and TagHeight and the size coupling that is used for the label bounding box on the dimension.The single row of the TFS clauses and subclauses of label is called label line struture.
TFS has following associated parameter:
● TagWidth is the width (in point) that is used for the bounding box of label;
● TagHeight is the height (in point) that is used for the bounding box of label;
● EntryWidth is the number (minimum is 2) of the position in each clauses and subclauses of TFS;
● NumTagDataBits is the data bit number (minimum be 0) relevant with each label.
For specific label example is encoded, need provide the data that will be inserted in this label:
● TagData is an array of NumTagDataBits position, comprises the real data in the data area that will store label into.Redundancy encoding has preferably been carried out according to the label coding scheme in these positions.
Each clauses and subclauses among the TFS are explained according to low level position (low order bit) (position 0):
● if position 0 is eliminated (=0), and the output point to these clauses and subclauses is the part of constant background pattern so.Point value itself comes self-alignment 1.If the position 1 equals 0, output is 0 so, and if position 1 equals 1, output valve is 1 so.
● if the position 0 is set (=1), so to this clauses and subclauses output point from the TagData array.The remaining bit of these clauses and subclauses (position 1 is to NumTagDataBits-1) comprises the address of the TagData position that will be used.
Each clauses and subclauses among the TFS are independently explained, and are not relied on status information.This is important, and feasible random access to clauses and subclauses is possible, and this situation of handling the different piece (for example, label can be reproduced engine by being given two or more) of page or leaf at a plurality of reproduction engines is necessary.
If the size of print point is too little, label can come convergent-divergent in one of several modes.Can come convergent-divergent to label itself with the N point on each dimension, this increases the number of entries among the TFS.Replacedly, can the bitmap zoom technology by standard amplify output from the TFS generator---for example, duplicate or over-extraction sample (supersample) average etc. by pixel.
For example, if original TFS is 21x21 clauses and subclauses, and for each original point, convergent-divergent is a simple 2x2 point, and this TFS will increase to 42x42.In order to produce new TFS from old TFS, each clauses and subclauses on every row of TFS will be repeated, and each of TFS is about to be repeated then.In these cases, the clean entry number of TFS will be increased to 4 times (2x2).
TFS allows to produce grand point, rather than simple convergent-divergent.With reference to figure 7, the simplified example of 3x3 point label has been described here, for example may need the label of physically big print form, wherein each original point can be represented by 7x7 print point.If all duplicating (by the size of TFS is amplified in the output of label generator output in 7 times of increases on each dimension or by being provided with one) with 7 on each dimension of original TFS, 9 groups of 7x7 squares will be produced so.Instead, each original point among the TFS can be replaced by the round dot of 7x7 point definition.Fig. 8 illustrates this result.
Therefore, the resolution of TFS is high more, and for the point of each grand dot printing is many more, wherein grand point is represented the individual data position of label.The point that can be used for producing grand point is many more, and the pattern of grand point can be complicated more.For example, Fig. 4 illustrates the Netpage label construction, and it is appeared as makes data bit be represented by average 8 x8 points (at 1600dpi), but the practical structures of point be not square in shape.After allowing, this reads this Netpage label on where position in office.
9 labels by Fig. 7 show a very simple example.Have 3 some constant background patterns to be used to help positioning label, remaining 6 points are as data.This means that we can store 6 data bit in this label.
But, suppose that 6 positions in fact only represent 3 original data bits, because 3 raw bits anti-value by increasing them is by redundancy encoding.For example, if 3 original data bit are 111,6 positions will be 101010 so.If 3 original data bit are 101,6 positions that obtain so will be 100110.
The redundancy encoding of the chosen consideration data of relation of the some position in the label.In this simplified example, the top line of label always 111.Second row comprises preceding two data bit.Known data coding scheme, front two must be reciprocal.Therefore, 111 the second row position can never be realized, though 101,011,100 or 010 can be implemented.The 3rd row for label also is like this.Therefore, when producing label, except predetermined constant zone, 111 constant pattern can not appear.
Following parameter has been summed up this simple label scheme:
●TagWidth=3
●TagHeight=3
● EntryWidth=4 (1+3,1 is used for the low level position, 3 are used for 6 data bit of index)
●NumTagDataBits=6
With reference to figure 7, it is 0010,0010,0010 that first of TFS is about to, and represents 3 positions of on always, and with the storage data independence.First clauses and subclauses of second row will be 0001 among the TFS, show that with indication the content of the position 0 of the TagData array that is used for this label should be output at this position.Second clauses and subclauses of second row will be 0011, and the content of the position 1 of expression TagData array will be output on this position.The 3rd clauses and subclauses of second row will be 0101 among the TFS, represent the 2nd content.
First clauses and subclauses of the third line will be 1001 among the TFS, be used to indicate the content of the position 4 of TagData array should be output at this position.Row 2, clauses and subclauses 2 will be 1011, expression position 5, and the row 2 among the TFS, clauses and subclauses 3 will be 0111, be used to indicate no matter what is stored in the 3rd of the TagData array that is used for label, should be output on this position.
Therefore, whole TFS will be (with the clauses and subclauses series arrangement):
0010,0010,0010
0001,0011,0101
1001,1011,0111
Notice that sign indicating number 1101 and 1111 never is used, because they point to non-existent data bit 6 and 7 (we only have data bit 0-5).
The given TFS that has just described may produce and is used for any group 6 label, promptly given 6 long TagData arrays.If these 6 is 101010, so on 9 some positions, will be from the output of label coder:
● 1 (constant)
● 1 (constant)
● 1 (constant)
● 1 (from data bit 0)
● 0 (from data bit 1)
● 1 (from data bit 2)
● 1 (from data bit 4)
● 0 (from data bit 5)
● 0 (from data bit 3)
If 6 positions are 100110, so on 9 some positions, will be from the output of label coder:
● 1 (constant)
● 1 (constant)
● 1 (constant)
● 1 (from data bit 0)
● 0 (from data bit 1)
● 0 (from data bit 2)
● 1 (from data bit 4)
● 0 (from data bit 5)
● 1 (from data bit 3)
Refer again to Fig. 1, sample QR sign indicating number label is 21 and takes advantage of 21.If each piece is made up of a single point, QR sign indicating number label is 21 x21 points so.In addition, 249 data blocks are arranged in the data area, represent 249.Basic parameter TagWidth and TagHeight can be set to 21 now.EntryWidth=9 (1+8,1 is used for the low level position, 8 are used for 249 data bit of index), NumTagDataBits=249.Therefore, the tag format structure should be 441 clauses and subclauses (21x21) altogether, and wherein each clauses and subclauses is 9.Preceding 7 clauses and subclauses will be 000000010, and being used to define 1, the 8 clauses and subclauses of output point constant will be 000000000, be used to define output point constant 0.Subsequent clauses and subclauses should be xxxxxxxx1, and wherein xxxxxxxx is the figure place destination address, and it represents first the 9th of going.If this piece is from the position 129 of 249 data bit, xxxxxxxx will be 10000001 so.If this piece is from the position 62 of 249 data bit, xxxxxxxx should be 00111110 so.To always have 5 data reference bar orders, be thereafter 000000000, and 7 000000010 clauses and subclauses are finished this row.
It is 00000010 that second of tag format structure is about to, and is thereafter 5 000000000 clauses and subclauses, and one 00000010 clauses and subclauses, and one 000000000 clauses and subclauses are represented 8 constant data output points 1,0,0,0,0,0,1 and 0 respectively.The clauses and subclauses that 5 reference datas are arranged then, its sensing are used for each position of the 2nd 249 data bit that are listed as of label.
Being about at last of tag format structure is 7 00000010 clauses and subclauses, one 000000000 clauses and subclauses, and the clauses and subclauses of each data bit of 13 sensings in the rank rear of label then.TagData is one 249 a array, and it comprises the real data that will store in the label data zone.Redundancy encoding must have been carried out according to QR label coding scheme in these positions.
Tag format structure of the present invention can be to apply for that at above-mentioned common unsettled PCT reference number is that the label coder that discloses among the PEC02 is realized.The operating in this and simply summed up of this label coder.
Label coder (TE) provides the functional application that label enables (tag-enabled) that is used for, and it requires IR China ink exist (though can use K China ink or alternative under condition of limited) at the printhead place usually.TE is encoded into wrong repairable code tag to fixed data together with specific label data value to the page or leaf of printing, and is printed on the page or leaf with infrared or tusche after it.Consider vertical or horizontally, TE places label according to the triangle lattice.Basic label construction reproduces with the resolution of 1600dpi, and label data can be encoded into the grand point (minimum dimension is 1 point of 1600dpi) of arbitrary shape.
Label coder uses following as input:
● vertically/horizontal flag;
● define the template of the structure of single label;
● several fixed data positions (at page fixing);
● flag, whether its definition is carried out redundancy encoding to the fixed data position or this position is considered as being encoded;
● several variable data position records, wherein each record comprises at the variable data position in the given row of label;
● flag, whether its definition is carried out redundancy encoding to the variable data position or this position is considered as being encoded.
Output from label coder (TE) is two-value (bi-level) layer of 1600dpi, should be printed at this label data.Output is the FIFO via 1 bit wide.Afterwards, preferably by the infrared absorption China ink that can read by the label sensing equipment, label is printed.
Though notional enforcement of label coder (TE) allows label to have variable structure and constant and variable data composition, TE applies the scope restriction to certain coding parameter really.Yet these restrictions are the buffer size of most of encoding schemes selections and the direct result of addressing bit number.Adjusting buffer size and corresponding addressing is simple thing with other parameter in using that allows to encode arbitrarily.
TE writes two-value label bit stream to two-value label F IFO.TE is responsible for encoded label data and basic label construction are merged, and the point among the output FIFO is placed with correct order, to be used for follow-up printing.Encoded label data instant (on the fly) produces from original data bits, to minimize spatial cache.
The TagData array is divided into fixing and variable composition.For example, if a label is held 512 bit data, some in these may be fixed all labels.Other change for different labels.For example, the Universal product code allows national code and company's sign indicating number.Because these positions do not change with label, when producing many labels,, can be encased in these positions in the label generator in advance in order to reduce bandwidth.Another example is the Netpage label generator.Single type face comprises the Netpage label of several forms shown in Fig. 2-4.Between all labels, page or leaf ID is constant, though the remaining data in certain label is different to each label.For each label,, can reduce total bandwidth to scrambler by reducing the total amount of the variable data that is being sent to label coder.
Depend on the enforcement of scrambler, these parameters will be implicit expression or explicit, but and the size of the reproducible label of restriction system.For example, the software label coder can be variable fully, and the hardware label coder can have the label data position of maximum quantity.
Do not receive the TagData that external encoder is encoded that passes through of whole numbers, label coder can be accepted basic nonredundancy coded data position, and according to the requirement of each label they is encoded.Can cause the remarkable saving of bandwidth like this.Under the situation of Netpage label, as described in common unsettled PCT application PEC02, for each label provides only 120 raw data, and label coder is encoded into 360 to these 120.By have REDUNDANCY ENCODER on the plate of label coder, required effective bandwidth has reduced 2/3.
During TFS hereinbefore described, position 0 qualification whether output point is stored (value that position 1 comprises carry-out bit) with clauses and subclauses immediately or whether high bit forms the address of seeking the TagData structure.Using the different identical information of position normal indication is a little variation.
In order to reduce the memory requirement to the label of particular type, TFS can use indirectly two.In the foregoing description, when the position 0 of TFS clauses and subclauses is set up, the high-order address that forms from the position of the TagData array that will be used.But if the clauses and subclauses sum is big among the TFS, and for the given row of TFS, the maximum number of coordination is not considerably little than NumTagDataBits, and using two so is easily indirectly.
Use is indirectly two, and data-address entry of TFS points to second array, and it is stored in the capable end of TFS.In the TagData array that will use, second array comprises actual address.For example, if on the given row of a label, have only 8 different data bit to be used, can be set to for 4 (1 is used to determine whether to be necessary to search data bit or directly to use position 1) by EntryWidth.If position 0 is 1, position 1-3 is used to form address 0-7 so.This address searches 8 n position tables of articles that point to the TagData array.If 512 clauses and subclauses, n=9 are so arranged in the TagData array.If TagWidth=100, the basic coding scheme is that 1000 (100x10 positions) have been used in every enforcement of TFS so.If use is indirectly two, and has only 8 different data bit to be used on the given row of label, every row of TFS needs 472 (100x4 position+8x9 position) so.Depend on application, saved about 50% that this may be a valuable coefficient.
The another kind of variation is to become continuous tone output from two-value output.In the present invention, each output point is on normally, perhaps off.If position 0 is 0, position 1 comprises the carry-out bit that will use so.This can be extended to the position that forms greater number at an easy rate.For example, 4 continuous tones are printed if desired, if promptly position 0 is 0, output is 4 positions that formed by position 1-3 so.Certainly, EntryWidth also needs to increase rightly.
Equally, point to the address of TagData array and can point to n clauses and subclauses yet, wherein, these clauses and subclauses are not 1, but a plurality of positions (depending on the figure place in each continuous tone output point).
If whole TFS stores in this locality, for example on chip, it can visit with line mode or by the row mode so, so that horizontal or vertical orientation to be provided.If the tag format structure is not (for example in the internal memory outside chip) of local storage, and once visits delegation, preferably, have two structure copies---one is used for laterally, and another is used for vertical printing.
For example, in common unsettled PCT application PEC02, label coder is on ASIC, and TFS is externally among the DRAM.In order to store on the plate that reduces ASIC, once only to the current line of its TFS that packs into.Owing to the visit of TFS is based on capable, needs externally to preserve two TFS structures among the DRAM---one is used for vertically, and one is used for landscape orientation.In theory, they can be at random different.Yet in fact, they are that identical TFS has rotated 90 degree.
Run through whole instructions, the preferred embodiments of the present invention are described, rather than limit the invention to the specific collection of any one embodiment or feature.The technician in relevant field can realize various variations according to specific embodiment, but it still falls into scope of the present invention.

Claims (14)

1. label coder is used for being encoded by data printer prints, that formed by a plurality of points, and the described data that are encoded comprise:
The constant background pattern of arbitrary shape, it is by a plurality of points or blank formation; And
The data area of at least one arbitrary shape, wherein said data area comprise and are positioned at the locational data point of being determined by encoding scheme, and described encoding scheme is realized by described label coder;
Described label coder exports encoded label data to printer, makes that be used for the background patterns of Print Label data and the point of data area is printed.
2. label coder as claimed in claim 1 is characterized in that, the constant background pattern of described arbitrary shape comprises at least one steady arm composition that can read with the locator data zone.
3. label coder as claimed in claim 1 is characterized in that described label data is two-dimentional.
4. label coder as claimed in claim 1 is characterized in that described label data is two-dimentional, and the constant background pattern of described arbitrary shape comprises the orientation composition that can read in the orientation that is used to identify described at least one data area.
5. label coder as claimed in claim 1 is characterized in that, described background patterns and described data point are the sense of touch elements that can read by the sense of touch scanner.
6. label coder as claimed in claim 1 is characterized in that, described encoding scheme identifies whether each point is the part of background patterns or data area.
7. label coder as claimed in claim 1 is characterized in that, described point is a two-value.
8. label coder as claimed in claim 1 is characterized in that, described point is a continuous tone.
9. label coder as claimed in claim 1 is characterized in that described data are by redundancy encoding.
10. label coder as claimed in claim 1 is characterized in that, described data are in office, and where the position is readable.
11. label coder as claimed in claim 1 is characterized in that, but described data are by error correction ground coding.
12. label coder as claimed in claim 1 is characterized in that, described data are printed with infrared China ink.
13. label coder as claimed in claim 1 is characterized in that, described data comprise fixed data and variable data.
14. label coder as claimed in claim 13 is characterized in that, described fixed data comprises one or more univeraal product codes.
CNB2005100589271A 2000-06-30 2000-06-30 Device for representation of data Expired - Fee Related CN100361145C (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/AU2000/000757 WO2002003321A1 (en) 2000-06-30 2000-06-30 Data package template with data embedding

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
CN00819713.XA Division CN1265318C (en) 2000-06-30 2000-06-30 Data package template with data embedding

Publications (2)

Publication Number Publication Date
CN1667648A CN1667648A (en) 2005-09-14
CN100361145C true CN100361145C (en) 2008-01-09

Family

ID=29783657

Family Applications (2)

Application Number Title Priority Date Filing Date
CN00819713.XA Expired - Fee Related CN1265318C (en) 2000-06-30 2000-06-30 Data package template with data embedding
CNB2005100589271A Expired - Fee Related CN100361145C (en) 2000-06-30 2000-06-30 Device for representation of data

Family Applications Before (1)

Application Number Title Priority Date Filing Date
CN00819713.XA Expired - Fee Related CN1265318C (en) 2000-06-30 2000-06-30 Data package template with data embedding

Country Status (7)

Country Link
JP (1) JP4689935B2 (en)
CN (2) CN1265318C (en)
AT (1) ATE490516T1 (en)
AU (1) AU2000253747B2 (en)
DE (1) DE60045318D1 (en)
IL (2) IL153715A0 (en)
ZA (1) ZA200210184B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013010893A1 (en) 2011-07-15 2013-01-24 Sanofi-Aventis Deutschland Gmbh Drug delivery device with electro-mechanic drive mechanism

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1077299A (en) * 1992-04-06 1993-10-13 帝菱产业株式会社 The coding/decoding method of two-dimensional code symbol mark
US5288986A (en) * 1992-09-17 1994-02-22 Motorola, Inc. Binary code matrix having data and parity bits
US5477012A (en) * 1992-04-03 1995-12-19 Sekendur; Oral F. Optical position determination
JPH08185492A (en) * 1994-12-27 1996-07-16 Sharp Corp Digital information recording carrier, method and device for recording digital information, and method and device for converting digital information into plain one
US5591956A (en) * 1995-05-15 1997-01-07 Welch Allyn, Inc. Two dimensional data encoding structure and symbology for use with optical readers
US5661506A (en) * 1994-11-10 1997-08-26 Sia Technology Corporation Pen and paper information recording system using an imaging pen
US5726435A (en) * 1994-03-14 1998-03-10 Nippondenso Co., Ltd. Optically readable two-dimensional code and method and apparatus using the same

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3738049B2 (en) * 1995-03-10 2006-01-25 シャープ株式会社 Digital information recording method
JP3887947B2 (en) * 1998-05-12 2007-02-28 株式会社デンソー Two-dimensional code reading method and recording medium
JP2000099616A (en) * 1998-09-28 2000-04-07 Olympus Optical Co Ltd Device for generating code image data
JP2000158720A (en) * 1998-12-01 2000-06-13 Hitachi Ltd Bar code printer

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5477012A (en) * 1992-04-03 1995-12-19 Sekendur; Oral F. Optical position determination
CN1077299A (en) * 1992-04-06 1993-10-13 帝菱产业株式会社 The coding/decoding method of two-dimensional code symbol mark
US5288986A (en) * 1992-09-17 1994-02-22 Motorola, Inc. Binary code matrix having data and parity bits
US5726435A (en) * 1994-03-14 1998-03-10 Nippondenso Co., Ltd. Optically readable two-dimensional code and method and apparatus using the same
US5661506A (en) * 1994-11-10 1997-08-26 Sia Technology Corporation Pen and paper information recording system using an imaging pen
JPH08185492A (en) * 1994-12-27 1996-07-16 Sharp Corp Digital information recording carrier, method and device for recording digital information, and method and device for converting digital information into plain one
US5591956A (en) * 1995-05-15 1997-01-07 Welch Allyn, Inc. Two dimensional data encoding structure and symbology for use with optical readers

Also Published As

Publication number Publication date
IL153715A (en) 2012-03-29
AU2000253747A1 (en) 2002-04-11
CN1667648A (en) 2005-09-14
JP2004501476A (en) 2004-01-15
DE60045318D1 (en) 2011-01-13
AU2000253747B2 (en) 2007-03-29
ATE490516T1 (en) 2010-12-15
CN1265318C (en) 2006-07-19
ZA200210184B (en) 2003-08-27
JP4689935B2 (en) 2011-06-01
CN1454369A (en) 2003-11-05
IL153715A0 (en) 2003-07-06

Similar Documents

Publication Publication Date Title
US7073724B2 (en) Tagged surface printer
US6622923B1 (en) Data package template with data embedding
JPH06199078A (en) Recording body with coded data
CN101127089A (en) Implement method for embedding large amount of information on printing media
JPH01282694A (en) Optical reading code and information transmitting method
CN100361145C (en) Device for representation of data
CN101503037B (en) Processing method for embedding information on paper medium file
WO2015131163A1 (en) Method, system, and apparatus for creating an enhancing
JPH0378894A (en) Information transmitting method by dot copy
KR20030019443A (en) Data package template with data embedding

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
C17 Cessation of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20080109

Termination date: 20130630