KR101559824B1 - - Coding Method and Apparatus for B-Transform and Computer-Readable Recording Medium Recording Coded Data Having Structure Therefor - Google Patents

Abstract

The present invention relates to a coding method and apparatus for B-conversion and a computer-readable recording medium on which data having a structure for the B-transform is recorded.

An apparatus for encoding input data, the apparatus comprising: a B-transform unit for B-transforming input data to generate a binary representation; And an encoding unit for removing one or more binary symbols from the binary representation and generating a bitstream by scanning the binary representation from which one or more binary symbols have been removed.

According to the present invention, uniform distribution data can be efficiently encoded, and the number of bits can be reduced by encoding the binary representation generated after the B-transform of the uniform distribution data using the B-transform property, thereby improving the compression performance .

Uniformity, distribution, data, B-transform, binary representation, encoding, symbol, diagonal

Description

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a coding method and apparatus for B-conversion, and a computer-readable recording medium storing data having a structure therefor.

The present invention relates to a coding method and apparatus for B-conversion and coded data therefor. More particularly, the present invention relates to a method and apparatus for encoding and compressing data in order to effectively use a storage medium and a communication medium in the field of compression technology.

Examples of techniques for compressing random data include Huffman coding, arithmetic coding, and data compression techniques based on run-length coding. In 1948, entropy was defined by CE Shannon, and the lower limit of efficient symbol coding based on the probability model was proposed. Various encoding techniques such as Huffman coding or arithmetic coding, which can obtain a result close to the proposed lower limit, Were proposed. These encoding techniques have a problem in that a higher encoding efficiency can be obtained when the theoretical probability of entropy is shifted to a small number of symbols, and thus a high encoding efficiency can not be obtained when encoding data of a uniform distribution.

In order to solve this problem, a nonlinear Bubble-Transform technique has been proposed in order to increase the coding efficiency for data having a probability distribution model with a uniform probability distribution, where the probability is not on a small number of symbols. However, the proposed nonlinear B-transform technique only mathematically derives the upper limit of compression of uniform distribution data, and the method of efficiently encoding binary symbols ('0' and '1') caused by nonlinear B- However, there is a problem in that the encoding method is not proposed and coding is difficult yet. Therefore, there is a need to develop a technique for efficiently encoding binary symbols generated by non-linear B-transform.

In order to solve the above-described problems, the present invention is directed to a method for enhancing the coding efficiency by improving the coding efficiency by reducing the number of bits by using the B-conversion characteristic of the binary representation generated by B- There is a purpose.

According to an aspect of the present invention, there is provided an apparatus for encoding input data, the apparatus comprising: a B-transform unit for B-converting input data to generate a binary representation; And an encoding unit for removing one or more binary symbols from the binary representation and generating a bitstream by scanning the binary representation from which one or more binary symbols have been removed.

According to another aspect of the present invention, there is provided a method of encoding input data, the method comprising: a B-conversion step of B-converting input data to generate a binary representation; And an encoding step of removing one or more binary symbols in the binary representation and generating a bit stream by scanning the binary representation from which one or more binary symbols have been removed.

According to still another aspect of the present invention, there is provided a data processing method including: a step number field including a number of B-conversion steps in data generated by an encoding apparatus encoding encoded input data; And a data field including a bit string in which at least one binary symbol is removed from the binary representation generated by B-transforming the input data by the number of B-conversion steps and is generated by scanning.

As described above, according to the present invention, the uniform distribution data can be efficiently encoded, and the number of bits can be reduced by encoding the binary representation generated after B-transforming the uniform distribution data using the B-transform property It is possible to improve the compression performance and to simplify the implementation of the encoding apparatus since no separate calculation process is required.

Hereinafter, some embodiments of the present invention will be described in detail with reference to exemplary drawings. It should be noted that, in adding reference numerals to the constituent elements of the drawings, the same constituent elements are denoted by the same reference symbols as possible even if they are shown in different drawings. In the following description of the present invention, a detailed description of known functions and configurations incorporated herein will be omitted when it may make the subject matter of the present invention rather unclear.

In describing the components of the present invention, terms such as first, second, A, B, (a), and (b) may be used. These terms are intended to distinguish the constituent elements from other constituent elements, and the terms do not limit the nature, order or order of the constituent elements. When a component is described as being "connected", "coupled", or "connected" to another component, the component may be directly connected or connected to the other component, Quot; may be "connected," "coupled," or "connected. &Quot;

1 is a block diagram schematically showing a configuration of an encoding apparatus according to the present invention.

The encoding apparatus 100 according to the present invention may include a B-transform unit 110 and an encoding unit 120. [ Here, the encoding apparatus 100 may be a personal computer (PC), a notebook computer, a personal digital assistant (PDA), a portable multimedia player (PMP), a PlayStation Portable ), A mobile communication terminal, and the like, and may be a communication device such as a communication modem for performing communication with various devices or wired / wireless communication networks, various programs for encoding data, and data A memory for executing the program, a microprocessor for computing and controlling the program, and the like.

The B-transform unit 110 B-converts the input data to generate a binary representation. Here, the input data may be uniform distribution data including one piece of the summation sum data, and the B-transform is a technique of converting the uniform distribution data into a binary representation so as to efficiently encode the data.

The encoding unit 120 removes one or more binary symbols from the binary representation converted by the B-transform unit 110, and generates a bit stream by scanning the binary representation from which one or more binary symbols have been removed.

The encoding unit 120 may analyze one or more binary symbols in the binary representation by analyzing the correlation between binary symbols of the binary representation, and may convert the binary representation from which one or more binary symbols have been removed into a raster scan direction or a diagonal line. Direction to generate a bit stream.

Here, one or more binary symbols removed from the binary representation may be binary symbols from the last binary symbol of the binary representation generated by performing the i < th > B-transform on the symbol stream of the input data to the i-th binary symbol.

