[go: up one dir, main page]

KR930001472B1 - Data Compression Method of Korean Font Using Bit Pattern - Google Patents

Data Compression Method of Korean Font Using Bit Pattern Download PDF

Info

Publication number
KR930001472B1
KR930001472B1 KR1019870014096A KR870014096A KR930001472B1 KR 930001472 B1 KR930001472 B1 KR 930001472B1 KR 1019870014096 A KR1019870014096 A KR 1019870014096A KR 870014096 A KR870014096 A KR 870014096A KR 930001472 B1 KR930001472 B1 KR 930001472B1
Authority
KR
South Korea
Prior art keywords
case
font
memory
raster
bit
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
KR1019870014096A
Other languages
Korean (ko)
Other versions
KR890010756A (en
Inventor
유상철
Original Assignee
주식회사 금성사
최근선
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 주식회사 금성사, 최근선 filed Critical 주식회사 금성사
Priority to KR1019870014096A priority Critical patent/KR930001472B1/en
Publication of KR890010756A publication Critical patent/KR890010756A/en
Application granted granted Critical
Publication of KR930001472B1 publication Critical patent/KR930001472B1/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K15/00—Arrangements for producing a permanent visual presentation of the output data, e.g. computer output printers
    • G06K15/02—Arrangements for producing a permanent visual presentation of the output data, e.g. computer output printers using printers
    • G06K15/18—Conditioning data for presenting it to the physical printing elements
    • G06K15/1827—Accessing generic data, e.g. fonts
    • G06K15/1831—Accessing generic data, e.g. fonts characterized by the format of the data
    • G06K15/1832—Compressed bitmaps
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K15/00—Arrangements for producing a permanent visual presentation of the output data, e.g. computer output printers
    • G06K15/02—Arrangements for producing a permanent visual presentation of the output data, e.g. computer output printers using printers
    • G06K15/12—Arrangements for producing a permanent visual presentation of the output data, e.g. computer output printers using printers by photographic printing, e.g. by laser printers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K2215/00—Arrangements for producing a permanent visual presentation of the output data
    • G06K2215/0002—Handling the output data
    • G06K2215/002—Generic data access
    • G06K2215/0028—Generic data access characterised by the format per se
    • G06K2215/0031—Compressed bit maps
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K2215/00—Arrangements for producing a permanent visual presentation of the output data
    • G06K2215/0002—Handling the output data
    • G06K2215/004—Generic data transformation
    • G06K2215/0054—Geometric transformations, e.g. on rasterised data
    • G06K2215/0057—Sizing and resolution changes

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Optics & Photonics (AREA)
  • Controls And Circuits For Display Device (AREA)
  • Record Information Processing For Printing (AREA)

Abstract

내용 없음.No content.

Description

비트패턴을 이용한 한글폰트의 데이타 압축방법Data Compression Method of Korean Font Using Bit Pattern

제1도는 종래의 폰트기록방법 예시도.1 is a diagram illustrating a conventional font recording method.

제2도는 종래의 폰트읽기 흐름도.2 is a flow chart of a conventional font reading.

제3도는 본 발명에 적용되는 레이저 빔 프린터의 제어부 블록구성도.3 is a block diagram of a controller of a laser beam printer according to the present invention.

제4도는 본 발명에 따른 비트패턴분류 및 그에 대응하는 압축코드(Compression Code)예시도.4 is a diagram illustrating a bit pattern classification and a compression code corresponding thereto according to the present invention.

제5도는 본 발명의 폰트정보 기록방법예시도.5 is an exemplary view of a font information recording method of the present invention.

제6도는 본 발명의 폰트읽기 흐름도.6 is a flow chart of the font reading of the present invention.

본 발명은 레이저 빔 프린터의 폰트데이타압축(Compression)방법에 관한 것으로, 특히 메모리 사이즈가 큰 한글폰트에서 메모리 사이즈를 줄일 수 있게 비트패턴을 이용한 한글폰트의 데이타압축방법에 관한 것이다.The present invention relates to a font data compression method of a laser beam printer, and more particularly, to a data compression method of a Hangul font using a bit pattern to reduce the memory size in a Hangul font having a large memory size.

종래의 폰트데이타 기록방법은 제1도에 도시된 바와 같이, 폰트메모리에 처음 128낱말(Word)의 미국정보교환표준코드(ASC Ⅱ) 문자세트에 해당되는 어드레스를 기억시키고, 다음에 문자비트맵(bit map)을 기억시킨다. 여기서, 문자비트맵은 해당문자의 비트패턴을 16비트(1Word)씩 끊어 연속적으로 기록하게 되어 있으며, 또 문자의 사이즈가 일정하지 않을 경우 각각의 문자비트맵의 시작부분에 해당정보를 기록하게 되어 있다. 여기서, 문자비트맵의 시작부분에 기록하는 정보로서는 문자의 폭, 높이, X-오프세트, Y-오프세트 등이 있다.In the conventional font data recording method, as shown in FIG. 1, an address corresponding to the first 128 words of the US Information Exchange Standard Code (ASC II) character set is stored in a font memory, and then a character bitmap Remember the (bit map). Here, the character bitmap records 16 bits (1 Word) of the bit pattern of the corresponding character continuously and records the information at the beginning of each character bitmap if the size of the character is not constant. have. Here, the information recorded at the beginning of the character bitmap includes the width, height, X-offset, and Y-offset of the character.

한편, 상기와 같이 폰트메모리에 기록된 정보를 읽음에 있어서는 제2도의 흐름도에 나타낸 바와 같이, 주어진 ASC Ⅱ 코드로 비트맵의 처음 어드레스를 읽고, 문자정보를 읽은 후 비트맵의 끝검출일때 폰트데이타를 1비트단위로 읽어 라스터메모리에 기록시키게 되어 있다.On the other hand, in reading the information recorded in the font memory as described above, as shown in the flowchart of Fig. 2, when the end address of the bitmap is detected after reading the first address of the bitmap with the given ASC II code, the character data is read. Are read in 1 bit unit and written to the raster memory.

그러나, 이러한 종래의 방법에 있어서는 한글 또는 한자를 메모리에 기억시킬때 대단히 많은 메모리가 필요하게 되고, 또 제품의 규격이 작아 제어부의 규격이 문제시될 경우에는 폰트의 메모리 규격을 가능한 줄여야 하는 문제점이 있었다. 본 발명은 이러한 종래의 결점을 해결하기 위하여, 폰트데이타를 몇가지 유형으로 분리시켜 그에따른 압축(Compression)코드를 기억시킴으로써 폰트메모리를 보다 소형화할 수 있게 창안한 것으로, 이를 첨부된 도면을 참조하여 상세히 설명하면 다음과 같다.However, in the conventional method, when storing Hangul or Hanja in memory, a great deal of memory is required, and when the size of the product is so small that the size of the control unit is problematic, there is a problem in that the memory size of the font should be reduced as much as possible. . In order to solve the above-mentioned drawbacks, the present invention has been made to make the font memory more compact by dividing the font data into several types and storing the compression code accordingly, in detail with reference to the accompanying drawings. The explanation is as follows.

제3도는 본 발명에 적용되는 레이저 빔 프린터의 제어부 블록구성도로서 이에 도시한 바와 같이, 중앙연산처리장치(11), 폰트메모리(12), 시스템메모리(13), 라스터메모리(14) 및 비디오데이타인출부(15)로 구성된다.3 is a block diagram of a control unit of the laser beam printer according to the present invention. As shown in FIG. 3, the central processing unit 11, the font memory 12, the system memory 13, the raster memory 14, The video data extractor 15 is provided.

제4도는 본 발명에 따른 비트패턴분류 및 그에 대응하는 압축코드(Compression Code)예시도로서 이에 도시한 바와 같이, 폰트를 4가지 유형으로 분류시켜 그에 대응하게 2비트의 압축코드를 부여한 것이다. 즉, 폰트를 1비트단위로 읽으면 모든 비트패턴은 4가지 유형으로 분류되는 데, 경우 1은 모든 비트가 오프에 해당되는 것으로 정수값으로는 "0"에 해당된다. 이 경우 1에 있어서는 압축코드만 갖고 다른 정보는 갖지 않게 된다. 또 경우 2는 모든 비트가 온에 해당되는 것으로 정수값으로는 "65535"에 해당된다. 이 경우 2에 있어서도 압축코드만 갖고 다른 정보는 갖지 않게 된다. 또 경우 3은 모든 비트가 온된 상태를 좌 또는 우로 시프트할 수 있는 패턴을 나타낸 것으로, 이 경우 3에 있어서는 압축코드외에 좌시프트되는 비트수와 우시프트되는 비트수를 4비트씩 제8비트를 갖게 된다. 또 경우 4는 상기 경우 1, 경우 2, 경우 3을 제외한모든 패턴을 나타낸 것으로, 이 경우 4에 있어서는 압축코드화하지 않고 그 패턴을 그대로 기억시키게 된다.4 illustrates bit pattern classification and a corresponding compression code according to the present invention. As shown in FIG. 4, fonts are classified into four types and corresponding compression codes of two bits are given. That is, if the font is read in units of 1 bit, all bit patterns are classified into 4 types, in which case 1 means all bits are off and an integer value is "0". In this case, 1 only has a compressed code and no other information. In this case, 2 means that all bits are on and "65535" is an integer value. In this case, too, only the compressed code is used and no other information is provided. In this case, 3 represents a pattern capable of shifting all bits turned on to the left or right. In this case, in the case of 3, the number of bits shifted left and number shifted right and 8 bits each have 4 bits. do. Case 4 shows all patterns except case 1, case 2, and case 3, and in case 4, the pattern is stored as it is without compression coding.

상기와 같이 분류한 폰트패턴을 폰트메모리(12)에 기억시키는 순서는 제5도에 도시한 바와 같이 된다.The order in which the font patterns classified as described above are stored in the font memory 12 is as shown in FIG.

즉, 제4도의 영역 P1에는 폰트시작으로부터 경우 4에 해당되는 패턴이 시작되는 곳까지의 바이트수를 기억시키고, 영역 P2에는 상기 제3도에서 설명한 압축코드를 연속적으로 기억시키며, 영역 P3에는 상기 제3도의 경우 3에 해당되는 비트패턴을 연속적으로 기억시키고, 영역 P4에는 상기 제3도의 경우 4에 헤당되는 불규칙패턴의 비트패턴을 기억시킨다. 그리고, 제4도에서 영역 P1, P2, P3에는 1바이트(8비트)단위로 기억시키고, 영역 P4에는 2바이트단위로 기억시킨다.That is, the area P 1 of FIG. 4 stores the number of bytes from the start of the font to the start of the pattern corresponding to case 4, and the area P 2 continuously stores the compressed code described in FIG. In Fig. 3, bit patterns corresponding to 3 in Fig. 3 are continuously stored, and in the area P 4 , bit patterns of irregular patterns corresponding to 4 in Fig. 3 are stored. In FIG. 4, areas P 1 , P 2 , and P 3 are stored in units of 1 byte (8 bits), and areas P 4 are stored in units of 2 bytes.

이와 같이 기억된 데이타를 읽기위한 순서는 제6도의 흐름도에 나타낸 바와 같다.The procedure for reading the stored data in this manner is as shown in the flowchart of FIG.

즉, 압축코드유형수(ⅰ)를 "0"으로 하여 초기화한 후 압축코드 4개를 동시에 읽어 해당코드를 구하고, 이후 그 압축코드유형수(ⅰ)가 4보다 작을때, 경우 1인 경우에는 라스터메모리(14)에 전백(all white)비트패턴을 기록한 후 라스터어드레스를 "1"증가하고, 압축코드유형수(ⅰ)에 1을 더한다. 또, 경우 2인 경우에는 라스터메모리(14)에 전흑(all black)비트패턴을 기록한 후 라스터어드레스를 "1"증가하고, 압축코드유형수(ⅰ)에 1을 더한다.In other words, after initializing the compressed code type number as "0" and reading four compressed codes at the same time, the corresponding code is obtained. Then, when the compressed code type number is smaller than 4, the case is 1, and the raster After the all white bit pattern is recorded in the memory 14, the raster address is increased by " 1 ", and 1 is added to the compressed code type number. In case 2, after recording an all black bit pattern in the raster memory 14, the raster address is increased by "1", and 1 is added to the number of compressed code types.

마찬가지로, 경우 3인 경우에는 시프트정보를 읽은 후 전흑(all black)비트를 시프트하여 라스터메모리(14)에 기록하고, 이후 라스터어드레스를 "1"증가하고, 압축코드유형수(ⅰ)에 1을 더하며, 경우 4인 경우에는 비프패턴을 읽어 라스터메모리(14)에 기록한 후 그 라스터어드레스를 "1"증가하고, 압축코드유형수(ⅰ)에 1을 더한다.Similarly, in case 3, after shift information is read, all black bits are shifted and recorded in the raster memory 14. Then, the raster address is increased by "1", and the number of compressed code types is 1. In the case of 4, after reading the beep pattern and writing it to the raster memory 14, the raster address is increased by " 1 ", and 1 is added to the compressed code type number.

이와 같은 동작은 압축코드유형수(ⅰ)가 4보다 작을때 반복된다.This operation is repeated when the compression code type number is smaller than four.

이상에서 상세히 설명한 바와 같이 본 발명은 폰트데이타를 4가지 유형으로 분리시켜 그에따른 압축코드를 기억시키게 되므로 한글폰트를 경우에도 폰트메모리의 규격을 소형화시킬 수 있게 되는 효과가 있게 된다.As described in detail above, the present invention divides the font data into four types and stores the compressed codes according to the present invention, so that the size of the font memory can be reduced even in the case of Korean fonts.

Claims (1)

폰트를 전백(all white)비트패턴, 전흑(a1l black)비트패턴, 전흑비트패턴을 시프트할 수 있는 패턴, 기타 불규칙비트패턴의 4가지 유형(경우 1- 경우 4)로 분류하여, 상기 경우 1-3에 대응하는 압축코드, 시프트정보비트 및 경우 4의 불규칙비프패턴을 폰트메모리에 기억시켜 두고, 상기 폰트메모리의 폰트데이타를 읽을때 상기 경우 1일때는 라스터메모리에 전백비트패턴을 기록한 후 라스터어드레스를 "1"증가하고, 상기 경우 2일때는 라스터메모리에 전흑비트패턴을 기록한 후 라스터어드레스를 "1"증가하고, 상기 경우 3일때는 시프트정보를 읽은 후 전흑비트를 시프트하여 라스터메모리에 기록하고 라스터어드레스를 "1"증가하며, 상기 경우 4일때는 불규칙비트패턴을 읽어 라스터메모리에 기록한 후 라스터어드레스를 "1"증가하게 함을 특징으로 하는 비트패턴을 이용한 한글폰트의 데이타압축방법.Fonts are classified into four types (case 1-case 4): all white bit patterns, a1l black bit patterns, shiftable all black bit patterns, and other irregular bit patterns. The compression code corresponding to -3, the shift information bits, and the irregular beep pattern of case 4 are stored in the font memory, and in the case 1 when the font data of the font memory is read, the full back bit pattern is recorded in the raster memory. Raster address is increased by "1", and in case of 2, all black bit pattern is recorded in raster memory, then raster address is increased by "1", and in case of 3, all black bit is shifted after reading shift information. Write to the raster memory and increase the raster address by "1" .In the case of 4, the bit pad is characterized in that the raster address is increased by "1" after reading the irregular bit pattern. Data compression method of Hangul font using turn.
KR1019870014096A 1987-12-10 1987-12-10 Data Compression Method of Korean Font Using Bit Pattern Expired - Fee Related KR930001472B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1019870014096A KR930001472B1 (en) 1987-12-10 1987-12-10 Data Compression Method of Korean Font Using Bit Pattern

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1019870014096A KR930001472B1 (en) 1987-12-10 1987-12-10 Data Compression Method of Korean Font Using Bit Pattern

Publications (2)

Publication Number Publication Date
KR890010756A KR890010756A (en) 1989-08-10
KR930001472B1 true KR930001472B1 (en) 1993-02-27

Family

ID=19266824

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1019870014096A Expired - Fee Related KR930001472B1 (en) 1987-12-10 1987-12-10 Data Compression Method of Korean Font Using Bit Pattern

Country Status (1)

Country Link
KR (1) KR930001472B1 (en)

Also Published As

Publication number Publication date
KR890010756A (en) 1989-08-10

Similar Documents

Publication Publication Date Title
CA1199413A (en) Method of editing dot pattern data for character and/or image representations
US5123061A (en) Data compression/decompression method, device and resulting data structure
US5347266A (en) Method and device for accessing shared character patterns, and resulting stored decompressible font structure
US5272768A (en) Blank strip font compression method and device, and resulting stored, decompressible font
KR930001472B1 (en) Data Compression Method of Korean Font Using Bit Pattern
JPH06222747A (en) Font compression device and font restoration device
EP0009662A2 (en) Method and apparatus for storing and reconstructing chinese-like characters
US4490058A (en) Line printer and type carrier for use therein
JPS5932829B2 (en) How to read characters
EP0072708B1 (en) Printer
KR950004219B1 (en) Method and device for improving storage area of combined fonts
KR930009163B1 (en) Width compression control method of font data
KR950011809B1 (en) Korean character compound writing method in laser printer
JPH05281948A (en) Font pattern compressing and storing method
KR900008271B1 (en) Bold Type of Font
JPS60136885A (en) Business form format discriminating system
JPS5853338B2 (en) Dot pattern output method
JPS5616275A (en) Character read-in method
JPH0127430B2 (en)
JPS6371884A (en) Memory control system
JPS61199182A (en) Form format identification method
JPH02287739A (en) Memory access method
JPH0127429B2 (en)
JPH0740181B2 (en) Bitmap memory write control method
JPS58107993A (en) optical character reader

Legal Events

Date Code Title Description
PA0109 Patent application

St.27 status event code: A-0-1-A10-A12-nap-PA0109

R17-X000 Change to representative recorded

St.27 status event code: A-3-3-R10-R17-oth-X000

PG1501 Laying open of application

St.27 status event code: A-1-1-Q10-Q12-nap-PG1501

A201 Request for examination
PA0201 Request for examination

St.27 status event code: A-1-2-D10-D11-exm-PA0201

G160 Decision to publish patent application
PG1605 Publication of application before grant of patent

St.27 status event code: A-2-2-Q10-Q13-nap-PG1605

E701 Decision to grant or registration of patent right
PE0701 Decision of registration

St.27 status event code: A-1-2-D10-D22-exm-PE0701

GRNT Written decision to grant
PR0701 Registration of establishment

St.27 status event code: A-2-4-F10-F11-exm-PR0701

PR1002 Payment of registration fee

St.27 status event code: A-2-2-U10-U11-oth-PR1002

Fee payment year number: 1

FPAY Annual fee payment

Payment date: 19950104

Year of fee payment: 4

PR1001 Payment of annual fee

St.27 status event code: A-4-4-U10-U11-oth-PR1001

Fee payment year number: 4

LAPS Lapse due to unpaid annual fee
PC1903 Unpaid annual fee

St.27 status event code: A-4-4-U10-U13-oth-PC1903

Not in force date: 19970228

Payment event data comment text: Termination Category : DEFAULT_OF_REGISTRATION_FEE

PN2301 Change of applicant

St.27 status event code: A-5-5-R10-R13-asn-PN2301

St.27 status event code: A-5-5-R10-R11-asn-PN2301

PC1903 Unpaid annual fee

St.27 status event code: N-4-6-H10-H13-oth-PC1903

Ip right cessation event data comment text: Termination Category : DEFAULT_OF_REGISTRATION_FEE

Not in force date: 19970228

PN2301 Change of applicant

St.27 status event code: A-5-5-R10-R13-asn-PN2301

St.27 status event code: A-5-5-R10-R11-asn-PN2301

PN2301 Change of applicant

St.27 status event code: A-5-5-R10-R13-asn-PN2301

St.27 status event code: A-5-5-R10-R11-asn-PN2301

PN2301 Change of applicant

St.27 status event code: A-5-5-R10-R13-asn-PN2301

St.27 status event code: A-5-5-R10-R11-asn-PN2301

P22-X000 Classification modified

St.27 status event code: A-4-4-P10-P22-nap-X000