CN100542047C - A kind of coding method of index Golomb coding and device - Google Patents
A kind of coding method of index Golomb coding and device Download PDFInfo
- Publication number
- CN100542047C CN100542047C CNB2007101199737A CN200710119973A CN100542047C CN 100542047 C CN100542047 C CN 100542047C CN B2007101199737 A CNB2007101199737 A CN B2007101199737A CN 200710119973 A CN200710119973 A CN 200710119973A CN 100542047 C CN100542047 C CN 100542047C
- Authority
- CN
- China
- Prior art keywords
- data
- input
- coding
- output
- adder
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The invention discloses a kind of coding method and device of index Golomb coding, during coding,, can carry out k rank coding communication data with the exponent number k input coding device of data CodeNum to be encoded and coding.The present invention has adopted pure combinational logic circuit to find the solution 2 being the technology of the logarithm at the end, and then obtains the value of code word size CodeLength and coding codeword CodeWord, thereby the input data are carried out real-time k rank Columbus coding.Cataloged procedure is real-time, hardware resource consumption is few, has obtained the fast effect of coding rate.
Description
Technical field
The invention belongs to the communications field, relate to a kind of encoder method and device, be specifically related to a kind of method and apparatus of index Golomb coding.
Background technology
In the communications field,, to carry out source encoding to communication data usually at data sending terminal in order to reduce the data volume of communications.Index Golomb coding is a kind of coding method of often using in the communications field, H.264 with in the standards such as space communication CCSDS application is arranged all at international video standard.
Index Golomb coding is a kind of variable-length encoding algorithm.Variable length code adopts the code word of different length bit to represent data, and the code word short to The data commonly used is to the long code word of The data that is of little use.The benefit of doing like this is the efficient that has improved storage, taking the network bandwidth when having reduced transmission.Compare with fixed length code, variable length code has improved code efficiency.
Index Golomb coding is constructed as follows: to data to be encoded CodeNum, set encoded index exponent number k, coding codeword is: [M bit 0] [1] [INFO of M+k bit], promptly add that by 0 of M bit 1 of a bit adds information bit INFO, and wherein the computational methods of M and INFO are:
M＝log
2(CodeNum/2
k+1)，INFO＝CodeNum-(2
M-1)×2
k，
According to definition, can obtain the method for calculation code code word CodeWord and code word size CodeLength.To the Golomb coding on k rank, the coding computing formula is as follows:
CodeWord＝CodeNum+2
k，CodeLength＝2×log
2(CodeNum/2
k+1)+k+1
Wherein CodeNum represents data to be encoded.
When hardware is realized coding, logarithm operation has appearred, usually adopt the method for tabling look-up, LUT is cured in the middle of the rom, is about to data to be encoded as address wire, coding result CodeWord and CodeLength are put into the position of address wire correspondence, simplified logical operation like this, but the code table of structure need consume a large amount of memory spaces, and when the exponent number k of coding was inequality, code table can not be reused.
Summary of the invention
The objective of the invention is to, a kind of coding method and device of index Golomb coding is provided, can carry out k rank coding communication data.The present invention has adopted pure combinational logic circuit to find the solution 2 being the technology of the logarithm at the end, and then obtains the value of CodeLength and CodeWord, thereby the input data are carried out real-time k rank index Golomb coding, makes that coding is real-time, hardware resource consumption is few.
A kind of coding method of index Golomb coding is characterized in that, this method comprises following several steps:
Step 1: data input initialization: the exponent number k of data CodeNum to be encoded and coding is input to respectively in two registers;
Step 2: data and numerical value 1 that data CodeNum to be encoded is moved right after the k position are input in the adder, and dateout is CodeNum1.Operation expression is shown below:
CodeNum1＝(CodeNum＞＞k)+1
Step 3: CodeNum1 is imported data backward device, obtain exporting CodeNumAnti, data backward device act as the corresponding bit bit data transposing with the corresponding bit bit data of output and input;
Step 4: CodeNumAnti is input to logarithm finds the solution the unit, the complement code of obtaining CodeNumAnti is done the computing of a logical AND then with CodeNumAnti own, adopt combinational logic circuit to realize.Dateout is OneHotAnti, and OneHotAnti only contains the CodeNumAnti rightmost, be 1 of lowest order, the remainder data position is 0.The logical expression of combinational logic circuit is as follows:
OneHotAnti＝CodeNumAnti&(CodeNumAnti+1)
Wherein, CodeNumAnti represents CodeNumAnti step-by-step negate.
Step 5: OneHotAnti is input to a data backward device, is output as OneHot.
Step 6: OneHot is imported general 2
n-n encoder obtains exporting M.
Step 7: the M of output is moved to left one, obtain result and 1+k addition, promptly obtain the code word size of Golomb coding:
CodeLength＝(M＜＜1)+1+k，
Implementation procedure can realize with multiplier and adder.
Step 8: CodeNum and k are input in the arithmetic logic circuit, obtain coding codeword CodeWord; The logical expression of computing is shown below:
CodeWord＝CodeNum+(1＜＜k)，
Implementation procedure can be used adder and n-2
nDecoder is realized.
A kind of code device of index Golomb coding comprises: general 2
n-n encoder is characterized in that, also comprises: input data processing unit, dateout processing unit and logarithm are found the solution the unit.
The input data processing unit will be handled from data to be encoded CodeNum and the coding exponent number k that register takes out, draw the antilog CodeNumAnti that asks logarithm operation and be input to logarithm and find the solution in the unit, finding the solution through logarithm that the unit asks with 2 is that the logarithm at the end is found the solution, and backward output, obtain intermediate object program OneHot, and be input to general 2
n-n encoder obtains exporting M; M and data to be encoded CodeNum and coding exponent number k are input in the dateout processing unit code word CodeWord that obtains encoding and code word size CodeLength.
Import data processing unit in the described encoder, comprise holding wire, data backward device and a general adder; From register, take out the data CodeNum to be encoded and the exponent number k of coding; Holding wire connects the CodeNum correspondence position of input, the output data after the k position that move to right, and with 1 addition in adder, the result is as the input of data backward device; The circuit signal line connects input and output data height bit backward in the data backward device, obtains the output CodeNumAnti of this module.
Described logarithm is found the solution the unit, is used for separating out 1 of input data lowest bit position, and logarithm is found the solution the unit and is output as OneHotAnti; This unit is made up of a logical circuit and a data backward device; It is the logarithm OneHotAnti at the end that the CodeNumAnti that logical circuit will be imported this unit gets with 2 as antilog; The circuit signal line connects input and output data height bit backward in the data backward device, obtains the backward output OneHot of logic circuit output signal OneHotAnti.
Described logical circuit by not gate, with the door and an adder be formed by connecting, not gate is connected with input end signal, the output of not gate and signal 1 be as the input of adder, and the output of adder and input signal pass through and the output as logical circuit of behind the door output signal again.
Described dateout computing unit is by logical circuit compute codeword length C odeLength and coding codeword CodeWord; CodeWord is by n-2
nThe logical circuit of decoder and adder combination calculates, and will be input to n-2 from the coding exponent number k signal that register takes out
nDecoder is input to adder with it with the data to be encoded CodeNum that takes out from register again, promptly can obtain coding codeword CodeWord; The logical circuit that CodeLength forms by multiplier and adder calculates.
The invention has the advantages that:
(1) in the process that logarithm is found the solution, can be real-time calculate the input data be the integer part of the logarithm at the end with 2.Need not table look-up, save a large amount of memory spaces; Do not need the displacement comparison operation that circulates yet, saved operation time.
(2) the present invention can be suitable for k rank Columbus coding, and k is input in the circuit as a parameter, and the result encodes out.Different exponent numbers can need not look-up table and construct different code tables like that with identical logical circuit, to such an extent as to consume too much room and time resource.
Description of drawings
Fig. 1 is the modular structure figure of the code device of a kind of index Golomb coding of the present invention
Fig. 2 is the system flow chart of the coding method of a kind of index Golomb coding of the present invention
Fig. 3 calculates the circuit theory diagrams of waiting to ask to logarithmic data CodeNum1 for the present invention 0 rank Golomb coding
Fig. 4 calculates the circuit theory diagrams of OneHot for the code device of a kind of index Golomb coding of the present invention
Fig. 5 is the circuit theory diagrams of the present invention 0 rank Golomb coding compute codeword CodeWord
Fig. 6 is the circuit theory diagrams of the present invention 0 rank Golomb coding compute codeword length C odeLength
Fig. 7 calculates the circuit theory diagrams of waiting to ask to logarithmic data CodeNum1 for the present invention 2 rank Golomb coding
Fig. 8 is the circuit theory diagrams of the present invention 2 rank Golomb coding compute codeword CodeWord
Fig. 9 is the circuit theory diagrams of the present invention 2 rank Golomb coding compute codeword length C odeLength
Embodiment
The present invention is described in further detail below in conjunction with drawings and Examples.
A kind of coding method of index Golomb coding, this method comprise following several steps, as shown in Figure 2:
(1) data input initialization: the exponent number k of data CodeNum to be encoded and coding is input to respectively in two registers;
(2) from register, the exponent number k of data CodeNum to be encoded and coding is fetched in the input data processing unit respectively, with move right data after the k position and numerical value of data CodeNum to be encoded is that 1 high level signal is input in the general adder, and dateout is CodeNum1.Operation expression is shown in (1) formula.
CodeNum1＝(CodeNum＞＞k)+1 (1)
Shift operation wherein can directly couple together with the corresponding bit position of holding wire with the input and output data, supposes that shift result is TempShift, shown in (2):
TempShift＝CodeNum＞＞k (2)
Concrete grammar, with TempShift[i] with CodeNum[i+k] link to each other (and 0≤i≤(n-k), n represents total bit number of CodeNum, TempShift[i] expression TempShift the i bit, CodeNum[i+k] the i+k bit of expression CodeNum), the high position of TempShift mends 0.Then TempShift and 1 is input to adder, is output as CodeNum1, finish the calculating of (1).
(3) CodeNum1 is imported data backward device Anti, obtain exporting CodeNumAnti, among the data backward device Anti, corresponding bit bit data of just exporting with holding wire and the transposing of the corresponding bit bit data of input, the high low level that is about to both oppositely connects: the lowest order of CodeNum1 links to each other with the highest order of CodeNumAnti, time high-order the linking to each other of the inferior low level of CodeNum1 and CodeNumAnti, link to each other with the lowest order of CodeNumAnti until the highest order of CodeNum1.
(4) CodeNumAnti is input to logarithm and finds the solution the unit, the complement code of obtaining CodeNumAnti is done the computing of a logical AND then with CodeNumAnti own, the employing combinational logic circuit is realized, logical circuit by not gate, with the door and an adder be formed by connecting, not gate is connected with input end signal, the output of not gate and signal 1 be as the input of adder, and the output of adder and input signal pass through and the output as logical circuit of behind the door output signal again.
Be output as and separate out the CodeNumAnti rightmost, be lowest order 1 data OneHotAnti afterwards, the logical expression of combinational logic circuit is as follows:
OneHotAnti＝CodeNumAnti&(CodeNumAnti+1) (3)
The complement code of CodeNumAnti and the CodeNumAnti of itself do the computing of a logical AND, promptly can separate out CodeNumAnti lowest order 1.The result who obtains is meant and contains one 1 or complete 0 data.When CodeNumAnti is 0, dateout be complete 0, do not contain 1.
(5) OneHotAnti is input in the data backward device, dateout is OneHot.Backward data way is identical in the same step of this backward device (2), changes with the corresponding bit bit data of input with the corresponding bit bit data that holding wire is just exported.
(6) coding calculates M, and OneHot is imported general 2
n-n encoder obtains coding result, and dateout is M.Here 2
n-n encoder can realize that combination implementing method is an industry-accepted methodology with general 8-3 encoder combination.
(7) compute codeword length is taken out coding exponent number k to the dateout processing unit from register, and the M that obtains in (6) is done following processing:
CodeLength＝(M＜＜1)+1+k (4)
The M of output is multiplied each other by multiplier and semaphore 2, make M move to left one, also circuit can be deteriorated to the holding wire of some connections, the M of input and the corresponding bit of output are coupled together realization, obtain the result in adder with the 1+k addition, promptly obtain the code word size CodeLength of Golomb coding.
(8) calculation code CodeWord as a result, data to be encoded CodeNum that will take out from register and k are input to calculate the CodeWord logical circuit and can obtain coding result CodeWord, and logical expression is shown in (5):
CodeWord＝CodeNum+(1＜＜k) (5)
(1＜＜k) can be with a n-2
nDecoder realizes, k is as the input of decoder, output be exactly (1＜＜k).Will (1＜＜k) be input to an adder with CodeNum, promptly can finish the logic function of (5).
A kind of code device of index Golomb coding comprises: general 2
n-n encoder, general n-2
nDecoder, input data processing unit, logarithm are found the solution unit and dateout processing unit.
As shown in Figure 1, the input data processing unit will carry out signal processing from data to be encoded CodeNum and the coding exponent number k that register takes out with signal, draw the antilog CodeNumAnti that asks logarithm operation and be input to logarithm and find the solution in the unit, finding the solution through logarithm that the unit asks with 2 is that the logarithm at the end is found the solution, and backward output, obtain intermediate object program OneHot, and be input to general 2
n-n encoder obtains exporting M; M and data to be encoded CodeNum and coding exponent number k are input in the dateout processing unit code word CodeWord that obtains encoding and code word size CodeLength.
Import data processing unit in the described encoder, comprise holding wire, data backward device and a general adder; From register, take out the data CodeNum to be encoded and the exponent number k of coding; Holding wire connects the CodeNum of input with corresponding bit realizes shift operation, the k position data afterwards that move to right after output is shifted, and with 1 addition in adder, the result is as the input of data backward device; The circuit signal line connects input and output data height bit backward in the data backward device, obtains the output CodeNumAnti of this module, as the antilog of asking logarithm operation.
Described logarithm is found the solution the unit, is used for separating out 1 of input data lowest bit position, and logarithm is found the solution the unit and is output as OneHotAnti.Form by a logical circuit and a data backward device; Logical circuit will be imported the CodeNumAnti of this unit as antilog, and to get with 2 be the logarithm OneHotAnti at the end; The circuit signal line connects input and output data height bit backward in the data backward device, promptly importing the higher bit of data is connected with the dateout lowest bit, input data time higher bit is connected with dateout time higher bit, until the backward output OneHot that obtains logic circuit output signal OneHotAnti.
As shown in Figure 4, described logical circuit by not gate, with the door and an adder be formed by connecting, not gate is connected with input end signal, the output of not gate and signal 1 have so just been finished the computing of supplement sign indicating number as the input of adder; The output of adder and input signal pass through and the output as logical circuit of behind the door output signal again.
Described dateout processing unit calculates code word and code word size by logical circuit; The dateout processing unit is by multiplier, n-2
nDecoder and adder mixing are formed by connecting; The coding exponent number k signal that takes out from register outputs in the adder with 1 addition adder, and with described 2
nThe output M of-n encoder and semaphore 2 be through behind the multipliers, i.e. M one the result's addition in another adder that moves to left, and output signal is code word size CodeLength; Code word for coding can be input to a n-2 from the coding exponent number k signal that register takes out
nDecoder, with move to left k position output of high level signal 1, output is 2
k, again it is input to an adder with the data to be encoded CodeNum that takes out from register, promptly can obtain coding codeword CodeWord.
Embodiment 1:
This embodiment is example with k=0, and promptly 0 rank Golomb coding illustrates application of the present invention
The input data processing unit is obtained waiting to ask to logarithmic data CodeNum1 by the data CodeNum that imports.This moment k=0, formula (1) deteriorates to:
CodeNum1＝CodeNum+1 (6)
Specifically can realize that logical circuitry as shown in Figure 3 by general adder.
Obtain after the CodeNum1, CodeNum1 is imported the backward device, be output as CodeNumAnti; Be about to the high low level backward output of CodeNum1, corresponding bit bit data of just exporting with holding wire and the transposing of the corresponding bit bit data of input, the lowest order of CodeNum1 links to each other with the highest order of CodeNumAnti, time high-order the linking to each other of the inferior low level of CodeNum1 and CodeNumAnti, link to each other with the lowest order of CodeNumAnti until the highest order of CodeNum1.Result CodeNumAnti is exported to logarithm find the solution the unit.
Logarithm is found the solution the unit, and CodeNumAnti by the represented computing circuit of (7) formula, promptly can be separated out 1 of lowest bit position.
OneHotAnti＝CodeNumAnti&(CodeNumAnti+1) (7)
The specific implementation logical circuit as shown in Figure 4.What (7) formula obtained is the integer part of the logarithm of CodeNumAnti, obtain the logarithm integer part of CodeNum1, the high low level backward of OneHotAnti need be obtained OneHot.Specific practice also is directly oppositely to connect with the high low level of holding wire in the backward device, and the corresponding bit bit data of output and the corresponding bit bit data transposing of input are got final product.
2
n-n cell encoder is input as OneHot, is output as M, specifically can realize with general 8-3 encoder combination.
The dateout processing unit calculates code word CodeWord and code word size CodeLength.Wherein coding codeword CodeWord is obtained by (8) formula:
CodeWord＝CodeNum+1 (8)
Specifically logical circuit is realized by an adder, as shown in Figure 5, and n-2
nDecoder is encoded to the coding exponent number 0 that takes out from register, and the result of coding and the data to be encoded CodeNum that takes out from register are input to adder, obtains code word CodeWord.
And code word size is obtained by (9) formula:
CodeLength＝(M＜＜1)+1 (9)
Concrete logical circuit as shown in Figure 6,2
nThe output M of-n encoder and semaphore 2 through gained output behind the multipliers in adder with 1 addition of high level signal amount, signal M displacement also can directly connect with the circuit holding wire, be the 0th high level that is connected to expression 1 of CodeLength, the i position of CodeLength links to each other with the i-1 position of M.
Embodiment 2:
This embodiment is example with k=2, i.e. 2 rank Golomb coding.
The input data processing unit is obtained waiting to ask to logarithmic data CodeNum1 by the data CodeNum that imports, always total n the bit of CodeNum.This moment k=2, formula (1) becomes:
CodeNum1＝(CodeNum＞＞2)+1 (10)
Wherein, shift operation only needs corresponding bit to get final product with the holding wire connection, and addition is realized that by general adder logical circuitry as shown in Figure 7.CodeNum[n:2 wherein] expression, 2 of the n to the of CodeNum.
Obtain after the CodeNum1, CodeNum1 is imported the backward device, be about to the high low level of CodeNum1 conversely, the corresponding bit bit data of output and the corresponding bit bit data transposing of input are got final product.CodeNumAnti is as a result exported to logarithm find the solution the unit.
Logarithm is found the solution the unit, and 2
n-n cell encoder is identical with 0 rank Golomb code device.
The dateout processing unit calculates code word CodeWord and code word size CodeLength.Wherein, code word is obtained by (11) formula:
CodeLength＝(M＜＜1)+3 (11)
Concrete logical circuit as shown in Figure 8,2
nThe output M of-n encoder and semaphore 2 through gained output behind the multipliers in adder with 1 addition of high level signal amount, signal M displacement also can directly connect with the circuit holding wire, be the 0th high level that is connected to expression 1 of CodeLength, the i position of CodeLength links to each other with the i-1 position of M.
And code word size is obtained by (12) formula:
CodeWord＝CodeNum+(1＜＜2) (12)
Concrete logical circuit as shown in Figure 9, n-2
nDecoder is encoded to the coding exponent number 2 that takes out from register, with the result 2 of coding
2Be input to adder with the data to be encoded CodeNum that takes out from register, obtain code word CodeWord.
Claims (3)
1, a kind of coding method of index Golomb coding is characterized in that, this method comprises following several steps:
Step 1: data input initialization: the exponent number k of data CodeNum to be encoded and coding is input to respectively in two registers;
Step 2: data and numerical value 1 that data CodeNum to be encoded is moved right after the k position are input in the adder, and dateout is CodeNum1; Operation expression is shown below:
CodeNum1＝(CodeNum＞＞k)+1；
Step 3: CodeNum1 is imported data backward device, obtain exporting CodeNumAnti, data backward device is with the corresponding bit bit data of output and the corresponding bit bit data transposing of input;
Step 4: CodeNumAnti is input to logarithm finds the solution the unit, the complement code of obtaining CodeNumAnti is done the computing of a logical AND then with CodeNumAnti own, the employing combinational logic circuit is realized, be output as and separate out the CodeNumAnti rightmost, be lowest order 1 data OneHotAnti afterwards, the logical expression of combinational logic circuit is as follows:
OneHotAnti＝CodeNumAnti&(CodeNumAnti+1)；
Step 5: OneHotAnti is input to a data backward device, is output as OneHot;
Step 6: OneHot is imported general 2
n-n encoder obtains exporting M;
Step 7: the M of output is moved to left one, obtain result and 1+k addition, promptly obtain the code word size of Golomb coding:
CodeLength＝(M＜＜1)+1+k，
Implementation procedure can realize with multiplier and adder;
Step 8: CodeNum and k are input in the arithmetic logic circuit, obtain coding codeword CodeWord; The logical expression of computing is shown below:
CodeWord＝CodeNum+(1＜＜k)，
Implementation procedure adder and n-2
nDecoder is realized.
2, a kind of device that is applied to the coding method of the described a kind of index Golomb coding of claim 1 comprises: general 2
n-n encoder is characterized in that, also comprises: the input data processing unit, and logarithm is found the solution unit and dateout processing unit;
The input data processing unit will be handled from data to be encoded CodeNum and the coding exponent number k that register takes out, draw the antilog CodeNumAnti that asks logarithm operation and be input to logarithm and find the solution in the unit, finding the solution through logarithm that the unit asks with 2 is that the logarithm at the end is found the solution, and backward output, obtain intermediate object program OneHot, and be input to general 2
n-n encoder obtains exporting M, and OneHot as a result and coding exponent number k that M and data to be encoded CodeNum, high level signal 1, logarithm are found the solution the unit are input in the dateout processing unit code word CodeWord that obtains encoding and code word size CodeLength;
Described input data processing unit, comprise holding wire, data backward device and a general adder, from register, take out the data CodeNum to be encoded and the exponent number k of coding, holding wire is with the CodeNum of input and corresponding bit connection realization shift operation, k position data afterwards move to right after the output displacement, and with 1 addition in adder, the result is as the input of data backward device, the circuit signal line oppositely connects input and output data height bit in the data backward device, obtains the output CodeNumAnti of this module;
Described logarithm is found the solution the unit, be used for separating out 1 of input data lowest bit position, this unit is output as signal OneHotAnti, form by a logical circuit and a data backward device, it is the logarithm OneHotAnti at the end that the CodeNumAnti that logical circuit will be imported this unit gets with 2 as antilog, the circuit signal line oppositely connects input and output data height bit in the data backward device, obtains the backward output OneHot of logic circuit output signal OneHotAnti;
The code word CodeWord that calculates in the described dateout processing unit is by n-2
nThe logical circuit of decoder and adder combination calculates, and concrete computational process is: n-2
nDecoder calculates take out coding exponent number k signal from register, is about to the high level signal 1 k position output that moves to left, and again result of calculation is input to adder with the data to be encoded CodeNum that takes out from register, promptly obtains coding codeword CodeWord;
The logical circuit that the code word size CodeLength that obtains in the described dateout processing unit forms by multiplier and adder calculates, detailed process is: the coding exponent number k signal that takes out from register outputs in the adder with 1 addition adder, and with 2
nThe output M of-n encoder and semaphore 2 be through behind the multipliers, i.e. M one the result's addition in another adder that moves to left, and output signal is code word size CodeLength.
3, a kind of device that is applied to the coding method of the described a kind of index Golomb coding of claim 1 according to claim 2, it is characterized in that: described logical circuit by not gate, with the door and adder be formed by connecting, not gate is connected with input end signal, the output of not gate and signal 1 obtain the complement code of input signal as the input of adder; The output of adder and input signal pass through and the output as logical circuit of behind the door output signal again.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2007101199737A CN100542047C (en) | 2007-08-06 | 2007-08-06 | A kind of coding method of index Golomb coding and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2007101199737A CN100542047C (en) | 2007-08-06 | 2007-08-06 | A kind of coding method of index Golomb coding and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101114833A CN101114833A (en) | 2008-01-30 |
| CN100542047C true CN100542047C (en) | 2009-09-16 |
Family
ID=39022993
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2007101199737A Expired - Fee Related CN100542047C (en) | 2007-08-06 | 2007-08-06 | A kind of coding method of index Golomb coding and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100542047C (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101355700B (en) * | 2008-09-09 | 2010-06-02 | 北京大学软件与微电子学院 | Method for encoding parallel series entropy and apparatus thereof |
| CN102412934B (en) * | 2011-12-01 | 2014-04-09 | 中国航天时代电子公司 | Digital coding transmission method |
| CN104469366B (en) * | 2014-12-18 | 2017-10-03 | 中国科学院自动化研究所 | A kind of 0 rank Exp- Golomb decoder and coding/decoding method |
-
2007
- 2007-08-06 CN CNB2007101199737A patent/CN100542047C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN101114833A (en) | 2008-01-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105260776A (en) | Neural network processor and convolutional neural network processor | |
| TWI360956B (en) | Cabac decoding apparatus and decoding method there | |
| CN101164340A (en) | CABAC decoding system and method | |
| ZA200408780B (en) | Method and system for multi-rate lattice vector quantization of a signal. | |
| CN101945286B (en) | Compression coding method, decoding decompression method, device and communication system | |
| CN105183425B (en) | A kind of fixation bit wide multiplier with high-precision low complex degree characteristic | |
| CN105356971A (en) | SCMA decoder based on probability calculation | |
| CN100542047C (en) | A kind of coding method of index Golomb coding and device | |
| CN102170327A (en) | Super forward error correction hardware decoding method and apparatus thereof | |
| CN112039535A (en) | Code rate compatible LDPC encoder based on quasi-cyclic generator matrix | |
| CN111008698B (en) | Sparse matrix multiplication accelerator for hybrid compression cyclic neural networks | |
| CN103955585B (en) | FIR (finite impulse response) filter structure for low-power fault-tolerant circuit | |
| CN110825346A (en) | Low-logic-complexity unsigned approximate multiplier | |
| CN103401650A (en) | Blind identification method for (n, 1 and m) convolutional code with error codes | |
| CN101355700B (en) | Method for encoding parallel series entropy and apparatus thereof | |
| WO2022156601A1 (en) | Audio encoding method and apparatus, and audio decoding method and apparatus | |
| CN102545910B (en) | A kind of jpeg huffman decoding circuit and coding/decoding method thereof | |
| CN104486624A (en) | CAVLC entropy decoder and entropy decoding method | |
| CN111933162A (en) | Method for optimizing LC3 encoder residual coding and noise estimation coding | |
| CN111200481A (en) | Method for improving universality of computing unit in Polar code decoding process | |
| JPS6186872A (en) | Apparatus for real time processing of digital signal by folding | |
| CN109257146B (en) | LTE (Long term evolution) rapid decoding system and method based on DSP (digital Signal processor) | |
| US8200733B1 (en) | Device having interleaving capabilities and a method for applying an interleaving function | |
| CN113450807B (en) | Method and device for compressing voice digital signal | |
| CN115882875A (en) | Design method and system of semi-parallel prospective SC decoder |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090916 Termination date: 20100806 |