The one or more binary symbols removed from the binary representation are subjected to i + 1 th B-conversion when the value of the j-th binary symbol of the binary representation generated by the i < th & May be the j-1 < th > binary symbol of the generated binary representation. In this case, the encoding unit 120 can scan the binary representation in the diagonal direction at 135 degrees.

If the value of the j-th binary symbol of the binary representation generated by the i < th > B-transform of the symbol stream of the input data is '1', the at least one binary symbol removed from the binary representation is 1 < th > binary symbol of the binary representation generated by the < RTI ID = 0.0 > In this case, the encoding unit 120 can scan the binary representation in the -45 direction as the diagonal direction.

In addition, the encoding unit 120 can generate a bit stream by encoding the number of '1' to be read when scanning in the diagonal direction. In this case, the number of bits required to encode the number of '1' is determined, and the number of '1' can be encoded by expressing the number of '1' as a binary number according to the determined number of bits. When the most significant bit of the binary number representing the number is '1', only the most significant bit can be included in the bit string.

The encoding unit 120 determines the number of bits required to encode the number of '1' when a bit string is generated by encoding the number of '1' to be read when scanning in the diagonal direction, And an alignment identifier having a number of '1' that is greater than or equal to '1' is encoded with a determined number of bits. In case of an alignment identifier having a maximum number of bits from an alignment identifier having a number of '1' In the case of the remaining sorting identifier, the number of bits determined by subtracting one bit from the number of bits is encoded, and the position of the sorting identifier requiring a maximum number of bits can be further encoded.

Also, the encoding unit 120 determines the number of bits required to encode the number of '1's, encodes it into the determined number of bits up to the sorting identifier having the number of' 1 'that is greater than or equal to the threshold value, The number of bits determined by subtracting one bit from the number of bits determined from the sorting identifier following the sorting identifier having the number of '1s' that is greater than or equal to 1 can be encoded. In this case, when the sorting identifier having the number of '1' equal to or greater than the threshold value is located near the end or the end of all the sorting sequences, the number of bits to be reduced is small. Therefore, 1 " by adaptively determining one direction of " 1 " and " reverse ".

Also, the encoding unit may determine fewer of the binary symbols of the binary representation from which one or more binary symbols have been removed as the Most Probable Symbol (MPS).

Hereinafter, a specific embodiment for encoding a binary representation using B-transform properties according to the present invention will be described.

FIG. 2 is an exemplary diagram illustrating the properties used to B-transform and encode input data according to the present invention.

이 X에 대한 이진 표현으로 정의된다. 집합

들을 통해 도 1에 도시한 바와 같은 성질 1 내지 성질 3의 성질들이 있음을 알 수 있는데, 이러한 성질들을 이용하면 B-변환 후에 발생하는 X에 대한 이진 표현을 효과적으로 부호화할 수 있다.In the B-transform (Bubble-Transform), a set of binary symbols occurring after successive M _X B-transforms on the generated symbol sequence X

Is defined as a binary representation of X. set

1 through 3, it is possible to efficiently encode the binary representation of X that occurs after the B-conversion.

In Equation (1), n, i, j are each an arbitrary integer.

Referring to FIG. 1, Property 1 indicates that the number of binary symbols in a binary representation can be reduced each time B-transform is performed on a symbol sequence X of binary data. That is, in the binary representation generated by performing the i < th > B-transformation on the symbol sequence X of the input data, the binary symbol from the last binary symbol of the binary representation to the binary symbol located at the ith binary symbol is always & 0 ', it means that coding can be omitted. Therefore, by using the property 1, it is possible to reduce the number of bits of encoded data.

If the jth binary symbol of the binary representation of the binary representation of the symbol sequence X of the binary data is '0', the j-1 th binary symbol of the (i + 1) th B- Respectively. That is, when each binary symbol of the binary representation in which the symbol stream of the input data is B-transformed is represented by a table according to the number of B-transform steps, when the binary symbol at an arbitrary position in the table is '0' The remaining binary symbols located in the diagonal lower left direction at the position of the binary symbol are all '0'. Therefore, when the value of the j-th binary symbol of the binary representation generated by the i < th > B-transform of the symbol stream of the input data is '0', the j- 1 < th > binary symbol can be omitted, the bit of the data to be encoded can be reduced by using the property 2.

The property 3 is that if the binary symbol of the jth order of the binary representation of the symbol sequence X of the input data is '1', then the (j + 1) th binary symbol of the i- 1 '. That is, when each binary symbol of the binary representation in which the symbol stream of the input data is B-transformed is represented by a table according to the number of B-transformation steps, when the binary symbol at an arbitrary position in the table is '1' The remaining binary symbols located in the upper right diagonal direction at the position of the binary symbol are all '1'. Therefore, when the value of the j-th binary symbol of the binary representation generated by the i < th > B-transform of the symbol stream of the input data is '1', the (j + Since the symbol can be omitted, if the property 3 is used, bits of data to be encoded can be reduced.

3 is an exemplary diagram illustrating a process of generating a binary representation by B-transforming input data according to the present invention.

Collective sum S = {1,2, ... , 16}, the symbol string of the input data generated so that the data of the summation sum is uniformly distributed one by one, and X is {2,5,3,1,11,12,15,8,7,6,6,16,4,9 , 10, 14, 13}, the symbol sequence X can be B-transformed as shown in FIG.

는 1 번째 B-변환한 후 생성되는 이진 표현,

는 2 번째 변환한 후 생성되는 이진 표현을 나타낸다. 도 3을 통해 알 수 있듯이, 각 B-변환에 의해 생성되는 이진 표현의 이진 심볼의 개수는 입력 데이터의 심볼열의 개수보다 한 개 작다.In FIG. 3, X denotes a symbol stream of input data, X _(M1) denotes a symbol stream of input data rearranged after first B-conversion, X _(M2) denotes a symbol of input data rearranged after second B- ≪ / RTI >

