Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
JPS637050B2 - - Google Patents
[go: Go Back, main page]

JPS637050B2 - - Google Patents

Info

Publication number
JPS637050B2
JPS637050B2 JP7946382A JP7946382A JPS637050B2 JP S637050 B2 JPS637050 B2 JP S637050B2 JP 7946382 A JP7946382 A JP 7946382A JP 7946382 A JP7946382 A JP 7946382A JP S637050 B2 JPS637050 B2 JP S637050B2
Authority
JP
Japan
Prior art keywords
code word
encoding method
bits
ary
coordinates
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
Application number
JP7946382A
Other languages
Japanese (ja)
Other versions
JPS58195316A (en
Inventor
Fumitaka Ono
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.)
Mitsubishi Electric Corp
Original Assignee
Mitsubishi Electric 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 Mitsubishi Electric Corp filed Critical Mitsubishi Electric Corp
Priority to JP57079463A priority Critical patent/JPS58195316A/en
Publication of JPS58195316A publication Critical patent/JPS58195316A/en
Publication of JPS637050B2 publication Critical patent/JPS637050B2/ja
Granted legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Description

【発明の詳細な説明】 本発明は画像信号等の符号化方法に関するもの
である。
DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a method for encoding image signals and the like.

n値の画像信号の出力系列を0.0から1.0迄の数
直線上に写像し、その座標をn進表示したものを
符号語としてシンボルの出力系列を符号化する数
直線表示符号化方式が知られている。
A number line representation encoding method is known in which the output sequence of an n-valued image signal is mapped onto a number line from 0.0 to 1.0, and the coordinates expressed in n-ary form are used as code words to encode the output sequence of symbols. ing.

ここでは簡単のため、以下ではnが2の場合に
ついて説明する。
For the sake of simplicity, the case where n is 2 will be described below.

第1図はその概要を示すものである。今、シン
ボル1の出現確率をr、シンボル0の出現確率を
(1−r)とする。出力系列長を3とする時、右
端のC(000)〜C(111)のそれぞれの座標を2進
表示し、区別のつく桁迄で打ち切つてそれぞれの
符号語とすれば、受信側では送信側と同様の過程
を経ることにより復号が可能である。
Figure 1 shows its outline. Now, let the appearance probability of symbol 1 be r, and the appearance probability of symbol 0 be (1-r). When the output sequence length is 3, the coordinates of each of the rightmost C (000) to C (111) are expressed in binary and truncated to a distinguishable digit to form each code word. It is possible to decode it by going through the same process as on the other side.

このような符号化方式に於いてはAi、Ciの初
期値を1.0、0.0として次のような演算により出力
系列に対する座標Ciを求めることになる。
In such an encoding system, the initial values of Ai and Ci are set to 1.0 and 0.0, and the coordinate Ci for the output sequence is determined by the following calculation.

出力シンボルaiが0の時 Ai=(1−r)Ai-1 Ci=Ci-1 出力シンボルaiが1の時 Ai=rAi-1 Ci=Ci-1+(1−r)Ai-1 さて、このような装置を作成するに当つては当
然演算精度を予め定めておく必要があり、Aiの
計算にあたつては、小数点以下で最初に1がでて
きた桁から定められた数の桁以下の数値を切捨て
ることになる。
When output symbol a i is 0 Ai = (1-r) A i-1 Ci = C i-1 When output symbol a i is 1 Ai = rA i-1 Ci = C i-1 + (1-r )A i-1 Now, when creating such a device, it is of course necessary to determine the calculation precision in advance, and when calculating Ai, the first digit below the decimal point is The numbers below the specified number of digits will be rounded down.

この演算精度の定め方に関しては有効桁数を小
さく設定するとAiが実際より小さく見積られ、
結果的にCiを表現するための桁数が増し、逆に有
効桁数を大きく設定するとAiを表現するための
桁数が増してCiを表現するための桁数が増すとい
う問題があつた。
Regarding how to determine this calculation precision, if the number of significant digits is set small, Ai will be estimated to be smaller than the actual value,
As a result, the number of digits to represent Ci increases, and conversely, if the number of significant digits is set to a large number, the number of digits to represent Ai increases, which increases the number of digits to represent Ci.

本発明は上記のような従来のものの欠点を除去
するためになされたもので、系列Siの符号化に於
いては必ずしも座標Ciを用いなくてもCiからCi+
Ai迄のどの座標位置を用いても正しく復号が可
能なことに着目し、Ci+1/2Aiをn進表示したの ち、Aiから計算される定められた桁数迄を符号
語として用いることにより、符号長の最大値が、
情報量で定められるある値以下に抑えられること
が保証され、演算精度に関してはこれを高くとれ
ばそれだけ高い効率が生じる符号化方法を提供す
ることを目的としている。
The present invention was made to eliminate the drawbacks of the conventional ones as described above, and it is possible to encode the sequence Si without necessarily using the coordinates Ci from Ci to Ci +
Focusing on the fact that correct decoding is possible using any coordinate position up to Ai, after representing Ci + 1/2 Ai in n-ary, the code can be decoded by using up to a predetermined number of digits calculated from Ai as a code word. The maximum length is
The purpose of the present invention is to provide an encoding method that guarantees that the amount of information is kept below a certain value determined by the amount of information, and that the higher the calculation precision, the higher the efficiency.

