Relative Horizontal Step
Data Structure
ASCII
hex.
dec.
Description
This code sequence moves the print head to a relative print position without regard to the
current character density. This print position is calculated according to the formula
+ 256 ∗ n
(n
1
⁄
1
180
Calculation of the values of n
the movement is directed towards the left side, the result is subtracted from 65536. Sub-
sequently the values for n
n
1
n
2
If the print position exceeds the currently set margins after execution of the horizontal
step, this code sequence is ignored.
This code sequence can be used in all print qualities (DPQ, NLQ, LQ).
Example for calculating n
Movement of 4 inches towards the right side:
n
n
2
ESC "\"
<n
> <n
1
1B
5C
<n
> <n
1
27
92
<n
> <n
1
).Each dot, i. e. each print position has a width of
2
inch in NLQ and LQ.
and n
1
= n MOD 256
⁄
n
= INT(
)
256
1
= 4
120
*
= 480
⁄
480
= INT (
)
256
= dec.1
= hex.01
>
set relative horizontal step
2
>
2
>
2
and n
first requires the prefix (n dots) to be calculated. If
1
2
can be calculated according to the formula:
2
and n
:
2
ESC \
⁄
1
inch in DPQ and
120
53
Print Positioning
Need help?
Do you have a question about the Matrix Printer and is the answer not in the manual?