Is a binary representation generated after the first B-transform,

Represents a binary representation generated after the second transformation. As can be seen from FIG. 3, the number of binary symbols in the binary representation generated by each B-transform is one less than the number of symbol streams in the input data.

Referring to FIG. 3, the symbol sequence X of the input data symbol sequence is sequentially compared with the next symbols. If two symbols are arranged in ascending order, the binary symbol '0' And outputs the binary symbol '1' if the two symbols are not arranged in ascending order. In this case, when two symbols are not arranged in ascending order, and the binary symbol '1' is outputted, the two symbols are sorted in ascending order by changing the order of the two symbols. When the next two symbols are compared, And the next symbol.

For example, when the symbol string X of the input data is B-converted once, the first symbol '2' of the symbol string X of the input data is compared with the second symbol '5'. At this time, since '2' and '5' are arranged in ascending order, a binary symbol '0' is output. Since the binary symbol is output as '0', the position of the symbol is not changed. Therefore, the first symbol of X _(M2) becomes '2'. Thereafter, since the position of the symbol is not changed, the second symbol '5' is compared with the third symbol '3'. At this time, since '5' and '2' are not arranged in ascending order, a binary symbol '1' is output. In this case, since the binary symbol is outputted as '1', the positions of the symbols '5' and '3' are changed. Therefore, the second symbol of X _(M2) becomes '3'. Next, since the position of the symbol is changed, the symbol '5' is compared with the fourth symbol '1', the binary symbol is outputted according to the ascending order, and the position of the symbol is changed accordingly. And outputs the binary symbol by comparison, thereby completing the first B-conversion. Conversion is performed in the same manner for each B-conversion including the second B-conversion.

FIG. 4 is an exemplary diagram showing a table in which a property 1 is applied to a binary expression generated after B-transform according to the present invention.

The symbol sequence X of the input data is B-transformed 8 times in the manner described above through FIG. 3, and the binary representation generated by the B-transformation of each step is expressed in the form of a table by applying the property 1, . Referring to FIG. 4, the total number of binary symbols of the binary representation generated after the first B-conversion is 15. The total number of binary symbols of the binary representation generated after the second B-conversion is 14, The total number of binary symbols in the binary representation generated after the second B-transform is eight. In fact, the total number of binary symbols in the binary representation is 15, regardless of the number of B-transformation steps. However, as the number of steps of the B-transformation increases, As the number of binary symbols increases, the last binary symbols of the binary representation can be predicted according to the number of B-transform steps. Therefore, since some of the binary symbols that can be generated according to the B-transform can be predicted by the property 1, it is possible to restore the predictable binary symbol without encoding the binary symbol, thereby reducing the number of binary symbols to be encoded The number of bits can be reduced. In FIG. 4, d ₁ to d ₁₅ represent binary symbols of a binary representation generated by B-transforming a symbol string of input data, and can be generalized as d _n .

FIG. 5 is an exemplary diagram showing a form of a table by applying a property 2 to a binary representation generated after B-transform according to the present invention.

If property 2 is applied to the binary data shown in Fig. 4, it can be expressed as shown in Fig. According to property 2, if the binary symbol at an arbitrary position in the table is '0', it can be predicted that all the remaining binary symbols located in the lower left diagonal direction at the position of the corresponding binary symbol are '0'. That is, in the table of FIG. 4, the binary symbols after the binary symbol having the first value of '0' among the binary symbols located on the same line in the diagonal direction (for example, 135 °) 0 ".

Therefore, all the binary symbols after the binary symbol having the value of '0', which are first among the binary symbols located on the diagonal line, can be predicted as '0', and therefore, they can be omitted as shown in FIG. In addition, binary symbols that can be skipped can be restored without coding, thereby reducing the number of binary symbols to be coded and reducing the number of bits.

FIG. 6 is a diagram illustrating a state in which a property 2 is applied to a binary representation generated after B-conversion according to the present invention and scanning is performed in a diagonal direction.

The total number of binary symbols of the binary representation shown in FIG. 5, that is, the number of bits is 50, and the binary symbols in the table are sequentially scanned in the raster scan direction to transmit the scanned bits as bit strings, As described above, scanned bits scanned in the diagonal direction of 135 DEG can be transmitted as bit strings, and the original binary representation can be restored by inverse scanning the transmitted bit strings in the same manner.

For example, in the case of scanning in the raster scan direction, the bit string of the binary representation shown in FIG. 5 may be {01100011101111101111111111111111010111110011000111}. In addition, as shown in Fig. 6, when scanning is performed diagonally, the bit string of the binary representation shown in Fig. 5 may be {01011100011101111011111001111111111110111101101110}. When the encoding apparatus generates and transmits a bit stream in this manner, the decoding apparatus can reverse-scan the received bit stream according to the scanning direction to recover all the symbols of the binary representation.

On the other hand, when the binary representation shown in FIG. 5 is scanned in the diagonal direction shown in FIG. 6, the rule as shown in Equation 2 can be found. That is, FIG. 5 and as can be seen with reference to FIG. 6, n is, if equal to or smaller than M _X, the binary symbols that is, the maximum number of bits which may have in the position of d _n (max_ bit (d _n)) is n Games . And M n is greater than _X, the maximum number (max_ bit (d _n)) of bits which may have in the position of d _n can know the M _X Games.

max_ bit (k) denotes the bits that can be generated with a maximum in the k position.

When the binary representation shown in FIG. 5 is scanned in the diagonal direction shown in FIG. 6, a rule like Equation (3) can be additionally found. That is, when a binary symbol having a value of '0' is generated in the process of scanning in the diagonal direction according to the property 2, it is not necessary to read and code the next binary symbol in the next position in the diagonal direction. The fact that the encoder does not need to read and code the next binary symbol means that the number of binary symbols having a value of '1' among the binary symbols read when the decoding apparatus scans in the diagonal direction at the position of d _n , It means that all the binary expressions shown in Fig. 4 can be restored.

