CN1265318C - Data package template with data embedding - Google Patents

Abstract

The present invention relates to a general data packet template. The data packet template allows the use of a specific coding scheme for coding and printing data into any shape. The data packet template comprises a readable fixed background with any shape, which is used for determining the position and the direction of a data region. The data in the template comprises a plurality of coded points for extracting stored information.

Description

Have the data package template that data embed

Technical field

The present invention relates to a kind of data package template or mark that data embed that have, relate in particular 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 with the present invention, system and device disclose in following patent family application.These patented claims are that patent applicant of the present invention or assignee applied for the present invention simultaneously 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 announcement of these patent family applications is summarized in this in the cross reference mode.

In addition, the whole bag of tricks, system and device related to the present invention disclose in following similar PCT application.These PCT application applicants of the present invention or assignee and the present invention apply for simultaneously:

PCT/AU00/00754, PCT/AU00/00755 and PCT/AU00/00756.

The announcement of these similar applications is summarized in this in the cross reference mode.

With relation of the present invention close especially be that title is the PCT patented claim (application number: PCT/AU00/00517), when mentioning this patented claim hereinafter, refer to our Ref. No. PEC02 of " printed page tag encoder ".

Today, almost every commodity buying from the shop all have certain bar code on the packaging.Bar code provides a kind of convenient method of determining article according to production code member.The type that the accurate explanation of production code member is depended on bar code.Inventory status notification system allows the production code member scope of user definition oneself.But, must encode to the commodity in the shop more generally, can not conflict so that guarantee the product coding of a company with the product coding of another company.

Bar code itself has various forms.More old-fashioned barcode format comprises with lines form symbols displayed.The information that bar code comprises is described in the combination of black and white lines.Usually, constitute complete bar code two kinds of lines are arranged: symbol lines (information itself) and list separator piece are beneficial to the lines of light identification.Though the information of different bar codes may be different, the lines that are used for the list separator piece all are the same.Therefore, the lines that are used for the list separator piece can be considered as the part of the fixed sturcture element of bar code.

Bar code is read by special fetch equipment, for example light pen, rifle formula reader, scanner or the like.These fetch equipments data extract in computing machine so that further handle.

For the data that guarantee to extract can correctly be read, use verification usually and as a kind of straightforward procedure of error-detecting.Newer barcode format uses certain redundancy encoding scheme, for example Reed Solomon Coding method.At US 5,591, just adopted a kind of such encoding scheme in the Aztec 2D bar code of describing in 956 patents.Usually, the redundance of coding can be selected by the user.

The information of 2 dimensions in the bar codes are with 2 dimension form codings, rather than with the form canned data (data with the storage of lines form are extracted on the one dimension direction) of a series of lines.The same with former bar code, the 2D bar code also comprises information and is beneficial to the structural element of light identification.Be the example of a kind of quick response (QR) sign indicating number shown in Fig. 1, this encoding scheme is by the Denso invention of Japan, at US 5,726, has disclosed this encoding scheme in 435 patents.It should be noted that bar code elements is made of two zones: a data zone (relevant) and a fixing position probing pattern with the data in being stored in bar code.Reader uses fixing position probing pattern location bar code elements itself, locatees the border of bar code elements then, thereby determines its original orientation of bar code elements.The foundation of determining direction is: have only 3 angle patterns in the bar code elements, do not have the 4th angle pattern.

A problem relevant with the range of application of bar code is: the generation hardware of bar code can only produce specific barcode format.Along with printer more and more trends towards embeddedization, people more and more wish can be when needed type slug font code at any time.

Summary of the invention

An object of the present invention is to provide a kind of data package template that data embed that has.

Another object of the present invention provides a kind of common tags format structure that can support the universal coding scheme.

Can further understand other purpose of the present invention by hereinafter discussion and accompanying drawing.

The present invention relates to the method for encapsulation of data in a kind of conventional data bag template that is made of a plurality of points, this method comprises the following steps:

Be the entry bit array of each some placement configurations in the above-mentioned packet, this clauses and subclauses array is determined the part of the fixed background pattern that above-mentioned each point is an arbitrary shape or the part of the data area of arbitrary shape;

Above-mentioned data are encoded, and the data storage behind the coding is in above-mentioned data area:

Print a plurality of points that use above-mentioned digital coding.

Description of drawings

In order to understand and apply the invention better, use preferred embodiment conjunction with figs. explanation the present invention of the present invention below, wherein:

Figure 1 shows that a kind of 2 dimension quick response codes in the past;

Figure 2 shows that a kind of Netpage mark background patterns;

Figure 3 shows that the data area of the Netpage mark among Fig. 2;

Fig. 4 is the zoomed-in view of the Netpage mark under 1600dpi resolution.

Figure 5 shows that the output resolution ratio effect of a tagged element;

Figure 6 shows that the data manifestation mode in 2 dimension quick response codes;

Figure 7 shows that simple 3 * 3 mark structures;

Fig. 8 is the spread scenarios of the mark among Fig. 7.

Embodiment

In present patent application, " mark " speech index certificate and being used to is held, the combination of any other element (for example position probing pattern, white space, circle zone or the like) of location or reading of data.Therefore, a mark comprises following element:

At least one data area.This data area is the reason that produces mark.The flag data zone comprises through coded data (may be redundancy encoding, also may be to use simple verification and encoding process).Data bit is placed in the data area, and the position of data area is determined by the label coding scheme.

Fixing background patterns, this background patterns comprises a fixing position probing pattern usually.This background patterns helps the indicia reader telltale mark.They include the element that helps locate, and for the 2D mark, background patterns also may comprise direction and perspective information.The fixed background pattern also may comprise around elements such as the white space of data area or position probing patterns.These blank patterns have been eliminated the interference between the data area, help the coding to data.

For convenience of description, we utilize light recognition methods commonly used (for example bar code scanner etc.) that data package template is described at this.But it will be appreciated that notion of the present invention is suitable for tactile recognition or even voice recognition equally.

All have certain fixing background patterns in most label coding schemes, but this background patterns not necessarily.For example, if the employing physical space centers on the flag data zone and use certain non-optical location mechanism as read means (for example arrange with certain physics mode with respect to data reader on the surface of bar code), so just do not need the position probing pattern.

Different label coding scheme produces the marks of different sizes, and is the physical markings area dividing different fixed position check pattern and data areas.For example, QR sign indicating number shown in Figure 1 uses 3 fixed blocks 10 as the position probing pattern on the edge of mark, and remaining pattern is data area 11.On the contrary, the Netpage mark structure shown in Fig. 2,3 and 4 comprises the location element 20 of a circle, a direction element 21 and a several data area.Figure 2 shows that a kind of Netpage mark fixed background pattern that has nothing to do with resolution.Content shown in Figure 3 is identical with content among Fig. 2, but has increased data area 30 in the Netpage mark.Fig. 4 is the example of a some layout, and the resolution of Netpage mark wherein is 1600dpi.In Fig. 4, a data bit is represented that by a plurality of physics output points these points form a piece in the data area.

The data area comprises the data of mark.Each data bit in the data area may be by a plurality of physical printed point expressions, and this depends on the encoding scheme of mark.The actual point of representative data position depends on output resolution ratio and reads accordingly/scanning resolution.Figure 5 shows that the different resolution effect of lines in a kind of traditional bar code.When describing with resolution R, lines may point be wide and 5 points are high for 2, but when describing with 2 resolutions, these lines counting on width and length direction all doubles.

Again for example, for QR sign indicating number shown in Figure 1, a data bit is represented that by a dark-coloured piece or light tone piece the resolution of counting with describing in wherein dark-coloured piece or the light tone piece is relevant, also with accordingly read/scanning resolution is relevant.For example, each data block among Fig. 6 is represented (be full of in the square a little and 60 represent binary one, blank square 61 is represented binary zero) by the square of a print point.

Therefore, a data bit in the stamped mark can be printed shape by certain and represents.Minimum shape is a print point, and maximum shape can be whole mark.For example, one all is made of a plurality of print points on length and Width a little louder.

A kind of desirable common tags definition structure should allow for each data bit and produce a specific printing shape.

For the raw data of particular number of bits, in order to be put into these data in the mark of printing in case later on by read/scanister fetches data, can directly be put into these data bit in the mark, perhaps with certain form it carried out redundancy encoding.The concrete form of redundancy encoding depends on the form of mark.

