Position code

Details Position code Position code

2002-06-25

2003-12-23

Wamsley, Patrick (Department: 2621)

Coded data generation or conversion

Digital pattern reading type converter

For x or y coordinate determination

C341S057000, C178S018090

Reexamination Certificate

active

06667695

ABSTRACT:

FIELD OF THE INVENTION
The present invention relates to methods for achieving a position code, a method for decoding of a position code, a computer program for these purposes, a product that is provided with a position code and devices for position coding and for decoding of a position code.
BACKGROUND ART
The use of position codes on a surface as a tool for recording in electronic form information that is written or drawn on the surface is already known.
In U.S. Pat. No. 5,477,012 a pen is described that detects optically a position code consisting of various symbols on a surface. The pen decodes the position code and gene-rates pairs of coordinates that describe the movement of the pen across the surface. Each position is coded by a specific symbol. If the position code is to code many positions, this results in the disadvantage that the symbols become complex and hence difficult to detect correctly. On the other hand, if the symbols are made larger, the resolution is decreased.
In WO 92/17859 a position code is described in which each position is coded by means of a plurality of symbols and each symbol contributes to the coding of more than one position. Adjacent positions are thus coded by partially shared symbols.
In Appendix A of WO 92/17859 the following example is given of how the position code can be built up and how a position can be decoded.
Start from the following m-sequences: s=(0,0,1,0,1,1,1) and t=(0,1,1). Build up a position-coding pattern by letting a first column in the pattern be the same as the sequence s. In order to build up the following columns, look at the t-sequence. If the first element in the t-sequence is 0, then the second column consists of the s-sequence. If the first element is 1 instead, then the second column consists of the s-sequence with a circular shift of one step. Subsequent columns are built up in a corresponding way in accordance with the values of the elements in the t-sequence. The following pattern is thus obtained:
0
0
1
1
0
0
0
1
1
1
0
0
0
0
1
0
1
1
0
1
1
1
1
0
1
1
1
1
Now assume that we want to find the position of a partial surface with the following subset of the pattern.
1
0
0
0
1
0
1
0
1
The first column in the subset is (1,0,1). This sub-sequence appears in position 2 in the s-sequence. The circular shifts in the subset are (1,1). This sub-sequence appears in position 1 in the t-sequence. The accumulated shifts in the pattern are (0,0,1,2) and therefore the vertical position of the subset is 2+0=2. The position of the subset on the partial surface is thus (1,2).
This pattern has the advantage that it can be coded on a base using simple symbols, for example a first symbol for a zero and a second symbol for a one.
An interesting property of a position-coding pattern of this type is, however, the ability to code a large pattern with many unique positions so that position determination can be carried out on as large a surface as possible. In the example above, the size in the vertical direction is limited by the length of the s-sequence and the size in the horizontal direction by the length of the t-sequence. The length of these sequences cannot be increased without limit as the sequences must have the property that if a sub-sequence is taken of k bits, then this sub-sequence must only occur in one single place in the sequence. An increase in the length of the sequence can thus bring about an increase in the length of the sub-sequence and thereby an increase in the partial surface that needs to be recorded in order to be able to determine a position.
In WO 01/26032, WO 01/26033 and WO 01/26034, which have been assigned to the Applicant of the present application, another position-coding pattern is described that is based on the same basic principles as those in WO 92/17859, but which enables coding of a larger number of positions.
In one embodiment of this pattern, a first number sequence is used that has the property that the place in the number sequence of each sub-sequence or partial sequence of a predetermined length is unambiguously determined and this number sequence is printed out in columns over the surface with various rotations or circular shifts. Instead of using a binary second sequence (the t-sequence in WO 92/17859), however, larger circular shifts between adjacent columns are permitted.
The surface is further divided into code windows. Each code window comprises at least three columns with number sequences and overlaps the adjacent code windows by one number sequence. Using the shifts between adjacent columns, the position of the code window along the x-axis is coded. The shifts between the number sequences in a code window thus define a position, the first code window having the position 0, the next 1, and so on.
When reading off the position code, the reading device will often, however, record parts of two code windows. In order that the position of the code windows relative to the read-off image of the position code can be determined, shifts in a first range are used to indicate the least significant shift for the position and shifts in a second range for other shifts in the position.
The coding of a y-coordinate is carried out in a corresponding way.
This position code has been found to work very well and permits coding of a very large number of positions. There is, however, a desire to improve the error-correction properties of the position code.
Assume, for example, that the least subset that unambiguously codes a position in the x-direction comprises five shifts. From these five shifts, a position of a code window can be determined. The positions of two adjacent code windows thus usually only differ in the last digit (the last shift). For three consecutive code windows the shifts can, for example, be as follows:
25,15,34,18,3; 25,15,34,18,4; 25,15,34,18,5;
A common method of detecting errors is based on reading off more information than what is needed for the task concerned. With the above-mentioned coding, it is difficult to read off extra information which is suitable for use for error detection. Assume, for example, that a reading device records the two last shifts from the first of the above three code windows, and the first three shifts from the following code window, that is 18,3,25,15,34. Assume further that an error occurs that means that 18,4,25,15,34 is recorded. The reading off of, for example, two more shifts, one on each side of the five, provides no extra information that makes it possible to detect the error.
If, when coding in the x-direction, a number sequence is used with the property that each partial sequence (sub-sequence) of a predetermined length has an unambiguously determined place in the number sequence, error correction is facilitated. On the other hand, the practical problem arises that this number sequence must have a large base, that is must permit large shifts, if it is to be possible to code many positions. A very large table is then required in order to find the place in the number sequence to which a read-off partial sequence corresponds, which in turn requires a large amount of memory. It is, however, desirable for the decoding to be able to be carried out in, for example, a hand-held reading device with limited memory and processor capacity. It is also desirable that the coding should be able to be carried out in devices with limited memory and processor capacity.
SUMMARY OF THE INVENTION
An object of the present invention is therefore to reduce the above-mentioned problems by providing a position code that makes it possible to code a very large number of positions, that permits error correction, but yet does not require the storage of large tables for the coding and decoding and which therefore can be realized in devices with a limited amount of memory and/or limited processor capacity.
Another object is to make possible effective and correct decoding of a position code that codes a very large number of positions.
These objects are achieved completely or partially by a method for position coding according to claim
1
, a computer program acco

Affiliated with

Also associated with

Rating

Position code does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Position code, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Position code will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3153993