Therefore, the encoder encodes only the number of binary symbols having to read the binary symbols of the '1' value when scanning a diagonal direction, and wherein the number of binary symbols for each position of the d _n has a value of '1' (bit ( d _n ) can be calculated by Equation (3).

In Equation (3), Ceil ( x ) is the largest integer in the number less than or equal to x .

FIG. 7 is an exemplary diagram showing the number of bits necessary for encoding in the case of scanning the binary representation after the B-conversion according to the present invention in the diagonal direction.

Applying the equation (3) For example, the symbol column of the proposed input data (that is, in the case of N = 16), encoding the number of binary symbols having a value of '1' at the position of d _n (1≤ _n ≤16) The number of bits required to perform the above operation can be expressed as shown in FIG. Referring to FIG. 7, the total bits required for coding are 49 bits.

Expanding the total number of bits (bit _Prop _ Total (N)) necessary for this coding in the general case, not when N is 16, it is possible to derive the equation (4).

일 때, 생성되는 비트수이며, 오른쪽 항의 오른쪽 부분은 n의 범위가

≤n<N일 때, 생성되는 비트수이다. 균일 분포 무작위 데이터의 심볼열 X의 길이가 N이면, 엔트로피 기법 등 다양한 부호화 기법을 이용하여 부호화한 경우, 총 비트(Total_bit _Entropy (N))는 수학식 5와 같이 구할 수 있다. 수학식 5에서는 엔트로피 부호화를 이용하여 부호화한 경우의 총 비트수를 계산하는 수학식을 나타내었지만, 그 부호화 기법에 따라 다양한 수학식이 도출될 수 있다.In Equation (4), the left part of the right term indicates that the range of n is 1? N <

When, the number of bits to be generated, the right side of the right term is in the range of n

Lt; n < N. If the length of the symbol stream X of uniformly distributed random data N, when the coding is performed using the various entropy coding methods such as techniques, total number of bits (bit _Entropy _ Total (N)) can be obtained as shown in equation (5). Equation (5) shows a mathematical expression for calculating the total number of bits when entropy coding is used, but various mathematical expressions can be derived according to the coding method.

Thus, when the binary representation generated after B- transcoding by using a diagonal scan, the gain (Gain) that can be obtained can be calculated by the equation (6).

FIG. 8 is an exemplary diagram illustrating a binary representation for encoding the number of '1' s to be read when scanning in the diagonal direction according to the present invention.

When the binary data exemplarily shown in FIG. 2 is encoded by the method described above with reference to FIGS. 6 and 7 and Equations 2 to 6, the binary data can be encoded in the order shown in FIG. That is, the number of bits necessary for encoding the binary symbol value '1' of each d _n of the binary data shown in FIG. 2 is calculated, and the number of '1' is calculated when scanning in the diagonal direction for each d _n , And the number of '1' is converted into a binary number, a new binary representation is generated as shown in FIG.

Referring to FIG. 8, when the number of bits necessary to encode the number of '1' at the position of d ₁ is calculated using Equation (3), and when scanning in the diagonal direction at the position of d ₁ , Since the number is zero, the binary representation for encoding it is represented by '1'. When the number of bits required to encode the number of '1' at the position of d ₂ is calculated using Equation (3), the number of '1' when scanning in the diagonal direction at the position of d ₂ is one , The binary representation for encoding it is represented by '01'. When the number of bits required to encode the number of '1' at the position of d ₇ is calculated using Equation (3), the number of '1' when scanning in the diagonal direction at the position of d ₇ is 3 , The binary representation for encoding it is represented by '011'. When d ₁ to d ₁₅ are coded in this manner, a binary representation is generated as shown in FIG. Therefore, when coding is performed as described above, the symbol sequence X generated as uniform distribution data can be encoded and expressed as a bit string {1011100000000001101000101000010000100010000100011}.

에서 d _N 까지의 비트 중 일부분의 비트를 제거할 수 있다.As described above, when the number of '1' s is calculated in the diagonal direction for each d _n , the number of '1' is converted into a binary number to be encoded, and then, using the information of M _X , Similarly, you can remove the extra bits. That is, M _X is the number of stages of the B-conversion. Since the number of 1's of each d _n can not be larger than M _X ,

Lt; _{RTI ID} = _0.0 &gt; dN. &Lt; / RTI &gt;

For example, in the binary representation shown in FIG. 4, M _X is 8, so it is '1000' if expressed in binary numbers. According to Equation (2), since the number of 1's of d _n can not be greater than M _X , d ₈ to d ₁₅ can have values from 0000 to 1000 because they must be less than or equal to M _x . In the case of d ₁₁ , since the number of '1' is 8, it can be expressed as '1000'. Here, since the maximum value of M _X is '1000', if the most significant bit (MSB) is '1', the remaining 3 bits of the total 4 bits are necessarily 000. Accordingly, when the most significant bit is received in the decoding apparatus, the number of the original '1' can be known without restoring the remaining three bits '000', and the corresponding binary symbol can be recovered. Therefore, the encoding apparatus does not need to transmit the remaining 3 bits '000', and accordingly, 3 bits can be further compressed.

9 is an exemplary diagram illustrating the number of bits that can be reduced using the number of steps according to the present invention.

The above example can be generalized as shown in FIG. 9 when N is 16 and M _X is equal to or greater than 8. That is, in the case of d _n where the number of '1' is M _X , the bit can be reduced as shown in FIG. For example, if M _X is 9, then d _n with a number of '1' s can be expressed as '11' by omitting '00' from the original binary representation '1001' have.

이 d _N 의 위치에 있는 모든 심볼에 적용할 수 있다.Thus, the bits can be reduced from a maximum of 3 bits to a 0 bit per single alignment identifier ( d _n ) using the rule that the number of 1's of each d _n can not be greater than M _x . Such a method is not limited to the example shown in Fig. 9,

This can be applied to all symbols in position d _N.

에서 d _N 까지 중 '1'의 개수가

보다 크거나 같은 d _N 은 적다. 도 7에 나타낸 예시에서, d ₈ ~d ₁₅ 사이에서의 '1'의 개수가 8보다 크거나 같은 경우는 d ₁₁ 의 하나의 경우가 있다. 따라서, 실제로 d ₈ ~d ₁₅ 중에서 d ₁₁ 을 제 외하면 3비트로 충분히 '1'의 개수를 표현할 수 있다. 하지만, 복호화 장치에서는 실제 d ₈ ~d ₁₅ 중에서 d ₁₁ 을 제외하면 3비트로 표현할 수 있다는 정보를 부호화해야 하는데, 두 가지 방법이 있다.In addition to this, in another method, binary symbols representing the number of '1's in binary numbers can be omitted, as will be described later. That is, when N is small (for example, N < 64)

In the number of "1" of up to d _N

D _N less than or equal to. In the example shown in FIG. 7, d ₈ ~ d when the number of "1" of between ₁₅ greater than or equal to 8, there is a case of one of the d _11. Accordingly, it is actually when the outer ~ d ₈ d ₁₅ d ₁₁ from the fully represent the number of "1" by 3 bits. However, in the decoding apparatus, it is necessary to encode information indicating that the d ₈ to d ₁₅ can be represented by 3 bits except d _11, and there are two methods.

The first method is to encode the position of d ₁₁ . For example, since d ₈ to d ₁₅ are 8 in total, they can be represented by 3 bits. Therefore, if d ₈ is represented as '000' as a reference point, d ₁₁ can display its position as '100'. In the decoding apparatus, d ₈ , d ₉ , d ₁₀ , d ₁₂ , d ₁₃ , d ₁₄ , and d ₁₅ can be decoded using only 3 bits and decoded using d ₁₁₄₄ bits using this position. In this case, an additional 3 bits are required to indicate the position, but this can be reduced by 7 bits, thus reducing the total of 4 bits. However, as in this example, if there are two or more d _{n that} are equal to or greater than 8, the number of bits required to encode the actual position may be greater than the number of bits that can be reduced accordingly.

That is, assuming that the generated symbol stream X of length N is encoded in the diagonal direction from the binary data, i.e., d ₁ to d _N-1 , after performing the B-conversion, the number of '1' (That is, sorting identifiers d _n that are encoded using the same number of bits), and the number of ds in the interval is defined as K (for example, in FIG. 7, d ₈ to d ₁₅ is the same by using the four bits can represent the number of "1", the number of the interval is eight, is K = 8.), in order to express the position of the K d specific one of the d T bit . T can be calculated using Equation (7).

Assuming that n positions are displayed in this K , the required bit is nT . The position except for this is Kn , and it is possible to reduce the bit by one for each position. To reduce the bit, Equation (8) must be satisfied.

FIG. 10 is a diagram illustrating a condition for reducing a bit when encoding the position of an alignment identifier requiring a maximum number of bits according to the present invention.

10 is obtained by summarizing Equation (8) for several K and obtaining n satisfying Equation (8). 10, the larger the size n of which is greater the more K allows, n is the greater number of bits can be reduced The more smaller. However, additional information that is necessary to encode and transmit the number of n is also needed.

보다 크거나 같은 d _n 의 개수만을 전송하고 '1'의 개수가

보다 크거나 같은 d _n 을 전송할 때까지는 모든 비트를 전송하며, 그 다음 비트부터는 1비트씩 덜 전송하는 방법이다. 다시 도 7의 예에서의 d ₈ ~d ₁₅ 를 부호화한다고 가정하면, d ₈ ~d ₁₅ 중

보다 크거나 같은 d _n 은 d ₁₁ 만 존재하므로 개수는 1개이다. '1'을 부호화한 후, 실제 데이터를 순서대로 전송한다. 즉, d ₈ 은 '0100'으로, d ₉ 는 '0101'로, d ₁₀ 은 '0000'으로, d ₁₁ 은 '1000'으로 전송한다. d ₁₁ 은 '8'보다 크거나 같은 수이므로(N이 16이므로,

는 '8'이다.), d ₁₂ 부터는 '7'보다 작은 수임을 알 수 있고, 3비트로만 부호화할 수 있다는 것을 알 수 있다. 따라서, d ₁₂ 는 '100'으로, d ₁₃ 은 '100'으로, d ₁₄ 는 '010'으로, d ₁₅ 는 '011'로 부호화하며, 총 3비트를 줄일 수 있다.In the second method, the number of '1'

Only the number of d _{n that} is greater than or equal to the number of '1'

All bits are transmitted until a greater than or equal to d _n is transmitted, and less bits are transmitted from the next bit by one bit. Assuming again encoding d ₈ to d ₁₅ in the example of FIG. 7, d ₈ to d ₁₅ medium

There is only one d _n, because there is only d ₁₁ , which is greater than or equal to d _n . After encoding '1', the actual data is transmitted in order. That is, d ₈ is transmitted as '0100', d ₉ as '0101', d ₁₀ as '0000', and d ₁₁ as '1000'. d ₁₁ is a number equal to or greater than '8' (since N is 16,

Is '8'). From d _12, it is known that the number is smaller than '7', and it can be encoded with only 3 bits. Therefore, d ₁₂ is encoded as '100', d ₁₃ as '100', d ₁₄ as '010' and d ₁₅ as '011', and the total 3 bits can be reduced.

보다 크거나 같은 d _n 의 위치에 따라 비트를 줄일 수 있는 정도의 차이가 매우 크다는 점이다. 만약, '1'의 개수가

보다 크거나 같은 d _n 의 위치가 부호화 순서(전송 순서)상 앞에 위치한다면 많은 비트를 줄일 수 있는 반면, 뒤에 위치한다면 줄일 수 있는 비트가 적어지며, 마지막에 위치한다면 줄일 수 있는 비트가 없다.However, the problem with the second method is that the number of '1'

The difference in the degree of bit reduction is very large depending on the position of d _n , which is greater than or equal to d _n . If the number of '1'

If the position of d _n , which is greater than or equal to d _n, is placed in front of the coding order (transmission order), many bits can be reduced. On the other hand, there are fewer bits that can be reduced.

보다 크거나 같은 d _n 의 위치가 부호화 순 서상 뒤에 위치하거나 마지막에 위치할 때 비트를 줄일 수 없는 비효율을 줄이기 위해, 역방향 탐색을 사용할 수 있다. 예를 들어, 전술한 예에서, d ₁₅ ,d ₁₄ ,d ₁₃ ,…,d ₈ 의 순서로 부호화(또는 전송)하는 것이다. 이 경우, 정방향 탐색과 역방향 탐색을 표시하기 위해 1비트가 추가로 전송되어야 한다. 여기서, 정방향 탐색이란 '1'의 개수가

보다 크거나 같은 d _n 에 대해 d ₈ ,d ₉ ,d ₁₀ ,…,d ₁₅ 의 순서로 부호화하는 것을 말하며, 역방향 탐색이란 d ₁₅ ,d ₁₄ ,d ₁₃ ,…,d ₈ 의 순서로 부호화하는 것을 말한다.Therefore, if the number of '1'

In order to reduce the inefficiency that the bit can not be reduced when the position of d _n , which is greater than or equal to d _n, is located after the coding order or is located at the end, reverse searching can be used. For example, in the above example, d ₁₅ , d ₁₄ , d ₁₃ , ... , and d ₈ in this order. In this case, one bit must be further transmitted to indicate the forward search and the reverse search. Here, the forward search means that the number of '1'

D ₈ , d ₉ , d ₁₀ , ... for d _n greater than or equal to ... , d ₁₅ , and the reverse search is to encode d ₁₅ , d ₁₄ , d ₁₃ , ... , and d ₈ in this order.

보다 크거나 같은 d _n 은 한 개밖에 없다고 가정한다. 이러한 가정하에서, 정방향 탐색만을 수행할 경우, 줄일 수 있는 비트수(Bit _Right )는 수학식 9를 이용하여 구할 수 있다.In order to generalize the case of encoding according to the second method described above, a generated symbol sequence X having a length N is subjected to B-conversion and then scanned in a diagonal direction from a binary expression, i.e., d ₁ to d _N-1 , (That is, an alignment identifier d _n using the same number of bits), it is defined that the number of d' s in the interval is K In FIG. 7, d ₈ to d ₁₅ can express the number of '1' by using 4 bits in the same manner, and the number of these intervals is 8 and K = 8) Number of

Suppose there is only one d _{n that} is greater than or equal to. Under this assumption, if only the forward search is performed, the number of bits to be reduced ( Bit _Right ) can be obtained using Equation (9).

In Equation (9), it is assumed that the distribution of n has a uniform distribution.

In addition, when the forward search and the backward search are adaptively performed, the number of bits that can be reduced ( Bit _Adaptive ) can be obtained using Equation (10).

Comparing Equations (9) and (10), it can be seen that as the K increases, more bits can be reduced when the direction is selected adaptively.

The above embodiments are based on the method of removing the '0' in the diagonal direction and counting the number of '1' using the property 2. In the present invention, bits can be reduced using not only the property 2 but also the property 3.

FIG. 11 is an exemplary diagram showing a form of a table in which a property 3 is applied to a binary expression generated after B-transform according to the present invention.

Applying Property 3 to the table of FIG. 4, which is an exemplary representation of a binary representation that occurs after B-transforming the symbol string of the input data, can be represented as shown in FIG. In order to transmit the binary symbols shown in FIG. 11, that is, bits are scanned and transmitted in order from the leftmost row to the raster scan direction, or as shown in FIG. 12, I.e., a diagonal line, and can be encoded and transmitted.

FIG. 12 is a diagram illustrating a state in which a property 3 is applied to a binary expression generated after B-conversion according to the present invention and scanning is performed in a diagonal direction.

As shown in FIG. 12, in the case of applying the property 3 to the binary representation generated after the B-conversion and scanning the bits in the diagonal direction, that is, in the -45 direction, as in the case where the property 2 is applied, You can find the same rules as. That is, n is equal to or less than M, if _X, the maximum number of bits which may have in the position of d _n (max_ bit (d _n)) is can be seen that n Games. And M n is greater than _X, the maximum number (max_ bit (d _n)) of bits which may have in the position of d _n can know the M _X Games. Also, when '1' is found in the process of scanning bits in the diagonal direction according to the property 3, it is not necessary to encode the next binary symbol because it is '1'. This means that all binary data shown in FIG. 4 can be restored if the number of '0's' in binary symbols read when the decoding apparatus scans in the diagonal direction at the position of d _n is known.

Therefore, when the binary symbol is scanned in the diagonal direction according to the property 3, the number of '1's is' 0' when compared with the case of scanning binary symbols in the diagonal direction according to the property 2 All properties are identical except for the changes. Therefore, a description of a method of scanning and encoding a binary symbol in a diagonal direction according to the above-described property 2 can similarly be applied to the property 3 as well.

After encoding the binary representation generated by B-converting the symbol sequence X of the input data, the maximum possible symbol reverse flag (RF) is determined as in the above embodiment. In the conventional method, the maximum likelihood symbol is determined by analyzing the distribution of binary symbols having '0' and '1' in the binary representation after B-transform. That is, if the number of '0' is large, the maximum possible symbol is determined as '0', and if the number of '1' is large, the maximum possible symbol is determined as '1'. However, in the present invention, the maximum possible symbols are not determined according to the distribution of '0' and '1', but are encoded using the property 2 and the property 3, And determines the bit as the maximum possible symbol.

Similarly, the reverse flag also determines the direction in which the output bit becomes minimum after performing both the forward search and the reverse search. For example, if the output bit is minimum after performing the forward search, it is determined as '0', and if the output bit is minimum after performing the reverse search, it can be determined as '1'.

On the other hand, the encoding unit 120 of the encoding apparatus 100 encodes the input data to generate data. The generated encoded data includes a number of steps field including the number of B-conversion steps and a number of steps field including the number of B- And a data field including a bit string generated by scanning one or more binary symbols from the binary representation generated by the B-transform.

In addition, the encoded data may further include a maximum possible symbol field including a flag indicating a maximum possible symbol, where the maximum possible symbol may be fewer of the binary symbols of the binary representation from which one or more binary symbols have been removed . The encoded data may further include an inverse flag field including a flag indicating whether or not to search backward.

13 is a diagram illustrating a structure of encoded data obtained by encoding a binary representation generated after B-conversion according to the present invention.

The structure of the encoded data as described above can be represented as shown in FIG. M _X represents the number of stages of the B-transform, and the maximum possible symbol represents the binary symbol 0 generated frequently after the B-transformation and the binary symbol generated frequently. According to the present invention, not only the maximum possible symbol is determined according to the distribution of binary symbols, but a rarely generated symbol is determined as the maximum possible symbol after reducing the bits by applying the characteristics 2 and 3 according to the present invention.

The inverse flag is used to generate the symbol sequence X = {x ₁ , x ₂ , ... , x _N } and a new symbol string X ' = {x _N , x _{N 1} , ... , x ₁ } is a flag that can indicate which value was used when selecting a smaller value among the values of the number of steps M _X and M _{X '} of the two conversions for each. In the present invention, the inverse flag indicates the direction in which the output bit becomes minimum after performing both the forward search and the backward search. In the structure of the encoded data shown in FIG. 12, the fields that can be compressed by encoding using the properties 1 to 3 are data fields.

