Dismiss
The Prior Art Database and Publishing service will be updated on Sunday, February 25th, from 1-3pm ET. You may experience brief service interruptions during that time.
Browse Prior Art Database

# Bidirectional Positioning

IP.com Disclosure Number: IPCOM000046565D
Original Publication Date: 1983-Aug-01
Included in the Prior Art Database: 2005-Feb-07
Document File: 1 page(s) / 11K

IBM

## Related People

Hughes, JJ: AUTHOR

## Abstract

Bidirectional positioning, especially for a carrier in a printer, uses only an addition operation in adding to absolute position values the relative distance values; in the case of diminishing the absolute position value, these were folded to their first complement value prior to the addition operations. This simple folding operation eliminates the complicated subtraction operation, all calculations which differ due to direction of motion can be handled in the same manner through the use of simple performable inversion. For an explanation of the method the following example is given, using position values in binary form. (Image Omitted) The initial position is supposed to be A, and the desired next position is supposed to be C.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 100% of the total text.

Page 1 of 1

Bidirectional Positioning

Bidirectional positioning, especially for a carrier in a printer, uses only an addition operation in adding to absolute position values the relative distance values; in the case of diminishing the absolute position value, these were folded to their first complement value prior to the addition operations. This simple folding operation eliminates the complicated subtraction operation, all calculations which differ due to direction of motion can be handled in the same manner through the use of simple performable inversion. For an explanation of the method the following example is given, using position values in binary form.

(Image Omitted)

The initial position is supposed to be A, and the desired next position is supposed to be C. The desired position is calculated by adding to the absolute initial position value 010, the value 001 for the relative distance so that the new position value is 011. That includes movement to the right. In the case of a newly desired next position B, including movement from A to B to the left, the absolute position values are folded by inversion of each bit value, so that the above shown folded position values result. Now to the folded value 101 for A, the value for the relative distance 001 is added, resulting in the folded value 110. Before a new movement to the right is performed, a refolding takes place.

1