CN101099387A - Method and apparatus for encoding/decoding point sequences on laser binary representation - Google Patents

Method and apparatus for encoding/decoding point sequences on laser binary representation Download PDF

Info

Publication number
CN101099387A
CN101099387A CNA2005800350574A CN200580035057A CN101099387A CN 101099387 A CN101099387 A CN 101099387A CN A2005800350574 A CNA2005800350574 A CN A2005800350574A CN 200580035057 A CN200580035057 A CN 200580035057A CN 101099387 A CN101099387 A CN 101099387A
Authority
CN
China
Prior art keywords
laser
decoding
bit
difference data
point
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
CNA2005800350574A
Other languages
Chinese (zh)
Other versions
CN101099387B (en
Inventor
郑芮先
车知勋
郑元植
金奎宪
林荣权
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.)
Electronics and Telecommunications Research Institute ETRI
Original Assignee
Electronics and Telecommunications Research Institute ETRI
Net and TV Inc
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 Electronics and Telecommunications Research Institute ETRI, Net and TV Inc filed Critical Electronics and Telecommunications Research Institute ETRI
Priority claimed from PCT/KR2005/003415 external-priority patent/WO2006041259A1/en
Publication of CN101099387A publication Critical patent/CN101099387A/en
Application granted granted Critical
Publication of CN101099387B publication Critical patent/CN101099387B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion 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/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/12—Selection from among a plurality of transforms or standards, e.g. selection between discrete cosine transform [DCT] and sub-band transform or selection between H.263 and H.264
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/13—Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/146—Data rate or code amount at the encoder output
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/46—Embedding additional information in the video signal during the compression process

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Discrete Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

Provided are a method and an apparatus for selectively encoding/decoding point sequences to maximize bit efficiency of a lightweight application scene representation (LASeR) binary stream. The point sequence encoding method includes the steps of: for each point sequence, (a) selecting one of exponential-Golomb (EG) encoding and fixed length (FL) encoding schemes; (b) when the FL encoding scheme is selected, encoding the point sequence using the FL encoding scheme to generate a binary stream; and (c) when the EG encoding scheme is selected, encoding the point sequence using the EG encoding scheme to generate a binary stream. The binary stream includes a flag indicating which encoding scheme is selected and a parameter k, with which the EG encoding can be most effectively performed, when the EG encoding scheme is selected. According to the encoding method, LASeR point sequences can be efficiently encoded and, during a decoding process, a large overhead is not incurred to a decoder (terminal).

Description

