Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Serial-To-Parallel/Serial Data Conversion for Matrix Printers With Several Dot Lines Per Sweep Using Scaling

IP.com Disclosure Number: IPCOM000046064D
Original Publication Date: 1983-May-01
Included in the Prior Art Database: 2005-Feb-07
Document File: 2 page(s) / 66K

Publishing Venue

IBM

Related People

Hehl, WH: AUTHOR [+2]

Abstract

For converting a serial data flow with, for example, a 5_bit word structure (Fig. 1) into a parallel data flow with, for example, a 3/=/bit parallel structure (Fig. 2) and comprising in serial notation (Fig. 3) some tables (Fig. 4) have to be prepared, whose number corresponds to the number of parallel bits, in this case 3 Each table has as many entries (rows) as there are bits to the base of 2 in a word (in this case, 2/5 /= 32). Each entry in this example consists of 5 3/=/bit fields. (The digits 5 and 3/= correspond to the previously underlined values.)

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 63% of the total text.

Page 1 of 2

Serial-To-Parallel/Serial Data Conversion for Matrix Printers With Several Dot Lines Per Sweep Using Scaling

For converting a serial data flow with, for example, a 5_bit word structure (Fig. 1) into a parallel data flow with, for example, a 3/=/bit parallel structure (Fig.
2) and comprising in serial notation (Fig. 3) some tables (Fig. 4) have to be prepared, whose number corresponds to the number of parallel bits, in this case 3 Each table has as many entries (rows) as there are bits to the base of 2 in a word (in this case, 2/5 /= 32). Each entry in this example consists of 5 3/=/bit fields. (The digits 5 and 3/= correspond to the previously underlined values.)

Each field contains an address bit 0 or 1 (bold print, Fig. 5).

The address bits of a table row form a binary address. The binary addresses in the subsequent rows of a table correspond to ascending dual numbers

The arrow-marked row in Table I is addressed by word 1 "00011", the arrow- marked row in Table II by word 2 "00111" and the arrow-marked row in Table III by word 3 "00110".

The arrow-marked table rows (Fig. 6) are ORed, thus yielding the section sequence (Fig. 7).

The above-described code conversion may be significant, for example, for dot printers receiving their data as a serial flow and printing output in a sweep comprising several dot lines.

If the dot pattern is to be extended (scaled), for example, by the factor 3 (Fig.
8) in a horizontal and a vertical direction this is achieved by extendin...