14 is a flowchart for explaining a coding method according to the present invention.

In operation S1410, the encoding device 100 performs a B-transformation on a symbol string of input data to generate a binary representation (S1410), removes one or more binary symbols from the binary representation by applying a property 1 to a property 3 to the binary representation (S1420) Each binary symbol of the binary representation from which one or more binary symbols are removed is scanned in the raster scan direction or the diagonal direction to generate a bit stream (S1430). The bit stream thus generated may be combined with the number of steps or combined with at least one of the number of steps, the maximum possible symbol and the inverse flag to generate encoded data and transmitted to the decoding apparatus. In addition, when the encoding apparatus 100 scans each binary symbol of the binary representation from which one or more binary symbols have been removed in the diagonal direction to generate a bit string, the encoding apparatus 100 uses the various techniques described above with reference to FIGS. Can be further reduced.

While the present invention has been described in connection with what is presently considered to be the most practical and preferred embodiment, it is to be understood that the invention is not limited to the disclosed embodiments. That is, within the scope of the present invention, all of the components may be selectively coupled to one or more of them. In addition, although all of the components may be implemented as one independent hardware, some or all of the components may be selectively combined to perform a part or all of the functions in one or a plurality of hardware. As shown in FIG. The codes and code segments constituting the computer program may be easily deduced by those skilled in the art. Such a computer program can be stored in a computer-readable storage medium, readable and executed by a computer, thereby realizing an embodiment of the present invention. As the storage medium of the computer program, a magnetic recording medium, an optical recording medium, a carrier wave medium, or the like may be included.