Be used for the coding/decoding lightweight application scene and represent the method and apparatus of the point sequence of binary representation
Technical field
The present invention relates to a kind of method and apparatus of coding/decoding point sequence effectively that is used for, and relate in particular to a kind of lightweight application scene of coding/decoding effectively and represent (lightweight application scenerespresentation, LASeR) method and apparatus of point sequence.
Background technology
LASeR is a kind of content of multimedia form, is defined to be used to resource-constrained equipment such as mobile phone that simple multimedia service is provided.LASeR can be used for the application such as map (map) application, animation and 2 dimensional vectors.These application work have a large amount of point data, therefore need a kind of method of efficient coding point data.For this reason, should consider two principal elements of LASeR: binary representation that efficient is high and little decoder memory.
The encoding scheme that the LASeR text that is published in the 14496-20 of International Standards Organization/International Electrotechnical Commission (ISO/IEC) committee draft (CD) in July, 2004 proposes a kind of regular length (FL) the LASeR point data that is used for encoding.According to the FL encoding scheme, when counting, nbPoint during less than 3, decodes to point data itself.Work as number, nbPoint is 3 or more for a long time, checks all point sequences determining their dynamic range, and uses from the regular length that detects the result and derive point sequence is encoded.This method can very simple realization.Yet the overhead that not only needs ten bits to be giving each point sequence designated length field, and many bits are unnecessarily distributed to data field after the length field.
Entropy coding and decoding can be used for compressing effectively and going back original digital image data.The comentropy coding is a kind of different value of having considered that data can be got, and the value of using little bit number coding often to occur.
Various entropy coding schemes are arranged, and these schemes can be divided into scheme with coding schedule and the scheme that does not have coding schedule roughly.The Huffman encoding scheme is to use the typical scenario of coding schedule.According to the Huffman encoding scheme, can obtain optimum compression ratio.Yet, must transmit decoding table, and in decoder (terminal), have processing expenditure to be, must visit the memory location when decoding point data at every turn.Because LASeR need have the little storage of least complex, so use the Huffman encoding scheme of coding schedule to be not suitable for the encoded point data.
As other entropy coding scheme, promptly do not use the encoding scheme of coding schedule, arithmetic coding and index Columbus (exponential golomb, EG) encoding scheme are arranged.Arithmetic coding is the high coding method of a kind of efficient, but is difficult to LASeR owing to lacking mistake recovery (error resilience).
On the other hand, the EG encoding scheme has the characteristic that some are suitable for LASeR.According to the EG encoding scheme, can select parameter k, it brings low expense to encoder and is fit to for specific distribution.In addition, can be easy to the EG code conversion is become coding (the variable-length coding of variable-length, VLC) (see also " increasing the reversible VLC that mistake is recovered ", (International Telecommunications Union-radio communication standardization department, seminar 8 (ITU-T SG8) formulate by International Standards Organization/1/ 29/ working group of the committee of department (SC) (WG) 1 of joint technical committee of International Electrotechnical Commission (JTC) so that increase error recovery capability.Also having the another one advantage is low decoder expense.Because decode procedure can only be undertaken by addition (addition) and bit shifting function, so the EG encoding scheme can be applied to such as the low-end devices of mobile phone and not introduce high expense.
Summary of the invention
The present invention is directed to a kind of method and apparatus of encoded point sequence, its choice point sequential coding scheme is to improve the compression efficiency of LASeR binary representation; The value that the sign of which kind of encoding scheme is selected in the coding indication and coding is used for the parameter k of EG coding when selecting the EG coding; With send this sign and parameter k value with the LASeR binary stream.
Also at a kind of method and apparatus of the point sequence of decoding, its LASeR stream from coding extracts the sign that any encoding scheme has been used in indication in the present invention; Determine decoding scheme based on this sign; Extracting parameter k when having selected the EG decoding scheme; LASeR stream with decoding and coding.
Technical scheme
The present invention proposes the method and apparatus of a kind of selective coding/decoding point sequence, so that the bit efficiency of maximization LASeR binary representation.
One aspect of the present invention provides a kind of method of the LASeR point sequence that is used to encode, and comprises step: for each point sequence, and (a) one of selection index-Columbus (EG) coding and regular length (FL) encoding scheme; (b) when selecting the FL encoding scheme, use FL encoding scheme encoded point sequence to produce binary stream; (c) when selecting the EG encoding scheme, use EG encoding scheme encoded point sequence to produce binary stream, wherein, this binary stream comprises and is used to indicate the sign of selecting which kind of encoding scheme, and utilizes it can carry out the parameter k of EG coding most effectively when selecting the EG encoding scheme.
Another aspect of the present invention provides a kind of method of the LASeR binary stream that is used to decode, comprise step: from this LASeR binary stream, extract the information which kind of encoding scheme indication has used, and determine one of EG decoding and FL decoding scheme based on the information of being extracted; With this LASeR binary stream of decoding according to determined decoding scheme.
Another aspect of the present invention provides a kind of server, comprising: code device is used for the LASeR point sequence of coded representation scene description by carrying out above-mentioned coding method, to produce the LASeR scene description stream of coding; Multiplexer, be used for multiplexing this coding the LASeR scene description stream and form other element flow of LASeR scene, to produce multiplexing LASeR binary stream; And dispensing device, be used for the LASeR binary stream that this is multiplexing to send to user terminal.
Another aspect of the present invention provides a user terminal, comprising: receiving system is used to receive the LASeR binary stream; The demultiplexing device is used for from LASeR binary stream demultiplexing and output LASeR scene description stream and other element flow of being received; Decoding device is used for decoding from the LASeR scene description stream of this demultiplexing device output by carrying out above-mentioned coding/decoding method, to produce the LASeR addressed location of a plurality of decodings that can visit separately; Additional decoding device is used to other element flow of decoding and exporting from this demultiplexing device; The scene tree manager is used for producing scene tree from the addressed location of decoding; With the LASeR announcer, be used to use other element flow of the scene tree that produced and decoding that LASeR is provided service.
Another aspect of the present invention provides a kind of data structure of data flow of LASeR point sequence of coding, comprising: be used to indicate and use which sign of FL and EG encoding scheme; When having the value of indication EG encoding scheme when this sign, parameter k utilizes this parameter k can carry out the EG coding most effectively.
Beneficial effect
As mentioned above, when the method according to this invention coding/decoding point sequence, can obtain the compression gains between the 6%-17%.Therefore in the time will being used for image, animation and polar plot, use decoder to obtain goodish compression efficiency with low complex degree according to coding method of the present invention.
Description of drawings
Fig. 1 shows according to the present invention and is used for the optionally block diagram of the system of coding/decoding LASeR point sequence;
Fig. 2 shows the flow chart according to the process of encoded point sequence of the present invention; With
Fig. 3 shows the flow chart according to the process of decoding point sequence of the present invention.
Embodiment
Hereinafter, will describe exemplary execution mode of the present invention in detail.Yet, originally be not limited to following public exemplary execution mode, but can be with multi-form realization.Therefore, to those skilled in the art, provide exemplary execution mode of the present invention to come full disclosure the present invention, and inform protection scope of the present invention.
Fig. 1 shows according to the present invention and is used for the optionally block diagram of the system of coding/decoding LASeR point sequence.As shown in fig. 1, server system 10 comprises LASeR scene encoder 11, simple aggregation format (simple aggregation format, SAF) multiplexer 12 and transmitter 13.The scene description data that LASeR scene encoder 11 receives about scene, for example, scalable vector graphics (scalablevector graphics, SVG) data, LASeR extend markup language (XML) data etc., and produce compression (coding) LASeR scene description stream.To be applied to LASeR scene encoder 11 according to optionally the encode method of LASeR point sequence of the present invention.
SAF multiplexer 12 receives the LASeR scene description stream and other forms the element flow of LASeR scene, for example video, audio frequency, image, font, metadata streams etc., and produce multiplexing LASeR binary stream.This transmitter 13 uses procotol (IP), wireless network, code division multiple access (CDMA) network etc. that the LASeR binary stream is sent to user terminal 20.
User terminal 20 comprises receiver 21, SAF demultiplexer 22, LASeR scene decoder 23, other element decoder 24, scene tree manager 25 and LASeR announcer (render) 26.SAF demultiplexer 22 receive by receiver 21 data flow transmitted and to its demultiplexing to produce LASeR scene description stream and other element flow.This LASeR scene decoder 23 receives from this LASeR scene description stream of SAF demultiplexer 22 outputs and produces the decoding addressed location.The decoding addressed location be can the independent access data a part.Method according to coding LASeR point sequence of the present invention can be applied to LASeR decoder 23.
The other element flow of another element decoder 24 decodings except that LASeR describes stream, for example video, audio frequency, image, font, metadata streams etc.Scene management device 25 receives the addressed location of decoding and produces scene tree.This scene tree refers to the level (hierarchy) of scene description data, and it shows time/locus of forming the LASeR scenario objects.Various forms of other element flows that this LASeR announcer 26 receives scene tree and exports from other element decoder 24, and offer user LASeR service.
Fig. 2 shows the flow chart according to encoded point sequence process of the present invention.For each point sequence, select one of FL (regular length) coding and EG (index Columbus) encoding scheme (step 210).Particularly, in the exemplary embodiment, after having carried out EG coding and FL encoding scheme, select to produce the decoding scheme of less bit number.When having selected the FL encoding scheme, the coding selection marker is set to ' 0 ' (flag=0) (step 220).Then, use FL encoding scheme encoded point sequence (step 230).
Can carry out the FL coding according to following process.
When hypothesis one point sequence comprises (n+1) individual point: (x 0, y 0), (x 1, y 1) ..., (x n, y n) and
1) when counting in the point sequence be 2 or still less the time,
I) x that can encode of calculating and coding utilization 0, y 0x 1And y 1Bit minimal amount and
Ii) use the bits of encoded point coordinates (x of aforementioned calculation number 0, y 0) and (x 1, y 1); Or
2) counting in point sequence is 3 or more for a long time:
I) the first point (x that can encode of calculating and coding utilization 0, y 0) the minimal amount bits of bit;
Ii) use the bits of encoded point (x of aforementioned calculation number 0, y 0),
Iii) calculate dx 10..., dx Nn-1(dx herein, Nn-1=x n-x N-1), calculate the bit number that they are encoded and need then, bitsx,
Iv) calculate dy 10..., dy Nn-1(dy herein, Nn-1=y n-y N-1), calculate the bit number that they are encoded and need then, bitsy,
This number bits that v) encodes, bitsx and bitsy and
Vi) to dx 10, dy 10..., dx Nn-1, dy Nn-1Encode
On the other hand, when having selected the EG scheme, the selection marker of encoding is set to ' 1 ' (flag=1) (step 240).Subsequently, calculate and coding parameter k, utilize this parameter can carry out EG coding (step 250) most effectively.Then according to EG encoding scheme encoded point sequence (step 260).
The EG coding as one of entropy coding scheme, has system construction mechanism, by giving the compression of the point sequence of little quantity to little quantity wherein occurring favourable than short assignment of code.The Huffman encoding scheme as another entropy coding scheme, needs the code table of relation between designated symbols and the Code Number (code number).In addition, code table should be stored in user terminal.On the contrary, the EG encoding scheme adopts system building approach, and does not therefore need coding schedule.Therefore, the EG encoding scheme is more suitable in LASeR.This EG encoding scheme is not distributed code words according to the statistics of symbol accurately.On the contrary, the EG encoding scheme is adjusted parameter k, and therefore can mate the various distributions (dispersion) of geometric distributions.According to the EG encoding scheme, each code of following structure:
[M zero] [1] [INFO]
M represents the number of leading zero herein, and INFO represents the suffix deviant of beared information (M+k) bit.Leading zero with and subsequent " 1 " as the prefix code of cutting apart each coding.Code Number CodeNum is following to be determined:
Formula 1
CodeNum＝2 M+k+INFO-2 k
Because the value of INFO does not influence the length of leading zero, so by ignoring the number M that INFO item in the formula 1 calculates leading zero, as shown in formula 2:
Formula 2
M＝[log 2(CodeNum+2 k)]-k
And, can calculate the value of INFO according to the formula of deriving by formula 23:
Formula 3
INFO＝CodeNum+2 k-2 M+k
As an example, following table 1 shows at parameter k=0,11 EG codings of 1,2 and 3 configurations.
Table 1
?CodeNum ?Code(k＝0) ?Code(k＝1) ?Code(k＝2) ?Code(k＝3)
?0 ?1 ?10 ?100 ?1000
?1 ?010 ?11 ?101 ?1001
?2 ?011 ?0100 ?110 ?1010
?3 ?00100 ?0101 ?111 ?1011
?4 ?00101 ?0110 ?01000 ?1100
?5 ?00110 ?0111 ?01001 ?1101
?6 ?00111 ?001000 ?01010 ?1110
?7 ?0001000 ?001001 ?01011 ?1111
?8 ?0001001 ?001010 ?01100 ?010000
?9 ?0001010 ?001011 ?01101 ?010001
?10 ?0001011 ?001100 ?01110 ?010010
As shown in table 1, coding increases progressively according to logical order.
Because the EG coding only has not signed Code Number, should be mapped to not signed EG coding so have the EG coding of symbol.From bit stream, retrieve the Code Number CodeNum of not signed EG coding, and it is mapped to signed EG coding, resolved thus.
If(CodeNum?is?0)signed?code＝0；
else?if(CodeNum?is?even)signed?code＝-CodeNum/2；
else?if(CodeNum?is?odd)signed?code＝(CodeNum+1)/2；
Illustrated in the following table that the Code Number that will not have symbol is mapped to the example of the Code Number that has symbol.
Table 2
The EG Code Number that does not have symbol 0 ?1 ?2 ?3 ?4 ?5 ?6 ?7 ?8 ?9 ...
The EG Code Number that has symbol 0 ?1 ?-1 ?2 ?-2 ?3 ?-3 ?4 ?-4 ?5 ...
In this illustrative embodiments, the EG coding can be realized according to following steps:
When the postulated point sequence comprises (n+1) individual point (x 0, y 0), (x 1, y 1) ... (x n, y n) time,
(1) calculating and coding can utilize its coding (x 0, y 0) the minimal amount of bit;
(2) use this minimal amount bits of encoded point (x 0, y 0); With
(3) for removing point (x 0, y 0) outside each the point, to be mapped to the EG Code Number and, realize the EG coding thus at x-coordinate between previous point and the current point and y-coordinate difference data by using the EG code word of EG Code Number and parameter k value generation corresponding to x-coordinate and y-coordinate difference data.
Particularly, carry out following steps with to point (x i, y i) encode.
(i) according to following rule with x iAnd x I-1Between difference, " diffx " is mapped to not signed EG Code Number CodeNum:
If(diffx＞＝0)CodeNum＝diffx*2-1；
else?CodeNum＝|diffx|*2。
(ii) M represents the number of leading zero, is calculated by formula 2.
(iii) write down M " 0 " bit.
(iv) write down " a 1 " bit.
(v) calculate the suffix skew " INFO " of beared information by formula 3.
(vi) INFO is recorded in (M+k) bit;
(vii) according to following rule with y iAnd y I-1Between difference, " diffy " is mapped to not signed EG Code Number CodeNum:
If (diffy＞=0) CodeNum=diffy*2-1; With
else?CodeNum＝|diffy|*2。
(viii) calculate the numbering " M " of leading zero by formula 2,
(ix) M " 0 " bit of record.
(x) " 1 " bit of record.
(xi) calculate " INFO " by formula 3.
(vi) INFO is recorded in (M+k) bit.
Fig. 3 is the flow chart according to the processing of decoding point sequence of the present invention.As shown in Figure 3, for the LASeR binary stream, determine one of FL decoding scheme and EG decoding scheme (step 310).Should determine to be undertaken by reading in the coding selection marker (flag) that is included in the LASeR binary stream.As mentioned above, show which scheme of use current point sequence of encoding because be included in coding selection marker (flag) in the LASeR binary stream, so indicate to determine decoding scheme based on this.
When having determined the FL decoding scheme, use FL decoding scheme decoding point sequence (step 320).Realize the FL decoding scheme according to following processing:
When hypothesis is decoded into point sequence (x with the LASeR binary stream 0, y 0), (x 1, y 1) ... (x n, y n) time,
(1) from the LASeR binary stream, extracts counting in the point sequence;
(2) from the LASeR binary stream, extract a little x-coordinate figure and the needed bit number of y-coordinate figure " bits ".
(3) be 2 or still less the time when counting, extract x by reading " bits " individual bit 0, y 0, x 1, and y 1Each value; With
(4) be 3 or more for a long time when counting:
(i) extract x by reading " bits " individual bit 0, y 0Each value;
(ii) extract the needed bit number of difference dx " bitsx " of x-coordinate and the needed bit number of difference dy " bitsy " of y-coordinate;
(iii)i＝1；
(iv) extract dx and dy respectively, calculate x then by reading " bitsx " individual bit and " bitsy " individual bit i=x I-1+ dx and y i=y I-1+ dy; With
(v) (n-1) carries out the i value inferiorly and adds 1 (i=i+1) and carry out previous step (iv).
On the other hand, when definite EG decoding scheme, extract the parameter k (step 330) that is used for the EG decoding, and use the parameter k that extracts to carry out EG decoding (step 340) from the LASeR binary stream.
In one exemplary embodiment, can carry out the EG decoding according to following processing:
When hypothesis is decoded into point sequence (x with the LASeR binary stream 0, y 0), (x 1, y 1) ... (x n, y n) time,
(1) from the LASeR binary stream, extracts the bit number of counting, be used for encoded point " bits " and the parameter k of point sequence;
(2) read " bits " individual bit of bit, first point coordinates (x then decodes 0, y 0);
(3) from the LASeR binary stream, read out with previous point and current point between each x-coordinate and the corresponding EG code word of y-coordinate difference data, and operation parameter k decodes to it, and with the coordinate speech addition of the difference data of being decoded and previous point in order to calculate the coordinate of current point; With
(4) previous step (3) is carried out counting so repeatedly except that first point.
Particularly, carry out following steps and separate code-point (x i, y i):
(i) read a bit up to detecting " 1 ", and the total number of the bit of being read is set to M at every turn;
(ii) abandon " 1 " of being read;
(iii) read (M+k) individual bit number and it is set to INFO;
(iv) calculate CodeNum=2 M+k+ INFO-2 k
(v) calculate dx by CodeNum;
(vi) calculate x i=x I-1+ dx;
(vii) read bit one by one up to detecting " 1 ", and the total number of the bit of reading is set to M;
(viii) abandon " 1 " of being read;
(ix) read (M+k) individual bit and it is set to INFO;
(x) calculate CodeNum=2 M+k+ INFO-2 k
(xi) calculate dy by CodeNum; And
(xii) calculate y i=y I-1+ dy.
Can express with the sentence structure of following pseudo-code and the semanteme of semantic meaning representation according to LASeR binary stream decode procedure of the present invention:
Sentence structure:
decodingPointSequence{
nbPoints＝Read(lenBits)；
flag＝Read(1)；
if(flag＝＝0){
if(nbPoints＜3){
bits＝Read(5)；
for(int?i＝0；i＜nbPoints；i++){
x[i]＝Read(bits)；
y[i]＝Read(bits)；
}
}
else{
bits＝Read(5)；
x[0]＝Read(bits)；
y[0]＝Read(bits)；
bitsx＝Read(5)；
bitsy＝Read(5)；
for(int?i＝1；i＜nbPoints；i++){
dx＝Read(bitsx)；
dy＝Read(bitsy)；
x[i]＝dx+x[i-1]；
y[i]＝dy+y[i-1]；
}
}
}
else{
bits＝Read(5)；
x[0]＝Read(bits)；
y[0]＝Read(bits)；
kvalue＝Read(4)；
for(i＝1；i＜nbPoints；i++){
1_zero＝0；
while?(Read(1)＝＝0)1_zero++；
Mvalue＝1_zero；
Read(1)；
INFO＝Read(Mvalue+kvalue)；
CodeNum＝2 M+kvalue+INFO-2 kvalue；
if(CodeNum＝＝0)dx＝0；
else?if(CodeNum＝＝even)dx＝-CodeNum/2；
else?if(CodeNum＝＝odd)dx＝(CodeNum+1)/2；
x[i]＝dx+x[i-1]；
1_zero＝0；
while(Read(1)＝＝0)1_zero++；
Mvalue＝1_zero；
Read(1)；
INFO＝Read(M?value+kvalue)；
CodeNum＝2 M+kvalue+INFO-2 kvalue；
if(CodeNum＝＝0)dy＝0；
else?if(CodeNum＝＝even)dy＝-CodeNum/2；
else?if(CodeNum＝＝odd)dy＝(CodeNum+1)/2；
y[i]＝dy+y[i-1]；
}
}
}
Semantic:
Flag-sign, indication FL coding (flag=0) or EG coding (flag=1).
Kvalue-is used for the parameter of EG coding, and it changes according to geometric distributions.For example, when the k value increased, it is mild that the slope of geometric distributions becomes.
The number of Mvalue-leading zero.
The CodeNum-Code Number.
The difference of the x-coordinate of current point of dx-and previous point.
dx＝x[i]-x[i-1]
The difference of the y-coordinate of current point of dy-and previous point.
dy＝y[i]-y[i-1]
INFO-has the value of relevant dx or dy information.
As illustrative embodiments, can use the following sentence structure of being write as pseudo-code to represent according to the decoding processing of LASeR binary stream of the present invention:
Sentence structure:
decodingPointSequence{
nbPoints＝Read(lenBits)；
flag＝Read(1)；
if(flag＝＝0){
if(nbPoints＜3){
bits＝Read(5)；
for(int?i＝0；i＜nbPoints；i++){
x[i]＝Read(bits)；
y[i]＝Read(bits)；
}
}
else{
bits＝Read(5)；
x[0]＝Read(bits)；
y[0]＝Read(bits)；
bitsx＝Read(5)；
bitsy＝Read(5)；
for(int?i＝1；i＜nbPoints；i++){
dx＝Read(bitsx)；
dy＝Read(bitsy)；
x[i]＝dx+x[i-1]；
y[i]＝dy+y[i-1]；
}
}
}
else{
kvalue＝Read(4)；
bits＝Read(5)；
x[0]＝Read(bits)；
y[0]＝Read(bits)；
for(i＝1；i＜nbPoints；i++){
1_zero＝0；
while(Read(1)＝＝0)1_zero++；
Mvalue＝1_zero；
Read(1)；
INFO＝Read(Mvalue+kvalue)；
CodeNum＝2 M+kvalue+INFO-2 kvalue；
if(CodeNum＝＝0)dx＝0；
else?if(CodeNum＝＝even)dx＝-CodeNum/2；
else?if(CodeNum＝odd)dx＝(CodeNum+1)/2；
x[i]＝dx+x[i-1]；
1_zero＝0；
while(Read(1)＝＝0)1_zero++；
Mvalue＝1_zero；
Read(1)；
INFO＝Read(Mvalue+kvalue)；
CodeNum＝2 M+kvalue+INFO-2 kvalue
if(CodeNum＝＝0)dy＝0；
else?if(CodeNum＝＝even)dy＝-CodeNum/2；
else?if(CodeNum＝＝odd)dy＝(CodeNum+1)/2；
y[i]＝dy+y[i-1]；
}
}
}
As exemplary embodiment, can use following sentence structure of expressing to represent with syntactic description language (SDL) code according to the decoding processing of LASeR binary stream of the present invention:
Sentence structure:
decodingPointSequence{
uivlc5?nbPoints；
uint(1)flag；
if(flag＝＝0){
if(nbPoint＜3){
uint(5)bits；
for(int?i＝0；i＜nbPoints；i++){
uint(bits)x[i]；
uint(bits)y[i]；
}
}else{
uint(5)bits；
uint(bits)x[0]；
uint(bits)y[0]；
uint(5)bitsx；
uint(5)bitsy；
for(int?i＝1；i＜nbPo?int?s；i++){
uint(bitsx)dx；
uint(bitsy)dy；
x[i]＝dx+x[i-1]；
y[i]＝dy+y[i-1]；
}
}
}
else{
uint(4)kvalue；
uint(5)bits；
uint(bits)x[0]；
uint(bits)y[0]；
int?XMvalue，YMvalue＝0；
int?CodeNum＝0；
int?Diff＝0；
for(i＝1；i＜nbPoints；i++){
// calculating X point
do{
bit(1)bitX；
XMvalue++；
}while(bitX＝＝0)；
const?bit(1)endX＝1；
uint(XMvalue+kvalue)INFO_dx；
CodeNum＝GetCodeNum(kvalue，XMvalue，INFO_dx)；
Diff＝GetDiff(CodeNum)；
x[i]＝x[i-1]+Diff
// calculating Y point
do{
unit(1)bitY；
YMvalue++；
}while(bitY＝＝0)；
const?bit(1)endY＝1；
uint(YMvalue+kvalue)INFO_dy；
CodeNum＝GetCodeNum(kvalue，YMvalue，INFO_dy)；
Diff＝GetDiff(CodeNum)；
Y[i]＝y[i-1]+Diff
}
}
}
uint?GetCodeNum(int?k，int?Mvalue，int?INFO){
return?2( k+Mvalue)+INFO-2 k；
}
int?GetDiff(int?CM){
if((CM％2)＝＝0)return-1*CM/2；
else?return?CM//2；
}
In above-mentioned grammer, " % " expression mould behaviour operator and operator " // " expression positive number is divided by and the rounding remainder.For example 1//2 value is that 1,3//2 value is that 2 and 5//2 value is 3.
The readable computer medium that foregoing description of the present invention can be used as storage computation machine program provides.This medium may be floppy disk, hard disk, CD (CD) read-only memory (ROM), flash card, programmable read-only memory (PROM), random-access memory (ram), ROM, tape, or the like.Usually this can use the random procedure design language to work out this computer program, for example C, C++ or JAVA.
Although the present invention describes the present invention by reference specific illustrative embodiments wherein and describes, to those skilled in the art, wherein in form and details various changes can be arranged and can not exceed the of the present invention spiritual scope that limits by accessory claim.

