JPH06169404A - Facsimile equipment - Google Patents

Facsimile equipment

Info

Publication number
JPH06169404A
JPH06169404A JP43A JP31990992A JPH06169404A JP H06169404 A JPH06169404 A JP H06169404A JP 43 A JP43 A JP 43A JP 31990992 A JP31990992 A JP 31990992A JP H06169404 A JPH06169404 A JP H06169404A
Authority
JP
Japan
Prior art keywords
encoding
storage
data
picture
code amount
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.)
Granted
Application number
JP43A
Other languages
Japanese (ja)
Other versions
JPH0799855B2 (en
Inventor
Tamotsu Kusaka
保 日下
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NEC Corp
Original Assignee
NEC Corp
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 NEC Corp filed Critical NEC Corp
Priority to JP4319909A priority Critical patent/JPH0799855B2/en
Publication of JPH06169404A publication Critical patent/JPH06169404A/en
Publication of JPH0799855B2 publication Critical patent/JPH0799855B2/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Abstract

PURPOSE:To shorten a communicating time by searching an encoding system optimal to an original by an arithmetic operation from the plural encoding systems, and encoding picture data by the encoding system whose compressibility is the most satisfactory, and transmitting it, at the time of facsimile transmission. CONSTITUTION:A picture is read by a picture reading part 1, and the read picture is binarized by a binarizing part 2. The binarized data are encoded by an encoding part 3 for storage, and stored in a picture storage memory part 5. At the same time, encoding amounts at the time of encoding the picture data by the plural encoding systems are calculated by a compressibility computing element 6, the encoding system whose compressibility is the most satisfactory is selected, and an encoding selection signal 9 is outputted. The data in the picture storage memory part 5 are decoded by a decoding part 4 for storage, and encoded by the selected encoding system by a communication encoding part 7. Then, the compression optimal to the original can be attained. Thus, the encoding system optimal to the original can be selected, so that the total communicating time can be shortened.

Description

【発明の詳細な説明】Detailed Description of the Invention

【0001】[0001]

【産業上の利用分野】本発明は、ファクシミリ装置に関
し、特に、原稿を2値化後にメモリに蓄積して送信する
ファクシミリ装置に関する。
BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a facsimile machine, and more particularly to a facsimile machine which binarizes an original and stores it in a memory for transmission.

【0002】[0002]

【従来の技術】従来のファクシミリ装置には、画像読取
部で原稿を読み取り、2値化部において2値化されたデ
ータを蓄積し、通信相手機の能力から選択された符号化
方式で符号化し、送信する方法として、以下の4種類の
方法が知られていた。
2. Description of the Related Art In a conventional facsimile apparatus, an image reading unit reads an original document, a binarizing unit stores binarized data, and the data is encoded by an encoding method selected from the capabilities of a communication partner. The following four types of methods have been known as transmission methods.

【0003】先ず、第一の方法は、相手機の能力からM
MR、MR、MHの順に一般的に圧縮率の良いとされる
符号化方式を固定的な優先順位で選択し、蓄積されたデ
ータを蓄積用復号化器で復号化し、固定的な優先順位で
選択された符号化方式で符号化を行い送信する方法であ
る。
First, the first method is M
MR, MR, and MH are selected in order of the compression method, which is generally considered to have a good compression rate, with a fixed priority order, and the stored data is decoded by a storage decoder. This is a method of performing encoding by the selected encoding method and transmitting.

【0004】第二の方法は、MMR、MR、MH等の全
ての符号化方式で符号化を行い、それぞれメモリに蓄積
し、相手機の能力からMMR、MR、MHの順に一般的
に圧縮率の良いとされる符号化方式を固定的な優先順位
で選択し、選択された符号化方式で蓄積されたデータを
選択し送信することにより、送信時の符号化時間を短縮
する方法である。
The second method is that all the coding methods such as MMR, MR and MH are coded and stored in memory respectively, and the compression ratio is generally in the order of MMR, MR and MH according to the capability of the partner machine. Is a method of shortening the coding time at the time of transmission by selecting a coding method considered to be good in a fixed priority order and selecting and transmitting the data accumulated by the selected coding method.

【0005】第三の方法は、蓄積されたデータをMH符
号化器Aと白、黒いづれのランレングスも白のランレン
グス符号で符号化する符号化器Bを持ち、符号化比較器
の比較結果に従ってA、Bの符号化結果の符号量の短い
符号化器を選択し、どちらを選択したかを示す付加符号
を付加し送信することにより通信時間を短縮する方法で
ある。
The third method has an MH encoder A and an encoder B for encoding the run lengths of white and black with a run length code of white, and compares the accumulated data with an encoding comparator. This is a method of shortening the communication time by selecting an encoder having a short code amount of the encoding result of A and B according to the result, adding an additional code indicating which one has been selected and transmitting.

【0006】第四の方法は、蓄積されたデータをMH符
号化器Cと画信号の白、黒を反転しMH符号化を行う符
号化器Dを持ち、符号化比較器の比較結果に従ってC、
Dの符号化結果の符号量の短い符号化方式を選択し、ど
ちらを選択したかを示す付加符号を付加し送信すること
により通信時間を短縮する方法があげられる。
The fourth method has an MH coder C for accumulated data and an coder D for MH coding by inverting white and black of a picture signal, and C according to a comparison result of a coding comparator. ,
There is a method of shortening the communication time by selecting an encoding method having a short code amount of the D encoding result, adding an additional code indicating which one has been selected, and transmitting.

【0007】上記第三の方法は、特開昭62−1595
75号公報に、第四の方法は、特開昭61−22597
7号公報にそれぞれ記載された内容である。
The third method is disclosed in Japanese Patent Laid-Open No. 62-1595.
The fourth method is disclosed in JP-A-61-22597.
These are the contents respectively described in Japanese Patent No.

【0008】[0008]

【発明が解決しようとする課題】しかしながら、上述し
た従来のファクシミリ装置は、それぞれの方式に対し以
下の課題があげられる。
However, the above-mentioned conventional facsimile apparatus has the following problems for each system.

【0009】第一の方法および第二の方法は、画情報に
より、符号化方式による符号量は、数1に示すように、
According to the first method and the second method, the image information is used, and the code amount according to the encoding method is as shown in Equation 1.

【数1】MMR>MR>MH となることがあり、固定的な優先順位で符号化方式を決
定するとかえって通信時間が長くなるという欠点があ
る。
## EQU1 ## MMR>MR> MH may be satisfied, and there is a disadvantage that the communication time becomes longer if the coding method is determined with a fixed priority.

【0010】第二の方式は、それぞれの符号化方式に対
して符号化メモリを必要とするのでメモリの冗長な使わ
れ方をしており、ファクシミリ装置の冗長なメモリ搭載
によるコストアップにつながるという欠点がある。
The second method requires a coding memory for each coding method, so that the memory is used in a redundant manner, which leads to an increase in cost due to the redundant memory mounting in the facsimile apparatus. There are drawbacks.

【0011】第三の方法および第四の方法は、付加符号
を付加する処理を行っているので、付加符号を認識でき
る受信端末に限られるという欠点がある。
Since the third method and the fourth method perform the process of adding the additional code, they have a drawback that they are limited to the receiving terminals that can recognize the additional code.

【0012】本発明は従来の上記実情に鑑みてなされた
ものであり、従って本発明の目的は、従来の技術に内在
する上記諸欠点を解消することを可能とした新規なファ
クシミリ装置を提供することにある。
The present invention has been made in view of the above-mentioned conventional circumstances, and therefore an object of the present invention is to provide a novel facsimile apparatus capable of solving the above-mentioned drawbacks inherent in the prior art. Especially.

【0013】[0013]

【課題を解決するための手段】上記目的を達成する為
に、本発明に係るファクシミリ装置は、原稿をメモリに
蓄積する際に複数の符号化方式で符号化した時の符号量
を圧縮率演算器で算出し、読取原稿に最も適した符号化
方式を選択し、通信符号化部でこの選択された符号化方
式により符号化を行うように構成され、しかして、トー
タル的に画情報の圧縮率を高め、伝送時間の短縮を図る
ようにしている。また、画像蓄積は、固定的に1つの符
号化方式により符号化され、蓄積される。送信時には、
蓄積用復号化器で復号化し、原稿に最も適した符号化方
式で符号化をおこなうことにより蓄積用メモリ容量を最
小限で実現可能である。
In order to achieve the above object, a facsimile apparatus according to the present invention calculates a compression rate of a code amount when a document is stored in a memory and encoded by a plurality of encoding methods. It is configured so that the encoding method calculated by the device is selected and the most suitable encoding method for the read original is selected, and the communication encoding unit performs encoding according to this selected encoding method. The rate is increased and the transmission time is shortened. Further, the image accumulation is fixedly encoded by one encoding method and accumulated. When sending,
The storage memory capacity can be minimized by performing the decoding by the storage decoder and performing the encoding by the most suitable encoding method for the original.

【0014】[0014]

【実施例】次に、本発明をその好ましい一実施例につい
て図面を参照して具体的に説明する。
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, the present invention will be described in detail with reference to the accompanying drawings with reference to the accompanying drawings.

【0015】図1は、本発明に係るファクシミリ符号化
方式選択回路の一実施例を示すブロック構成図である。
FIG. 1 is a block diagram showing an embodiment of a facsimile coding system selection circuit according to the present invention.

【0016】図1を参照するに、画像読取部1によって
読み取られた画情報は、2値化部2により2値化され、
蓄積用符号化部3で符号化されて画像蓄積メモリ部5に
蓄積される。同時に2値化部2により2値化された画情
報は、圧縮率演算器6で複数の符号化方式で、ここでは
例としてMH符号化、MR符号化、MMR符号化、Wy
leの符号化、生デ−タの5つの符号化方式にて、それ
ぞれ同時に符号量が演算される。
Referring to FIG. 1, the image information read by the image reading unit 1 is binarized by the binarizing unit 2,
The data is encoded by the storage encoding unit 3 and stored in the image storage memory unit 5. The image information binarized by the binarization unit 2 at the same time is subjected to a plurality of encoding methods by the compression ratio calculator 6, and here, as an example, MH encoding, MR encoding, MMR encoding, Wy.
The code amount is calculated at the same time in each of the five coding methods of le coding and raw data coding.

【0017】通信開始後に、圧縮率演算器6は、フェ−
ズBにて受信機能力検出部11で検出された相手機の能
力とから、伝送すべき画情報の符号化方式を決定し、符
号化選択信号9を通信符号化部7へ出力する。
After the communication is started, the compression ratio calculator 6
In step B, the encoding method of the image information to be transmitted is determined from the capability of the partner device detected by the reception function detecting section 11, and the encoding selection signal 9 is output to the communication encoding section 7.

【0018】画像蓄積メモリ部5に蓄積された画情報
は、蓄積用復号化部4で復号化され、通信符号化部7で
選択された符号化方式により、符号化が行われ、MOD
EM部8で変調されて通信回線10へ出力され、しかし
て画情報が送信される。
The image information stored in the image storage memory unit 5 is decoded by the storage decoding unit 4, encoded by the encoding method selected by the communication encoding unit 7, and MOD.
The image information is transmitted after being modulated by the EM unit 8 and output to the communication line 10.

【0019】図2は、本発明における圧縮率演算器の内
部具体例を示すブロック構成図である。
FIG. 2 is a block diagram showing an internal specific example of the compression ratio calculator in the present invention.

【0020】図2を参照するに、画像入力部61に入力
された2値化画デ−タ69は、そのまま、MH符号量算
出器63、MR符号量算出器64、MMR符号量算出器
65、Wyle符号量算出器66、生デ−タカウンタ部
67へ入力される。各符号量算出器63〜66及び生デ
−タカウンタ部67では、入力された画デ−タをそれぞ
れの符号化方式で符号化した時の符号量を内部に持つカ
ウンタによってカウントする。カウントされた符号量
は、信号線72によって符号量比較器68へ入力され
る。
Referring to FIG. 2, the binarized image data 69 input to the image input unit 61 is as it is, the MH code amount calculator 63, the MR code amount calculator 64, and the MMR code amount calculator 65. , Wyle code amount calculator 66, and raw data counter 67. Each of the code amount calculators 63 to 66 and the raw data counter unit 67 counts the code amount when the input image data is encoded by each encoding method by a counter having therein. The counted code amount is input to the code amount comparator 68 via the signal line 72.

【0021】受信機能力入力及びカウンタリセット信号
生成部62は、受信機能力信号を信号線70から入力
し、受信機能力のない符号化方式に対して符号量カウン
タリセット信号71を出力する。符号量算出器63〜6
6及び生デ−タカウンタ部67のそれぞれにリセット信
号71が入力されるが、リセット信号71が入力された
符号量算出器63〜66及び生デ−タカウンタ部67の
出力は、符号量“0”を信号線72へそれぞれ出力す
る。
The reception function input / counter reset signal generator 62 receives the reception function signal from the signal line 70 and outputs a code amount counter reset signal 71 for an encoding system having no reception function. Code amount calculators 63 to 6
The reset signal 71 is input to each of the 6 and the raw data counter section 67, and the output of the code amount calculators 63 to 66 and the raw data counter section 67 to which the reset signal 71 is input is the code amount "0". Are output to the signal line 72, respectively.

【0022】各々の符号量算出器63〜66及び生デ−
タカウンタ部67でカウントされた符号量は、信号線7
2によりそれぞれ符号量比較器68へ入力される。符号
量比較器68では、符号量“0”が入力されたものは比
較対象とせずに、符号量が“0”以外のもので、1番小
さい符号量を検出し、最も小さい符号量の符号化方式選
択信号73を出力する。
Each of the code amount calculators 63 to 66 and the raw data
The code amount counted by the data counter unit 67 is
2 is input to the code amount comparator 68. The code amount comparator 68 does not treat the code amount “0” input as a comparison target, and detects the code amount other than “0” with the smallest code amount and determines the code with the smallest code amount. The conversion method selection signal 73 is output.

【0023】図2に示された実施例では、符号量算出器
を5種類としたが5種類以上でも以下でもよいことは明
らかであり、またハードウェアも図示以外のブロック構
成も容易に類推できることは勿論である。
In the embodiment shown in FIG. 2, there are five types of code amount calculators, but it is clear that there may be more than five types or less, and the hardware and block configurations other than those shown in the figure can be easily inferred. Of course.

【0024】この実施例によれば、通信符号化部7の他
に、蓄積用符号化部3を有しているが、蓄積用符号を通
信符号のうちの1つを割り当てて一個の符号化器を時分
割で使用することも可能であり、その際には符号化器の
共用化ができるのでハードウェアの縮小が可能である。
According to this embodiment, the storage encoding unit 3 is provided in addition to the communication encoding unit 7, but one storage code is assigned to one of the communication codes to encode one storage code. It is also possible to use the encoder in a time division manner, and in that case, the encoder can be shared and the hardware can be reduced.

【0025】次に、符号化方式の選択単位について述べ
る。上述したような実施例に基づいて回路を構成した場
合には、符号化方式の選択は、1送信単位(複数ペー
ジ)とページ単位の2つの方式が実現できる。
Next, the selection unit of the coding method will be described. When the circuit is configured based on the above-described embodiment, the selection of the encoding method can be realized by two methods of one transmission unit (plural pages) and page unit.

【0026】1送信単位の場合には、送信する全ての画
情報の符号量から符号化方式を決定すれば良い。1ペー
ジ単位の場合には、ページ単位で符号量を演算し、ペー
ジ単位で符号化方式をきりかえる方法である。現送信中
ページと次ページとの符号化方式が異なった場合には、
ページ間の通信手順において、符号化方式変更を相手機
に通知すれば実現可能である。
In the case of one transmission unit, the coding method may be determined from the code amount of all the image information to be transmitted. In the case of one page unit, the code amount is calculated in page units, and the encoding method is changed in page units. If the encoding method of the currently transmitting page and the next page is different,
This can be realized by notifying the other device of the encoding method change in the communication procedure between pages.

【0027】[0027]

【発明の効果】以上説明したように、本発明によれば、
送信する画情報により、最適な符号化方式を決定し伝送
するので、トータル的な通信時間の短縮が可能である。
As described above, according to the present invention,
Since the optimum encoding method is determined and transmitted according to the image information to be transmitted, the total communication time can be shortened.

【0028】本発明によればまた、複数の符号化方式が
通信時に決定されるにも関わらず蓄積用符号化/復号化
器を有しているので、画像蓄積メモリの容量が最小限で
実現できるという効果が得られる。
Further, according to the present invention, since a plurality of encoding methods are determined at the time of communication and the storage encoder / decoder is provided, the capacity of the image storage memory is minimized. The effect of being able to be obtained is obtained.

【図面の簡単な説明】[Brief description of drawings]

【図1】本発明の一実施例を示すブロック構成図であ
る。
FIG. 1 is a block diagram showing an embodiment of the present invention.

【図2】図1に示した本発明の主要部としての圧縮率演
算の具体例を示すブロック構成図である。
FIG. 2 is a block diagram showing a specific example of compression rate calculation as a main part of the present invention shown in FIG.

【符号の説明】[Explanation of symbols]

1…画像読取部 2…2値化部 3…蓄積用符号化部 4…蓄積用復号化部 5…画像蓄積メモリ部 6…圧縮率演算器 61…画像入力部 62…受信機能力入力及びカウンタリセット信号生成部 63…MH符号量算出器 64…MR符号量算出器 65…MMR符号量算出器 66…Wyle符号量算出器 67…生データカウンタ部 68…符号量比較器 7…通信符号化部 8…MODEM部 9…符号化選択信号 10…通信回線 11…受信機能力検出部 DESCRIPTION OF SYMBOLS 1 ... Image reading part 2 ... Binarization part 3 ... Storage encoding part 4 ... Storage decoding part 5 ... Image storage memory part 6 ... Compression ratio calculator 61 ... Image input part 62 ... Reception function input and counter Reset signal generation unit 63 ... MH code amount calculator 64 ... MR code amount calculator 65 ... MMR code amount calculator 66 ... Wile code amount calculator 67 ... Raw data counter unit 68 ... Code amount comparator 7 ... Communication coding unit 8 ... MODEM section 9 ... Encoding selection signal 10 ... Communication line 11 ... Reception capability detection section

Claims (2)

【特許請求の範囲】[Claims] 【請求項1】 画像読取部で送信原稿を読み取り、2値
化部において2値化されたデータをメモリに蓄積するフ
ァクシミリ装置において、前記2値化されたデータを蓄
積用符号化器で符号化し、該符号化データを画像蓄積メ
モリに蓄積するのと同時に、前記2値化された符号化デ
ータを圧縮率演算器において複数の符号化方式で符号化
した時の符号量(圧縮率)を求め、前記複数の符号化方
式で符号化した時の圧縮率と通信相手機の能力から、相
手機に最も高速に伝送できる符号化方式を選択し、前記
蓄積用復号化器で蓄積されたデータを復号化し、通信符
号化器により前記選択された符号化方式で符号化して送
信することを特徴とするファクシミリ装置。
1. A facsimile apparatus for reading a transmission original by an image reading unit and storing binarized data in a binarizing unit in a memory, wherein the binarized data is encoded by a storage encoder. , While storing the coded data in an image storage memory, at the same time obtaining the code amount (compression rate) when the binarized coded data is coded by a plurality of coding methods in a compression rate calculator , The encoding method that can be transmitted at the highest speed to the partner device is selected from the compression rate and the capability of the communication partner device when the data is stored in the storage decoder. A facsimile apparatus, which is decoded, encoded by a communication encoder according to the selected encoding method, and transmitted.
【請求項2】 前記蓄積用符号化器と前記通信符号化器
を一体にして共用化し、蓄積用及び通信用として時分割
で使用することを更に特徴とする請求項1に記載のファ
クシミリ装置。
2. The facsimile apparatus according to claim 1, wherein the storage encoder and the communication encoder are integrated and shared, and are used in time division for storage and communication.
JP4319909A 1992-11-30 1992-11-30 Fax machine Expired - Lifetime JPH0799855B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP4319909A JPH0799855B2 (en) 1992-11-30 1992-11-30 Fax machine

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP4319909A JPH0799855B2 (en) 1992-11-30 1992-11-30 Fax machine

Publications (2)

Publication Number Publication Date
JPH06169404A true JPH06169404A (en) 1994-06-14
JPH0799855B2 JPH0799855B2 (en) 1995-10-25

Family

ID=18115588

Family Applications (1)

Application Number Title Priority Date Filing Date
JP4319909A Expired - Lifetime JPH0799855B2 (en) 1992-11-30 1992-11-30 Fax machine

Country Status (1)

Country Link
JP (1) JPH0799855B2 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9260577B2 (en) 2009-07-14 2016-02-16 Toray Plastics (America), Inc. Crosslinked polyolefin foam sheet with exceptional softness, haptics, moldability, thermal stability and shear strength

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9260577B2 (en) 2009-07-14 2016-02-16 Toray Plastics (America), Inc. Crosslinked polyolefin foam sheet with exceptional softness, haptics, moldability, thermal stability and shear strength
US10301447B2 (en) 2009-07-14 2019-05-28 Toray Plastics (America), Inc. Crosslinked polyolefin foam sheet with exceptional softness, haptics, moldability, thermal stability and shear strength

Also Published As

Publication number Publication date
JPH0799855B2 (en) 1995-10-25

Similar Documents

Publication Publication Date Title
CA1119303A (en) Transmission and/or recording of digital signals
US4301479A (en) Signal processing system of facsimile
US4688100A (en) Video data encoding/decoding apparatus
US4156880A (en) Method for transmitting a facsimile signal by sequential edge differential coding
JPS6043703B2 (en) Binary signal facsimile data compression method
US4618846A (en) Data coding
JPH06169404A (en) Facsimile equipment
EP0153630A2 (en) Two dimensional coding apparatus
JPH04270569A (en) Data compression system for picture processor
US5243435A (en) Method of decoding MR codes of continuous vertical mode data for the same change points
JP4603698B2 (en) Method and apparatus for encoding / decoding
JPS5915553B2 (en) Predictive coding device
GB1570914A (en) Method and apparatus for bandwidth compression
JP3159811B2 (en) Demodulator
JP2563297B2 (en) Fax machine
SU1045409A1 (en) Line image transmission system using segment coding
KR960036695A (en) Object encoder
JPS5927503B2 (en) calligraphy communication device
JPH06245084A (en) Processor for picture data
JP2985173B2 (en) Digital information receiver
KR960006601A (en) Method and apparatus for encoding / decoding of image signal by bit division
JPS59208980A (en) Facsimile coding device
JPH05308530A (en) Facsimile equipment
JPH0522611A (en) Image coding system
JPH0813133B2 (en) Blocked entropy encoder

Legal Events

Date Code Title Description
FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20071025

Year of fee payment: 12

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20081025

Year of fee payment: 13

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20091025

Year of fee payment: 14

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20091025

Year of fee payment: 14

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20101025

Year of fee payment: 15

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20111025

Year of fee payment: 16

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20121025

Year of fee payment: 17

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20131025

Year of fee payment: 18

EXPY Cancellation because of completion of term
FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20131025

Year of fee payment: 18