さて、シンボル系列Siが与えられた時、逐次
Ci、Aiを計算していくわけであるが、最後にCi
+1/2Aiを計算して、小数点以下何桁迄を符号語 とすればよいかを以下に説明する。まず次の式を
みたす整数値miを求める。
Now, given the symbol sequence Si, sequentially
We will calculate Ci and Ai, and finally we will calculate Ci and Ai.
How many digits below the decimal point should be used as a code word after calculating +1/2Ai will be explained below. First, find an integer value m i that satisfies the following formula.

1/2mi+1Ai<1/2mi 即ちAiを2進展開すれば以下のようになる。 1/2 mi+1 Ai<1/2 mi , that is, if Ai is expanded in binary, it becomes as follows.

次にSiと異なる系列としてS′iを考える。同様
にm′iを求めると、 Siの符号語はmi+2ビツト、S′iの符号語はm′i
+2ビツトにとる。この時Ci>C′iとしておく。
Next, consider S′i as a series different from Si. Similarly, finding m′i, we get The codeword of Si is mi + 2 bits, the codeword of S′i is m′i
Take +2 bits. At this time, let Ci > C′i.

もしmim′iなら両者の符号語の区別がつくた
めには (Ci+1/2Ai)−(C′i+1/2Ai)1/2mi+2(
1) という条件が必要である。
If mim′i, in order to distinguish between the two codewords, (Ci+1/2Ai)−(C′i+1/2Ai)1/2 mi+2 (
1) The following conditions are necessary.

またm′imiなら両者の符号語の区別がつくた
めには (Ci+1/2Ai)−(C′i+1/2A′i)1/2mi+2(
2) という条件がみたされる必要がある。
Also, in the case of m′imi, in order to distinguish between the two code words, (Ci+1/2Ai)−(C′i+1/2A′i)1/2 mi+2 (
2) must be satisfied.

ところが、CiC′i+A′iより (Ci+1/2Ai)−(C′i+1/2A′i)1/2(A
′i+A′i) 1/2(1/2mi+1+1/2mi+1) 従つて式(1)、(2)は満たされる。従つて系列Siは
mi+2ビツトで、系列S′iはm′i+2ビツトで符号
化しても両者の区別はつくことになる。
However, from CiC′i+A′i, (Ci+1/2Ai)−(C′i+1/2A′i)1/2(A
′i+A′i) 1/2 (1/2 mi+1 +1/2 mi+1 ) Therefore, equations (1) and (2) are satisfied. Therefore, the series Si is
Even if the sequence S'i is encoded using m'i+2 bits and mi+2 bits, the two can be distinguished.

また平均符号長LとエントロピHの関係は以下
のようになることが示される。
It is also shown that the relationship between the average code length L and the entropy H is as follows.

L=ΣAi(mi+2)H+2 従つて平均符号長としてはエントロピより2ビ
ツト程度大きい値を見込めば十分であり、本符号
化方法によれば高い効率で画像情報等の符号化が
可能である。
L=ΣAi(mi+2)H+2 Therefore, it is sufficient to expect the average code length to be about 2 bits larger than the entropy, and according to this encoding method, it is possible to encode image information etc. with high efficiency.

次に具体例について第2図に符号語を示す。但
しr=1/4とした。また、同期信号を優先的に
復号するシステムでは画像データに対する符号語
の長さも分かるため、符号語の最後に連続して存
在する“0”信号はこれを省くことも可能であ
る。
Next, code words for a specific example are shown in FIG. However, r=1/4. Furthermore, in a system that preferentially decodes the synchronization signal, the length of the code word for image data is also known, so it is possible to omit the continuous "0" signal at the end of the code word.

なお、本発明は画像情報以外の電気信号の符号
化にも有効である。
Note that the present invention is also effective for encoding electrical signals other than image information.

以上のように本発明によれば、Ci+1/2Aiをn 進表示したのち、このn進表示のAiを用いて所
定の式により計算される桁数までを符号語として
とるようにしたので、演算精度と独立に符号語の
必要桁数が得られ、高い効率が保証される。
As described above, according to the present invention, Ci + 1/2 Ai is expressed in n-ary and then the number of digits calculated by a predetermined formula is taken as a code word using this n-ary expressed Ai. The required number of digits of the codeword can be obtained independently of precision, and high efficiency is guaranteed.

【図面の簡単な説明】[Brief explanation of the drawing]

