Browse Prior Art Database

Self Clocking Type Wheel

IP.com Disclosure Number: IPCOM000097544D
Original Publication Date: 1961-Feb-01
Included in the Prior Art Database: 2005-Mar-07
Document File: 2 page(s) / 61K

Publishing Venue

IBM

Related People

Darling, RH: AUTHOR

Abstract

In an on the fly printer the typehammer (not shown) must be restored after its release to effect printing. Such restoration is possible only during selected periods in one complete cycle of the print wheel. This is an arrangement in which character bits also represent timing bits to provide timing signals to control hammer restore.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 100% of the total text.

Page 1 of 2

Self Clocking Type Wheel

In an on the fly printer the typehammer (not shown) must be restored after its release to effect printing. Such restoration is possible only during selected periods in one complete cycle of the print wheel. This is an arrangement in which character bits also represent timing bits to provide timing signals to control hammer restore.

A group of disks 1 containing magnetic data is mounted on a shaft 2 common to type wheel 3 to provide transducers 4 with a unique combination of data bits at each character position.

Six equally, spaced timing signals are produced during each revolution by combining the outputs from transducers 4A, 4B and 4-1 in an AND circuit.

It is possible to obtain timing signals at any position by combining the output from appropriate transducers in logical circuits and locating the characters containing the appropriate bit combinations at the desired intervals.

In the code illustrated, the characters A, E, G, I,., and C each contain a bit in the A, B and 1 positions. The AND circuit therefore produces a timing signal at each of these character positions. Other unique combinations of three data bits can also be used. For example, J, L, P, N, $ and R each contain the unique combination of a bit in the A and 1 location and none in the B location.

1

Page 2 of 2

2

[This page contains 2 pictures or other non-text objects]