JPH05324263A - Huffman code zrl processing circuit - Google Patents

Huffman code zrl processing circuit

Info

Publication number
JPH05324263A
JPH05324263A JP13383492A JP13383492A JPH05324263A JP H05324263 A JPH05324263 A JP H05324263A JP 13383492 A JP13383492 A JP 13383492A JP 13383492 A JP13383492 A JP 13383492A JP H05324263 A JPH05324263 A JP H05324263A
Authority
JP
Japan
Prior art keywords
code
zrl
signal
eob
huffman
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.)
Pending
Application number
JP13383492A
Other languages
Japanese (ja)
Inventor
Hiromitsu Takano
弘光 高野
Ko Matsushima
鋼 松島
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 Home Electronics Ltd
NEC Corp
Original Assignee
NEC Home Electronics Ltd
Nippon Electric Co Ltd
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 Home Electronics Ltd, Nippon Electric Co Ltd filed Critical NEC Home Electronics Ltd
Priority to JP13383492A priority Critical patent/JPH05324263A/en
Publication of JPH05324263A publication Critical patent/JPH05324263A/en
Pending legal-status Critical Current

Links

Landscapes

  • Image Processing (AREA)
  • Compression Of Band Width Or Redundancy In Fax (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

PURPOSE:To prevent the increase of code amount by removing all ZRL codes generated between a valid coefficient code and an EOB code. CONSTITUTION:A Huffman code conversion part 1 inputs a run length 11 and a category 12 and outputs a ZRL signal 13, a valid coefficient signal 14, an EOB signal 15, code data 16 and a data length 17. A processing instructing part 2 receives the ZRL signal 13, the valid coefficient signal 14 and the EOB signal 15 from the Huffman code conversion part 1 and outputs an instruction to a ZRL processing circuit 3. The ZRL processing circuit 3 receives the instruction of the processing instructing part 2 and outputs the code data from the Huffman code conversion part 1. That is, transmission is withheld until the valid coefficient signal arrives next when the ZRL code is inputted and the ZRL code is not transmitted when the EOB code arrives so that the transmission of the ZRL code preceding the EOB code is eliminated. Also, the ZRL code is generated at a ZRL code generating part 4, however, the ZRL code generated at the Huffman code conversion part 1 may be stored and used.

Description

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

【0001】[0001]

【産業上の利用分野】本発明は、ハフマン符号化、特に
二次元ハフマン符号化を用いたディジタル画像信号処理
装置のZRL処理回路に関する。
BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a ZRL processing circuit of a digital image signal processing apparatus using Huffman coding, particularly two-dimensional Huffman coding.

【0002】[0002]

【従来の技術】情報の伝達効率を高めるため、情報中の
個々のデータに於いて出現頻度が高いデータ程、其のデ
ータの変換符号長を短く取るという可変長符号を用いた
符号化装置が一般に使用されている。
2. Description of the Related Art In order to improve the transmission efficiency of information, there is an encoding device using a variable length code in which the conversion code length of each piece of data in the information having a higher appearance frequency is shorter. Commonly used.

【0003】この可変長符号の一種として広く用いられ
ているハフマン符号とは、ある情報源から出力される情
報中の斯くデータの生起確率が均一でなく互いに相関が
ない場合に、データ出現頻度の高い情報ほど短い符号に
変換することで、情報伝達量を効率的に圧縮するもので
ある。
The Huffman code, which is widely used as a type of variable-length code, means the occurrence frequency of data when the occurrence probabilities of such data in information output from a certain information source are not uniform and do not correlate with each other. By converting higher information into shorter codes, the amount of information transmission is efficiently compressed.

【0004】上記ハフマン符号方法を利用して変換した
データ列の例を図3−aに示す。
An example of a data string converted by using the above Huffman coding method is shown in FIG.

【0005】図に於いて、DC 21は画像符号の開始
を示す直流成分符号であり、ZRL22は0が16個続
く度に出力される符号であり、A 23は有効係数とよ
ばれる各データの符号、EOBはデータブロックの終わ
りを示す符号である。
In the figure, DC 21 is a DC component code indicating the start of an image code, ZRL 22 is a code output every 16 consecutive 0's, and A 23 is the effective coefficient of each data. The code, EOB, is a code indicating the end of the data block.

【0006】図で示されるように、有効係数符号とEO
B符号の間にもZRL符号が生成されている。
As shown in the figure, the effective coefficient code and EO
The ZRL code is also generated between the B codes.

【0007】[0007]

【発明が解決しようとする課題】このように、従来のハ
フマン符号処理回路では、ブロック中の位置を問わず、
0が16個続いた時点で常にZRL符号を出力してお
り、有効係数符号とEOB符号の間でも0が16個以上
続くと、最大3個のZRL符号を出力する。
As described above, in the conventional Huffman code processing circuit, regardless of the position in the block,
The ZRL code is always output when 16 0s continue, and when 16 or more 0s continue between the effective coefficient code and the EOB code, a maximum of 3 ZRL codes are output.

【0008】本来、EOB符号は、EOB符号の後は当
該ブロックの最後までデータ全てが0である事を意味し
ており、有効係数符号とEOB符号の間のZRL符号は
不必要に冗長度の増大させていた。
Originally, the EOB code means that after the EOB code, all the data is 0 until the end of the block, and the ZRL code between the effective coefficient code and the EOB code has unnecessary redundancy. Was increasing.

【0009】本発明は、こような不必要なZRL符号を
除去するためになされたものである。
The present invention has been made to remove such unnecessary ZRL codes.

【0010】[0010]

【課題を解決するための手段】ハフマン符号変換部か
ら、入力されたコードデータに対応して変換し出力され
るハフマン符号とは別に、これと対応してZRL信号、
有効係数信号、EOB信号の3種の信号を出力し、この
3種の信号を受けて指示を発するZRL処理指示部と、
この指示部からの指示をうけ所定のZRL処理を実行す
るZRL処理部とを設け、EOB符号に先行するZRL
符号の送出を除去する様構成した。
In addition to the Huffman code that is converted and output from the Huffman code conversion unit corresponding to the input code data, a ZRL signal corresponding to the Huffman code,
A ZRL processing instruction section that outputs three types of signals, an effective coefficient signal and an EOB signal, and that issues an instruction in response to these three types of signals;
A ZRL processing unit that executes a predetermined ZRL process in response to an instruction from this instruction unit is provided, and the ZRL preceding the EOB code is provided.
It is configured to eliminate the transmission of the code.

【0011】[0011]

【実施例】本発明の一実施例について図1のZRL処理
回路ブロック図、図2の実施例フロー図、図3の符号化
データ構成を参照して説明する。
DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described with reference to the block diagram of the ZRL processing circuit of FIG. 1, the flow chart of the embodiment of FIG. 2 and the encoded data structure of FIG.

【0012】図1のZRL処理回路ブロック図におい
て、1はハフマン符号変換部で、ラン長11、カテゴリ
12を入力してZRL信号13、有効係数信号14、E
OB信号15、符号データ16、データ長17を出力す
る。
In the block diagram of the ZRL processing circuit of FIG. 1, reference numeral 1 denotes a Huffman code conversion unit, which inputs a run length 11 and a category 12 to input a ZRL signal 13, an effective coefficient signal 14, E.
The OB signal 15, code data 16 and data length 17 are output.

【0013】2は、処理指示部で、ハフマン符号変換部
からのZRL信号13、有効係数信号14、EOB信号
15を受け、ZRL処理回路3に次のごとく指示を出
す、即ち、ZRL信号を受けると(ステップ202)、
内部カウンタのカウント数CがC<3の場合はカウンタ
を1だけカウントアップしC=C+1とし(ステップ2
08)、C=3の場合はZRL符号を出力するよう指示
する(ステップ207)。
A processing instruction unit 2 receives the ZRL signal 13, the effective coefficient signal 14, and the EOB signal 15 from the Huffman code conversion unit, and issues the following instruction to the ZRL processing circuit 3, that is, receives the ZRL signal. And (step 202),
When the count number C of the internal counter is C <3, the counter is incremented by 1 and C = C + 1 (step 2
08), and when C = 3, an instruction is issued to output the ZRL code (step 207).

【0014】有効係数信号を受けると(ステップ20
3)、カウント数と同数のZRL符号と(ステップ21
0〜214)、所定の有効変換データを出力するよう指
示を出し(ステップ215)、カウント数をリセットし
C=0とする(ステップ216)。
When the effective coefficient signal is received (step 20)
3) the number of ZRL codes equal to the number of counts (step 21
0 to 214), an instruction is issued to output predetermined valid conversion data (step 215), and the count number is reset to C = 0 (step 216).