Furthermore, the terms "comprises", "comprising", or "having" described above mean that a component can be implanted unless otherwise specifically stated, But should be construed as including other elements. All terms, including technical and scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs, unless otherwise defined. Commonly used terms, such as predefined terms, should be interpreted to be consistent with the contextual meanings of the related art, and are not to be construed as ideal or overly formal, unless expressly defined to the contrary.

The foregoing description is merely illustrative of the technical idea of the present invention, and various changes and modifications may be made by those skilled in the art without departing from the essential characteristics of the present invention. Therefore, the embodiments disclosed in the present invention are intended to illustrate rather than limit the scope of the present invention, and the scope of the technical idea of the present invention is not limited by these embodiments. The scope of protection of the present invention should be construed according to the following claims, and all technical ideas within the scope of equivalents should be construed as falling within the scope of the present invention.

As described above, the present invention can be applied to a compression technique using encoding for B-transform, so that uniform distribution data can be efficiently encoded, and a binary expression generated after B-transforming uniform distribution data is converted into B- It is possible to reduce the number of bits by coding using the characteristics of the conversion and thus it is a very useful invention that can improve the compression performance.

BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a block diagram schematically showing a configuration of an encoding apparatus according to the present invention;

FIG. 2 is an exemplary diagram illustrating the properties used to B-transform and encode input data according to the present invention;

