Browse Prior Art Database

Compiled Fonts

IP.com Disclosure Number: IPCOM000040925D
Original Publication Date: 1987-Mar-01
Included in the Prior Art Database: 2005-Feb-02
Document File: 1 page(s) / 12K

Publishing Venue

IBM

Related People

Bantz, DF: AUTHOR [+2]

Abstract

Faster generation of alphanumeric bitmap images can be obtained through representation of character appearance as an instruction sequence.

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

Page 1 of 1

Compiled Fonts

Faster generation of alphanumeric bitmap images can be obtained through representation of character appearance as an instruction sequence.

In this system, the representation of character's appearance is a sequence of computer instructions. Each has a unique sequence of instructions to represent it. Instead of a computer program that copies a binary array into the target bitmap, the computer executes a branch instruction to the code that represents a character. Since all character representations return to the same point, there is no need to pass the return address to the character code segment. On entry to the character code segment, the X-Y position in the page image bitmap must be given and these are the only parameters needed.

The most commonly available form for character representations is the binary array, and it is desirable to be able to automatically convert from that form to an instruction sequence. The task involves optimal choice of instructions based on the width of the character. For example, if the character is less than 8 bits wide and the computer's instruction set has 8-bit literal values then each row of the character can be stored in a single instruction. If the character is wider than 8 bits, then a more optimal representation is to store the row of the character as a literal value and move it into a register with a LOAD instruction. The translator should be smart enough to recognize that two rows of a character are identical a...