【0015】EOB信号を受けると(ステップ20
4)、EOB符号を出力するよう指示し(ステップ21
7)、カウント数をリセットしC=0とする(ステップ
218)。
When the EOB signal is received (step 20)
4) instruct to output the EOB code (step 21
7) Then, the count number is reset to C = 0 (step 218).

【0016】以上の処理をデータが終了するまで繰り返
し終了する(ステップ205)。
The above process is repeated until the data is completed (step 205).

【0017】3は、ZRL処理回路で、指示部2の指示
を受けハフマン符号変換部からの符号データを出力す
る。
A ZRL processing circuit 3 receives the instruction from the instruction unit 2 and outputs the code data from the Huffman code conversion unit.

【0018】即ち、ZRL符号が入力された場合は、次
に有効係数信号が来るまで送出を保留し、もしEOB符
号が来た場合はZRL符号を送出しない。
That is, when the ZRL code is input, the transmission is suspended until the next effective coefficient signal arrives, and when the EOB code comes, the ZRL code is not transmitted.

【0019】なお、ZRL符号はZRL符号発生部4で
発生させるが、ハフマン符号変換部1で生成したZRL
符号を記憶させ使用しても良い。
Although the ZRL code is generated by the ZRL code generation unit 4, the ZRL code generated by the Huffman code conversion unit 1 is used.
The code may be stored and used.