Claims (17)

1. the method for the LASeR point sequence that is used to encode comprises step: for each point sequence,
(a) one of selection index-Columbus (EG) coding and regular length (FL) encoding scheme;
(b) when selecting the FL encoding scheme, use FL encoding scheme encoded point sequence to produce binary stream; With
(c) when selecting the EG encoding scheme, use EG encoding scheme encoded point sequence with the generation binary stream,
Wherein, this binary stream comprises and is used to indicate the sign of selecting which kind of encoding scheme, and utilizes it can carry out the parameter k of EG coding most effectively when selecting the EG encoding scheme.
2. according to the process of claim 1 wherein, step (c) further comprises calculating parameter k, can carry out the EG coding most effectively by this parameter k.
3. according to the process of claim 1 wherein, in step (a), point sequence is carried out EG encoding scheme and FL encoding scheme, and select the encoding scheme of the minimal amount of generation bit.
4. according to the process of claim 1 wherein, in step (b), the FL encoding scheme comprises step: for point sequence (x 0, y 0), (x 1, y 1) ..., (x n, y n),
(b1) when counting in the point sequence be 2 or still less the time,
(b1-i) calculate and coding utilizes it can encoded point coordinate (x 0, y 0) and (x 1, y 1) bit minimal amount and
(b1-ii) use the bits of encoded point coordinates (x of this minimal amount 0, y 0) and (x 1, y 1); With
(b2) when counting in the point sequence surpasses 2,
(b2-i) calculating and decoding utilize its first point coordinates (x that can encode 0, y 0) the minimal amount of bit;
(b2-ii) use the bits of encoded first point coordinates (x of this minimal amount 0, y 0);
(b2-iii) the x-coordinate difference data between the calculating consecutive points, dx 10..., dx Nn-1(dx herein, Nn-1=x n-x N-1) and the number of the needed bit of this x-coordinate difference data that is used to encode;
(b2-iv) the y-coordinate difference data between the calculating consecutive points, dy 10..., dy Nn-1(dy herein, Nn-1=y n-y N-1) and the number of the needed bit of this y-coordinate difference data that is used to encode;
(b2-v) number of this needed bit of this x-coordinate difference data that is used to encode and this be used to the to encode number of the needed bit of this y-coordinate difference data of encoding; With
(b2-vi) encode this x-coordinate difference data and this y-coordinate difference data.
5. according to the process of claim 1 wherein, in step (c), the EG encoding scheme comprises the steps: for point sequence (x 0, y 0), (x 1, y 1) ..., (x n, y n),
(c1) calculating and coding utilize its first coordinate (x that can encode 0, y 0) the minimal amount of bit;
(c2) use the bits of encoded first point coordinates (x of this minimal amount 0, y 0); With
(c3) for each point except that first o'clock, to be mapped to corresponding EG Code Number at x-coordinate difference data between the more preceding and current point and y-coordinate difference data according to pre-defined rule, and use this EG Code Number and parameter k to produce the corresponding EG code word corresponding with this x-coordinate difference data and y-coordinate difference data.
6. according to the method for claim 5, wherein, step (c3) comprises the following steps, for each point except that first point:
(c3-i) will be mapped to the EG Code Number, CodeNum at the x-coordinate difference data between the more preceding and current point according to pre-defined rule;
(c3-ii) use the EG Code Number CodeNum that obtains in step (c3-i) to calculate the number M of leading zero and the suffix skew INFO of beared information;
(c3-iii) be connected the M that calculates in the step (c3-ii) " 0 " bit, " 1 " bit and (M+k) the suffix skew INFO of bit, to produce EG code word corresponding to x-coordinate difference data;
(c3-iv) will be mapped to EG Code Number CodeNum at the y-coordinate difference data between the more preceding and current point according to pre-defined rule;
(c3-v) the suffix skew of using the EG Code Number CodeNum that obtains in step (c3-iv) to calculate the number M and the beared information of leading zero, INFO; With
(c3-vi) be connected the M that calculates in the step (c3-v) " 0 " bit, " 1 " bit and (M+k) the suffix skew INFO of bit, to produce EG code word corresponding to y-coordinate difference data.
7. the method for the LASeR binary stream that is used to decode comprises step:
From this LASeR binary stream, extract the information which kind of encoding scheme indication has used, and determine one of EG decoding and FL decoding scheme based on the information of being extracted; With
According to determined decoding scheme this LASeR binary stream of decoding.
8. according to the method for claim 7, wherein, when having determined the FL decoding scheme and the LASeR binary stream being decoded into point sequence (x 0, y 0), (x 1, y 1) ..., (x n, y n) time, comprise the following steps: according to the decode step of this LASeR binary stream of determined decoding scheme
(a) number (BITS) of from this LASeR binary stream, reading the information of counting in the relevant point sequence and being used for the bit of encoded point;
(b) be 2 or still less the time when counting, read bit in regular turn to a BITS number bit, and decode these 2 or coordinate still less; With
When (c) surpassing 2 when counting,
(c1) read bit in regular turn to a BITS number bit, and the first point coordinates (x that decodes 0, y 0),
(c2) read information in proper order from LASeR stream about the number (BITSX and BITSY) of the bit of be used to encode x-coordinate difference data between the consecutive points and y-coordinate difference data,
(c3) order reads each the corresponding bit with number BITSX and BITSY, and decoding is a bit preceding and the x-coordinate difference data of current point and each of y-coordinate difference data, and the x-coordinate difference data and the y-coordinate difference data of decoding is added to last point coordinates to calculate current point coordinates; With
(c4) number of repeating step (c3) sequence mid point except that first o'clock so repeatedly.
9. according to the method for claim 7, wherein, when having determined the EG decoding scheme, comprise the following steps: according to the decode step of this LASeR binary stream of determined decoding scheme
From the LASeR binary stream, extract the required parameter k of EG decoding; With
According to EG decoding scheme operation parameter k this LASeR binary stream of decoding.
10. according to the method for claim 9, wherein, when the LASeR binary stream is decoded into point sequence (x 0, y 0), (x 1, y 1) ..., (x n, y n) time, comprise the following steps: according to the decode step of this LASeR binary stream of EG decoding scheme operation parameter k
(a) from this LASeR binary stream, read the number (BITS) of counting, be used for the bit of encoded point in the relevant point sequence, the information of parameter k;
(b) order reads bit, to a BITS number bit, and the first point (x that decodes 0, y 0);
(c) from the LASeR binary stream, read with more preceding and current point between x-coordinate difference data and the corresponding EG code word of y-coordinate difference data, and operation parameter k decode this x-coordinate difference data and y-coordinate difference data, and the x-coordinate difference data and the y-coordinate difference data of decoding be added to last point coordinates to calculate current point coordinates; With
The number of the sequence mid point outside (d) repeating step (c) gets rid of at first so repeatedly.
11. a server comprises:
Code device is used for by carrying out according to any one method of claim 1-6 and the LASeR point sequence of coded representation scene description, to produce the LASeR scene description stream of coding;
Multiplexer, be used for multiplexing this coding the LASeR scene description stream and form other element flow of LASeR scene, to produce multiplexing LASeR binary stream; With
Dispensing device is used for the LASeR binary stream that this is multiplexing to send to user terminal.
12. a user terminal comprises:
Receiving system is used to receive the LASeR binary stream;
The demultiplexing device is used for from LASeR binary stream demultiplexing and output LASeR scene description stream and other element flow of being received;
Decoding device is used for decoding from the LASeR scene description stream of this demultiplexing device output by carrying out according to one of any method of claim 7-10, to produce the LASeR addressed location of a plurality of decodings that can visit separately;
Additional decoding device is used to other element flow of decoding and exporting from this demultiplexing device;
The scene tree manager is used for producing scene tree from the addressed location of decoding; With
The LASeR announcer is used to use other element flow of the scene tree that produced and decoding that LASeR is provided service.
13. a computer readable recording medium storing program for performing that has computer program on it, this computer program is carried out the method according to any one the coding LASeR point sequence of claim 1-6.
14. a computer readable recording medium storing program for performing that has computer program on it, this computer program is carried out the method according to any one the decoding LASeR binary stream of claim 7-10.
15. the data structure of the data flow of the LASeR point sequence of a coding comprises:
Be used to indicate and use which sign of FL and EG encoding scheme; With
Parameter k when this sign has the value of indication EG encoding scheme, utilizes this parameter k can carry out the EG coding most effectively.
16. an encoder comprises:
LASeR scene encoder is used for by carrying out according to one of any method of claim 1-6 and the coding LASeR point sequence of coded representation scene description, to produce the LASeR scene description stream of coding;
Multiplexer is used for the LASeR scene description stream of multiplexing and encoding and forms other element flow of LASeR scene, to produce multiplexing LASeR binary stream; With
Output is used for exporting this multiplexing LASeR binary stream.
17. a decoder comprises:
Input is used to receive the LASeR binary stream;
Demultiplexer is used for LASeR binary stream output LASeR scene description stream and other element flow from this input;
The LASeR scene decoder is used for decoding from the LASeR scene description stream of this demultiplexer output by carrying out according to one of any method of claim 7-10, to produce the LASeR addressed location of a plurality of decodings that can visit separately;
Other element decoder is used to other element flow of decoding and exporting from this demultiplexer;
The scene tree manager is used for producing scene tree from the addressed location of decoding; With
The LASeR announcer is used to use other element flow of the scene tree that produced and decoding to provide LASeR service as the user.
CN2005800350574A 2004-10-13 2005-10-13 Method and apparatus for encoding/decoding point sequences on laser binary representation Expired - Fee Related CN101099387B (en)