第1図は数直線表現符号化の原理を示す図、第
2図は本発明の一実施例による符号化方法を説明
するための図である。 A(0),A(1)〜A(111)、C(0),C(1

〜C(111)…変数。
FIG. 1 is a diagram showing the principle of number line expression encoding, and FIG. 2 is a diagram for explaining the encoding method according to an embodiment of the present invention. A(0), A(1) to A(111), C(0), C(1
)
~C (111)...Variable.

Claims (1)

【特許請求の範囲】 1 n値情報源のシンボル{0、1、2、…、n
−1}の出力系列を数値線上の0.0から1.0の間の
点に写像し、この点のn進表示された座標を符号
語として用いる符号化方法において、次の2変数
Ai、Ci Ai=rjAi-1 (但しj=0の時Ci=Ci-1) (ここでrjはシンボルjの出現確率、Ai、Ciの初
期値はそれぞれ1.0、0.0である。) を逐次所定の精度で計算し、最後に条件 1/nmi+1Ai<1/nmi をみたす整数値miを求め、Ci+1/2Aiのn進表示 された座標を小数点以下(mi+2)ビツトで打
ち切り、該(mi+2)ビツトの系列を上記出力
系列の符号語として伝送することを特徴とする符
号化方法。 2 符号語の最後に連続して存在する“0”信号
がある時はこれを省いて伝送することを特徴とす
る特許請求の範囲第1項記載の符号化方法。
[Claims] 1 Symbols of n-value information source {0, 1, 2, ..., n
-1} is mapped to a point between 0.0 and 1.0 on the numerical line, and the n-ary coordinates of this point are used as the code word. In this encoding method, the following two variables are used:
Ai, Ci Ai=r j A i-1 (However, when j = 0, Ci = Ci -1 ) (Here, r j is the probability of appearance of symbol j, and the initial values of Ai and Ci are 1.0 and 0.0, respectively.) are calculated one after another with a predetermined precision, Finally, find the integer value mi that satisfies the condition 1/n mi+1 Ai<1/n mi , truncate the n-ary coordinates of Ci+1/2Ai to the decimal point (mi+2) bits, and select the series of the (mi+2) bits. An encoding method characterized in that the output sequence is transmitted as a code word of the output sequence. 2. The encoding method according to claim 1, characterized in that when there is a continuous "0" signal at the end of a code word, the signal is omitted and transmitted.
JP57079463A 1982-05-10 1982-05-10 Encoding method Granted JPS58195316A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP57079463A JPS58195316A (en) 1982-05-10 1982-05-10 Encoding method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP57079463A JPS58195316A (en) 1982-05-10 1982-05-10 Encoding method

Publications (2)

Publication Number Publication Date
JPS58195316A JPS58195316A (en) 1983-11-14
JPS637050B2 true JPS637050B2 (en) 1988-02-15

Family

ID=13690573

Family Applications (1)

Application Number Title Priority Date Filing Date
JP57079463A Granted JPS58195316A (en) 1982-05-10 1982-05-10 Encoding method

Country Status (1)

Country Link
JP (1) JPS58195316A (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5177796A (en) * 1990-10-19 1993-01-05 International Business Machines Corporation Image data processing of correlated images

Also Published As

Publication number Publication date
JPS58195316A (en) 1983-11-14

Similar Documents

Publication Publication Date Title
NO850199L (en) PROCEDURE FOR SENDING INFORMATION, CODING FOR USE IN PROCEDURE, AND DECODING FOR USE IN PROCEDURE
JPS57176866A (en) Encoder of binary signal
BR8500200A (en) PROCESSES TO CODE N-BITS INFORMATION WORDS AND TO DECODE M-BITS CODE WORDS AND APPLIANCES FOR THEIR PERFORMANCE
JP2002305450A (en) Method for encoding/decoding decimal number into binary number
CN108391129A (en) Data-encoding scheme and device
KR20010014990A (en) A low disparity coding method for digital data
JPS637050B2 (en)
JPS5929020B2 (en) 2D block encoding method
JP2590287B2 (en) Data compression method and data compression apparatus
JP3199292B2 (en) Run-length extraction method, Huffman code conversion method, and MH coding processing method in Huffman code coding
JPS5921235B2 (en) encoding device
JP2537551B2 (en) Variable length code decoding circuit
JPS62108663A (en) Entropy recording system
JPS5899028A (en) Code converter
Mandal An approach towards development of efficient data compression algorithms and correction techniques
JPH04280517A (en) Data compression and restoring system
JP2783221B2 (en) Decryption method
JPH01302917A (en) Data compression system
JPH04315270A (en) Encoder
JP2025024868A (en) Decoder, Encoder, Decoding Method, and Encoding Method
JPS5936779B2 (en) Character pattern data transmission method
JPS5915229B2 (en) encoding device
KR920003292A (en) Digital signal modulator and its modulation method
JPS6074854A (en) Code transmission system
JPH06149537A (en) Data compression method and restoration method