The redundancy scheme that adopts in the placement schemes of data bit in the data field of mark and the encoding scheme is directly related.Can place data bit with the 2D form, the accidental error probability of data is evenly distributed in whole flag data zone.For example, can be distributed to all data bit of Reed Solomon code word in the whole flag data zone, so that reduce the influence of accidental error as far as possible.

Because data coding scheme is directly related with the shape and the size in flag data zone, so preferably use a kind of general tag format structure.Like this, can use identical data structure and plotting method to describe various tag formats.

Tag format structure of the present invention (TFS) is a kind of data package template based on point.Its allows the packet of the arbitrary shape that definition is made of point and how data itself is stored as point in the packet.TFS has passed through optimization, therefore can realize the real-time depiction of mark.TFS provides clauses and subclauses for each the some position in the mark boundaries, and these clauses and subclauses can determine that respective point is the part of fixed background pattern (the fixed background pattern comprises a fixed position check pattern usually) or the part of the data element of mark.

TFS provides clauses and subclauses for each the some position in the mark boundaries, and in this, it and bitmap are closely similar.Therefore, TFS has TagWidth clauses and subclauses of TagHeight x, and wherein the mark boundaries frame on TagWidth and the line direction is big or small corresponding, and the mark boundaries frame on TagWidth and the column direction is big or small corresponding.A TFS entry line of mark is called the capable structure of mark.

TFS has following relevant parameter:

TagWidth is the width (counting) of the bounding box of mark;

TagHeight is the height (counting) of the bounding box of mark;

EntryWidth is the figure place (minimum is 2) in each clauses and subclauses of TFS;

NumTagDataBits is the data bits (minimum be 0) relevant with each mark.

For a specific markers is encoded, need provide the data that will be inserted in this mark:

TagData is an array of NumTagDataBits position, and it comprises the real data in the data area that will store mark 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 by its lowest order (the 0th):

If the 0th is eliminated (=0), the point of clauses and subclauses output is the part of fixed background pattern so for this reason.Point value itself is from the 1st.If the 1st is 0, output valve is exactly 0 so; If the 1st is 1, output valve is exactly 1 so.

If the 0th is set (=1), the point of clauses and subclauses output is from the TagData array so for this reason.All the other positions (the 1st to the NumTagDataBits-1 position) of these clauses and subclauses comprise the address of the TagData position that will use.

Each clauses and subclauses among the TFS explain that independently they and status information have nothing to do.This is very important, because only in this way could support the reading at random of all clauses and subclauses, like this, a plurality of drawing engines are the different piece (for example, can distribute to two or more drawing engines to a mark) of processing page simultaneously.

If the size of print point is too little, can utilize certain approach magnifying tags so.Can this on length and Width, all amplify N to mark doubly, but can increase the number of entries among the TFS like this.In addition, the output that can use the bitmap zoom technology of standard to amplify the TFS generator---for example, duplicate or the Mean Method of super large sample etc. by pixel.

For example, if original TFS is 21 * 21 clauses and subclauses, employed Zoom method is that each original point is enlarged into 2 * 2 points simply, and this TFS will become 42 * 42 clauses and subclauses so.In order to produce new TFS from old TFS, should repeat the clauses and subclauses in every row of TFS, repeat each row of TFS then.In these cases, the clean entry number of TFS will be increased to 4 times (2 * 2).

TFS allows to produce a little bigger, rather than simple convergent-divergent.Please refer to Fig. 7, wherein shown the simple case of one 3 * 3 marks.This moment, we need print one of this mark big figure, and wherein each point is represented by 7 * 7 print points.If on the length of original TFS and Width, all duplicate 7 times (the size of TFS be increased to 7 times or the output of mark generator amplified), need to produce 9 covers, 7 * 7 squares so.At this, we also can replace with 7 * 7 round dots to each point among the original TFS.Figure 8 shows that this result.

Therefore, the resolution of TFS is high more, and many more for counting of each big dot printing, wherein each represents a data bit of mark a little louder.It is complicated more to produce a little bigger many more, a little bigger patterns of counting.For example, Figure 4 shows that a kind of Netpage mark structure, each data bit is wherein represented by 8 * 8 points (under 1600dpi resolution) pattern, but the practical structures of putting is not a square.Like this, can read this Netpage mark by any direction.