FIG. 3 is an exemplary diagram for explaining a process of generating a binary representation by B-transforming input data according to the present invention. FIG.

FIG. 4 is an exemplary diagram showing a table in which a property 1 is applied to a binary expression generated after B-transform according to the present invention,

FIG. 5 is an exemplary diagram showing a table in which a property 2 is applied to a binary expression generated after B-transform according to the present invention,

FIG. 6 is a diagram illustrating a state in which a property 2 is applied to a binary expression generated after B-transform according to the present invention and scanning is performed in a diagonal direction.

FIG. 7 is an exemplary view showing the number of bits necessary for encoding in the case of scanning the binary representation after the B-conversion in the diagonal direction according to the present invention;

8 is a diagram illustrating a binary representation for encoding the number of '1' s to be read when scanning in the diagonal direction according to the present invention;

9 is a diagram illustrating the number of bits that can be reduced using the number of steps according to the present invention.

FIG. 10 is a diagram illustrating a condition for reducing a bit when encoding a position of an alignment identifier requiring a maximum number of bits according to the present invention;

FIG. 11 is an exemplary diagram showing a form of a table by applying a property 3 to a binary representation generated after B-transform according to the present invention,

12 is a diagram illustrating a state in which a property 3 is applied to a binary expression generated after B-conversion according to the present invention and scanning is performed in a diagonal direction;

