Ultrahigh resolution photocomposition system employing electronic character generation from magnetically stored data

Description

BACKGROUND OF THE INVENTION
(1) Field of the Invention
This invention relates to the field of photocomposition using electronically displayed character images generated from stored binary signals.
(2) Discussion of the Prior Art
Electronic graphic displays controlled by digital computers are presently used in a variety of applications including computer aided design, long distance telecommunications and word processor systems. Due to their extremely high speed and great versatility, computer controlled CRT displays have even found application in the field of photocomposition of typecharacters and other graphic symbols but such applications have generally been attended by low resolution and high cost due to the vast amount of digital data needed to obtain even a minimally acceptable character resolution. As the requirement for greater resolution in character design increases, very significant sacrifices must be made in the speed at which the character designs are displayed in order to keep the capital equipment costs within reasonable limits. For this reason, virtually all photocomposition systems capable of producing high resolution, graphic quality character images have relied upon film grid fonts from which the character designs may be optically reproduced. Film font systems, however, suffer from a number of disadvantages including the high cost and fragile nature of the film grids, the need for a complicated font support mechanism and the need for an expensive optical projection system.
Since an electronic display system virturally eliminates all of these disadvantages of the conventional film font, numerous attempts have been made to develop a practical electronic system capable of producing sufficiently high resolution to compete with film font based photocomposition systems. In U.S. Pat. No. 3,569,951 to Lavenir, a digital computer based graphic symbol display system is disclosed in which line image characters are generated on a CRT display screen by cursively moving the CRT beam in response to a series of 3 bit codes commanding successive translational movements of the CRT beam. Since the CRT screen can be imagined as an orthogonal matrix of dots, each translational movement of the CRT can be described as a movement from one dot in the matrix to an adjacent dot in one of eight possible directions (called Freeman directions). A three bit binary number is required to identify all 8 possible directions assigned to each translational movement command produced by the digital circuitry controlling the CRT display. To obtain a greater degree of flexibility, the Freeman direction codes can be expanded to allow selectively for either one dot or two dot translational movements, as is disclosed in U.S. Pat. No. 3,533,096 to Bouchard and U.S. Pat. No. 3,603,967 Houerbach.
Still further reduction in the storage capacity required for cursive character generation can be realized by using successive two part encoded commands wherein the first part of each command identifies generally a sector direction in which movement of the CRT beam will take place and a second part specifically identifies a path within the sector over which the CRT beam is to be moved. By generating successive two part commands of this type the CRT beam may be commanded to sweep out any arbitrary design. Examples of this technique are disclosed in U.S. Pat. Nos. 3,675,230 to Pitteway; 3,716,705 to Newell and 3,735,389 to Tarczy-Hornach. While significant reduction in storage capacity can be achieved by this approach especially when a large number of display matrix dots are traversed in response to each binary path identification code, this reduction is offset somewhat by the need to include a number of bit positions in each command to identify the direction sector in which path movement is to take place. Moreover, cursive line generation of character images allows no variation in the thickness of the line images generated and is therefore unacceptable in most situations in which graphic quality photocomposition is desired.
Accordingly, it has been suggested to encode additional information such as disclosed in U.S. Pat. No. 4,087,788 to Johannesson in which the Freeman direction codes are supplemented by digital information relating to the "thickness" of the various letter portions. Some loss of resolution occurs in systems of this type and thus for very high resolution work, the system disclosed in U.S. Pat. No. 3,581,302 to Kolb may be employed wherein successive 3 bit Freeman codes are employed to describe in successive translational movements the position of all dots in the dot matrix of a CRT display which must be illuminated in order to recreate a particular character image. The Kolb patent recognizes that one of the Freeman directions may even be eliminated by careful arrangement of the instructions and yet permit all of the dot positions to be described. In this way the eliminated Freeman direction code can be used for further machine code instructions without requiring more than three bits per translational command code.
A system using successive 3 bit Freeman codes to define each dot location of a character design will maximize the resolving capability of a CRT display, but massive storage capacity will be required to approach the maximum resolving capability of the human eye. For example, assuming the minimum resolving capacity of the unaided human eye at a normal reading distance to be about 0.0002 inch, a character reproduced at copy size in 12 point type would require almost 1 million dots of 0.0001 inch to define a dot matrix covering a 12 point EM sqaure which is the imaginary square in which all letters of a 12 point alphabet are formed. Even if the letter form uses only one tenth of the dots in the EM matrix, 300,000 bits of storage capacity would be required for each symbol in the alphabet in order to achieve the maximum visibly perceptible resolution in the output image.
One technique for reducing this mammoth storage requirement is illustrated in U.S. Pat. No. 3,594,759 to Smura wherein successive 24 bit computer commands are sent to a decoder circuit for deflecting a CRT beam in a pattern to sweep through the dots defining one portion of a character. Basically the system of the type illustrated in the Smura patent works well for "block style" lettering, but tends to break down when the letter boundary is of a curvilinear nature. Note for example the chart in column 8 wherein 30 24 bit commands are required to describe a curved letter portion as compared with rectangular portions requiring only 2 or 3 24 bit commands.
An alternative approach to encoding commands identifying all dots making up a character is to encode only the boundary point of the character design and to use these encoded boundary point positions to control a raster scanned display to recreate the character image. A system of this type is disclosed in U.S. Pat. No. 3,783,331 to Darnall wherein original artwork is scanned in raster fashion to produce signals indicating the position at which each scan line crosses the boundary of the character. This stored information is subsequently read out to control the blanking and unblanking of a CRT beam which is raster scanned over a display screen to recreate an image of the character. In a system employing many hundreds of scans per character, the amount of storage capacity required can still be impractical with this system even though significant advantages are achieved over systems identifying the location of each and every point in a character image. Moreover, a system of scanning original artwork such as illustrated in U.S. Pat. No. 3,783,331 requires simultaneous scanning of the artwork and a reference character in order to obtain a spatial reference for the encoding data. This requirement prevents the selection of the conventional base and left hand reference lines normally used by typeface designers as the scan reference since the character design will often touch the conventional base or left hand reference lines thereby creating the absence of a reference character in the area of overlap. Other techniques for creating character images by raster type scanning of a display screen are illustrated in U.S. Pat. Nos. 3,422,737 to Bailey, Jr.; 3,643,067 to Coldita et al and 3,713,098 to Muenchhousen et al.
Some attempts have been made to combine the benefits of cursive type character data storage with the efficiency and simplicity of a raster scanned image display. For example U.S. Pat. No. 3,936,664 to Sato discloses a technique whereby a character pattern is encoded by end to end vectors defining plural dot positions whereby the stored vector signals are used, upon decoding, to store data bits in a random access memory in which the storage cells correspond to dot positions in an electronic display matrix. When all of the vectors making up a character have been stored, the memory is read out to control a conventionally scanned CRT display.
Another way to combine cursive type character encoding with raster scanned output display is illustrated in U.S. Pat. No. 3,870,922 to Schutoh which discloses a pattern generating structure wherein the coordinates of boundary points of a pattern intersected by a scan line are generated in real time using encoded data relating to successive translational movements from one boundary point to another. The CRT beam is unblanked when the position of the CRT beam coincides with a coordinate being generated from the encoded data indicating that the beam is entering the pattern image and is blanked when the CRT beam position coincides with a coordinate being generated from the encoded data indicating that the beam is leaving the pattern image.
Attempts have also been made to achieve greater data compaction by modifying the organization of the storage media itself. For example, numerous techniques have been developed, such as illustrated in U.S. Pat. No. 4,001,883, for high density data storage on magnetic discs using uniform length data sectors. Similar techniques such as disclosed in U.S. Pat. No. 3,514,616 to Kolb have been disclosed as being particularly advantageous for the storage of encoded data CRT image generation wherein the data for each character is subdivided into subsections assigned to plural sectors containing both character and non-character data. Disc storage media organized with uniform length data sectors inevitably result in unused storage capacity since the amount of encoded data necessary to describe completely any one character will be variable and will often require only a fraction of the last data sector assigned to record the encoded character data.
SUMMARY OF THE INVENTION
It is the primary object of this invention to overcome the deficiencies of the prior art and to provide a photocomposition system for composing typeface characters with the highest practical degree of resolution using electronically displayed character images generated from stored binary signals.
A more specific object of this invention is to provide a system capable of producing the same high resolution and graphic character quality obtainable from film grid font based photocompositions systems by means of a system wherein the film grid font has been replaced by a magnetic font disc on which character images are stored in the form of magnetically recorded encoded binary signals.
A still more specific purpose of this invention is to provide a magnetic font disc organized to allow the maximum possible compaction of encoded character design signals and to allow extremely rapid retrieval of the encoded signals. More particularly the signals are organized into groups of successive multi-bit translational commands sufficient to describe the entire boundary contour of a single alphabet character. Each such group is stored in a single continuous character sector including a character data field formed of a plurality of magnetic storage cells equal in number to the total number of data bits in the associated group of multi-bit translational commands and a non-character data field formed of a predetermined fixed number of storage cells preceding the associated character data field. The storage cells of the non-character data field are magnetically altered to store binary signals identifying the position of the associated character data field. A plurality of additional character corresponding to the number of remaining character contours recorded on the disc are arranged sequentially end to end within a plurality of concentric tracks made up of the ordered storage cells on the magnetic font disc.
Still another object of the subject invention is the provision of a single master magnetic font disc capable of producing signals suitable for electronic alteration to generate all sizes of normally used alphabet characters of a particular typestyle. This advantage is achieved by recording two or more complete sets of alphabet letters of the same type style encoded from separate original art work wherein corresponding letters are proportioned slightly differently in order to better adapt one complete set of alphabet characters for image generation in larger point sizes and the other set of characters for image generation in smaller point sizes. This master magnetic font disc further includes instructions in the form of binary numbers stored thereon to indicate what point sizes each set of alphabet characters is properly adapted to generate.
It is still another object of this invention to provide a master magnetic disc font for use with a photocomposition system capable of independently altering the set size and the point size in which character images are generated on the electronic output display wherein the master magnetic font disc includes instructions recorded in binary form for causing the photocomposition system to vary, automatically, the ratio of point size to set size as the point size of the characters are modified.
A primary feature of the subject invention is the method for recording the boundary contour of a character image by means of a series of translational codes designed to identify one path out of a set of translational paths which may be followed in moving incrementally around the boundary of a character image. The number of binary bits required for each translational code is reduced by limiting the number of paths which may be followed dependent upon the path previously followed. In other words the meaning which is attached to a particular translational code is dependent upon the preceding translational code in the series of codes used to define the character boundary.
A more specific feature of this invention is the provision of a method for encoding a character boundary whereby a series of three bit translational codes is used to identify one translational path out of a path set composed of 24 distinct translational paths wherein the general direction of a preceding translational path is used to define a subset of translational paths from which the succeeding translational path must be selected. In this way the number of bits required to identify successive translational codes may be significantly less than the number of bits which would be required in order to uniquely identify each of the total number of translational paths in the overall path set. This advantage of the invention derives from the fact that a character boundary generated in a very high density dot matrix will very rarely require a translational movement which represents a sharp turn away from the direction of the previous translational path.
A further feature of the subject invention is the provision of special code which is substituted for a normal translational code to indicate that the next translational move will be identified from a set of translational paths which are infrequently required in order to define a character boundary. In particular, the path set includes translational paths which represent generally sharper turns from the direction previously followed.
Still another object of the subject invention is the provision of an optical scanner system for deriving the coordinate position of the intersection of a scan line with the boundary of a character image whereby the coordinates identify the position of such intersection points relative to a reference the position of which does not appear on the optical image carrier. Rather, the reference position on which the character boundary point coordinates are based are recorded on a separate image carrier adapted to be scanned separately from the character image carrier.
A more specific object of the invention is to provide a photocomposition printer system including decoding means for retrieving the successive translational codes stored on the magnetic font disc and converting these codes into coordinate numbers capable of defining the contour of a character boundary combined with collector circuit means for responding only to those coordinates located within a predetermined linear slice of the character image to cause signals to be stored in an output memory from which the CRT beam control signals may be derived.
A more particular object of the subject invention is to provide a photocomposition printer system including a character decoder memory in which is stored the successive multi-bit translational codes defining the entire boundary contour of at least one character image combined with cyclically operating accessing circuitry for reading out in series the multi-bit translational codes for use by the collector circuit means in determining whether any of the multi-bit translational codes identify coordinates existing within a particular slice of the character image. By this technique, all of the translational codes are successively transformed to boundary coordinates one time for each character slice identified by the collector circuit means.
Still another object of this invention is to provide a photocomposition printer system including a multiplier circuit means between the output of the decoder circuit means and the collector means for the purpose of altering the magnitude of the coordinates received from the decoder circuit in such a way as to adjust the point size and the set size of the character images to be generated on the CRT display. In particular the multiplier circuit means includes an X multiplier circuit for adjusting the X coordinate of each boundary point received from the decoder circuit to thereby adjust the set size of the character image and a Y multiplier circuit for adjusting the Y coordinate of each boundary coordinate to thereby adjust the point size of the character image independently of the set size.
Still another object of the subject invention is to provide four separate output memory circuits controlled in such a way that two memory circuits are simultaneously accessed to provide CRT beam control signals while the CRT is displaying one slice of a character image while the remaining two output memories are successively operated to receive data from the collector circuit means with one output memory circuit receiving data regarding the boundary of one character and the second output memory receiving data regarding the boundary of an adjacent character image such that upon simultaneous read out of the data from these two output memory circuits, the CRT beam can be properly controlled even though two character images are designed to be photocomposed in overlapping relationship.
Still another object of the subject invention is to provide four separate random access output memory circuits having a storage cell corresponding to each dot position within the output dot matrix conceptually representing the elemental areas of the CRT display screen being used. The coordinate signal produced by the collector circuit means are accordingly used to access particular locations within the random access output memory circuits to permit a binary representation to be stored in the memory storage cell corresponding in position to the coordinate signal provided by the collector circuit. When the decoder circuit means has cyclically read out all of the translational command codes completely describing a single character's boundary the output memory circuit then being accessed will contain stored signals at each of the storage cells corresponding to the boundary coordinates of the character image falling within the character slice then identified by the collector circuit means.
Other and more specific objects of the subject invention may be understood by a consideration of the drawings and the following description of the preferred embodiments.