Applications Claiming Priority (7)

Application Number Priority Date Filing Date Title
KR20040081789 2004-10-13
KR1020040081789 2004-10-13
KR10-2004-0081789 2004-10-13
KR20050003864A KR20060032944A (en) 2004-10-13 2005-01-14 Method and apparatus for coding point sequences on laser binary representation
KR1020050003864 2005-01-14
KR10-2005-0003864 2005-01-14
PCT/KR2005/003415 WO2006041259A1 (en) 2004-10-13 2005-10-13 Method and apparatus for encoding/decoding point sequences on laser binary representation

Publications (2)

Publication Number Publication Date
CN101099387A true CN101099387A (en) 2008-01-02
CN101099387B CN101099387B (en) 2010-10-20

Family

ID=37142178

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2005800350574A Expired - Fee Related CN101099387B (en) 2004-10-13 2005-10-13 Method and apparatus for encoding/decoding point sequences on laser binary representation

Country Status (3)

Country Link
JP (1) JP4727669B2 (en)
KR (1) KR20060032944A (en)
CN (1) CN101099387B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101930613A (en) * 2009-06-17 2010-12-29 佳能株式会社 Method with figure path sequence Code And Decode component layer scheme
CN108134942A (en) * 2012-04-11 2018-06-08 杜比国际公司 Coding and decoding methods are carried out for a pair bit stream associated with transformation coefficient

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100790191B1 (en) 2007-01-16 2008-01-02 삼성전자주식회사 Method for providing broadcasting scene using laser contents, the dvb-h system and the terminal

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS62230266A (en) * 1986-03-31 1987-10-08 Fujitsu Ltd Image data error correction system
JPH04291826A (en) * 1991-03-20 1992-10-15 Toshiba Corp Coding transmitter
JPH08116447A (en) * 1994-10-18 1996-05-07 Fuji Xerox Co Ltd Coder for image signal
JPH0974566A (en) * 1995-09-04 1997-03-18 Sony Corp Compression encoder and recording device for compression encoded data
US6304607B1 (en) * 1997-03-18 2001-10-16 Texas Instruments Incorporated Error resilient video coding using reversible variable length codes (RVLCS)
US6118392A (en) * 1998-03-12 2000-09-12 Liquid Audio Inc. Lossless data compression with low complexity
JP2002368625A (en) * 2001-06-11 2002-12-20 Fuji Xerox Co Ltd Encoding quantity predicting device, encoding selection device, encoder, and encoding method
US6650784B2 (en) * 2001-07-02 2003-11-18 Qualcomm, Incorporated Lossless intraframe encoding using Golomb-Rice
JP4125565B2 (en) * 2001-08-31 2008-07-30 松下電器産業株式会社 Image encoding method, image decoding method and apparatus
JP4138391B2 (en) * 2002-07-03 2008-08-27 株式会社エヌ・ティ・ティ・ドコモ Variable length code generation device, variable length decoding device, variable length code generation method, and variable length decoding method
KR101082233B1 (en) * 2004-01-20 2011-11-09 파나소닉 주식회사 Picture Coding Method Picture Decoding Method Picture Coding Apparatus Picture Decoding Apparatus and Program thereof

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101930613A (en) * 2009-06-17 2010-12-29 佳能株式会社 Method with figure path sequence Code And Decode component layer scheme
US8930924B2 (en) 2009-06-17 2015-01-06 Canon Kabushiki Kaisha Method of encoding and decoding a graphics path sequence into a layered scheme
CN101930613B (en) * 2009-06-17 2015-03-25 佳能株式会社 Method of encoding and decoding a graphics path sequence into a layered scheme
CN108134942A (en) * 2012-04-11 2018-06-08 杜比国际公司 Coding and decoding methods are carried out for a pair bit stream associated with transformation coefficient
CN108134943A (en) * 2012-04-11 2018-06-08 杜比国际公司 Coding and decoding methods are carried out for a pair bit stream associated with transformation coefficient
CN108282663A (en) * 2012-04-11 2018-07-13 杜比国际公司 Coding and decoding methods are carried out for a pair bit stream associated with transformation coefficient
CN108347619A (en) * 2012-04-11 2018-07-31 杜比国际公司 Coding and decoding methods are carried out for a pair bit stream associated with transformation coefficient
US10582218B2 (en) 2012-04-11 2020-03-03 Dolby International Ab Golomb-rice/eg coding technique for CABAC in HEVC
CN108134943B (en) * 2012-04-11 2020-06-16 杜比国际公司 Method for encoding and decoding a bitstream associated with transform coefficients
CN108282663B (en) * 2012-04-11 2020-06-16 杜比国际公司 Method for encoding and decoding a bitstream associated with transform coefficients
CN108347619B (en) * 2012-04-11 2020-09-15 杜比国际公司 Method for encoding and decoding a bitstream associated with transform coefficients
CN108134942B (en) * 2012-04-11 2020-09-15 杜比国际公司 Method for encoding and decoding a bitstream associated with transform coefficients
US11039169B2 (en) 2012-04-11 2021-06-15 Dolby International Ab GOLOMB-RICE/EG coding technique for CABAC in HEVC
US11496768B2 (en) 2012-04-11 2022-11-08 Dolby International Ab GOLOMB-RICE/EG coding technique for CABAC in HEVC
US11706451B2 (en) 2012-04-11 2023-07-18 Dolby International Ab Golomb-Rice/EG coding technique for CABAC in HEVC