13 is a diagram illustrating a structure of encoded data obtained by encoding a binary representation generated after B-conversion according to the present invention.

14 is a flowchart for explaining a coding method according to the present invention.

Claims (21)

1. An apparatus for encoding an input data list including one set of aggregation agreement data, A B-conversion unit for performing the conversion of the input data list a plurality of times to generate alignment data and generating a binary symbol table corresponding to the alignment data; And An encoding unit for removing one or more binary symbols according to a correlation between binary symbols in the binary symbol table and generating a bit string by scanning the binary symbol table from which the one or more binary symbols have been removed, Wherein the conversion comprises: When each data of the input data list is sequentially compared with the next data to check whether the two data are arranged in a predetermined order, a binary symbol '1' is generated when the two data are arranged in the predetermined order, Exchanges positions of data, and generates a binary symbol '0' when it is not aligned in the preset order, Wherein the binary symbol table includes a plurality of binary symbol lists, and the binary symbol list includes at least one binary symbol generated for each transform. delete 2. The method of claim 1, wherein the removed one or more binary symbols comprise: Wherein the input data list is a binary symbol from a last binary symbol of a binary symbol list generated by performing an i &lt; th &gt; transformation to a binary symbol located at an ith position. 2. The apparatus of claim 1, And the binary symbol table in which the at least one binary symbol is removed is scanned in a diagonal direction. 5. The method of claim 4, wherein the removed one or more binary symbols Th binary symbol of a binary symbol list generated by i + 1-th conversion when a value of a j-th binary symbol of a binary symbol list generated by i-th transformation of the input data list is '0' . delete 5. The method of claim 4, wherein the at least one binary symbol comprises: Th binary symbol of the binary symbol list generated by the (i-1) -th transform when the value of the j-th binary symbol of the binary symbol list generated by i-th transformation of the input data list is '1' . delete 6. The apparatus of claim 5, And generates the bit stream by encoding the number of '1' s to be read when scanning in the diagonal direction. The apparatus of claim 9, And the number of '1' is determined by determining the number of bits required to encode the number of '1', and expressing the number of '1' as a binary number according to the determined number of bits. . 11. The apparatus of claim 10, And when the most significant bit of the binary number expressing the number of '1's is' 1', only the most significant bit is included in the bit string. The apparatus of claim 9, The number of bits required to encode the number of '1' is determined, and an encoding is performed using the determined number of bits up to an alignment identifier having a number of '1' that is greater than or equal to a threshold value, 'Is encoded with the determined number of bits in the case of an alignment identifier that requires a maximum number of bits from the alignment identifier having the number of bits, and the number of bits is obtained by subtracting one bit from the determined number of bits in the case of the remaining alignment identifier. Wherein the encoding unit further encodes the position of the sorting identifier. The apparatus of claim 9, Determining a number of bits required to encode the number of '1's, encoding an alignment identifier having a number of' 1's' that is greater than or equal to a threshold value to the determined number of bits, 1 'to the number of bits obtained by subtracting one bit from the determined number of bits from an alignment identifier subsequent to the sorting identifier having the number of 1's. delete 2. The apparatus of claim 1, If the value of the j-th binary symbol of the binary symbol list generated by the i-th transform of the input data list is '0', the j-1th binary symbol of the binary symbol list generated by the (i + How, If the value of the j-th binary symbol of the binary symbol list generated by the i-th transform of the input data list is '1', the j + 1-th binary symbol of the binary symbol list generated by the (i- Among them, And selecting one method to perform coding. delete A method for encoding an input data list including one set of assignment agreement data, Performing the transformation of the input data list a plurality of times to generate alignment data and generating a binary symbol table corresponding to the alignment data; And An encoding step of removing one or more binary symbols according to a correlation between the binary symbols in the binary symbol table and generating a bit stream by scanning the binary symbol table from which the one or more binary symbols have been removed Wherein the conversion comprises: When each data of the input data list is sequentially compared with the next data to check whether the two data are arranged in a predetermined order, a binary symbol '1' is generated when the two data are arranged in the predetermined order, Exchanges positions of data, and generates a binary symbol '0' when it is not aligned in the preset order, Wherein the binary symbol table includes a plurality of binary symbol lists, and the binary symbol list includes at least one binary symbol generated for each transform. A step number field indicating the number of steps of performing the conversion of the input data list a plurality of times in order to arrange an input data list including one of the recruitment agreement data; And The binary symbol table is generated by transforming the input data by the number of steps, and one or more binary symbols are removed according to the correlation between the binary symbols, Wherein the conversion comprises: When each data of the input data list is sequentially compared with the next data to check whether the two data are arranged in a predetermined order, a binary symbol '1' is generated when the two data are arranged in the predetermined order, Exchanges positions of data, and generates a binary symbol '0' when it is not aligned in the preset order, Wherein the binary symbol table includes a plurality of binary symbol lists, and the binary symbol list includes at least one binary symbol generated for each conversion. &Lt; Desc / Clms Page number 19 &gt; 19. The method of claim 18, If the value of the j-th binary symbol of the binary symbol list generated by the i-th transform of the input data list is '0', the j-1th binary symbol of the binary symbol list generated by the (i + How, If the value of the j-th binary symbol of the binary symbol list generated by the i-th transform of the input data list is '1', the j + 1-th binary symbol of the binary symbol list generated by the (i- Among them, Further comprising a symbol field including a flag indicating a selected method. delete delete

Images