BRIEF SUMMARY OF THE DRAWINGS
FIG. 1 is a conceptual schematic diagram of a photocomposition system formed in accordance with the subject invention,
FIG. 2 is a schematic illustration of the manner by which the boundary coordinates of a letter form are generated,
FIG. 3 is a schematic illustration of an electronic optical generator screen on which the letter form of FIG. 2 has been generated in response to encoded signals derived from the scanning operation illustrated in FIG. 2,
FIG. 4 is a schematic illustration of the 8 possible 1-dot translational movements from any point in a dot matrix to an adjacent point,
FIG. 5 is a schematic illustration of a path set of possible 2-dot translational movements from one dot matrix position to the 16 peripheral termination points surrounding the one dot matrix position,
FIG. 6 is a schematic illustration of a path set of possible 3-dot translational movements from one dot matrix position to the 24 peripheral three dot translation termination points surrounding the one dot matrix position,
FIG. 7 is a chart indicating the ratio of storage bits required to identify a translational movement within a dot matrix to the number of dots actually traversed within the matrix for each translational movement,
FIG. 8 is a schematic illustration of another path set of possible 2-dot translational movements from one dot matrix position to the 16 peripheral two dot translational termination points surrounding the one dot matrix position,
FIG. 9 is a schematic illustration of another path set of possible 3-dot translational movements from one dot matrix positionto the 24 peripheral three dot translational termination points surrounding the one dot matrix position,
FIG. 10 is a schematic illustration of yet another path set of possible 3-dot translational movements from one dot matrix position to the 24 peripheral three dot translational termination points surrounding the dot matrix position,
FIG. 11 is a schematic illustration of the method of this invention for encoding successively the translation paths of FIG. 6 using 3 bit binary codes in order to describe the boundary contour of a alphabet character,
FIG. 12 is a schematic illustration of an arbitrary boundary contour defined by a succession of dots,
FIG. 13 is a chart detailing the successive three bit binary codes necessary to describe the boundary contour illustrated in FIG. 2 in accordance with the method illustrated in FIG. 11,
FIG. 14 is a schematic illustration of the scanner system employed to initially encode the coordinate position of the intersection of scan lines with the boundary contour of a letter form,
FIG. 15 is an illustration of a standardized grid for use in adjusting the intensity of the light source employed in the scanner system of FIG. 14,
FIG. 16 is an illustration of a reference gride for use in establishing the reference position for a scanning operation of the optical scanner illustrated in FIG. 14,
FIG. 17 is an illustration of a blocking mask transparency for use in reducing the scan time of the optical scanner of FIG. 14,
FIG. 18 is an illustration of a typical character image suitable for scanning by the optical scanner system of FIG. 14,
FIG. 19 is a schematic illustration of a series to parallel converter for converting the serial scan pulses into 8 bit bytes suitable for manipulation by the microprocessor of the scanner of FIG. 14,
FIG. 20 is a chart illustrating the format of 8 bit bytes actually stored on a magnetic disc by the microprocessor of the optical scanner of FIG. 14,
FIG. 21 is a schematic illustration of the encoding system by which the 16 bit coordinate numbers resulting from the scanning operation of the optical scanner of FIG. 14 are converted to 3 bit translational codes as illustrated in FIG. 11,
FIG. 22 is a schematic illustration of a conventional magnetic floppy disc provided with equal length data storage sectors,
FIG. 23 is a chart of the manner by which data is organized on the conventional floppy disc of FIG. 22,
FIG. 24 is a chart illustration of the manner by which data is organized on the novel magnetic font disc formed in accordance with the subject invention,
FIG. 25 is a chart illustrating in greater detail the manner by which blocks of data are stored on the magnetic font disc of the subject invention,
FIG. 26 is an illustration of the E.M. square employed by typeface designers and photocomposers to measure the size of a character image,
FIG. 27 is a schematic illustration of the major components of the photocomposition printer formed in accordance with the subject invention,
FIG. 28 is a schematic illustration of the printer control circuit illustrated in FIG. 27,
FIG. 29 is a schematic illustration of the disc controller circuit of FIG. 27 used to control the magnetic font disc formed in accordance with the subject invention,
FIG. 30 is a schematic illustration of the character decoder circuit employed in the printer illustrated in FIG. 27,
FIGS. 30A through 30C illustrate schematically the operation of an adder circuit of the multiplier circuit,
FIG. 31 is a schematic illustration of the multiplier circuit employed in the printer illustrated in FIG. 27,
FIG. 32 is a simplified schematic illustration of the collector circuit employed in the printer illustrated in FIG. 27,
FIG. 33 is a schematic illustration of the character slice identifying function of the slice identifying counter employed in the collector circuit of FIG. 32,
FIGS. 34 through 36 are illustrations of the function of the collector circuit permitting boundary "turn around" configurations occuring within a character slice to be appropriately handled by the collector circuit,
FIG. 37 is a more detailed schematic illustration of the collector circuit employed in the printer illustrated in FIG. 27,
FIG. 38 is a more detailed schematic illustration of the collector circuit employed in the printer illustrated in FIG. 27,
FIGS. 39 through 43 are illustrations of the operation of the collector circuit of FIG. 38,
FIG. 44 is an illustration of the output memory board control circuit used to control the operation of the output memory circuits of the printer of FIG. 27,
FIG. 45 is a schematic illustration of one of the high speed output memory circuits employed in the printer of FIG. 27,
FIG. 46 is a schematic illustration of the scan control circuitry for the CRT display of the printer illustrated in FIG. 27,

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
The ultimate purpose of the subject invention is to provide a photocomposition system for composing typeface characters with the highest practical degree of resolution of the character designs and of control over the arrangement and spacing of the characters forming the textual material composed by the system. By use of the subject invention, it is now practical for the first time to photocompose by electronically recreating images from highly compact data stored in memory with optical resolution equal to or greater than that possible by use of a film-font based photocomposition system. In particular, the subject system has the unique ability to sense and encode original design data for storage in an ultra compact format and to recreate electronically the original designs from this data in an optical form suitable for photographic recordation at a sufficiently high speed to permit commercial application without sacrificing in any significant way the visually perceptible resolution of the original letter design.
FIG. 1 is a diagrammatic representation of the conceptual basis of the subject system. Block 2 represents the original character artwork normally drawn by an artist using pen and ink in accordance with the artist's esthetic sense. If the system is to be used for photocomposing the Roman alphabet, all upper and lower case letters plus numeral 0-9 and miscellaneous punctuation symbols will be drawn by the artist using a systematically applied design scheme so that each character can be visually identified as belonging to a particular alphabet style (typeface design) such as HELVETICA (a trademark of Eltra Corporation) or ALPHAVANTI (a trademark of Alphatype Corporation, Skokie, Illinois). Block 4 represents that portion of the subject system used to electronically digitize the character designs and encode the information in a highly compact format thereby allowing storage of a massive amount of character design information in storage media 6 such as a magnetic (floppy) disc. Encoded data including all upper and lower case letters plus all numerals and miscellaneous punctuation for each typeface in which it is directed to photocompose must be encoded and stored. While it is possible to electronically or photographically adjust proportionally from one point size to the next size or even the next two sizes without significant loss of resolution and artistic effect, it is not possible to electronically or optically enlarge or diminish a single letter design proportionally to all of the commonly used commercial point sizes. Thus, it is necessary to draw, encode and store a complete set of letters, numbers and symbols of each typeface style at least three or four times in order to provide optimum esthetic effect in textual matter photocomposed in letter sizes covering the commonly used point sizes 6 pt through 18 pt. A massive amount of storage capacity is thus required which further necessitates the highest possible data compaction consistent with achieving the ultimate purpose of this invention, i.e., maximizing resolution of the final output character design. By use of the disclosed apparatus and method it has been possible to record a complete set of characters in a single typeface style in each of 4 different commercial weights (e.g., 8 pt, 10 pt, 14 pt, 18 pt) in both Roman and italicized form, or Roman and bold, for a total of over 800 separate characters on a single magnetic floppy disc. This degree of compaction allows a photocomposer to maintain a complete library of most commercially available type styles in all point sizes and weights having the highest possible degree of resolution and clarity on a few hundred easily stored discs.
After a disc has been properly encoded with the desired typeface design information, it may be used in the system to produce the signals necessary to control a display such as a CRT or other type character image generator to recreate letter designs sequentially in accordance with a series of text composing instructions in the form of electrical signals formulated in circuit 8 by prior recordation or by "on-line" manual input at a keyboard. More particularly, the blocks of coded signals representative of each letter or symbol identified by successive instructions from circuit 8 are encoded into a form suitable for transmission to an electronic display device 12, such as a CRT, where the signals are used to generate a highly accurate optical image of the original artwork. A lens system 14 projects this image onto a photosensitive film master 16 which is adapted to photographically record the character images in the sequence in which they are formed on the CRT corresponding to the sequence of instructions formulated by instruction circuit 8. The photosensitive film master 16 is mounted for vertical translation on a horizontal bar 18 by pins 19 to permit the master 16 to be positioned to record successive lines of characters while the lens system 14 is horizontally translatable to permit successive characters in each line of print to be recorded. In order to hold film master 16 in a fixed perfectly flat position, the film master is pressed against a focus frame 21 containing an exposure window 21a through which the optical image formed on CRT 12 is projected by lens system 14 onto the photosensitive film master 16. The back side of the film is gently pressed against focus frame 21 by a film clamp bar 23 on which a plurality of spaced flat fingers (not illustrated) are separately mounted to contact and gently urge the back side of film master 16 against the focus frame.
While each and every portion of the system illustrated in FIG. 1 includes advantageous novel features over systems known heretofore, the method and apparatus employed in coding and decoding the extremely compact design data is crucial to the dramatic improvements brought about by the subject system. The specific procedure for achieving this data compaction depends upon the recognition of several unique characteristics of letter and symbol designs which permit the use of novel method steps and novel apparatus for implementing the subject invention as will be more fully understood by considering the following general description.
When generating images of readable symbols such as letters, numbers, and miscellaneous punctuation using digitally stored information, it is possible to obtain virtually any degree of optical resolution desired simply by increasing the amount of stored data per unit area of display up to the resolving limit of the display. If each elemental area on the display is assigned a coordinate position, the coordinate positions of all areas which must be illuminated to form any arbitrary design could be stored in the digital memory and read out in order to generate the control signals necessary to permit the electronic image generator to optically recreate the stored design. Since hundreds of thousands of elemental areas would be required for achieving even low optical resolution with such a system, an extremely large number of coordinate positions would have to be stored in memory. If the cost of memory and the speed at which it operates were unimportant there would be no need to encode the raw design data into a more compact form. However, the immensity of data required to store high resolution design information makes effective data compaction the primary requirement for design of a practical system. It is possible, in part, to achieve significant data compaction because substantially all character designs used in commerical photocomposition consist of spatially arranged, solid sections having substantial width and length. In other words, letter and number designs, to be recognized as such, even when artistically formed in a pleasing typeface design, will almost always employ contoured solid line sections of substantial width compared to the overall character size. Thus, if a letter character is recreated on a display such as a CRT by scanning the CRT in raster fashion made up of a plurality of parallel sweeps, the scanning mechanism, i.e., the electronic beam may be merely turned "on" once upon entering a character boundary with no further control information being required until the beam moves out of a character boundary at which time the beam is turned "off". For example, there are only a maximum of six transitions between light and dark areas in a vertical scan of the letter "E" as illustrated in FIG. 2 wherein the transitions are labeled X.sub.1, X.sub.2 . . . X.sub.6. The letter E design, thus, could be recreated on a raster scanned CRT by storing the coordinate positions of only the transistion points for each sweep and by generating the necessary signals from this stored data for controlling the electron beam during its scan of the CRT screen. In a very high resolution system scanning many hundreds of elemental areas per beam sweep, a substantial reduction in the memory area required for storing character design data could be achieved by storing only the coordinates of the CRT elemental areas or points defining the boundaries of the letter or symbol as it would appear on the CRT screen. If the elemental areas are visualized as a matrix of dots the letter design could be recorded in memory by recording the coordinate position of each of the boundary dots such as illustrated in FIG. 3.
In accordance with the subject invention, coordinate locations of the boundary dots of a stored image is further condensed by storing the coordinates of only a single starting point for each boundary line relative to a given reference followed by a series of binary codes representative of a series of translational movements which, conceptually, will trace out the boundary of the character image defined by the boundary data referred to above. Actual generation of the necessary CRT control signals to recreate the desired image could take place subsequently by reprocessing the stored binary codes to reproduce the coordinate information describing the positions of each and every dot defining the boundary of a letter.
To understand more clearly how the coordinate data can be transformed into translational movement codes and how this process will result in data compaction, consider the matrix of dots such as illustrated in FIG. 4, wherein movement from one dot position to an adjacent dot position can occur in only one of eight distinct directions labeled 1 through 8. It would thus be possible conceptually to trace out the boundary of a character on a matrix of dots, such as illustrated in FIG. 3, by simply encoding a succession of one dot translational movement codes with each successive movement being identified by a stored code representative of one of the eight possible directions illustrated in FIG. 4. In binary code, the number n of storage bits required to identify X different unique codes is determined by the formula: 2.sup.n -X. Accordingly, at least three bits are required to identify uniquely each of the eight possible directions schematically illustrated in FIG. 4, i.e., direction 1=000, direction, 2=001, direction 3=010, direction 4=011, direction 5=100, direction 6=101, direction 7=110 and direction 8=111. An encoding scheme of this type could significantly reduce the total amount of storage area required since only three bits would be required for each boundary dot as compared with the storage of coordinate locations for each boundary dot wherein many more than three bits would be required to uniquely identify each coordinate position in a dot matrix of very high density.
Still further reduction in the required storage area can be achieved by increasing the number of dot positions actually traversed per translational movement code. For example, FIG. 5 discloses a 2 dot translational scheme wherein 16 unique 2 dot translational movements are represented by the lines interconnecting the central dot P with each of the 16 peripheral termination points at which a two dot translational movement could terminate in a display system made up of a matrix of dots. FIG. 6 discloses a 3 dot translational scheme using 24 different translational paths to reach each of the 24 possible peripheral termination points in a dot matrix.
FIG. 7 (sheet 11) demonstrates how increasing the number of dots actually traversed per stored translational code results in a reduction in the total number of bits which must be stored in order to encode a character boundary line using each such scheme. As is evident from FIG. 7, each one dot increase in the number of dots traversed per stored code increases the number of termination end points by eight. Accordingly, the number of binary bits which must be assigned to each code to permit unique identification of all possible termination points is determined by the formula 2.sup.n -8L wherein n equals the number of bits per code and L equals the number of dots traversed per stored code. FIG. 7 demonstrates that increased data compaction can result from continual increases in the number of dots actually traversed for each stored code. However, the logic of this approach breaks down when it is no longer possible to assign only a single traversing path between the beginning position and each terminal point without sacrificing visibly perceptible character design resolution. To explain this more fully, attention is again directed to FIG. 4 wherein it is obvious that, in a 1 dot translational system there can be no loss of resolution by coding the boundary in the form of one dot translational movement codes since any arbitrary translational path from one dot to the next may be followed. When two dot positions are transversed for each stored code, more than one path may be followed in arriving at each of the 16 possible termination points. Compare, for example, the pattern in FIG. 5 with the pattern of paths illustrated in FIG. 8. For an even more dramatic illustration compare the 3 dot schemes illustrated in FIGS. 9 and 10 with the scheme of FIG. 6 wherein it is apparent that there exists more than a single desirable path between the central staring point P and each of the 24 termination points in a 3 dot system. In each of the above examples illustrated in FIGS. 4-6 and 8-10, the termination points for each code translation was assumed to be at the periphery of a square matrix of dots having 2n+1 rows and 2n+1 columns wherein n is the number of dots traversed by each translation path. As the number of dots traversed for each stored code increases, the resolving capacity of the system increasingly degenerates. This results in a system where the termination points are constrained to the periphery of the (2n +1) by (2n+1) matrix because the total number of possibly necessary paths between the starting point and each of the termination points increases as the matrix size increases. Elimination of some of the possible paths may not be particularly detrimental in a system wherein the character generation has a very high dot density in the output display and wherein the character images stored do not have boundary lines with exceptionally sharp radii of curvature. In systems of this type, no exceptionally abrupt changes in direction would occur within a relatively small section of the total display area. With stored characters of the type normally employed in photocomposition, it has been found that a 3 dot translational scheme such as illustrated in FIGS. 6, 9 and 10 is well suited for producing standard photocomposition characters. The FIG. 6 scheme, in fact, has been found imperically to be superior in producing the best possible resolution, as compared with the schemes of FIGS. 9 and 10. Four or five dot translational systems may also be employed although some sacrifice of image resolution must be accepted in such systems in order to achieve the data compaction disclosed in FIG. 7. The use of codes indicating a translational movement greater than 5 would not generally yield an acceptable level of image resolution since too many possible paths would be eliminated thereby causing significant degeneration in the optical resolution of the character image.
An extremely important and crucial refinement of the subject invention derives from the additional conceptual recognition that multi-dot translational movements along the boundary of virtually all standard photocomposition characters need not involve a turn greater than ninety degrees relative to the direction of the previous move when then dot density per letter is very high, e.g., greater than 1000 dots per linear inch at copy size, and the number of dots traversed per stored code is relatively low, e.g., less than 5. Under such circumstances, the translational code system illustrated in FIG. 11 may be employed. In this notational system the translational path identified by each successive code will depend upon the path defined by the previous code. Arrows D.sub.0 through D.sub.7 represent the eight possible directions in which a one dot translational movement may take place. When a previous translational movement (whether a single dot or multi-dot) has occurred in approximately one of the directions represented by arrows D.sub.0 through D.sub.7, the probability is quite high that the next translational movement necessary to remain on the character boundary will take place generally in the same direction. As the density of the dots on the display screen increases, the number of dots defining the boundary also increases thereby increasing the probability that each successive move necessary to define the boundary of a character will take place in the same general direction as the previous move. If a 3 dot translational system is used such as described in FIG. 6 in which 24 different and unique paths are possible for each move, it can be safely assumed for example, that a translation path defined in FIG. 6 by numbers 4, 5 or 6 would never be followed by a translation along the paths numbered 16, 17 or 18.
The FIG. 11 system adopts the same set of translational paths as described in FIG. 6 but only a limited number (subset) of the total of 24 paths may be identified by each successively stored translational code. The composition of the subset will vary dependent upon the direction generally indicated by the previously stored code. For example, if a series of translational codes describing a character boundary were stored in memory and the first such code identified a direction of movement indicated by arrow D.sub.5, the subset of translational paths from which the next translational path could be chosen would be one of the translational paths illustrated in FIG. 11 within the section marked "Path Set T.sub.5." If the second translational code in the series were the number one, the translational path identified would be the path terminating at the number 1 in path set T.sub.5. This path corresponds to path 10 in FIG. 6. Alternatively, the second translational code following the first code could be identified by an encoded 4 or an encoded 7 representative of paths 4 and 7, respectively, in path set T.sub.5 (corresponding to paths 7 and 4, respectively, in FIG. 6). Each translational movement along paths 1, 2 or 3 in path set T.sub.5 will generally result in movement in the direction of arrow D.sub.4, and would cause the next translational path to be selected from path set T.sub.4. As an example, the third code could identify path 1 in path set T.sub.4 which would correspond to translational path 13 in FIG. 6 and simultaneously constrain the next possible translational movement to one of the paths identified in path set T.sub.3 since path 1 in this set is directed generally in the direction indicated by arrow D.sub.3. Similarly, if the second code were a 5, 6 or 7 indicating generally a direction represented by arrow D.sub.6, the third stored code would represent a path selected from path set T.sub.6 illustrated in Fig. 11.
The purpose of this rather involved system is to reduce the total number of unique codes required to describe accurately the boundary of a symbol or character by identifying successively one out of a rather large number of unique multi-dot translational paths wherein the number of unique codes actually needed is significantly less than the total number of possible paths which may be followed. As indicated in FIG. 7 a scheme of describing character boundaries involving three dot translations, such as illustrated in FIG. 6, would require a 5 bit binary code in order to uniquely identify each successive movement around the boundary if no constraint is placed on the sequence in which these paths may be followed. By employing the system described in FIG. 11, the number of possible paths which can be identified following a previous translational movement is limited to the 7 next most likely moves. Thus, if the last movement was in the direction of arrow D.sub.7, the next most likely move will be one of the 7 paths illustrated in path set T.sub.7. These paths are identified by numbers 1-7 which are the same numbers used to identify different paths in the remaining path sets. In the binary number system, a three bit binary number will define up to 8 unique numbers and thus a 3 bit binary code would be sufficient to implement an encloding scheme such as illustrated in FIG. 11 as compared with the encoding scheme of FIG. 6 wherein a 5 bit code is required to identify the 24 possible 3 dot translational movements which are permitted. The constraints and limitations imposed by the scheme of FIG. 11 are not detrimental to the specific purpose to which the subject invention is directed (which is to recreate ultra high resolution character images for photocomposition from digitally stored binary dots). Ultra high resolution is maintained because the boundaries of standard characters, when encoded in successive steps on a high density dot matrix do not often require the encoding of a sharp turn. Therefore, the successive directional movements along the character boundary may be limited to variable subsets of the total number of movements necessary to move around the entire boundary.
FIG. 12 is a schematic illustration of how the scheme of FIG. 11 might be employed to encode the boundary line of a character using a succession of three bit codes defining, respectively, one of the 24 3-dot translational movements illustrated in FIG. 6. The series of circles drawn with solid lines correspond to those dots in a matrix of dots which would most nearly define the boundary line of a character. Obviously in a high resolution system the density of dots per lineal unit would be significantly greater (i.e. over 1000 dots per inch) but the procedure followed would be analogous to that described below. The process begins by recording the coordinate position of the lowest left hand boundary dot. By so selecting the starting point and arbitrarily choosing to proceed in the clockwise direction, it is obvious that the first three dot translation of any character boundary would take place generally upwardly and thus path set T.sub.5 of FIG. 11 will be used to identify the first translational movement shown within bracket A in FIG. 12. Since this movement takes place straight upwardly to point P.sub.1, the first stored three bit code should be a binary 4 (100) to identify path 4 in path set T.sub.5 as was the first translational movement. The second movement, indicated by bracket B, is most nearly followed by path 5 of path set T.sub.5 even though the path follows a route through circle 20, shown in dashed lines, instead of circle 22. The third code would thus be a binary 5 (101). Since path 5 of path set T.sub.5 follows generally the direction represented by arrow D.sub.6, the next three bit code will identify one of the paths defined by path set T.sub.6 of FIG. 11. Within path set T.sub.6 path 6 corresponds to the movement C followed in moving from point P.sub.2 to point P.sub.3 of FIG. 12. Thus, the third 3 bit code should be a binary 6 (110).
Reference is now made to FIG. 13 wherein the successive binary codes used to describe each of the successive translational movements A through N necessary to move around the boundary of FIG. 12 are listed. The path set from which each designated path is selected and the resulting directional movement are also listed. With the exception of dashed circles 20, 24 and 26, the composite translational path 28 (consisting of movements A through N) intersects each of the circles defining the boundary line of FIG. 12. In a very high density matrix, slight deviations from the true boundary such as represented by dashed circles 20, 24 and 26 will not be visibly perceptible. It must be noted here that the choice of the pattern of movements illustrated in FIG. 6 (as opposed to FIGS. 9 and 10) was not arbitrary. For reasons that are not totally understood, the path set of FIG. 6 has been found, empirically to produce better results than other possible path sets. In particular, one of the path sets which was tried caused the encoded boundary to "hunt" back and forth across the true boundary resulting in a jagged edge. As FIG. 12 aptly shows dots 20, 24 and 26 are off the true boundary on the same side rather than on opposite sides.
To give the scheme of FIG. 11 a greater degree of flexibility a special meaning is assigned to the one remaining 3 bit binary (000) code which is not employed to identify the heavy solid line paths illustrated in FIG. 11. When this code appears no translational movement is indicated, rather, the next three bit code is assigned a special meaning indicative, generally, of translational movements which are less frequently required to sweep out a boundary line. These specialized movements are illustrated in path sets T.sub.1, T.sub.3, T.sub.5 and T.sub.7 by thin lines identified as 0+1, 0+2, 0+3, 0+5, 0+6 and 0+7. Since these movements represent sharp turns, they are used much less often than are the paths numbered 1 through 7. Use of 6 bits to store each code representing these translational paths does not materially increase the total number of bits used to store a series of codes representing a boundary line since such 6 bit codes are not frequently needed. In the example of FIG. 12, the specialized zero code was only needed twice (for movements G and N). While the 6 bit codes increase slightly the amount of data which must be stored to describe an image boundary, a special straight ahead command of up to 54 dots can be employed to offset the increased storage required by the 6 bit codes. This special straight ahead code includes a three bit binary zero (000) code followed by a three bit binary 4 (100) which is used to indicate a straight ahead movement of 9 dots plus an additional movement of 3 times the number represented by the next 3 bit code. For example, the following sequence of codes (000, 100, 111 equivalent to 9, 4, 7 in base 10) would indicate a straight ahead displacement of (9+3.times.7) dots or 30 dots. By yet another refinement, the scheme of FIG. 11 may be designed to respond to a specialized zero command to move still further along a straight line by the following sequence of 3 bit binary codes: (000, 100, 000, 100, 111) equivalent to (0, 4,0,4, 7 in base 10) which would command a displacement of 33 dots plus 3 times the next number, that is 33+3.times.7 for a total of 54 dots. Since only 15 bits are used to indicate a translational movement of 54 dots, it is apparent that a significant reduction in the number of storage bits per straight line translation of boundary dots can be achieved. Since straight line displacements in excess of 9 dots usually occurs more frequently than the thin line sharp turns indicated in FIG. 11, the use of specialized zero commands can result in a further reduction in the total number of bits used to describe the boundary of a character in a dot matrix.
The above described technique for encoding the boundary of a character requires a completely novel method and apparatus for implementing the technique in a practical photocomposition system schematically illustrated in FIG. 1 and described in greater detail hereinbelow.
MASTER DISC ENCODING SYSTEM
As noted above, the subject photocomposition system employs magnetic disc storage media for recording character design data in an extremely compact format and includes virtually all of the visibly perceptible design information contained in the original character design. FIG. 14 schematically illustrates the system employed to initially convert the character design artwork into raw digital data including an optical scanner 30 for scanning the original character artwork 32 (including a transparent character image on an opaque background) and for converting the optical image into a stream of digital pulses supplied to an output line 34. The operation of the optical scanner will be described in greater detail hereinbelow. Controlling the operation of the optical scanner 30 is a microprocessor 36 adapted to receive operator commands from a keyboard and display 38 and to forward these commands to the optical scanner over lines 40 and 41 to control its operation. A linear array logic circuit 42 is arranged to receive the serial stream of pulses supplied over line 34 and convert this digital information into 8 bit bytes of data which the microprocessor 36 is capable of manipulating and transmitting to a conventional magnetic disc 44. The disc 44 is controlled by a conventional microprocessor based controller 46 such as sold by Intel Corporation identified as 8271 Floppy Disc Controller Chip. The 8 bit bytes of character data information is received from the microprocessor 36 over data bus 48. The main scanner microprocessor 36 communicates with the disc controller 46 over control line 50. The controller 46, in turn, supplies control signals to the disc drive 51 over line 52 while simultaneously supplying the data signals in serial form to the magnetic disc 44 over data signal line 54. Manual operation of the scanner system is accomplished by means of keyboard and display 38 communicating with the microprocessor 36 through lines 56 and 58 for handling 8 bit data bytes and control signals, respectively.
Referring now in more detail to the optical scanner 30, illustrated partially in perspective view in FIG. 14, control signals are received from the microprocessor 36 over line 40 to set the condition of the outputs from an 8 bit latch 60. The output signals are sent via lines 62 and amplifiers 64 to control stepper motor 66 which in turn controls the position of a horizontally translatable frame 68 through a rack and pinion drive 70 schematically illustrated in dashed lines. The original artwork design 32 photographically recorded in negative form on transparency film 72 is mounted by means of pins 74 and spring clips 76. A light source 78 is arranged to project a beam of light through the transparency film 72 to illuminate image 32 contained thereon as the frame 68 is stepped through each of 2048 different horizontal positions in which the frame may be placed. An upper lens 80 is arranged on the opposite side of the film 72 from light source 78 in order to project one portion of the shadow image of design 32 onto an upper linear array of photodetectors 82 and lower lens 84 is arranged to project the lower portion of the shadow image of design 32 onto a lower linear array of photodetectors 86. Each photodetector array may be the monolithic self scanning type such as sold by Reticon Corporation, Sunnyvale, California under the name RETICON G SERIES. The upper array consists of 512 photo diodes while the lower array includes 1024 photo diodes. Upon receipt of the appropriate control signals from linear array logic circuit 42 over control line 88, the condition of each photo diode contained in linear arrays 82 and 86 are serially scanned to produce a stream of output bits on line 34 to indicate whether or not the respective photo diodes are illuminated. The stream of serial bits is therefore in the form of a series of binary pulses having an amplitude indicative of whether the corresponding photo diodes are illuminated or not-illuminated. Microprocessor 36 in the scanner system of FIG. 1 is programmed to cause each of the photo diodes in linear arrays 82 and 86 to be interrogated once in series for each advancement step of frame 68 caused by stepper motor 66.
To set up the scanner 30 for scanning artwork, the intensity of light 78 is first adjusted by means of light intensity control 90 by scanning a standardized grid, FIG. 15, over a predetermined number of horizontal positions. If the number of dark areas detected by the photodiodes falls within a predetermined range, no light adjustment is required. However, if too many dark areas are detected, the ight intensity control 90 is adjusted to increase the illumination produced by light source 78. If an insufficient number of dark areas are detected, the light intensity control 90 is adjusted to reduce the amount of illumination produced by light source 78. FIG. 15 discloses one form of standardized grid 92 which may be used consisting of a film transparency having horizontally oriented transparent lines 94 when the standardized grid 92 is mounted on the translatable frame 68. Apertures 96 contained in the grid 92 are positioned to receive pins 74 and thereby positioning the grid properly for the light source intensity test. During this test, stepper motor 66 is advanced over only a limited number of horizontal positions A of carriage 68 so that the area of grid 66 actually scanned by linear arrays 82 and 86 can be controlled and predicted. The number of dark areas actually sensed by the photodetectors of arrays 82 and 86 are compared by microprocessor 36 with upper and lower acceptable limits and appropriate instructions are thereafter sent for display to the keyboard and display 38 if either an increase or decrease in the light source intensity is required. The tests can be repeated until the light source intensity has been adjusted in order to cause the number of detected light and dark areas to fall within an acceptable range. Of course, the microprocessor 36 could be programmed to automatically adjust the light intensity control 90 to cause light source 78 to produce an appropriately intense light for scanning images mounted on frame 68. Moreover, the standardized grid 92 may take a variety of shapes or forms although the design disclosed in FIG. 15 consisting of horizontal lines 94 has been found to be quite satisfactory.
As will be described hereinbelow, high quality photocomposition of character designs such as alphabet letters and numerical symbols requires not only extremely accurate resolution and reproduction of character design but also extremely accurate positioning and spacing of such character designs in word and sentence forming sequences so as not only to optimize readability but also to satisfy criteria relating to the artistic effect desired by the photocomposer. Thus, before each letter design may be scanned, a reference position for the design must be established and is normally chosen to coincide with the left reference line and basic line normally used by typeface designers. These lines correspond to the left hand boundary of the imaginary square establishing the set width of the letter and the base line defining the lower boundary of an upper case letter, respectively. In the subject system, this reference position is established by scanning a positional reference grid recorded on film transparency 98, illustrated in FIG. 16, upon which has been recorded a base line 100 arranged horizontally when the transparency is mounted on pins 74 of frame 68 by means of apertures 102 contained in the transparency 98. A left hand reference line 104 is also positioned on transparency 98 perpendicular to base line 100. Before any single letter design is scanned, reference grid film transparency 98 is placed on frame 68 to permit the scanner system to record the position of the base line 100 and reference line 104 as recorded on transparency 98 relative to the lower most photodiode position and the left most starting position of the frame 68, respectively. Thereafter, the transparency 98 is removed from the frame so as to permit a letter design or designs to be scanned as desired.
Naturally, the width and height of all letter designs will not be so great as to require use of the entire width and height scanning capability of optical scanner 30. Accordingly, a blocking mask transparency 106, illustrated in FIG. 17, may be mounted on pins 74 of frame 68 by means of apertures 108 to permit digital recording of a left boundary 109 and a right boundary 110 between which scanning will occur; thus, enabling the stepper motor 66 to initially advance frame 68 to the left boundary position defined by left boundary line 109 before commencing the optical scanning of a selected design known to reside between the left and right boundaries 109 and 110, respectively. Obviously, the use of a transparency such as illustrated in FIG. 17 will greatly reduce the time required for digitally recording the design information contained in a series of designs which occupy a field of view significantly less than the total field of view defined by the optical and mechanical portions of the subject optical scanner 30.
The optical scanner 30 may be further provided with a scan position indicator 112 (FIGS. 14 and 17) physically mounted to a fixed position relative to the optical axis defined by lens 80 and 84. The indicator 112 is positioned to cooperate with a position scale 114 recorded at the top of blocking mask transparency 106. Apertures 108 contained in transparency 106 are positioned to receive pins 74 thereby positioning the scale 114 and the boundaries 109, 110, in a predetermined location relative to the frame 68. Thus, a group of character designs known to occupy only a selected field of view relative to a predetermined base line and left hand reference lines may be more quickly scanned by the provision of a masking transparency as illustrated in FIG. 17 by positioning the left and right boundaries 109, 110 so as to define a desired field of scan. Moreover, should the operator determine that any one particular character design need only be scanned over a portion of the field defined by boundaries 109 and 110, the scan position indicator 112 may be employed in cooperation with the scale 114 to permit manual control, through keyboard and display 38, over which stepper motor 66 moves during the scanning procedure.
FIG. 18 discloses a typical character image 116 recorded on a transparency 118 in a predetermined location relative to apertures 120 arranged to receive positioning pins 74 of frame 68. By separating the character image 116 from the base and left hand reference lines contained on transparency 98, FIG. 16, the character image itself may extend below the base line or to the left of the left hand reference line as is desirable with certain types of letter designs including what is termed in the printing trade as a "descender" which is that portion of a letter design extending below the base line of a line of printed characters. For example, the lower portion of a lower case "g" or "y" which extends below a line of print is considered a "descender." The recordation of the position of the base and left hand reference lines by scanning a reference line transparency (FIG. 16) separate from the transparency containing the letter or character design (FIG. 18) allows the letter form to fall below the base line or extend to the left of the left hand reference line without thereby requiring the microprocessor 36 to distinguish between that portion of the shadow image representative of the base and left hand reference lines. At the same time, provision of a positional reference grid film transparency such as transparency 98 (FIG. 16) permits the base line and left hand reference lines to coincide with corresponding lines traditionally used by typeface design artists in preparing original artwork. Moreover, a reference grid transparency 98 such as illustrated in FIG. 16 further permits highly accurate positional recordation of character images which are substantially unaffected by changes in temperature and mechanical wear associated with the translation of frame 68 by stepper motor 66. If the reference grid transparency 98 were not employed periodically to redefine the correct position of the left hand and base reference lines, such information would have to either be contained on each transparency containing a character design to be scanned or would have to be permanently stored. Placement of such lines on the character design image transparency would lead to the disadvantages discussed above relating to the confusion caused by the character design actually coming in contact with or crossing over one of the reference lines. On the other hand, if the reference line positions were permanently stored, no provision could be made for variations caused by temperature changes or gradual wear of the mechanical parts connecting the stepper motor 66 to the reference frame 68.
As noted above, the output from photodetector arrays 82 and 86 is provided to the linear array logic circuit 42 over line 34 in serial pulse from wherein each pulse is amplitude detected to form a series of digital pulses indicating binary ones and zeros corresponding to the illuminated or non-illuminated condition of corresponding photodiodes of arrays 82 and 86. FIG. 19 discloses a series of parallel converters for converting the series form of digital pulses resulting from each scan of the photo arrays into parallel 8 bit bytes suitable for processing by the microprocessor 36. More particularly, the circuit of FIG. 19 which forms part of logic circuit 42 is designed to convert the serial digital pulses received on an input line 122 into 8 bit bytes of scan data provided on output lines 124 connected with microprocessor 36. In particular, FIG. 19 discloses a pair of 4 bit shift registers 126, 128 designed to shift through the data received on line 122 upon receipt of clock signals on clock line 130. Since the same clock signals are provided to the photodetector arrays, the digital data received by registers 126 and 128 are syncronized with the receipt of data pulses on input line 122. FIG. 19 also discloses a pair of shift registers 132 and 134 connected in parallel by lines 136 with registers 126 and 128, respectively, to read out the contents of registers 126 and 128 once for each 8 clock pulses supplied on line 130. Operation of registers 132 and 134 is controlled by a pulsed signal having a frequency equal to the clock rate divided by 8 supplied over line 138. Upon receipt of a pulse over line 138, registers 132 and 134 transfer in parallel the contents in registers 126 and 128 to output lines 124 through amplifiers 140 for transmission to microprocessor 36 of FIG. 14. This microprocessor is programmed to accept the 8 bit bytes of scan data for each vertical scan of a character image received from optical scanner 30, and to determine from this data the coordinate position of each transsition from light to dark in each series of 8 bit scan data bytes representative of a vertical image scan. In the preferred embodiment the pulse data received by microprocessor 36 for each vertical scan of an image is reduced to a series of pairs of 8 bit bytes of binary pulses representing hexadecimal numbers describing the the start of each vertical scan followed by hexidecimal representation of the transition between light and dark areas as determined by transistions in the pulse data from ones to zeros and back again. The total number of pulses received from the linear photodiode arrays 82 and 86 for each scan is 1536. To uniquely identify the position of each photodetector, a hexidecimal number having a least three place significance would be required. In binary format, a 3 place hexidecimal number would require 12 bits per 3 place hexidecimal number but since the commercially available microprocessors operate in 8 bit bytes, a pair of such bytes is required to uniquely identify the position of all photodiodes in arrays 82 and 86. FIG. 20 illustrates a typical example of the format of data prepared by microprocessor 36 in response to the pulse scan data received from optical scanner 30. In column 1, are listed successive pairs of 8 bit data bytes representative of the beginning of a vertical scan followed by identification of those photodiodes in arrays 82 and 86 at which transistors between light and dark takes place. These transistors would, of course, represent the boundary points of a character image which points are actually intersected during each vertical scan of the character image. Referring again to FIG. 14, a character image 32 may be vertically scanned once for each horizontal step of frame 68 across the entire width of the character image 32. In this way, microprocessor 36 would be in a position to determine the coordinate position of each boundary point by obtaining the horizontal position of frame 68 upon detection of the first transition from light to dark followed by determining the vertical position of transitions between light and dark for each successive vertical scan of the image.
The transition coordinate data is fed by microprocessor 36 to the magnetic disc recorder 46 where it is recorded on a magnetic disc 44 as a series of binary bits having the form shown in column 1 of FIG. 20. Microprocessor 36 is also designed to forward signals indicative of the position of frame 68 at which image data is first detected in the scan of the character image. Operator inserted data identifying the character image is also received from keyboard and display 10 by the microprocessor 36 which forwards the information for recording on disc 44. Programs capable of operating the microprocessor 36 and microprocessor based controller 46 are listed in Appendices A and B, respectively.
Since the data supplied to disc 44 is in a fairly raw uncondensed form, only a few letters may be recorded on any one disc. It is the purpose of the encoding system illustrated in FIG. 21 to take the raw data from a series of discs such as disc 44 and to encode this data in accordance with the principles described with reference to the scheme of FIG. 11 by which the binary representation of the coordinate positions in hexadecimal format of all boundary points for a character image is transposed into a series of 3 bit codes representative of successive 3 dot translational movements along the boundary of the character image.
More particularly with regard to FIG. 21, the encoding system includes a disc drive 142 for receiving a disc 44 from the scanner system of FIG. 14 whereby data comprising hexadecimal coordinate data for the boundary points of one or more character images may be transferred to a random access memory 144 by means of a microprocessor 146 operating through a variable length sector controller 148, the precise organization and function of which will be described in greater detail hereinbelow with reference to FIG. 29. Also included in the encoding system illustrated in FIG. 21 is a second disc drive 150 for driving a magnetic floppy disc 152 on which the final encoded data representative of the letters and images in one or more alphabets may be recorded to form a master disc adapted to be repeatedly used composing text material as will also be described below. A program capable of operating the system of FIG. 21 in accordance with the encoding scheme of FIG. 11 is reproduced in Appendix C. Before encoding of the data actually takes place, the microprocessor 146 is programmed to perform a cleaning routine wherein data recorded on disc 44 which is obviously representative of spurious signals as opposed to actual boundary point coordinates are removed from the recorded information before encoding takes place. For example, if a coordinate position is recorded indicating transition from light to dark followed immediately by the coordinate position of a transition from dark to light during the vertical stand, it can reasonably be assumed that the scanner system has generated a spurious signal since any visibly perceptible portion of an image character would require more than a single matrix dot corresponding to the elemental area in the CRT display which corresponds to each of the 1500 + photodiodes contained in linear arrays 82 and 86. The clean up routine is designed to apply a selectably variable criteria in deciding whether to accept a particular coordinate. In particular, recordation of a coordinate is allowable according to one criteria only if the raw coordinate data indicates that at least 4 consecutive character dots in the dot matrix are followed by at least 6 consecutive non character dots. If the encoded data is to be reduced by a factor of 3 or more, a courser criteria is applied which prevents the acceptance of any coordinate unless at least 6 consecutive character dots are followed by at least 9 consecutive non-character dots. Once the cleaning routine has been completed on the data recorded on a disc 44, the actual encoding routine may be performed by microprocessor 146 by manually switching the microprocessor using switch 154 between operation in the cleaning routine mode to the encoding routine mode. A cleaning routine program suitable for the encoded disc of FIG. 21 is recorded in Appendix D.
To make the vitally important encoding function performed by the encoding system of FIG. 21 more understandable, attention is directed to FIG. 22 wherein a conventional floppy disc 156 is disclosed having 77 concentric recording tracks 158 disposed around the rotational axis 160 of the disc. Each of the recording tracks 158 is, according to the standard format used in the prior art, subdivided into 26 equal angular length sectors with sector 1 beginning at a point coincident with the angular position of physical indexing aperture 162. In operation, disc 156 is placed upon a centering hub to be received in central opening 164. As disc 156 is rotated, an index position sensing device, such as a photosensor, picks up the passage of indexing aperture 162, thus enabling identification of the beginning of sector 1 as it passes the read/write head which is conventional on floppy disc drives.
To understand more clearly the importance of the novel type of magnetic disc which makes possible the subject invention, attention is directed to FIG. 23 in which the prior art arrangement of data within each of the 77 tracks of floppy discs 156 is illustrated. In particular, the output waveform 166 produced by the index aperture sensor, not illustrated, is shown in FIG. 23 wherein pulse 168 denotes the passage of index aperture 162 once for each revolution of the floppy disc 156. Within each of the 77 tracks 158 contained on the disc, there exists room for several thousand bit cells containing a clock bit occurring at the beginning of the bit cell followed by sufficient magnetic storage area to retain magnetic representation of the presence or absence of a data bit. Each successive group of eight bit cells forms a byte within which 8 data pulses may be stored. As indicated in FIG. 23, it is conventional to place an index address mark 170 located nominally 46 bytes subsequent to the commencement of the indexing aperture pulse 168 followed by 32 post index bytes before the commencement of the first of 26 sectors made up of 162 bytes of recorded data. In particular, each sector begins with an identification record 172 made up of 7 bytes including an identification address mark 174, a track address 176, one byte of zeroes 178 followed by sector address 180 again followed by a byte of zeroes 182. The concluding two bytes of the identification record includes CRC codes which are conventional system integrity checks.
Following the identification record in sector 1, is 17 bytes of data forming a gap 186 used to store data indicating a write function for a following data field. After gap 186, the following 131 bytes form gap 188 and are set aside for storing user data 190 which may consist of 128 bytes of such data sandwiched between a data or deleted data address mark 192 and a pair of CRC bytes 194. Each sector concludes with a 33 byte data gap 196 for storing data relating to a right turn-off function for update of the previous data field. While useful for many purposes, the subdivision of each track 158 into 26 equal length sectors is not well suited for the subject invention as it does not permit optimum compaction of the stored data. Moreover, merely subdividing each track into a greater or lesser number of individual sectors would not permit the flexibility necessary to implement the subject invention so as to permit the maximum number of image characters such as letters and numbered designs to be recorded on each floppy disc used in the system.
FIG. 24 discloses the completely novel way in which data is recorded on a magnetic disc within variable length sectors arranged relative to the index aperture of the disc to maximize the amount of character image date which may be stored on a magnetic disc. The compact nature of this data derives primarily from the use of successive three bit translational codes produced in accordance with the encoding scheme of FIG. 11. As illustrated in FIG. 24, the first sector in each track begins at a point 78 bytes following detection of the index aperture indicated at point 200. The first 10 bytes 202 of each sector includes stored zeroes followed by a special "dropped" clock pattern consisting of an eight bit byte of the hexadecimal numbers C7 (i.e., 1100 0111). The exact function of this pattern will be described more fully hereinbelow. Following byte 204 of each sector is a track number byte 206 followed by a byte 208 which indicates the beginning position of data recorded within the particular sector. The fifth byte group 210 includes bit cells set aside for receiving data indentifying the sector. The next byte 212 consists of data cells set aside for receiving a number indicative of the position of the high byte of data recorded in the variable length sector. Thus, it is bytes 208 and 212 which define the boundaries of the character image data stored in each variable length sector contained on a magnetic disc organized in accordance with the subject invention. Bytes 214 and 216 contain the conventional CRC codes followed by seven bytes of zeroes 218. Yet another "dropped" clock pattern byte 220 follows byte 218 at which point the character image data commences starting at byte 222 within the sector and continuing for as little as one byte up to 4861 bytes of data. Following conclusion of the bytes of recorded data, a pair of concluding bytes 124 and 126 contain character conventional CRC check codes. As is now apparent from FIG. 24, the number of bytes that can be stored on a track will vary dependent upon the number of sectors into which the track is actually divided since each sector includes 27 bytes of non user data including identification, clock checks and other types of control information, the total number of bytes that can be stored on a track equals 4889 minus 27 times the number of sectors. This amount of storage should be compared with the conventional storage capacity of a floppy disc as organized in the manner illustrated in FIG. 23 wherein a maximum of 26 times 128 bytes of user data may be stored on a single track or 3328 bytes of user data. By varying the length of each sector, in accordance with the length necessary to store all of the three bit translational codes needed to define a particular character image, additional storage capacity may be derived by elminating the need for separate successive sectors of a single character boundary. If a particular series of three bit translational codes describing a single letter cannot be stored before the available bytes in a particular track are exhausted, a special code may be stored which causes the remaining three bit codes to be stored in the first sector of the following track. By this technique, all of the data necessary to define a particular character image need appear in no more than two sectors since as will be discussed further hereinbelow, the degree of resolution required to exceed the resolution of the human eye and the degree of data compaction permitted by the scheme of FIG. 11, will not, as a practical matter, cause the amount of data necessary for any one character image to exceed the storage capacity of any one track in a magnetic disc organized in accordance with the arrangement illustrated in FIG. 24.
Attention is now directed to FIG. 25 which discloses the organization of data actually placed on a disc 152 by the microprocessor 146 and variable sector controller 148 of FIG. 21 upon execution of the encoding routine contained in the program appearing in Appendix C. As illustrated in FIG. 25, each master disc includes one sector such as sector 131 (not necessarily the first sector in the first track) wherein alphabet directory information is stored. This directory begins with a customer check number 228 including two bytes for purposes of identifying a particular customer using the master disc. Following the customer check number 228, certain alphabet information for each alphabet stored on the master disc is recorded. This information includes typeface number 232, encoded point size 234, encoded set size 236, sector 130 track number 238 and size information length 240.
To understand the meaning and necessity for the information recorded in bytes 232-240, it should be noted that each character in a font of characters is defined by a set of parameters that includes an EM square 252 such as shown in dashed lines in FIG. 26. The EM square defines the point size 246 of the character which for exemplary purposes is shown as an H in FIG. 26. The set size of an alphabet is defined as the horizontal width of the capital letter M of the alphabet measured in point units of length. The body size of the overall set width 248 of a particular character is equal to the sum of the character width 250 and the leading side bearing 252 and trailing side bearing 242 of the character. The leading side bearing 252 is defined as the distance from the leading or left outer periphery of the character to the leading edge of the set width of the character. Similarly, the trailing side bearing 254 is defined as the distance from the right edge of the character to the trailing edge of the set width of the character. One character is spaced from another character by the sum of the trailing and leading side bearings of the respective successive characters. In order to achieve the very high degree of graphic quality desired from the subject photocomposing system, the EM square is subdivided into 144 relative units per EM instead of the normal 18 pts. Thus the subject system has the capability of modifying the size of encoded character design in 1/8 point size variations. During the initial process of hand drawing each letter form, the artist will arbitrarily choose the overall set width of each character including the leading and trailing side bearings in accordance with the artist's visual conception of how the character should fit when juxtaposed with all other letters in a particular typeface style.
Returning now to FIG. 25, alphabet information 230 which is repeated for each alphabet includes size information 256 specifying the lowest limit 258 to which the encoded alphabet design may be reduced in both point size 262 and set size 264 (by 1/8 point units). Similarly, the upper limit 260 of both point and set sizes to which the encoded alphabet may be adjusted is recorded. If the ratio of point size to set size at the upper and lower limits are not identical, the point at which the ratio changes is indicated as the size break recorded at 267. Thus, if the upper limits were 18 pt 17 set and the lower were 12 pt 12 set, the allowed point/set ratios could be limited as follows 17/16; 16/15; 15/14; 14/14; 13/13; 12/12. In this situation, 14/14 would be the break point. Plural break points may be defined in 1/8 pt units from upper to lower limit sizes.
The alphabet information 230 is repeated for each alphabet contained on the master disc to a maximum of 512 bytes of information in the alphabet director 282. Following the alphabet directory, the actual alphabet letter image and number image information is recorded by successive three bit translational codes organized in accordance with the scheme of FIG. 11. More particularly, sectors 0-127 of the master disc are assigned for recording character data by first recording the left limit of the series of three bit translational codes for describing a letter boundary. The section length 286 within which the codes are recorded and the section byte execution time 288. The right limit is stored at 290 followed by one byte of zeroes 292 following which the X coordinate for the starting point for the first boundary line of a character are stored in two bytes 294. Also recorded in these two bytes within bits 13, 14 and 15 is a code indicating the starting direction of the first three bit code. As can be easily understood from the scheme of FIG. 11, the path identified by the first three bit code can only be determined when the path set from which the path has been selected is also identified. Thus, the purpose of the information recorded at bits 13, 14 and 15 is to properly identify this path set. Immediately following the starting X coordinate are two bytes 296 in which are recorded the starting Y coodinate followed by 8 bytes 298 of hexadecimal FF or in other words eight bytes of ones. The actual boundary data is next stored in successive bytes having a variable length dependent upon the amount of data required to completely describe one boundary of the character. The same information recorded in a series of bytes 292-300 is recorded for the second boundary of the same character as required in corresponding byte sections 302-312. There then follows separate sectors including a series of bytes containing a width table 314 including set width information for each character in each alphabet encoded on the disc. Since these widths are expressed in 144 relative units or 8 relative units per conventional width unit (point), the size and fit of letters photocomposed with the subject system may be very accurately controlled. The sector directory 318 merely indicates in which sector on the disc a particular alphabet character is found.
All of the information identified in FIG. 25 is placed on the master disc 152 of FIG. 21 by operation of the encoding system which, as described above, was also opertive to encode the boundary data received from the scanner system of FIG. 14. Disc 152 now contains all of the information required to permit a printer, designed in accordance with the subject invention and described in detail hereinbelow, to function in response to text composing signals received from a record produced previously on a keyboard editor, not illustrated, or in response to signals from a keyboard connected on-line to the printer all as schematically illustrated by circuit 8 in FIG. 1.
PHOTOCOMPOSITION PRINTER
Attention is now directed to FIG. 27 which schematically illustrates the important components of the printer system. Input commands are initially received from keyboard 350 for directing the printer to prepare itself to photocompose a particular text which may involve several different typeface styles in varying weights of Roman, bold and/or italized form. Thus, before the printer may be commanded to execute a particular photocomposition task, it is necessary to select one or more master discs such as disc 152 containing the information outlined on FIG. 25 for each of the alphabets selected within which the text material is to be photocomposed. A bank of floppy disc drives 352-358 are therefore provided to receive the appropriately chosen master disc on which are recorded the various alphabet styles necessary for photocomposing the text as desired. It has generally been found to be desirable to place a blank floppy disc in one of the disc drives such as drive 358 and to dump onto such a disc, commonly referred to as a working disc, only the alphabet identification and character design information required from each of the plurality of master discs containing the various alphabet styles desired for execution of a particular photocomposition job. Thus, the operator of the printer will use keyboard 350 to command the printer to first custom design a working font disc by recording thereon only the information necessary from a plurality of previously recorded master discs. The working disc will include all of the information stored on the master disc pertaining to a particular alphabet including all numbers and punctuation symbols associated therewith, with the exception that the information recorded in bytes 240 and 256 is omitted as it is unnecessary for photocomposition in a selected point size and set size of a single alphabet. Thus, the information recorded in bytes 234 and 236 of the master disc is modified on the working disc to specify the selected set size and selected point size of the alphabet in which photocomposition is to take place.
Once the working disc has been properly formulated, a series of text composing, instructional commands are fed into the printer either from an on-line text composing keyboard, not illustrated, through interface 360 or from a previously prepared floppy disc inserted into one of the disc drives such as drive 356 so as to command operation of the printer to sequentially produce character designs on CRT 362 while appropriately controlling operation of the lens 14 and film transport 18, illustrated in FIG. 1, by appropriate control of the lens shutter 364, film clamp 366, feed motor 368 and lens motor 370. To assist the operator to properly control the printer, a display 372 is provided to permit display of information as it is being fed into the printer and/or to display messages regarding improper commands and/or to display instructions regarding appropriate steps necessary for completion of a particular photocomposition task.
Central control and command of the printer system occurs in a microprocessor based printer control circuit 374 which will be described below. Control of the floppy disc drives during both read and write functions is further implemented by a novel floppy disc controller 376 which has been designed especially to handle the variable sector format of the master and working discs. In order to recreate on the display screen of CRT 362 the successive character images necessary to compose the desired text, the printer control circuit 374 is designed to feed all of the three bit translational codes forming a description of the boundaries of a particular character into a character decoder 377. As will be explained in greater detail, the decoder 377 continuously cycles around the outline of the character until the CRT display has reproduced each portion of the character for recordation on the film master, not illustrated in FIG. 27. Since the character image is not always recorded on the master disc in all point sizes, X and Y multiplier circuits 378 and 380 are provided to multiply the coordinate information received from the character decoder by an appropriate scaling factor determined by the selected set size and point size recorded on the working disc so as to cause the CRT to display the character image in the appropriate point size. Collector circuit 382 receives the output from multipliers 378, 380 but records only a predetermined slice of the character image which, as will be explained, comprises only the information required for 16 successive vertical sweeps of the CRT display 362. Because conventional integrated circuitry does not operate at a sufficiently high rate, special high speed output memory boards 384, 386, 388 and 400 are provided. In this way, one pair of the output boards such as boards 384 and 386 may be supplying control signals to the CRT driver circuit 402 while the other two output boards 388 and 400 are receiving CRT control signals from collector board 382. A CRT beam brightness and deflection circuit 403 is connected to CRT driver circuit 402 in order to provide proper control of the CRT during recreation of each character image.
FIG. 28 discloses a more detailed schematic illustration of the printer control circuit 374 wherein a central processor unit 404, such as an Intel 8080 microprocessor based circuit group, is used for providing the central control to the printer system illustrated in FIG. 27. Through a direct memory access control circuit 406, the CPU 404 operates the floppy disc controller 376 to read out selected image data from the floppy disc and to dump this data into a 16K RAM board which may be referred to as a repertoire memory 407 which will be discussed in greater detail in reference to the floppy disc controller circuit 376 hereinbelow. A repertoire to decoder control circuit 408 is operable upon receipt of a command from control circuit 406 to cause encoded data representative of a single character to be dumped from the repertoire memory 407 into the decoder circuit 377 in order to thereby commence the process of generating the signals necessary to cause the CRT 362 to produce a photographable image of the character. The CPU 404 further controls a programmable counter circuit 410 having six separate counters independently programmable to appropriately control the motor which causes the lens 14 illustrated in FIG. 1 to be displaced in a horizontal direction along the line of print and the motor which feeds the film 16 as each print character is recorded on the CRT 12. In particular, the CPU programs a lens motor rate counter 412 and a lens motor step counter 414 so that the lens rate counter 412 may provide an output through a pulse generator 416 to cause the lens to advance in a horizontal direction as illustrated in FIG. 1. The lens motor step counter counts backward from the number stored therein by the CPU and produces a signal indicative of the completion of the translational movement required in order to photocompose the character image produced by the CRT. This signal is sent back to the CPU on line 418. A feed motor rate counter 420 and a feed motor step counter 422 are similarly programmed by the CPU to cause the film frame 18 of FIG. 1 to be translated in a vertical direction in accordance with the command signals of the CPU. In particular, rate counter 420 generates signals which are forwarded to pulse generator 424 which in turn control the movement of a film frame motor not illustrated. The direction of movement of both the lens and the film frame is controlled by a latch 426 which may be set by the CPU to produce appropriate direction signals for both pulse generators 416 and 424. Upon completion of the necessary film advance, the feed motor step counter 422 will produce a signal sent to the CPU 404 over line 428 to indicate completion of the commanded film advance. Yet another counter 430 is provided to receive a count indicative of the number of bytes in the series of stored three bit translational codes describing the boundary of a character image which is being transferred from the repertoire memory to the character decoder circuit 376. When the requisite number of bytes have been transferred by causing counter 431 to count back to zero, a signal is sent to the repertoire to decoder control 408 to indicate that the required number of bytes has been transmitted to the decoder circuit 376. This end of byte transfer signal is sent to the repertoire to decoder control 408 over line 432.
During initial start-up of the printer, a boot strap program from PROM 434 is transferred to CPU 407 to provide the necessary start up signals for the printer system. These start up signals serve to initiate the system and permit the main system program to be read from a previously encoded program disc. The boot strap program in PROM 434 is designed to cause this system program to be transferred from the program disc to a 16K program memory 436. The input/output decoder circuit 438 provides necessary control signals to the various circuit chips contained within the central processor unit 404. A latch circuit 440 under the control of the CPU 404 is designed to provide output signals to control lens and focus solenoids as well as to enable the CRT video circuitry. Appendix E includes the program permanently recorded in PROM 434 and Appendix F includes the main program for the printer stored on the program disc.
Attention is now directed to FIG. 29 which is a schematic illustration of the disc controller circuit 376. This controller is identical to the variable length sector controller 148 of the encoding circuit illustrated in FIG. 21 and is designed to operate with the novel discs encoded in accordance with the scheme illustrated in FIGS. 24 and 25. Some differences are necessary in order to permit the performance of certain specialized functions but the program listed in Appendix G is basically the same whether used in the circuit of FIG. 21 or FIG. 29. Referring now specifically to FIG. 29, each of the four disc drives 352, 354, 356 and 358 are illustrated as being connected to a latch circuit 450 which in turn is connected to the disc controller CPU 452. Like CPU 404 of FIG. 28, the disc controller includes an Intel 8080 microprocessor based chip group 452. Control signals received from the printer CPU illustrated in FIG. 28 operate in accordance with the program initially stored in PROM 454 to permit the disc controller to operate disc drives 352-358 in a manner to accommodate the novel variable sector length, data recording format disclosed in FIGS. 24 and 25. In particular, selection for drive of one of the disc drives by CPU 452 through latch 450 causes one of the corresponding read/write heads 352'-358' to respond to the magnetically recorded data stored in the various tracks of the magnetic discs. Signals received from the read heads are sent via line 456 to an edge detector circuit 455 designed to produce a composite series of pulses including both data and clock pulses corresponding to the data recorded on the respective discs inserted in the disc drive selected by latch 452. This series of composite data is sent to a data separator circuit 458 wherein the data pulses are separated from the clock pulses both of which are still in a serial form and are passed over separate lines to a byte separator counter 460. The serial data pulses are provided over line 462 while the clock pulses are supplied over line 464. Byte separator counter 460 operates as a serial to parallel converter by converting the serially received data pulses from 462 into parallel 8 bit bytes sent to disc controller CPU 452 over data lines 466. Under operation of the printer CPU 404, the disc controller CPU 452 transfers the program for operating the entire printer system from the program disc inserted in one of the disc drives into the main printer system program memory 436. Communication between the disc controller CPU 452 and the respective repertoire memory 407 and program memory 436 takes place through a direct memory access circuit 468. Appendix G includes a listing of the variable sector disc controller program stored in PROM Program store 454.
After the main printer system program has been read into memory 436, a master disc, a working disc and a photocomposition instruction disc may be inserted into respective disc drives to permit the process of photocomposition to commence. The various three bit translational code sequences describing character image boundaries are read from the master disc(s) into the working disc as required in accordance with the particular instructions recorded on the instruction disc. Once the working disc is completely formatted, the actual photocomposition function can commence by transfer of the three bit translational codes for the first character to be displayed on the CRT from the working disc to the repertoire memory 407. Moreover, the selected character point size and set size are also read from the disc and transmitted to appropriate positions within the printer system. Other necessary control information is read from the working disc and instruction disc to provide the necessary control information for operation of the system.
The first step in providing appropriate control signals to the CRT display begins by the transfer of boundary data from the repertoire memory 407 to a temporary boundary memory 476 over line 478. The data for two successive characters are transferred to the temporary boundary memory in order to permit simultaneous generation of CRT vertical scan signals in case the text generating instructions require the two successive letters to actually be superimposed to some degree in the final printed text material. When the temporary boundary 476 has been completely loaded, the system produces a decode ready signal at line 480 to cause a mode sequencer circuit 482 to provide an activating signal successively to four output lines 484, 486, 488 and 490. A parameter loading circuit 492 is connected to output line 484 and is thus first initiated upon activation of the mode sequencer circuit 482. This performs the function of causing the first several bits of encoded image data stored in temporary boundary memory 476 to be sent to the appropriate registers in the decoder circuit and multiplier circuits 378 and 380. In particular, parameter loading circuit 492 produces an X starting coordinate load enable signal on line 494 to cause the eleven bit X starting coordinate stored in temporary boundary memory 476 to be supplied over lines 496 to the X multiplier circuit circuit illustrated in FIG. 31. Subsequently, a Y starting coordinate load enable signal is supplied over line 498 to the Y multiplier board 380 in order to cause the Y coordinate to be supplied over lines 496 to the Y multiplier circuit which is a circuit identical to the circuit of FIG. 31.
A point size latch store enable signal is also sent to the Y multiplier circuit on output line 500 to cause a latch in the Y multiplier circuit to store a scaling number designed to cause the CRT to display the selected point size from information stored in the temporary boundary memory 476 which describes the character image in the encoded point size. Similarly, a set size latch store enable signal is sent to the X multiplier circuit 387 over line 502 in order to cause the X multiplier circuit to store the scaling number in a latch so that the multiplier circuit may appropriately scale the X coordinate data of each character image to cause the CRT to display each character image in the selected set size. Starting direction information stored in temporary boundary memory 476 is transferred to the direction determining circuit 504 upon receipt of a starting direction store enable signal received over line 506. The exact function of the direction determining circuit 504 will be described in greater detail hereinbelow. Mode sequencer circuit 482 then advances to provide an activating signal over line 508 in order to cause the first byte of boundary data to be loaded into the parallel to serial converter 518. Mode sequencer circuit 482 then advances to provide an activating signal on line 510 to cause the first three bits to appear at the outputs of parallel to serial converter 518. Finally, a commence decoding activating signal is provided over line 512 to the memory addressing circuit 514. The temporary boundary memory 476 connected with the memory addressing circuit 514 is then caused to read out the sequentially stored three bit translational codes describing the boundary coordinates of two successive characters which are to be photocomposed. The temporary boundary memory 476 operates by providing an output in 8 bit bytes over data lines 516 to an 8 bit parallel to a three bit parallel converter 518. The three bit bytes provided at the output of converter 518 on lines 520 are synchronized to correspond to the originally encoded three bit translational codes representative of the translational movements around the boundary of a character image starting at the point identified by the starting X-Y coordinates discussed above. A high speed decoding PROM 522 is permanently programmed (as indicated in Appendix H) to decode each three bit translational code to cause the addition of one, the subtraction of one, or no change in the previously recorded X coordinate in the X multiplier circuit 378 and similarly to add one, subtract one or make no change in the Y coordinate recorded previously in the Y multiplier circuit 380 during each of the next three successive clock cycles of the high speed decoding PROM 522. This operation has the function of generating the three succeeding X-Y coordinates for each of the dot positions described by the translational paths represented by the three bit translational codes described in FIG. 11 above. As each three bit code is shifted into the high speed decoding PROM 522, the direction determining circuit 504 operates to provide a signal on line 524 which operates to define the path set from which the next three bit code will select a translational path in accordance with the encoding scheme of FIG. 11. If the three bit code sent to the high speed decoding PROM 522 is a three bit binary zero, a signal is provided on line 526 to enable a zero detect circuit 528 to provide an indication as to whether the succeeding three bit code is a zero in which case an activating signal is provided on line 520 to the memory addressing circuit 514 which operates to terminate boundary data decoding since two succeeding three bit zero codes are indicative of the end of the boundary data as illustrated in FIG. 15. Note byte groups 300 and 308 of FIG. 25. If the after zero detect circuit 528 senses a three bit binary number 4(100), an activating signal is sent over line 532 to an extend logic circuit 534. This circuit operates to determine the number represented by the next three bit binary code and operates to recirculate the three bit binary number 4 previously sent to the high speed decoding PROM 522 two additional times plus a number of times equivalent to the three bit binary code number stored in the temporary boundary in a position immediately following the three bit binary four code. Extend logic 534 therefore serves to implement the special zero command dealing with straight line advance as described above with reference to the encoding scheme of FIG. 11. During the recirculating operation of the 8 bit parallel to 3 bit parallel converter, a hold signal is provided on line 538 to cause memory addressing circuit 514 to remain in a fixed state to prevent further 8 bit parallel bytes of data from being transferred out of temporary boundary memory 476. The add and subtract signals from the high speed decoding PROM 522 provided over output lines 540 are first set to a X-Y coordinate adjusting circuit 542 which provide up-down count signals on lines 544 in order to operate the X coordinate latch for the X multiplier circuit illustrated in FIG. 31. Similarly, up-down count signals are provided on lines 546 to operate the Y coordinate latch of the Y multiplier circuit 380.
The parameter loading circuit 492 further serves to load X and Y position adjusting constants in each of the X and Y multiplier boards in order to properly position the size adjusted character image on the line of type being photocomposed by the CRT display. To understand this function more clearly reference is made to FIG. 30a which discloses the image of a letter O in the point size in which the letter was initially scanned by the optical scanner 30. As is apparent from FIG. 30a, the lower most boundary of the letter O was drawn to touch the base line 552 and the left most boundary of the letter was initially drawn to touch the left reference line 554. Should the text editing program call for the system to photocompose in a point size and a set size different from that in which the character image was originally encoded, appropriate scaling numbers would be stored in the X and Y multiplier circuits, as discussed above, by means of enable signals produced in the parameter loading circuit 492 and sent to the respective multiplier circuits on lines 500 and 502. As further discussed above, the multiplier circuits are designed to scale each X and Y coordinate by multiplying the stored scaling number times each X and Y coordinate, respectively. If no further adjustment were made, the image of the letter O illustrated in FIG. 30a would appear in the form illustrated in FIG. 30b wherein the set and point size of the letter image would have been properly adjusted but the letter image would no longer appear in the proper position on the CRT display screen relative to the base line 552 and the reference line 554. Accordingly, it is necessary to add a position adjusting constant to each product of the multiplier circuits in order to reposition the letter image as desired relative to the base line and reference line. For example, by adding the constant b to each of the Y coordinates describing the image illustrated in FIG. 30b and similarly adding the constant a to each of the X coordinates describing the image, the letter image would be repositioned as illustrated in FIG. 30c, thereby achieving the point and set adjustment desired while maintaining the letter image on the line being photocomposed by the printer system.
Referring now in FIG. 31, the organization of the X multiplier circuit 378 is schematically illustrated in greater detail. The Y multiplier circuit 380 is identical to the circuit illustrated in 31 and therefore functions in exactly the same manner. In particular, the X starting coordinate is initially recorded in a X coordinate up-down counter 554 upon receipt of an enable signal on line 494 from FIG. 30. The decoder circuit of FIG. 30 is designed to synchronize the provision of the enable signal on line 494 with the output of the appropriate X starting coordinates on output lines 496 from the temporary boundary memory 476. The X coordinate up-down counter 554 is continually adjusted by the X-Y coordinate adjusting circuit 542 of FIG. 30 as the decoder circuit moves around the boundary of a character image stored in the temporary boundary memory 476 of FIG. 30. More particularly, as the high speed decoding PROM 522 receives a three bit translational code, the X-Y coordinate adjusting circuit 542 is commanded to successively change the X coordinate stored in the X coordinate up-down counter 554 by adding one, subtracting one, or commanding no change in order to define the X coordinate for each of the three dots maiking up the translational path represented by the three bit translational code then being decoded. A similar function is performed by a Y coordinate up down counter in the Y coordinate multiplier circuit. For example, the high speed decoding PROM 522 may be decoding a three bit binary number 5 while the direction determining circuit 504 indicates that the three bit code 5 identifies a translational path selected from path set T.sub.5 see FIG. 11. In this circumstance, the high speed decoding PROM 522 would command the Y coordinate up down counter to add one to the Y coordinate then stored in the counter and would send no signal to the X coordinate up down counter to add one to the Y coordinate then stored in the counter and would send no signal to the X coordinate up down counter thereby indicating that the first dot position in the translational path identified by the three bit binary number 5 being decoded was a dot whose position is spaced 1 dot above the preceding dot on the boundary of the character image being decoded. As is evident from FIG. 11, the decoding PROM 522 would, during its next cycle, command both the X and Y coordinate up down counters to add one to the then existing coordinates to indicate that the second dot in the three dot translational path was positioned at a 45.degree. angle upwardly to the right of the first dot in the three dot translational path. Finally, in decoding the three bit binary 5 number from path set T.sub.5, the decoding PROM would command the Y coordinate up down counter of the Y multiplier circuit to add one to the previously recorded Y coordinate while no change would be made in the number stored in the X coordinate up down counter 554 of FIG. 31. This last command would indicate that the third dot in the three dot translational path was spaced immediately above the second dot. It can now be seen that the high speed decoding PROM is arranged to operate the X-Y coordinate up down counters of the multiplier circuits 378 and 380 in a way to cause these counters to store successively the coordinates of the dots making up the translational paths defined by the encoded data originally placed on the master disc. This boundary data has previously been transferred by the system from the master disc, to the working disc, and from the working disc to the repertoire memory to the printer. From the repertoire memory, the boundary data was transferred to the temporary boundary memory 476 along with the boundary data of a second succeeding character from the temporary boundary, each succeeding three bit translational code is read out by converter 518 to allow the high speed decoding PROM to successively define the X-Y coordinates of each of the boundary dots making up the character boundary. It should be noted here that the coordinate numbers stored successively in the X and the Y coordinate counters have now been transformed into 11 bit binary numbers representative of the position of each boundary dot relative to the boundary of the field defined by the original optical scanner 30. For each X coordinate stored in the X coordinate up down counter 554, the multiplier array 556 is caused to cycle one time to produce at output 558 an 11 bit number equivalent to the product of the X coordinate stored in 554 times the point size scaling number stored in point size latch 560. Thus, the multiplier array 556 would be cycled one time during the period that counter 554 is retained at a value representative of the X coordinate of one dot on the boundary of an image character being decoded. Normally the multiplier array would be cycled three times in order to scale the X coordinate of each of the three dots represented by a single three bit translational code supplied to the decoding PROM 522 from the temporary boundary memory 476. However, in those instances where the three bit binary code is a zero code, the high speed decoding PROM 522 would either operate to identify a sharp turn three dot translational movement or a multi-length straight ahead movement involving up to 54 dots arranged in a straight line. The coordinates provided on output line 558 define the X coordinate of all dots on a character boundary adjusted from the encoded set size to the selected set size. Similarly, the output from the multiplier array of the Y multiplier circuit represent the Y coordinates of all dots on the boundary of the image character modified from the encoded point size to the selected point size. Referring again to FIG. 31, the X coordinates successively provided on output line 558 are fed into adder circuit 562 within which the position adjusting constant previously stored in constant latch 564 is added to provide on output line 566 a series of X coordinates to which the constant in latch 564 has been added in order to adjust the position of the image boundary as is necessary to cause the CRT to photocompose the image on the proper print line of the photo sensitive master being used to record the successive characters reproduced on the CRT display screen.
Following each cycle of the multiplier circuits the outputs from the adder circuits of both the X multiplier and the Y multiplier are sent to the collector circuit 382 (FIG. 27). FIG. 32 is a schematic illustration of a simplified version of the collector circuit. Included in the input of the collector circuit are a pair of coordinate transfer registers 580 and 582 for receiving the Y coordinate numbers and the X coordinate numbers, respectively from the output circuits of the Y and X multipliers. The coordinate numbers entering the registers 580 and 582 are in an 11 bit byte format. The seven most significant X coordinate bits from register 582 are sent to an eight bit byte comparator 584 for comparison with a number received from an eight bit character slice identifying counter 586. To understand the purpose of the counter 586, consider the character image illustrated in FIG. 33, in which the letter image has been divided into a plurality of vertical slices S.sub.1 through S.sub.x. Each slice encompasses, conceptually, an integral number of beam sweeps of the CRT display in a vertical direction. In the preferred embodiment each vertical slice of the character encompasses 16 adjacent vertical beam sweeps of the character image. Accordingly, the output of counter 586 is provided to comparator 584 over line 588 in the form of an eight bit binary number starting with number 1 and advancing one count each time that the CRT beam completes the display of the character image data contained in one slice. Since the CRT in the preferred embodiments actually sweeps each vertical line three times, the CRT beam will scan the screen 48 times for each advance in the count stored in the character slice identifying counter 586. The comparator 584 compares the number stored in the counter 586 with only the seven most significant X coordinate bits stored in register 582 provided to the eight bit comparator over output line 600. Whenever the comparator 584 determines that the number represented by the eight most significant bits in register 582 is equal to the count stored in counter 586, a signal is produced on comparator output line 602 indicative of the fact that the X and Y coordinate then being stored in registers 580 and 582 define a coordinate within the character slice identified by the count stored in counter 586. To understand this function of the collector circuit more clearly, it should be recalled that the three bit translational codes stored in the temporary boundary memory 476 of the decoder illustrated in FIG. 30, are representative of successive translational movements around the boundary of a stored image character. Accordingly, the X and Y coordinate numbers successively stored in registers 580 and 582 will define the coordinate position of each and every dot on the boundary of a character image reproduced in a dot matrix as the high speed decoding PROM 522 proceeds to decode the three bit translational codes in the order in which these codes are stored in the temporary boundary memory 476. As the boundary dots move into the dot matrix slice conceptually identified by the number stored in counter 586, a positive output signal appears on the output of eight bit comparator 602 in order to signal that the numbers stored in registered 580 and 582 are indicative of the X--Y coordinate of a dot actually appearing within the identified slice. A positive signal appearing on output line 602 is sent to one of the output random access memories 384, 386, 388 or 400, FIG. 27, in order to cause an appropriate signal to be stored therein as will be discussed hereinbelow.
While the basic collector circuit illustrated in FIG. 32 will operate satisfactorily to control the output memories in the manner described above, specialized circuitry is required in order to solve a particular decoding problem which can be better understood by reference to FIGS. 34-36. Referring first to FIG. 34, there is illustrated a graphic representation of the type of information which appears successively in X and Y coordinate registers 580 and 582 as the high speed decoding PROM proceeds to decode successively the X--Y coordinate positions of the boundary dots represented by the boundary data stored in the temporary boundary memory 476. In particular, FIG. 34 represents a slice of a dot matrix corresponding to the elemental areas on the display screen of a CRT. Each vertical column of dots would be touched by a vertical sweep of the CRT beam and thus the storage of coordinate data representative of selected dots in such a dot matrix could be used to turn the CRT beam on and off at selected times in order to recreate a character image on the CRT screen by a process which is basically the reverse of the optical scanning procedure described in detail with reference to FIG. 14 above. In FIG. 34 the solid dots D represent dots whose X--Y coordinates are stored in one of the output memories by the collector circuit of FIG. 32. Thus, as the beam of the CRT moves vertically along the beam sweep paths indicated by letter BS.sub.1 through BS.sub.9 the output random access memory could be accessed to determine whether coordinates have been stored representative of a boundary dot as each corresponding elemental area of the display screen is swept by the beam. Normally, the CRT conceptually should encounter only two boundary dots as it crosses into and out of the character image being recreated such as would occur in an upward sweep along the path identified by BS.sub.1. As the CRT beam encounters dot D.sub.1, the beam would be turned on and would remain on until dot D.sub.2 is encountered at which point the beam would be turned off. By this technique, all of the intervening dots would be illuminated on the display screen of the CRT as indicated by the circular dots containing an X. In some instances, however, successive boundary dots will be recorded in memory identifying successive boundary dots identifying successive vertical locations along a particular vertical sweep pattern such as indicated by the sweep path identified as BS.sub.4 in FIG. 34. Here dots D.sub.3 and D.sub.4 having the same X coordinate are located on the lower boundary while dots D.sub.5 and D.sub.6 located on the upper boundary line also have the same X coordinate. The image recreating circuitry can easily take care of this situation by turning the CRT beam on upon the detection during its sweep of a boundary dot after which the beam is left on until the beam has swept through at least one dot position at which no boundary dot has been recorded followed by one or more successive boundary dots at the termination of which the CRT beam is turned off. Thus, if CRT beam is swept upwardly along path BS.sub.4, the beam would be turned on upon detection of a boundary dot at D.sub.3 and would remain on until the circuitry determines that no boundary dot is recorded at the position above boundary dot D.sub.5 at which point the CRT beam would be turned off.
Circuitry of this type would take care of all circumstances except for that illustrated in FIG. 35 wherein the boundary of the image stored in memory follows a turn-around path within the character slice being displayed by the CRT. Without specialized circuit controls, the movement of a CRT beam upwardly along the conceptual beam sweep path BS.sub.4 would result in the beam being turned on at dot D.sub.7 and left on continuously for the remainder of the beam sweep. Thus, those elemental areas of the CRT screen display represented by the dots above D.sub.8 would be improperly illuminated. The problem created by a situation such as illustrated in FIG. 35 where the boundary dots sweep out a turnaround path within a particular character slice can be corrected as illustrated in FIG. 36. In particular, the boundary dot stored at the position identified by dot D.sub.8 in FIG. 35 has been moved up by one vertical position to the position identified by D.sub.9. Thus, operation of the beam control circuitry described with reference to FIG. 34 would cause the CRT beam to properly turn on while sweeping between dots D.sub.7 and D.sub.9 as the beam sweeps along path BS.sub.4 regardless of whether the beam is sweeping upwardly or downwardly. When the data is initially encoded, as noted above with regard to FIG. 21, boundary dots are normally stored as indicated in FIG. 36 since the microprocessor 146 has been programmed to automatically modify data appearing in the format of FIG. 35 to be transformed to the format illustrated in FIG. 36. Nevertheless, during the process of modifying the size of character boundary data by operation of the multiplier array 556 and adder 562 of FIG. 31, a boundary dot such as boundary dot D.sub.9 of FIG. 36 might be moved in juxtaposition to the boundary dot indicated by D.sub.10. Thus, improper control of the CRT beam could result such as illustrated in FIG. 35.
To correct this problem, the circuit of FIG. 32 can be modified as indicated in FIG. 37. In particular, X coordinate comparator 604 is designed to compare the X coordinate stored in X coordinate register 582 with the next X coordinate supplied on line 566 to determine whether the X coordinate is changing positively or negatively. If the X coordinate is increasing, a signal is provided at output 608. If the X coordinate is changing negatively, an output is sent on line 610. A turn detector circuit 612 compares the output supplied by 608 or 610 with the output of the X coordinate comparator which was previously sent to turn detector 612. If a positive change is followed by a negative change or a negative change is followed by a positive change, the X turn detector 612 produces an output signal on line 614 which is designed to enable up/down counter 616 to add or subtract one from the number stored in the Y coordinate register 580. In order to decide whether to add or subtract one from the Y coordinate, a Y direction indicator 617 is connected with the Y coordinate comparator 606 arranged to provide an output if the previous Y coordinates indicate movement upwardly along the vertical sweep of the boundary in which case the Y coordinate stored in the Y coordinate register 580 should be increased by one to move the stored dot one position above the position in which it would have otherwise been stored. On the other hand, if the Y coordinate comparator 606 indicates that the movement in the Y direction is generally downward by comparing previous succeeding Y coordinates, no output signal is provided by comparator 606 thus causing the up/down counter 616 to subtract one from the Y coordinate upon an enable signal provided from the X turn detector 612. If no output is received from the X turn detector 612, the up/down counter operates merely as a transfer register and causes transfer of the number stored in the Y register 580 to the memory board as will be discussed hereinbelow. Since the Y coordinates are delayed by one clock cycle, shift register 628 is required to delay similarly the X coordinate data provided to the output memory. The write command from comparator 584 is also passed through a one cycle delay in shift register 629.
The collector circuit design of FIG. 37 is adequate for handling stored character data indicative of a turn around boundary configuration, such as illustrated in FIGS. 35 and 36 above, except when two successive X--Y coordinates identify the same end position on an X turn around line such as dot D.sub.8 on beam sweep line BS.sub.4 of FIG. 35. In such circumstances, the addition of 1 to the Y coordinate of one of the two identical X--Y coordinates, would not have the effect of creating a dot storage void such as indicated at position D.sub.11 in FIG. 36 since the remaining X--Y coordinate will identify this position and cause a record of it in the output memory. The problem of succeeding identical coordinates results, as explained above, from the operation of the multiplier circuit of FIG. 31 wherein the X-Y coordinate data may be scaled down by a factor of 1/3 or more. To overcome this problem, a circuitry of FIG. 37 can be modified as illustrated in FIG. 38 to provide a data output AND gate 632 which normally operates to provide a series of binary O signals in synchronization with the clock rate of the circuit with the zeroes being inverted and presented to the random access output memory for storage therein at the locations accessed by the successive coordinate data. The output memory can be visualized as a matrix of storage cells corresponding to the dot matrix on which the character boundary is described by the X-Y coordinates successively provided by the collector circuit. Since the inverted data generator output of 632 normally provides ones as input to the memory, and the X-Y coordinates supplied from the collector circuit causes ones to be stored within the output memory at bit storage cell locations corresponding to the boundary dots on a dot matrix describing the character outline which it is desired to reproduce on the CRT display. It should now be apparent that the problem posed by successive X-Y coordinates describing the terminal position on an X turn around line can be solved by simply causing the AND gate data generator 632 to produce an output one instead of a zero which when inverted will cause a zero to be stored in the output memory at the terminal dot location. This function is accomplished by supplying, as input to the AND gate 632, a binary one signal indicative of the existence of a turn around line simultaneously with a binary one signal indicating that two successive X-Y dots are both located at the terminal point on the X turn around line. Of course the necessary timing and sequencing of such signals with regard to the sequence in which the X-Y coordinates are presented to the output memory is somewhat difficult to achieve. The circuitry of FIG. 38 accomplishes this result by modifying the Y coordinate comparator 606 to produce a Y coordinate equal signal on line 624 whenever the Y coordinate stored in register 580 is equal to the succeeding Y coordinate being supplied as input to such register. This Y coordinate equal signal is provided to a shift register 630 which is designed to delay the application of the Y coordinate equal signal to the AND gate data generator 632 for two clock cycles in order for the appropriate terminal point describing coordinate to be shifted to the output memory at which it is held in a register so that on the third cycle following detection of the Y coordinate equality, a binary zero will be stored in the indicated memory storage cell rather than a binary one as would have otherwise been stored. In order to properly synchronize the appearance of an X turn indicating signal at the second input to AND gate data generator 632, the outout from X turn detector 612 is passed through a one clock cycle delay to flip flop 634. Because an additional clock cycle delay is required in the write command the output from comparator 584 is passed through a two clock cycle delay register which may be additional stages in shift register 630.
As already mentioned, the output from delay shift register 628 is subjected to an additional one clock cycle delay by means of a register in the output memory which will be described with reference to FIG. 45. The seven most significant Y coordinate bits are similarly delayed by a register in the output memory. However, the least significant bits in each Y coordinate are delayed for one clock cycle by register 626 after which the coordinate bits stored therein are used to immediately access the output memory.
To understand more clearly the operation of the circuit in FIG. 38, note FIGS. 39-43 wherein an X turn around boundary line is indicated by a plurality of dots D.sub.1 through D.sub.8 making up a portion of a dot matrix. These successive Figures show the manner by which the X-Y coordinates corresponding to the successive dots are processed during each of a plurality successive clock cycles of the system. In particular, the solid dots represent corresponding output memory storage cells in which a binary one has been stored using the coordinate data supplied by the collector of FIG. 38 while the dashed circles represent dots whose X-Y coordinates are still being processed by the system circuitry. A dot which is only half filled in is indicative that the X-Y coordinates are then being used to access the output memory to cause a binary 1 to be stored therein. With particular reference to FIG. 39, it can be seen that the dots D.sub.6 and D.sub.7 have identical X-Y coordinates and are positioned at the terminal point on an X turn around line corresponding to a CRT beam sweep BS.sub.x. If the coordinates of dot D.sub.3 are being used to access the output memory, the coordinates of dot D.sub.4 would be stored in the input stage of the registers of the output memory with the exception that the four least significant Y coordinate bits would be stored in register 626 of FIG. 38. The Y coordinates of dot D.sub.5 would be located in up-down counter and transfer register 616 while the X coordinate of dot D.sub.5 would be held in register 628. The coordinates of dot D.sub.6 would be located in transfer registers 580 and 582 with the coordinates of dot D.sub.7 being presented to the input of registers 580 and 582. This condition would result in an output on lines 624 of the Y coordinate comparator 606 to store a one in the first stage of shift register 630 indicating that the Y coordinates of dots D.sub.6 and D.sub.7 are equal. During the next clock cycle, FIG. 40, the coordinates of dot D.sub.4 would be used to access the output memory while the coordinates of dot D.sub.6 would be moved to up-down counter and transfer register 616 and delay register 628. During this clock cycle, the coordinates of dot D.sub.7 would reside within registers 580 and 582 with the coordinates of dot D.sub.8 being presented to these registers as input. Accordingly, the X turn detector circuit 612 will produce an output indicating that an X turn around is about to occur thus storing a binary one in effect in the flip flop delay 634. During the next clock cycle, as represented in FIG. 41, the Y coordinates of dot D.sub.7 will have been transferred to up-down counter and transfer register 616 and the binary one will have been shifted out of flip flop 634 so as to cause the up-down counter 616 to be enabled. A previous indication from the Y direction indicator circuit 617 that the Y coordinates were moving in an upward direction would result in the up-down counter 616 adding one to the Y coordinate of dot D.sub.7 thereby moving the position indicated for this dot to that illustrated in FIG. 41. During the clock cycle of FIG. 41, the "Y coordinate equals" signal will have been transferred from the register 630 as a binary one to the input of AND gate data generator 632 simultaneously with the binary one "X turn indication" from flip flop 634 so as to produce a binary one on the output 622 of AND gate data generator 632. Thus, during the clock cycle represented by FIG. 42, the coordinates of dot D6 will be used to access the output memory and will cause a binary zero (resulting from the inversion of the binary one produced by a gate 632) to be stored in the memory location identified by the coordinates of dot D.sub.6. During the final clock cycle represented in FIG. 42, a binary one will be stored at the location in the output memory represented by the coordinates of dot D.sub.7, the Y coordinate of which has been increased by one during the clock cycle illustrated in FIG. 41.
The circuit of FIG. 38 is particularly advantageous because it insures that one dot position between the terminal points of an X turn around line will always be left open regardless of the number of dots in the line and regardless of the number of identical successive coordinates which identify the terminal dot on an X turn around line.
FIG. 44 discloses an output memory board control 644 synchronized with the operation of the collector circuit in such a way as to cause the data generated by the collector circuit to be sent to one of the four high speed random access output memories 384, 386, 388, and 400 as illustrated in FIG. 27. In particular, only one of the four output memory circuits is designed to collect data from the collector circuit of FIG. 38 at any one time. Each output 646, 648, 650 and 652 connected, respectively, to output memories 384, 386, 388 and 400 are successively energized to direct the data generated in the collector circuit to the appropriate output memory while the output on lines 654 and 656 is designed to permit the data stored in the high speed random access memories 384 through 400 to be read out and used to control the operation of the CRT display. For reasons which will be discussed in more detail hereinbelow, memory 384 is used to collect data for controlling the CRT in order to create a first character image while memory 386 is used to collect data on a succeeding character image intended for photocomposition adjacent to the image stored in memory A. Similarly, the image data collected in memories 388 and 400 is also descriptive of characters which are to be photocomposed in succeeding positions in the textual material being photo composed. Thus the outputs from 654 and 656 are designed to cause memory boards 384 and 386 to read out character data simultaneously while output 652 is designed to cause memories 388 and 400 to output data simultaneously. The chart in FIG. 44 shows the condition of memories 384, 386, 388 and 400 in succeeding time intervals represented by rows T.sub.1, T.sub.2, T.sub.3 and T.sub.4.
Turning now to FIG. 45 one of the four high speed random access output memory circuits is disclosed which, for purposes of discussion, could be output memory 384 of FIG. 27. The remaining output memories 386, 388 and 400 are identical in construction and in operation. The random access memory is made up of two columns of sixteen one K by one bit random access memory circuits 679 such as an Intel 8102A random access memory. This composite random access memory is illustrated generally at 680 of FIG. 45. The random access memory 680 can be imagined as a matrix of storage cells having sixteen rows with each row having 2048 storage cells. Thus, the four least significant digits of the X coordinate number stored in register 642 may be combined with the seven most significant bits stored in the up-down counter and register 616 of FIG. 38 in order to define the appropriate column out of the 2048 columns defined by the random access memory 680. The four bit X coordinate number provided on output line 642 become the most significant bits in the 11 bit number while the seven bits of Y coordinate data supplied on line 640 become the least significant bits in the eleven bits in the eleven bit column identifying number. The four least significant bits stored in the Y register 626 are used to identify the appropriate row out of the 16 possible rows in the random access memory 680. Referring more particularly to FIG. 45, the four least significant X coordinate bits are stored in an address register 682 while the seven most significant bits of the Y coordinate are stored in address register 684. Finally, the four least significant bits of the eleven bit Y coordinate number are provided to the wire clock control 688. If, as noted above, the random access memory 680 is visualized as a matrix of storage cells having 2048 columns and 16 rows, the numbers stored in register 682, being the most significant, will identify 16 groups of columns with each group including 128 columns of 16 storage cells each. The number stored in register 684 will define which of the 128 columns in each group is to be accessed while the number supplied to the write clock control circuit 688 on line 638 will define the actual storage cell in the identified column which is to be accessed. If each vertical sweep of the CRT screen is assigned 2048 elemental areas, then each group of 128 columns in the random access memory would correspond to one of sixteen succeeding vertical sweeps of the CRT display screen. Identification of one of the columns within one of these groups of columns could then be visualized as an identification of one of 128 sections positioned vertically along a particular vertical sweep while the number stored in register 688 identifies a particular position within one of these sections of a vertical sweep. Under control of the write signal supplied on line 636 by the collector circuit of FIG. 38 the data signal supplied to the random access memory from the data generator 632 over output line 622 has the effect of placing a binary 1 in a storage cell of the random access memory at a position which corresponds to a boundary point along the vertical sweep line of each of the sixteen sweep paths making up a character slice being displayed conceptually on the CRT of the printer. During the read out phase of operation of the random access memory 680 initiated by a control signal supplied on line 654 a 16 bit high speed parallel to serial shift register 690 is employed to successively read out the data stored in each of the 2000 columns of storage cells. Since 128 such columns are equivalent to a single vertical sweep of the CRT screen, the CRT driver circuit, to be described in greater detail hereinbelow, is arranged to synchronize the CRT beam sweep so that one sweep is completed for each 128 cycles of the 16 bit high speed parallel to serial shift register 690. During each cycle, the data recorded in each of the 16 storage cells contained in a column of such cells is read into the shift register in parallel fashion and is provided to the output 692 in serial fashion. A video turn on and off logic circuit 694 receives the output on line 692 to provide a video enable signal at output 696 in accordance with the logic function discussed with relation to the necessary control signals for properly illuminating the dots in beam sweep BS.sub.4 of FIG. 34. In other words, the output on line 696 should go high upon detection of the first stored binary 1 supplied on output 692 and should remain high until a stored zero is detected followed by another zero separated by one or more ones.
Referring now to FIG. 46, the CRT driver circuit 402 is illustrated wherein video signals are provided simultaneously either on 696 and 698 or on 700 and 702. An OR gate 704 operates to provide the final video "on" signal on line 706 whenever any one of the output lines 696, 698, 700 and/or 702 provides a video enable signal. As noted above, the boundary data for two succeeding characters on a line of print actually being photocomposed are transmitted to the temporary boundary memory 476 of decoder circuit 376 (FIG. 27). The decoded signals representing the image of one character can thus be stored in one output memory (such as memory 384) and the decoded signals representing the image of the second character can be subsequently stored in another output memory (such as memory 386). Operation of OR gate 704 thus will cause the CRT beam to be turned on and off by the output of either of the two output memories from which data is being read out, whereby the CRT beam is appropriately controlled even if the character images are to be composed in an overlapped arrangement. This capability gives the subject system maximum flexibility and allows the photocomposer to adjust the spacing between letters in order to obtain the best possible fit or to achieve a special effect such as by running two letter designs in an overlapped condition.
As referred to in reference to FIG. 1, the lense 14, which projects the image from CRT 12 onto the photosensitive master 16, is displaced in steps along a horizontal track by means of a stepper motor (not illustrated). The amount and timing of lens 14 displacement defines the lines of print being photocomposed on master 16 and further defines the spacing between letters and between word forming groups of letters. The photocomposition instructions from circuit 8 concerning the margin spacing indentation and special letter spacing (curning) are combined by the printer control 374 (FIG. 27) with the spacing information received from the working disc including encoded alphabet set size and selected set size and character width information to provide the control signals for the lens stepper motor.
Deflection of the CRT beam is, of course, synchronized with the receipt of character information on the CRT 362 and with the movement of the lense 14 by horizontal deflection circuit 708 and vertical deflection circuit 710. The horizontal deflection circuit is advanced to cause the vertical scan line being illuminated on the CRT display to be moved horizontally in sequence with the movement of the lens as each vertical of a character is exposed on the CRT display. In this way, the same display area of the CRT is not continually exposed during the photocomposition process. Control information from the printer control is provided to the horizontal deflection circuit 708 on line 712 while the lens stepper motor control signal is supplied to the vertical deflection circuit on line 714. The brightness of the CRT is adjusted by a signal from circuit 403, FIG. 27, supplied to CRT 362 on line 718.
It is now apparent that a revolutionary system of photocomposition has been disclosed capable of achieving extremely high resolution in the images of type characters formed on an electronic display by signals generated from a practical storage system. Numerous additional benefits and advantages can now be appreciated from the above detailed description of the preferred embodiments. ##SPC1## PG,83 ##SPC2## ##SPC3## ##SPC4## ##SPC5## ##SPC6##
Having described the preferred embodiment of the subject invention and having described numerous specific functional improvements which result therefrom, what is believed to be new and patentable is set forth in the following claims:

Claims

1. A method for forming a magnetic font disc upon which alphabet character designs are recorded by coded binary signals stored by magnetically altering a plurality of ordered storage cells permitting retrieval of the signals to enable an electronic display to generate successive optical character images as selectively desired, comprising the steps of
(a) scanning an optical image of a character design having at least one closed boundary contour in a predetermined line scanning pattern relative to a predetermined reference;
(b) generating in succession coordinate signals representative of the coordinates of boundary points defined by the intersection of the boundary contour of the character design with the line scanning pattern;
(c) converting the coordinate signals into successive encoded binary signals describing successive end to end translational paths between successive plural boundary points selected from a set of possible translational paths to best approximate the boundary contour by starting at a first boundary point and continuing around the entire boundary contour in successive ordered steps different from the order in which the coordinate signals are generated in step (b) until the first boundary point is again reached; and
(d) storing all of the encoded binary signals for a single character design in successive storage cells of the magnetic font disc in an order corresponding to the order of the successive end to end translational paths.
2. A method for forming a magnetic font disc upon which alphabet character designs are recorded by coded binary signals stored by magnetically altering a plurality of ordered storage cells permitting retrieval of the signals to cause an electronic display to generate successive optical character images as selectively desired, comprising the steps of
(a) scanning an optical image of a character in a predetermined scan line pattern relative to a predetermined reference to generate coordinate signals representative of the coordinates of boundary points defined by the intersection of the boundary contour of the character with each line of the scan line pattern, including the steps of
(1) projecting a shadow image of the optical character image onto a linear array of photocells,
(2) scanning the linear array of photocells to produce a serial stream of binary signals with one signal level indicative of a photocell which is illuminated and another signal level indicative of a photocell which is not illuminated,
(3) converting the serial stream of binary signals into successive multi-bit bytes of scan data,
(4) responding to each transition from one binary level to another binary level in the multi-bit bytes by storing a multi-bit binary signal representative of a coordinate position of the transition from one binary level to another binary level, and
(5) storing temporarily the multi-bit binary signals in successive storage locations of a magnetic disc;
(b) converting the coordinate signals into successive encoded binary signals describing successive end to end translational paths between boundary points selected from a set of possible translational paths to best approximate the boundary contour; and
(c) storing all of the successive encoded binary signals for a single character in successive storage cells of the magnetic font disc.
3. A method as defined in claim 2, wherein step (b) includes the steps of (1) transfering the magnetic disc to an encoding system having a random access memory and (2) transfering the multi-bit binary signals to the random access memory for selective retrieval during the process of converting the coordinate signals into the encoded binary signals.
4. A method as defined in claim 3, wherein step (b) further includes the step of eliminating all coordinate signals which are separated in the scan line direction from another coordinate signal by a selectively variable criteria dependent upon the amount of size alteration to which the character images are to be subjected.
5. A method as defined in claim 4, wherein the selectively variable criteria includes one criteria whereby the position represented by each acceptable coordinate signal must be separated in the scan line direction from the position represented by any other coordinate signal by a distance equal to at least 6 consecutive photocell positions indicative of a character image followed by a distance equal to at least 9 consecutive photocell positions indicative of a non character image and another criteria whereby the position represented by each acceptable coordinate signal must be separated in the scan line direction from the position represented by any other coordinate signal by a distance equal to at least 4 consecutive photocell positions indicative of a character image followed by a distance equal to at least 6 consecutive photocell positions indicative of a non character image.
6. A method for forming a magnetic font disc upon which alphabet character designs are recorded by coded binary signals stored by magnetically altering a plurality of ordered storage cells permitting retrieval of the signals to cause an electronic display to generate successive optical character images as selectively desired, comprising the steps of
(a) scanning an optical image of a character in a predetermined scan pattern relative to a predetermined coordinate reference to generate coordinate signals representative of the coordinates of boundary points defined by the intersection of the boundary contour of the character with corresponding points in the scan pattern;
(b) converting the coordinate signals into successive encoded binary signals describing successive end to end translational paths between boundary points selected from a set of possible translational paths to best approximate the boundary contour; and
(c) storing all of the successive encoded binary signals for a single character in successive storage cells of the magnetic font disc, further including the steps of
(1) transferring a first coordinate signal to a magnetic disc having a plurality of ordered storage cells arranged in successive concentric circles,
(2) converting a predetermined number of coordinate signals representative of a first predetermined number of successive boundary points encountered in a first translational movement from the first coordinate in one direction along the character boundary into an encoded binary signal identifying out of the set of possible translational paths the translational path which best describes an incremental line segment pattern interconnecting the first predetermined number of boundary points,
(3) converting an additional number of coordinate signals representative of an additional predetermined number of successive boundary points encountered in an additional translational movement in the one direction starting at the termination point of the preceding translational movement into an encoded binary signal indentifying out of the set of possible translational paths the translational path which best describes an incremental line segment pattern interconnecting the additional predetermined number of boundary points,
(4) repeating step (3) of this claim until all of the coordinate signals describing all of the boundary points of a particular image boundary have been converted to successive encoded binary signals, and
(5) storing in order the successive encoded binary signals for a single character image in successive storage cells on the magnetic disc following the storage cells containing the first coordinate signals.
7. A method as defined in claim 4, wherein the number of binary bits making up each successive encoded binary signal is less than the number of binary bits required to uniquely define each of the translational paths in the set of possible translational paths and wherein step (b) of claim 6 includes converting each coordinate signal into an encoded binary signal representative of a translational path selected from a subset of the total set of possible translational paths, said subset being defined by the general direction in which the previous translational movement along the character boundary took place.
8. A method as defined in claim 7, wherein each encoded binary signal includes 2 to 6 bits and the total path set includes 8 to 48 paths.
9. A method as defined in claim 7, wherein each encoded binary signal includes at least 3 bits and the total path includes 24 paths.
10. A method as defined in claim 9, wherein the total path set includes 24 separate paths starting from a common point in an X, Y orthogonal point matrix to each of 24 peripheral terminal points spaced 3 points from the common point and wherein the first octant of paths starting on the horizontal includes a first path formed of end to end line segments interconnecting points (0,0) (1,0) (2,0) (3,0), a second path formed of end to end line segments interconnecting points (0,0) (1,0) (2,1) (3,1), a third path formed of end to end line segments interconnecting points (0,0) (1,1) (2,1) (3,2) and a fourth path formed of end to end line segments interconnecting points (0,0) (1,1) (2,2) (3,3) and wherein each succeeding octant of paths is formed of a mirror image of the paths contained in the preceeding octant of paths taken along the line joining the two succeeding octants.
11. A method as defined in claim 7, wherein the subset of paths from which each succeeding translational path is selected includes a first subset of paths formed of those paths most likely to be needed to describe the succeeding binary points and a second subset of paths formed of those paths less likely to be needed to describe the succeeding boundary points.
12. A method as defined in claim 11, wherein each encoded binary signal uniquely describing the paths within the first subset includes X binary bits and wherein each encoded binary signal uniquely describing the paths within the second subset include 2X binary bits.
13. A method as defined in claim 12, wherein the subset of paths from which each succeeding translational path is selected includes a straight ahead path including an integral number of straight translational movements the direction of which is defined by the general direction of the last translational movement and the number of which is defined by the number represented by the next succeeding X binary bits.
14. A method as defined in claim 13, wherein X equals 3 and wherein the straight ahead path is identified by an encoded binary signal including at least 9 bits.
15. A method as defined in claim 14, wherein the number of boundary points described by each path in the first and second subsets is 3 exclusive of the starting point and the number of boundary points described by a straight ahead path is equal to 9 plus 3 times the number represented by the next succeeding binary bits exclusive of the starting point.
16. A method for forming a magnetic font disc upon which alphabet character designs are recorded by coded binary signals stored by magnetically altering a plurality of ordered storage cells for selective retrieval of the signals to enable an electronic display to accurately create optical character images as selectively desired, comprising the steps of:
(a) scanning an optical image of a character design having at least one closed boundary contour in a predetermined line scanning pattern relative to a predetermined reference;
(b) generating in succession coordinate signals representative of the coordinates of boundary points defined by the intersection of the boundary contour of the character with the line scanning pattern;
(c) temporarily storing said coordinate signals in an accessible memory;
(d) designating one of the coordinate signals from a character design as a starting coordinate and successively retrieving the stored coordinate signals representing successive boundary points encountered in successive movements around the entire character boundary contour beginning at the starting coordinate;
(e) converting the retrieved coordinate signals into successive encoded binary signals describing successive end to end translational paths between selected boundary points selected from a set of possible translational paths to best approximate the position of the successive boundary points by starting at the starting coordinate and continuing around the entire boundary contour in successive ordered steps different from the order in which the coordinate signals are generated in step (b) until the starting coordinate is reached;
(f) repeating steps (d) and (e) for each additional boundary, if any, of the character design scanned in step (a); and
(g) storing the starting coordinates and all of the successive encoded boundary signals for one character in an order corresponding to the order of the successive end to end translational paths in successive storage cells of the magnetic font disc.
17. A method for forming a magnetic font disc upon which alphabet character designs are recorded by coded binary signals stored by magnetically altering a plurality of ordered storage cells for selective retrieval of the signals to cause an electronic display to accurately create optical character images as selectively desired, comprising the steps of:
(a) scanning an optical image of a character in a predetermined scan line pattern relative to a predetermined reference to generate boundary signals representative of the coordinates of boundary points defined by the intersection of the boundary contour of the character with each line of scan line pattern, including the steps of
(1) projecting a shadow image of the optical character image onto a linear array of photocells,
(2) scanning the linear array of photocells to produce a serial stream of binary signals with one signal level indicative of a photocell which is illuminated and another signal level indicative of a photocell which is not illuminated,
(3) converting the serial stream of binary signals into successive multi-bit bytes of scan data,
(4) responding to each transition from one binary level to another binary level in the multi-bit bytes by storing a multi-bit binary signal representative of coordinate position of the transition from one binary level to another binary level, and
(5) storing temporarily the multi-bit binary signals in successive storage locations of a magnetic disc;
(b) temporarily storing said coordinate signals in an accessible memory;
(c) designating one of the coordinate signals from a character as a starting coordinate and successively retrieving the stored coordinate signals representing successive boundary points encountered in successive movements around the character boundary beginning at the first coordinate point following the starting coordinate;
(d) converting the retrieved coordinate signals into successive encoded binary signals describing successive end to end translational paths between selected boundary points selected from a set of possible translational paths to best approximate the position of the successive boundary points;
(e) repeating steps (c) and (d) for each additional boundary, if any, of the character image scanned in step (a);
(f) storing the starting coordinates and all of the successive encoded binary signals for one character in successive storage cells of the magnetic font disc.
18. A method as defined in claim 17, wherein step (b) includes the steps of (1) transfering the magnetic disc to an encoding system including a random access memory and (2) transferring the multi-bit binary signals to the random access memory for selective retrieval during the process of converting the coordinate signals into the encoded binary signals.
19. A method as defined in claim 18, wherein step (b) further includes the step of eliminating all coordinate signals which are separated in the scan line direction from another coordinate signal by selectively variable criteria dependent upon the amount of size alteration to which the character images are to be subjected.
20. A method as defined in claim 19, wherein the selectively variable criteria includes one criteria whereby the position represented by each acceptable coordinate signal must be separated in the scan line direction from the position represented by any other coordinate signal by a distance equal to at least 6 consecutive photocell positions indicative of a character image followed by a distance equal to at least 9 consecutive photocell positions indicative of a non character image and another criteria whereby the position represented by each acceptable coordinate signal must be separated in the scan line direction from the position represented by any other coordinate signal by a distance equal to at least 4 consecutive photocell positions indicative of a character image followed by a distance equal to at least 6 consecutive photocell positions indicative of a non character image.
21. A method for forming a magnetic font disc upon which alphabet character designs are recorded by coded binary signals stored by magnetically altering a plurality of ordered storage cells for selective retrieval of the signals to cause an electronic display to accurately create optical character images as selectively desired, comprising the steps of:
(a) scanning an optical image of a character in a predetermined scan line pattern relative to a predetermined reference to generate boundary signals representative of the coordinates of boundary points defined by the intersection of the boundary contour of the character with each line of scan line pattern;
(b) temporarily storing said coordinate signals in an accessible memory;
(c) designating one of the coordinate signals from a character as a starting coordinate and successively retrieving the stored coordinate signals representing successive boundary points encountered in successive movements around the character boundary beginning at the first coordinate point following the starting coordinate;
(d) converting the retrieved coordinate signals into successive encoded binary signals describing successive end to end translational paths between selected boundary points selected from a set of possible translational paths to best approximate the position of the successive boundary points, wherein the number of binary bits making up each successive encoded binary signal is less than the number of binary bits required to uniquely define each of the translational paths in the set of possible translational paths and each coordinate signals is converted into an encoded binary signal representative of a translational path selected from a subset of the total set of possible translational paths, said subset being defined by the general direction in which the previous translational movement along the character boundary took place;
(e) repeating steps (c) and (d) for each additional boundary, if any, of the character image scanned in step (a); and
(f) storing the starting coordinates and all of the successive encoded binary signals for one character in successive storage cells of the magnetic font disc.
22. A method as defined in claim 21, wherein each encoded binary signal includes 2 to 6 bits and the total path set include 8 to 48 paths.
23. A method as defined in claim 21, wherein each encoded binary signal includes at least 3 bits and the total path set includes 24 paths.
24. A method as defined in claim 23, wherein the total path set includes 24 separate paths starting from a common point in an X, Y orthogonal point matrix to each of 24 peripheral terminal points spaced 3 points from the common point and wherein the first octant of paths starting on the horizontal includes a first path formed of end to end line segments interconnecting points (0,0) (1,0) (2,0) (3,0), a second path formed of end to end line segments interconnecting points (0,0) (1,0) (2,1) (3,1), a third path formed of end to end line segments interconnecting points (0,0) (1,1) (2,1) (3,2) and a fourth path formed of end to end line segments interconnecting points (0,0) (1,1) (2,2) (3,3) and wherein each succeeding octant of paths is formed of a mirror image of the paths contained in the preceeding octant of paths taken along the line joining the two succeeding octants.
25. A method as defined in claim 21, wherein the subset of paths from which each succeeding translational path is selected includes a first subset of paths formed of those paths most likely to be needed to describe the succeeding boundary points and a second subset of paths formed of those paths less likely to be needed to describe the succeeding boundary points.
26. A method as defined in claim 25, wherein each encoded binary signal uniquely describing the paths within the first subset includes X binary bits and wherein each encoded binary signal uniquely describing the paths within the second subset include 2X binary bits.
27. A method as defined in claim 26, wherein the subset of paths from which each succeeding translational path is selected includes a straight ahead path including an integral number of straight translational movements the direction of which is defined by the general direction of the last translational movement and the number of which is defined by the number of represented by the next succeeding X binary bits.
28. A method as defined in claim 27, wherein X equals 3 and wherein the straight ahead path is identified by an encoded binary signal including at least 9 bits.
29. A method as defined in claim 28, wherein the number of boundary points described by each path in the first and second subsets is 3 exclusive of the starting point and the number of boundary points described by a straight ahead path is equal to 9 plus 3 times the number represented by the next succeeding binary bits exclusive of the starting point.
30. A method for forming a magnetic font disc upon which alphabet character designs are recorded by coded binary signals stored by magnetically altering a plurality of ordered storage cells for selective retrieval of the signals to enable an electronic display to generate successive optical character images as selectively desired, comprising the steps of
(a) scanning an optical image of a character design having at least one closed boundary contour in a predetermined line scanning pattern relative to a predetermined reference;
(b) generating in succession coordinate signals representative of the coordinates of boundary points defined by the intersection of the boundary contour of the character with the line scanning pattern;
(c) temporarily storing said coordinate signals in an accessible memory;
(d) designating one of the coordinate signals from a character design as a starting coordinate and successively retrieving the stored coordinate signals representing successive boundary points encountered in successive movements around the entire character boundary contour beginning at the starting coordinate;
(e) converting the retrieved coordinate signals into successive encoded binary signals describing successive end to end translational paths between successive boundary points selected from a set of possible translational paths to best approximate the position of the successive boundary points by starting at the starting coordinate and continuing around the entire boundary contour in successive ordered steps different from the order in which the coordinate signals are generated in step (b) until the starting coordinate is reached;
(f) repeating steps (d) and (e) for each additional boundary, if any, of the character design scanned in step (a);
(g) storing the starting coordinates and all of the successive encoded binary signals for a first character within a first character data field formed of successive storage cells on the magnetic font disc;
(h) storing non-character binary signals describing the position on the disc of the first character data field in a non-character data field formed of the successive storage cells immediately preceding the first character data field;
(i) repeating steps (a) through (f) for each character design which it is desired to store on the magnetic font disc;
(j) storing the starting coordinates and all of the successive binary signals for each character within an associated character data field formed of successive storage cells; and
(k) storing non-character data relating to each character including the position on the disc of the associated character data field in a non-character data field formed of the successive storage cells immediately preceding the associated character data field.
31. The method as defined in claim 30, further including the steps of encoding on the same magnetic font disc all character images in one alphabet drawn specifically for reproduction at one point size and all character images in the same alphabet drawn specifically for reproduction at another point size.
32. The method as defined in claim 31, wherein the magnetic font disc is designed for use in a photocomposition system capable of electronically creating images in different sizes by reducing the set size and point size independently and further including the step of recording binary signals on the magnetic font disc representative of instructions for changing the ratio of point size to set size in accordance with the character size in which the image is to be electronically recreated.
33. A method as defined in claim 30 for forming a magnetic font disc having storage cells arranged in concentric circles to allow a magnetic pick-up to generate binary signals representative of the binary signals stored in storage cells within each track wherein step (g) includes the steps of storing the encoded binary signals associated with a corresponding character in a character data field defined by successive storage cells within one track of the font disc, and step (h) includes the step of identifying the location of the corresponding character data field by storing within the same track non-character binary signals representative of the locations of the first and last storage cells of the character data field.
34. A coded magnetic disc formed in accordance with the method of claim 33, whereby all of the signals descriptive of a particular character design stored within a track of the disc may be retrieved by rotating the font disc to cause all of the storage cells in which the corresponding character data field is stored to move past a magnetic pick-up in succession without interruption.
35. A method for forming a magnetic font disc upon which alphabet character designs are recorded by coded binary signals stored by magnetically altering a plurality of ordered storage cells for selective retrieval of the signals to cause an electronic display to generate successive optical character images as selectively desired comprising the steps of
(a) scanning an optical image of a character in a predetermined scan line pattern relative to a predetermined reference to generate coordinate signals representative of the coordinates of boundary points defined by the intersection of the boundary contour of the character with each line of the scan line pattern, including the steps of
(1) projecting a shadow image of the optical character image onto a linear array of photocells,
(2) scanning the linear array of photocells to produce a serial stream of binary signals with one signal level indicative of a photocell which illuminated and another signal level indicative of a photocell which is not illuminated,
(3) converting the serial stream of binary signals into successive multi-bit bytes of scan data,
(4) responding to each transition from one binary level to another binary level in the multi-bit bytes by storing a multi-bit binary signal representative of a coordinate position of the transition from one binary level to another binary level, and
(5) storing temporarily the multi-bit binary signals in successive storage locations of a magnetic disc;
(b) temporarily storing said coordinate signals in an accessible memory;
(c) designating one of the coordinate signals from a character as a starting coordinate and successively retrieving the stored coordinate signals representing successive boundary points encountered in successive movements around the character boundary beginning at the first coordinate following the starting coordinate;
(d) converting the retrieved coordinate signals into successive encoded binary signals describing successive end to end translational paths between successive boundary points selected from a set of possible translational paths to best approximate the position of the successive boundary points;
(e) repeating steps (c) and (d) for each additional boundary, if any, of the character image scanned in step (a);
(f) storing the starting coordinates and all of the successive encoded binary signals for a first character within a first character data field formed of successive storage cells on the magnetic font disc;
(g) storing non-character binary signals describing the position on the disc of the first character data field in a non-character data field formed of the successive storage cells immediately preceding the first character data field;
(h) repeating steps (a) through (d) for each character image which it is desired to store on the magnetic font disc;
(i) storing the starting coordinates and all of the successive binary signals for each character within an associated character data field formed of successive storage cells; and
(j) storing non-character data relating to each character including the position on the disc of the associated character data field in a non-character data field formed of the successive storage cells immediately preceding the associated character data field.
36. A method as defined in claim 35, wherein step (b) includes the steps of (1) transfering the magnetic disc to an encoding system having a random access memory and (2) transfering the multi-bit binary signals to the random access memory for selective retrieval during the process of converting the coordinate signals into the encoded binary signals.
37. A method as defined in claim 36, wherein step (b) further includes the step of eliminating all coordinate signals which are separated in the scan line direction from another coordinate signal by a selectively variable criteria dependent upon the amount of size alteration to which the character images are to be subjected.
38. A method as defined in claim 37, wherein the selectively variable criteria includes one criteria whereby the position represented by each acceptable coordinate signal must be separated in the scan line direction from the position represented by any other coordinate signal by a distance equal to at least 6 consecutive photocell positions indicative of a character image followed by a distance equal to at least 9 consecutive photocell positions indicative of a non character image and another criteria whereby the position represented by each acceptable coordinate signal must be separated in the scan line direction from the position represented by any other coordinate signal by a distance equal to at least 4 consecutive photocell positions indicative of a character image followed by a distance equal to at least 6 consecutive photocell positions indicative of a non character image.
39. A method for forming a magnetic font disc upon which alphabet character designs are recorded by coded binary signals stored by magnetically altering a plurality of ordered storage cells for selective retrieval of the signals to cause an electronic display to generate successive optical character images as selectively desired comprising the steps of
(a) scanning an optical image of a character in a predetermined scan line pattern relative to a predetermined reference to generate coordinate signals representative of the coordinates of boundary points defined by the intersection of the boundary contour of the character with each line of the scan line pattern;
(b) temporarily storing said coordinate signals in an accessible memory;
(c) designating one of the coordinate signals from a character as a starting coordinate and successively retrieving the stored coordinate signals representing successive boundary points encountered in successive movements around the character boundary beginning at the first coordinate following the starting coordinate;
(d) coverting the retrieved coordinate signals into successive encoded binary signals describing successive end to end translational paths between successive boundary points selected from a set of possible translational paths to best approximate the position of the successive boundary points, wherein the number of binary bits making up each successive encoded binary signal is less than the number of binary bits required to uniquely define each of the translational paths in the set of possible translational paths and each coordinate signal is converted into an encoded binary signal representative of a translational path selected from a subset of the total set of possible translational paths, said subset being defined by the general direction in which the previous translational movement along the character boundary took place;
(e) repeating steps (c) and (d) for each additional boundary, if any, of the character image scanned in step (a);
(f) storing the starting coordinates and all of the successive encoded binary signals for a first character within a first character data field formed of successive storage cells on the magnetic font disc;
(g) storing non-character binary signals describing the position on the disc of the first character data field in a non-character data field formed of the successive storage cells immediately preceding the first character data field;
(h) repeating steps (a) through (d) for each character image which it is desired to store on the magnetic font disc;
(i) storing the starting coordinates and all of the successive binary signals for each character within an associated character data field formed of successive storage cells; and
(j) storing non-character data relating to each character including the position on the disc of the associated character data field in a non-character data field formed of the successive storage cells immediately preceding the associated character data field.
40. A method as defined in claim 39, wherein each encoded binary signal includes 2 to 6 bits and the total path set includes 8 to 48 paths.
41. A method as defined in claim 39, wherein each encoded binary signal includes at least 3 bits and the total path set includes 24 paths.
42. A method as defined in claim 41, wherein the total path set includes 24 separate paths starting from a common point in an X, Y orthogonal point matrix to each of 24 peripheral terminal points spaced 3 points from the common point and wherein the first octant of paths starting on the horizontal includes a first path formed of end to end line segments interconnecting points (0,0) (1,0) (2,0) (3,0), a second path formed of end to end line segments interconnecting points (0,0) (1,0) (2,1) (3,1), a third path formed of end to end line segments interconnecting points (0,0) (1,1) (2,1) (3,2) and a fourth path formed of end to end line segments interconnecting points (0,0) (1,1) (2,2) (3,3) and wherein each succeeding octant of paths is formed of a mirror image of the paths contained in the preceeding octant of paths taken along the line joining the two succeeding octants.
43. A method as defined in claim 39, wherein the subset of paths from which each succeeding translational path is selected includes a first subset of paths formed of those paths most likely to be needed to describe the succeeding boundary points and a second subset of paths formed of those paths less likely to be needed to describe the succeeding boundary points.
44. A method as defined in claim 43, wherein the encoded binary signals uniquely describing the paths within the first subset includes X binary bits and wherein the encoded binary signals uniquely describing the paths within the second subset include 2X binary bits.
45. A method as defined in claim 44, wherein the subset of paths from which each succeeding translational path is selected includes a straight ahead path including an integral number of straight translational movements the direction of which is defined by the general direction of the last translational movement and the number of which is defined by the number represented by the next succeeding X binary bits.
46. A method as defined in claim 45, wherein X equals 3 and wherein the straight ahead path is identified by an encoded binary signal including at least 9 bits.
47. A method as defined in claim 46, wherein the number of boundary points described by each path in the first and second subsets is 3 exclusive of the starting point and the number of boundary points described by a straight ahead path is equal to 9 plus 3 times the number represented by the next succeeding binary exclusive of the starting point.
48. A method for forming a master magnetic font disc upon which alphabet character designs are recorded by encoded binary signals stored by magnetically altering a plurality of ordered storage cells permitting retrieval of the encoded binary signals to enable an electrical display to generate successive optical character images of graphic quality in any point size from 5 point to 18 point by electronically altering the retrieved encoded binary signals as selectively desired, comprising the steps of
(a) creating a first set of optical images of alphabet characters in a particular typeface style wherein the alphabet characters each have at least one closed boundary contour and are proportioned for electronic display in a predetermined point size;
(b) creating a second set of optical images of alphabet characters in said particular typeface style wherein the alphabet characters of said second set each have at least one closed boundary contour and are proportioned differently from said first set for electronic display in a predetermined point size different from said first set;
(c) scanning an optical image of a character from one of said sets in a predetermined line scanning pattern relative to a predetermined reference;
(d) generating in succession digital signals representative of the coordinates of the boundary points defined by the intersection of the boundary contour of the character with the line scanning pattern;
(e) converting the digital signals into successive encoded binary signals describing successive end to end translational paths between boundary points selected from a set of possible translational paths to best approximate the boundary contour of the scanned character by starting at a first boundary point and continuing around the entire boundary contour in successive ordered steps different from the order in which the coordinate signals are generated in step (d) until the first boundary point is again reached;
(f) storing all of the successive encoded binary signals for a single character in successive storage cells of the master magnetic font disc;
(g) repeating steps (c) through (f) for each optical character image in said alphabets sets; and
(h) storing binary control signals on said disc causing the electronic display to generate optical characters in a desired point size using the stored encoded binary signals which require the least point size alteration.
49. A method for forming a master magnetic font disc upon which alphabet character designs are recorded by encoded binary signals stored by magnetically altering a plurality of ordered storage cells permitting retrieval of the encoded binary signals to cause an electrical display to generate successive optical character images of graphic quality in any point size from 5 point to 18 point by electronically alternating the retrieved encoded binary signals as selectively desired, comprising the steps of
(a) creating a first set of optical images of alphabet characters in a particular typeface style wherein the alphabet characters are proportioned for electronic display in a predetermined point size;
(b) creating a second set of optical images of alphabet characters in said particular typeface style wherein the alphabet characters of said second set are proportioned differently than said first set for electronic display in a predetermined point size different from said first set;
(c) scanning an optical image of a character from one of said sets in a predetermined scan line pattern relative to a predetermined reference to generate digital signals representative of the coordinates of the boundary points defined by the intersection of the boundary contour of the character with each line of the scan line pattern, including the steps of
(1) projecting a shadow image of the optical character image onto a linear array of photocells,
(2) scanning the linear array of photocells to produce a serial stream of binary signals with one signal level indicative of a photocell which is illuminated and another signal level indicative of a photocell which is not illuminated,
(3) converting the serial stream of binary signals into successive multi-bit bytes of scan data,
(4) responding to each transition from one binary level to another binary level in the multi-bit bytes by storing a multi-bit binary signal representative of a coordinate position of the transition from one binary level to another binary level, and
(5) storing temporarily the multi-bit binary signals in successive storage locations of a magnetic disc;
(d) converting the coordinate signals into successive encoded binary signals describing successive end to end translational paths between boundary points selected from a set of possible translational paths to best approximate the position of the successive boundary points;
(e) storing all of the successive encoded binary signals for a single character in successive storage cells of the master magnetic font disc;
(f) repeating steps (c) through (e) for each optical character image in said alphabets sets; and
(g) storing binary control signals on said disc causing the electronic display to generate optical characters in a desired point size using the stored encoded binary signals which require the least point size alteration electrically.
50. A method as defined in claim 49, wherein step (d) includes the steps of (1) transferring the magnetic disc to an encoding system including a random access memory, and (2) transferring the multi-bit binary signals to the random access memory for selective retrieval during the process of converting the coordinate signals into the encoded binary signals.
51. A method as defined in claim 50 wherein step (d) further includes the step of eliminating all coordinate signals which are separated in the scan line direction from another coordinate signal by selectively variable criteria dependent upon the amount of size alteration to which the character images are to be subjected.
52. A method as defined in claim 51, wherein the selectively variable criteria includes one criteria whereby the position represented by each acceptable coordinate signal must be separated in the scan line direction from the position represented by any other coordinate signal by a distance equal to at least 6 consecutive photocell positions indicative of a character image followed by a distance equal to at least 9 consecutive photocell positions indicative of a non character image and another criteria whereby the position represented by each acceptable coordinate signal must be separated in the scan line direction from the position represented by any other coordinate signal by a distance equal to at least 4 consecutive photocell positions indicative of a character image followed by a distance equal to at least 6 consecutive photocell positions indicative of a non character image.
53. A method for forming a master magnetic font disc upon which alphabet character designs are recorded by encoded binary signals stored by magnetically altering a plurality of ordered storage cells permitting retrieval of the encoded binary signals to cause an electrical display to generate successive optical character images of graphic quality in any point size from 5 point to 18 point by electronically alternating the retrieved encoded binary signals as selectively desired, comprising the steps of
(a) creating a first set of optical images of alphabet characters in a particular typeface style wherein the alphabet characters are proportioned for electronic display in a predetermined point size;
(b) creating a second set of optical images of alphabet characters in said particular typeface style wherein the alphabet characters of said second set are proportioned differently than said first set for electronic display in a predetermined point set different from said first set;
(c) scanning an optical image of a character from one of said sets in a predetermined scan line pattern relative to a predetermined reference to generate digital signals representative of the coordinates of the boundary points defined by the intersection of the boundary contour of the character with each line of the scan line pattern;
(d) converting the coordinate signals into successive encoded binary signals describing successive end to end translational paths between boundary points selected from a set of possible translational paths to best approximate the position of the successive boundary points, wherein the number of binary bits making up each successive encoded binary signal is less than the number of binary bits required to uniquely define each of the translational paths in the set of possible translational paths and each coordinate signal is converted into an encoded binary signal representative of a translational path selected from a subset of the total set of possible translational paths, said subset being defined by the general direction in which the previous translational movement along the character boundary took place;
(e) storing all of the successive encoded binary signals for a single character in successive storage cells of the master magnetic font disc;
(f) repeating steps (c) through (e) for each optical character image in said alphabets sets; and
(g) storing binary control signals on said disc causing the electronic display to generate optical characters in a desired point size using the stored encoded binary signals which require the least point size alteration electrically.
54. A method as defined in claim 53, wherein each encoded binary signal includes 2 to 6 bits and the total path set includes 8 to 48 paths.
55. A method as defined in claim 53, wherein each encoded binary signal includes at least 3 bits and the total path set includes 24 paths.
56. A method as defined in claim 55, wherein the total path set includes 24 separate paths starting from a common point in an X, Y orthogonal point matrix to each of 24 peripheral terminal points spaced 3 points from the common point and wherein the first octant of paths starting on the horizontal includes a first path formed of end to end line segments interconnecting points (0,0) (1,0) (2,0) (3,0), a second path formed of end to end line segments interconnecting points (0,0)(1,0) (2,1) (3,1), a third path formed of end to end line segments interconnecting points (0,0) (1,1) (2,1) (3,2) and a fourth path formed of end to end line segments interconnecting points (0,0) (1,1) (2,2)(3,3) and wherein each succeeding octant of paths is formed of a mirror image of the paths contained in the preceeding octant of paths taken along the line joining the two succeeding octants.
57. A method as defined in claim 53, wherein the subset of paths from which each succeeding translational path is selected includes a first subset of paths formed of those paths most likely to be needed to describe the succeeding boundary points and a second subset of paths formed of those paths less likely to be needed to describe the succeeding boundary points.
58. A method as defined in claim 57, wherein each encoded binary signals uniquely describing the paths within the first subset includes X binary bits and wherein the encoded binary signals uniquely describing the paths within the second subset include 2X binary bits.
59. A method as defined in claim 58 wherein the subset of paths from which each succeeding translational path is selected includes a straight ahead path including an integral number of straight translational movements the direction of which is defined by the general direction of the last translational movement and the number of which is defined by the number represented by next succeeding X binary bits.
60. A method as defined in claim 59, wherein X equals 3 and wherein the straight ahead path is identified by an encoded binary signal including at least 9 bits.
61. A method as defined in claim 60, wherein the number of boundary points described by each path in the first and second subsets is 3 exclusive of the starting point and the number of boundary points described by a straight ahead path is equal to 9 plus 3 times the number represented by the next succeeding binary encoded signal exclusive of the starting point.

US Referenced Citations (5)

Number	Name	Date
3546686	McPherson et al.	Dec 1970
3643067	Colditz et al.	Feb 1972
3936664	Sato	Feb 1976
4029947	Evans et al.	Jun 1977
4151571	Cardot et al.	Apr 1979

Ultrahigh resolution photocomposition system employing electronic character generation from magnetically stored data

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

US Classifications

Field of Search

US

International Classifications

Abstract

Description

Claims

US Referenced Citations (5)