Also Published As

Publication number Publication date
KR20060032944A (en) 2006-04-18
JP2008517495A (en) 2008-05-22
JP4727669B2 (en) 2011-07-20
CN101099387B (en) 2010-10-20

Similar Documents

Publication Publication Date Title
US7782233B2 (en) Method and apparatus for encoding/decoding point sequences on laser binary representation
CN109167645B (en) Data structure for physical layer encapsulation, data structure generating apparatus and method thereof
CN1185795C (en) Device and method for entropy encoding of information words and device and method for decoding entropy-encoded information words
CN107919943B (en) Method and device for coding and decoding binary data
CN1795679A (en) Method, apparatus and system for encoding and decoding side information for multimedia transmission
CN1675842B (en) Method and apparatus arithmetic coding, and related decoding method
KR20060107942A (en) Methods and apparatuses for generating and recovering 3d compression data
CN101017574A (en) Huffman decoding method suitable for JPEG code stream
CN102098508A (en) Multimedia signature coding and decoding
CN105791527A (en) Method and device for transmitting contacts of mobile terminal
CN101099387B (en) Method and apparatus for encoding/decoding point sequences on laser binary representation
KR20020064776A (en) MPEG-4 encoder and output coded signal of such an encoder
JP2012124679A (en) Apparatus and method for decoding encoded data
CN116827354B (en) File data distributed storage management system
CN102651795B (en) Run-length reduced binary sequence compressed encoding method
KR100636370B1 (en) Apparatus and method for coding using bit-precision, and apparatus and method for decoding according to the same
US7193542B2 (en) Digital data compression robust relative to transmission noise
CN112885364B (en) Audio encoding method and decoding method, audio encoding device and decoding device
CN101262493B (en) Method for accelerating inter-network data transmission via stream buffer
Knapen et al. Lossless compression of 1-bit audio
RU2003125267A (en) METHOD FOR PROTECTING TRANSFER OF DATA FLOW WITHOUT LOSS AND A DEVICE FOR ITS IMPLEMENTATION
KR100686354B1 (en) Huffman decoding method and device for using variable length tree
KR101260285B1 (en) BSAC arithmetic decoding method based on plural probability model
KR100390693B1 (en) Binary Linear codes generation apparatus and method using orthogonal codes for communication system
CN101159444B (en) Decoding method of transformat combined indication

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
C41 Transfer of patent application or patent right or utility model
TR01 Transfer of patent right

Effective date of registration: 20160714

Address after: South Korea

Patentee after: Korea Electronic Communication Institute

Address before: South Korea

Patentee before: Korea Electronic Communication Institute

Patentee before: Net & TV Inc

CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20101020

Termination date: 20171013

CF01 Termination of patent right due to non-payment of annual fee