【0020】図4は本発明の第2の実施例のブロック図
である。
FIG. 4 is a block diagram of the second embodiment of the present invention.

【0021】[0021]

【発明の効果】以上説明したように本発明は、アップカ
ウンタを指示部に取り付ける事により、図3−bの出力
データ構成の例に示した様に、有効係数符号とEOB符
号間に生成したZRL符号をすべて除去することが出来
るので符号量の増大を防止するという優れた効果を発揮
する。
As described above, according to the present invention, by attaching the up-counter to the instruction section, as shown in the example of the output data structure of FIG. 3B, it is generated between the effective coefficient code and the EOB code. Since all ZRL codes can be removed, an excellent effect of preventing an increase in the code amount is exhibited.

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

【図1】実施例の回路ブロック図FIG. 1 is a circuit block diagram of an embodiment.

【図2】実施例のフロー図FIG. 2 is a flowchart of an embodiment.

【図3】従来処理とZRL処理回路の出力データブロッ
ク図
FIG. 3 is an output data block diagram of a conventional processing and ZRL processing circuit.

【図4】第2の実施例の回路ブロック図FIG. 4 is a circuit block diagram of a second embodiment.

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

1 ハフマン符号変換部 11 ラン長データ 12 カテゴリデータ 13 ZRL信号 14 有効係数信号 15 EOB信号 16 符号データ 17 データ長 2 処理指示部 3 ZRL処理回路 4 ZRL符号発生部 21 画像成分の始まりである直流成分 22 ラン長16個並びの符号 23 有効係数 24 END OF BLOCK 1 Huffman code conversion unit 11 Run length data 12 Category data 13 ZRL signal 14 Effective coefficient signal 15 EOB signal 16 Code data 17 Data length 2 Processing instruction unit 3 ZRL processing circuit 4 ZRL code generation unit 21 DC component at the beginning of image component 22 Codes with 16 run lengths arranged 23 Effective coefficient 24 END OF BLOCK

─────────────────────────────────────────────────────
─────────────────────────────────────────────────── ───

【手続補正書】[Procedure amendment]

【提出日】平成5年8月10日[Submission date] August 10, 1993

【手続補正1】[Procedure Amendment 1]

【補正対象書類名】明細書[Document name to be amended] Statement

【補正対象項目名】0013[Correction target item name] 0013

【補正方法】変更[Correction method] Change

【補正内容】[Correction content]

【0013】 2は、処理指示部で、ハフマン符号変換
部1からのZRL信号13、有効係数信号14、EOB
信号15を受け、ZRL処理回路3に指示を出し、即
ち、ZRL信号4を受けると(ステップ202)、内部
カウンタのカウント数を1だけカウントアップしてC=
C+1とする(ステップ208)。
Reference numeral 2 denotes a processing instruction unit, which is a ZRL signal 13 from the Huffman code conversion unit 1, an effective coefficient signal 14, and an EOB.
When the signal 15 is received and an instruction is given to the ZRL processing circuit 3, that is, when the ZRL signal 4 is received (step 202), the count number of the internal counter is incremented by 1 and C =
C + 1 is set (step 208).