Figure 7 shows that a simple case, the mark in this example is made of 9 points.Wherein form the fixed background pattern by 3 points, be used to help telltale mark, remaining 6 point is as data.This represents that we can store 6 data bit in this mark.

But, suppose that in above-mentioned mark the coding method of original data bits is redundant with their anti-value, 3 original data bits are represented in 6 positions in the mark in fact so.For example, if these 3 original data bits are 111,6 data bit in the mark should be 101010 so.If 3 original data bits are 101,6 data bit in the mark should be 100110 so.

The relation of the some position in the mark must be considered the redundancy encoding of data.In above-mentioned simple case, the lastrow of mark is 111 all the time.Second row of mark comprises preceding two data bit.According to used data coding scheme, we know that front two must be opposite.Therefore, though second row of mark may be 101,011,100 or 010, can never be 111.The 3rd row of mark too.Therefore, when producing mark, except top predetermined fixed area, 111 fixed pattern can not appear in mark.

Following parameter has been summed up this simple tagging scheme:

·TagWidth＝3

·TagHeight＝3

EntryWidth=4 (1+3,1 is used for low level, 3 are used for 6 data bit of index)

·NumTagDataBits＝6

Please refer to Fig. 7.The 1st row of TFS wherein should be 0010,0010,0010, and they represent fixed bit, with the data independence of storage.First clauses and subclauses of the 2nd row should be 0001 among the TFS, show that the 0th content of the TagData array of this mark should output on this position.The 2nd clauses and subclauses of the 2nd row should be 0011, and representative will output to this content of the 1st putting locational TagData array.The 3rd clauses and subclauses of the 2nd row should be 0101, represent the 2nd content.

The 1st clauses and subclauses of the 3rd row should be 1001 among the TFS, show that the 4th content of TagData array should output on this position.(line 2 for the 2nd clauses and subclauses of the 3rd row, entry 2) should be 1011, represent the TagData array the 5th, the 3rd clauses and subclauses of the row of the 3rd among the TFS (should be line 2, entry 3) 0111, represent the 3rd of TagData array of this mark should output on this position.

Therefore, whole TFS should be (with the clauses and subclauses series arrangement):

0010，0010，0010

0001，0011，0101

1001，1011，0111

It should be noted that and do not use code 1101 and 1111 among this TFS, because they point to non-existent data bit 6 and 7 (having only data bit 0-5 in this example).

Above-mentioned TFS can produce a mark, promptly any 6 long TagData arrays for any 6 bit data.If these 6 is 101010, on above-mentioned 9 some positions, the output of tag encoder should be so:

1 (fixing)

1 (fixing)

1 (fixing)

1 (obtaining) from data bit 0

0 (obtaining) from data bit 1

1 (obtaining) from data bit 2

1 (obtaining) from data bit 4

0 (obtaining) from data bit 5

0 (obtaining) from data bit 3

If 6 data bit are 100110, on above-mentioned 9 some positions, the output of tag encoder should be so:

1 (fixing)

1 (fixing)

1 (fixing)

1 (obtaining) from data bit 0

0 (obtaining) from data bit 1

0 (obtaining) from data bit 2

1 (obtaining) from data bit 4

0 (obtaining) from data bit 5

1 (obtaining) from data bit 3

Please refer again to Fig. 1, QR code labeling wherein is the pattern of 21 X21 pieces.If each piece is made of a point, this QR sign indicating number is 21 point * 21 dot patterns so.In addition, 249 data blocks are arranged in the data field, represent 249.This moment basic parameter TagWidth and TagHeight can be set to=21.EntryWidth=9 (1+8,1 is used for low level, 8 are used for 249 data bit of index), NumTagDataBits=249.Therefore, the tag format structure should be 441 clauses and subclauses (21 * 21), and wherein each clauses and subclauses is 9.Preceding 7 clauses and subclauses should be 000000010, and they have defined 1, the 8 clauses and subclauses of output point constant and should be 000000000, its definition output point constant 0.Next clauses and subclauses should be xxxxxxxx1, and wherein xxxxxxxx is the address of bit number, and they represent the 9th piece of first row.If this piece is the 129th from 249 data bit, xxxxxxxx so wherein should be 10000001.If this data block is from the 62nd of 249 data bit, xxxxxxxx so wherein should be 00111110.In this TFS, the back that always has 5 data clauses and subclauses is 000000000, and the ending that 7 row are arranged is 000000010.

