Browse Prior Art Database

Method of Print Hammer Control for Print Bands Containing Multiple Character Set Sizes

IP.com Disclosure Number: IPCOM000108615D
Original Publication Date: 1992-Jun-01
Included in the Prior Art Database: 2005-Mar-22
Document File: 3 page(s) / 130K

Publishing Venue

IBM

Related People

Dayger, DA: AUTHOR

Abstract

Disclosed is a method for logically dividing a print band, comprised of a plurality of sets of characters, into a band comprised of multiple instances of a single character set size. Also disclosed is a method for printing the first available occurrence of a desired band character while blocking the printing of any further occurrences of that character.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 52% of the total text.

Method of Print Hammer Control for Print Bands Containing Multiple Character Set Sizes

       Disclosed is a method for logically dividing a print
band, comprised of a plurality of sets of characters, into a band
comprised of multiple instances of a single character set size.  Also
disclosed is a method for printing the first available occurrence of
a desired band character while blocking the printing of any further
occurrences of that character.

      A print band is typically designed so that each character
occurs more than once, and the occurrences are evenly spaced, on the
band.  It is common for some characters to occur more often than
others on a band.

      In a typical embodiment, a print band is described to the
printer by a list of all the characters as they appear on the band.
This list is searched for all the occurrences of each character.  The
minimum increment between occurrences of each character is noted as
the set size for that character.  The set size data is then reduced
to the smallest common multiple set size(s).  The number of unique
characters at each resulting set size is determined and the most
common set size is chosen as the base character set size for the
band.

      Each unique character is described by a location within the
base set, and an indication of which set or sets it occurs in.  If
the band contains character sets that are not multiples of the base
set, then those characters, when mapped onto the base set, will have
different locations within the base set for different occurrences of
the character.  The description of these characters is assembled in a
linked list, with a list element for each unique location within the
base set.  Each list element contains a location within the base set,
and an indication of which set or sets it occurs in.

      The descriptions of the band characters are stored in a table
according to the character code.  For those characters, whose
description is comprised of a linked list, the table entry contains a
pointer to the linked list.

      Each description entry contains two bit masks: the set mask and
the entry mask.  In the set mask, each bit represents a specific base
character set on the band.  A bit is set to 1 if the character being
described exists in that set.

      In the entry mask a bit is defined for each description entry
that exists for...