【手続補正2】[Procedure Amendment 2]

【補正対象書類名】図面[Document name to be corrected] Drawing

【補正対象項目名】図2[Name of item to be corrected] Figure 2

【補正方法】変更[Correction method] Change

【補正内容】[Correction content]

【図2】 [Fig. 2]

Claims (1)

【特許請求の範囲】[Claims] 【請求項1】 コードデータを対応ハフマン符号に変換
するハフマン符号変換部を備えたハフマン符号化装置に
於いて、 前記ハフマン符号変換部からのZRL(ZERO RU
N LENGTH)信号、有効係数信号、EOB(EN
D OF BLOCK)信号入力に対応して指示を発す
るZRL処理指示部と、前記ZRL処理指示部からの指
示をうけ所定のZRL処理を実行するZRL処理部とを
設け、 EOB符号に先行するZRL符号を除去する様構成した
ことを特徴とするハフマン符号ZRL処理回路。
1. A Huffman coding apparatus including a Huffman code conversion unit for converting code data into a corresponding Huffman code, wherein a ZRL (ZERO RU) from the Huffman code conversion unit is used.
N LENGTH) signal, effective coefficient signal, EOB (EN
A ZRL processing instruction section for issuing an instruction in response to a D OF BLOCK) signal input and a ZRL processing section for executing a predetermined ZRL processing in response to an instruction from the ZRL processing instruction section, and a ZRL code preceding the EOB code A Huffman code ZRL processing circuit characterized by being configured to remove
JP13383492A 1992-05-26 1992-05-26 Huffman code zrl processing circuit Pending JPH05324263A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP13383492A JPH05324263A (en) 1992-05-26 1992-05-26 Huffman code zrl processing circuit

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP13383492A JPH05324263A (en) 1992-05-26 1992-05-26 Huffman code zrl processing circuit

Publications (1)

Publication Number Publication Date
JPH05324263A true JPH05324263A (en) 1993-12-07

Family

ID=15114134

Family Applications (1)

Application Number Title Priority Date Filing Date
JP13383492A Pending JPH05324263A (en) 1992-05-26 1992-05-26 Huffman code zrl processing circuit

Country Status (1)

Country Link
JP (1) JPH05324263A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6091856A (en) * 1996-09-05 2000-07-18 Mitsubishi Electric Semiconductor Software Co., Ltd Picture encoding device for compressing picture data

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0377477A (en) * 1989-08-19 1991-04-03 Victor Co Of Japan Ltd Method and apparatus for variable length coding

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0377477A (en) * 1989-08-19 1991-04-03 Victor Co Of Japan Ltd Method and apparatus for variable length coding

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6091856A (en) * 1996-09-05 2000-07-18 Mitsubishi Electric Semiconductor Software Co., Ltd Picture encoding device for compressing picture data

Similar Documents

Publication Publication Date Title
US5045852A (en) Dynamic model selection during data compression
EP0540177B1 (en) Information transmission method and apparatus
KR100950607B1 (en) Huffman coding
US6677869B2 (en) Arithmetic coding apparatus and image processing apparatus
JP2766302B2 (en) Variable length code parallel decoding method and apparatus
EP0349677B1 (en) Image coding system
JPH05324263A (en) Huffman code zrl processing circuit
JP3179588B2 (en) Data encoding apparatus and method
JPH05199122A (en) Decoding circuit
EP0494038A2 (en) Run-length encoding in extensible character sets
JP3083153B2 (en) Encoding circuit
JP2880533B2 (en) Image band compression coding method
JP2612343B2 (en) Data compression method
JP3260862B2 (en) Parallel data transmission device
JPH11205154A (en) Alignment device for variable length code
JP5230375B2 (en) Image coding apparatus and image coding method
KR890004316B1 (en) Convertor to run-length codes
JPS6153896B2 (en)
JPS62209948A (en) Data compressing and transmitting method
KR0153967B1 (en) Run length decoder
US20020085764A1 (en) Enhanced data compression technique
JPH06152988A (en) Decoder for variable length encoding
JP2001102937A (en) Method and device for run-length encoding
KR0134453B1 (en) Curcuit for processing level in a run length decoder
JPH0683377B2 (en) Run length counter