The 2nd row of tag format structure is with 00000010 beginning, there are 5 0000090000 clauses and subclauses the back, one 00000010 clauses and subclauses, one 000000000 clauses and subclauses are represented 8 fixed data output points 1,0,0,0,0,0,1 and 0 respectively, each position of 249 data bit in the 2nd row of 5 clauses and subclauses arrow marks of back.

Last 1 row of tag format structure has 7 00000010 clauses and subclauses, one 000000000 clauses and subclauses, and the back also has 13 clauses and subclauses, each data bit in last column of arrow mark.TagData is one 249 bit array, and it comprises the real data that will store in the flag 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 used in above-mentioned similar PCT application, and Ref. No. is that the tag encoder that discloses among the PEC02 is realized.The working method of following brief description tag encoder.

Tag encoder (TE) is used to support the application of mark.It requires printhead to use IR ink (though can use K ink or other ink to replace in some cases) usually.Tag encoder is the page that will print coding fixed data and specific markers data value, it these transformation of data be one can error correction mark, then, use infrared or black ink can print to this mark on the page.Tag encoder can be discharged into mark in the triangular lattice by vertical or horizontal, and basic mark structure is described with the resolution of 1600dpi, simultaneously, can be encoded to flag data a little bigger (minimum dimension is 1 point under the 1600dpi) of certain shape.

Tag encoder uses following input:

A vertical/lateral marker;

A template that defines mark structure;

Several fixed data positions (at page fix);

An indication is that redundancy encoding is carried out or the sign that the fixed data position is handled as coded data in the fixed data position;

Several variable data position records, wherein each record comprises the variable data position in the particular row of mark;

An indication is that redundancy encoding is carried out or the sign that the variable data position is handled as coded data in the variable data position.

The output of tag encoder (TE) is the bilayer of a 1600dpi, and it is used for the storage mark data.The output of tag encoder realizes by the fifo queue (FIFO) of one 1 bit wide.Then, can use the infrared ink stamped mark, like this, the mark of printing can be read by marker detection equipment.

Though tag encoder (TE) allows mark to have variable structure and fixed data and variable data element on design concept, tag encoder has certain limitation to the scope of coding parameter.These restrictions have direct relation with the buffer size and the addressing bit number of the application choice of encoding for great majority.Be easy to adjust the size of buffer zone and corresponding addressing mode so that use definite coding parameter for other.

Tag encoder writes double-deck mark bit stream to double-deck mark First Input First Output (FIFO).Tag encoder is responsible for flag data behind the coding and basic mark structure are merged, and the correct series arrangement of pressing among the output FIF0, so that print subsequently.The flag data of coding produces in real time from raw data, to reduce the requirement to spatial cache.

The TagData array is divided into fixed element and variable element.For example, if a mark contains 512 bit data, wherein some may to underlinedly all fix, and other are different for different marks.For example, the Universal product code comprises a country code and a company code.Because these positions do not change with mark, when producing a large amount of mark,, can be encased in these positions in advance in the mark generator in order to reduce bandwidth requirement.Another example is a Netpage mark generator, and a printer page comprises several Netpage marks, and the form of these marks is shown in Fig. 2-4.Underlined for institute, page identifier (page-ID) is changeless, and the remainder data position is different with the variation of mark.By reducing the quantity of the variable data that transmits to tag encoder, can reduce requirement to the total bandwidth of scrambler.

Some parameter of tag encoder may be imply or explicit expression, this depends on the embodiment of scrambler, the parameter of tag encoder also may limit to some extent to the mark size that allows.For example, the tag encoder of software may be to the size of mark without limits, and the tag encoder of some hardware can have certain limitation to the maximum quantity of flag data position.

Tag encoder may only be accepted basic, nonredundancy coded data position, and they are encoded, and can not accept all TagData positions by certain outer encoder.Can obviously save bandwidth like this.For the situation (as described in similar PCT application PEC02) of Netpage mark, only for each mark provides 120 raw data, tag encoder is encoded to 360 to these 120.By REDUNDANCY ENCODER is embedded in the tag encoder, can reduce by 2/3 to bandwidth requirement.

During hereinbefore TFS described, the 0th indication was output point to be stored (the 1st value that comprises carry-out bit) with clauses and subclauses immediately or the address of high bit as index TagData structure.Using the different identical information of location, position representative is a little variation.

In order to reduce the memory requirement to the mark of particular type, TFS can use two indirect addressings.In the foregoing description, when the 0th of TFS clauses and subclauses was set, high bit constituted the address of the corresponding positions in the TagData array.But if the clauses and subclauses sum among the TFS is more, and maximum quantity of the not coordination of the particular row of TFS are than NumTagDataBits much less, and using two indirect addressings so is very easily.

Use two indirect addressings, the data address clauses and subclauses of TFS are pointed to another array, and this storage of array is at the capable end of TFS.This array comprises the actual address in the TagData array that will use.For example, if on the particular row of certain mark, only use 8 different data bit, can be set to 4 (determining that the index data position still is directly to use the 1st for wherein 1) by EntryWidth so.If the 0th is 1, the 1-3 position is used to constitute an address 0-7 so.8 * n position table of articles of TagData array is pointed in this address.If 512 clauses and subclauses, n=9 are so arranged in the TagData array.If TagWidth=100 shows that so the basic coding scheme is that 1000 (100 * 10) have been used in every enforcement of TFS.If use two indirect addressings, every row of TFS needs 472 (100 * 4+8 * 9) so.Can save the memory space about 50% like this, very valuable.Use two savable memory spaces of indirect addressing relevant with concrete application.

The another kind of variation is: can become continuous tone output to bilayer output.In the present invention, each output point or 1, or 0.If the 0th is 0, the 1st comprises the carry-out bit that will use so.Can expand to the position that comprises greater number to this scheme at an easy rate.For example, use 4 continuous tones to print if desired, if the 0th of this moment be 0, output is 4 positions that are made of the 1-3 position so.Certainly, EntryWidth also wants corresponding increase.

Equally, point to the address of TagData array and can point to n clauses and subclauses yet, n the clauses and subclauses here are not 1, but some positions (depending on the figure place in each continuous tone output point).

If whole TFS in this locality storage (for example on chip), can realize laterally or vertically printing by row or by row use data wherein so.If the tag format structure is not (for example in the internal memory outside chip) of local storage, can adopt the mode that once reads 1 row to use wherein data so, at this moment, have preferably that two tag format structure copies---one is used for landscape orientation, and another is used for vertical printing.

For example, in similar PCT application PEC02, tag encoder is the integrated circuit (IC) chip of a special use, and TFS is externally among the DRAM.In order to reduce storage inside requirement, once only to the delegation of its TFS that packs into to ASIC.Because reading by row of TFS undertaken, two TFS structures---one is used for vertical printing so need externally to preserve among the DRAM, and one is used for landscape orientation.In theory, these two TFS structures are different, but in fact, they are same TFS, and just one of them has rotated 90 degree.

The purpose of foregoing description just illustrates preferred embodiment of the present invention, should not constitute any limitation of the invention.Those skilled in the art can realize various variations at an easy rate on specific embodiment of the present invention basis, but all should belong to scope of the present invention according to any equivalent modifications or the modification that the present invention carries out.

Claims (5)

1. method that is used at the conventional data bag template encapsulation of data that is made of a plurality of points, this method comprises the steps:

Be the entry bit array of each some placement configurations in the described packet, this clauses and subclauses array is determined the part of the fixed background pattern that above-mentioned each point is an arbitrary shape or the part of the data area of arbitrary shape;

Described data are encoded, and the data storage behind the coding is in described data area;

Print a plurality of points that use described digital coding.

2. the method for claim 1 is characterized in that, describedly presses double-deck dot printing.

3. the method for claim 1 is characterized in that, describedly presses the continuous tone dot printing.

4. the method for claim 1 is characterized in that, described coding comprises redundancy encoding.

5. the method for claim 1 is characterized in that, described coding comprises two indirect addressings.

Images