CN104113394B - The compression of communication modulation signal and decompressing method - Google Patents
The compression of communication modulation signal and decompressing method Download PDFInfo
- Publication number
- CN104113394B CN104113394B CN201410366597.1A CN201410366597A CN104113394B CN 104113394 B CN104113394 B CN 104113394B CN 201410366597 A CN201410366597 A CN 201410366597A CN 104113394 B CN104113394 B CN 104113394B
- Authority
- CN
- China
- Prior art keywords
- data
- class
- frame
- absolute value
- reference data
- 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
- 238000000034 method Methods 0.000 title claims abstract description 46
- 238000004891 communication Methods 0.000 title claims abstract description 36
- 238000007906 compression Methods 0.000 title claims abstract description 27
- 230000006835 compression Effects 0.000 title claims abstract description 23
- 238000005538 encapsulation Methods 0.000 claims abstract description 4
- 230000005540 biological transmission Effects 0.000 claims description 8
- 239000000203 mixture Substances 0.000 claims description 3
- 238000000605 extraction Methods 0.000 claims description 2
- 241000208340 Araliaceae Species 0.000 claims 1
- 235000005035 Panax pseudoginseng ssp. pseudoginseng Nutrition 0.000 claims 1
- 235000003140 Panax quinquefolius Nutrition 0.000 claims 1
- 235000008434 ginseng Nutrition 0.000 claims 1
- 238000009432 framing Methods 0.000 abstract description 2
- 238000005070 sampling Methods 0.000 abstract description 2
- 230000000295 complement effect Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 239000013307 optical fiber Substances 0.000 description 3
- 230000006837 decompression Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 229910002056 binary alloy Inorganic materials 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000005056 compaction Methods 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 238000013144 data compression Methods 0.000 description 1
- 238000013523 data management Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 238000007667 floating Methods 0.000 description 1
- 230000035772 mutation Effects 0.000 description 1
- 238000013139 quantization Methods 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 238000003786 synthesis reaction Methods 0.000 description 1
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention discloses a kind of Compress softwares method of communication modulation signal, mainly solve the problems, such as that existing Compress softwares method is more bad than not high, versatility for communication modulation Signal Compression.Its implementation is：1. the sampling of several communication modulation signals is constituted into data frame, calculate the absolute value of data in data frame；2. it is threshold value to set a reference data, and two classes are divided into and by class restructuring according to the size relative to reference data to absolute value；3. pair the data class less than reference data is directly encoded, and to the data class elder generation more than or equal to reference data, calculates the difference of itself and reference data, then difference is encoded；4. pair coding result encapsulation framing is transmitted；5. pair receiving frame is unsealed and decoded, and is obtained reference data and two class data reconstruction data frames with decoding and is exported.Present invention efficiently solves the problem that prior art depends on correlation between adjacent signals, compression efficiency is improve, and possess preferable versatility.
Description
Technical field
The invention belongs to communication technical field, more particularly to a kind of compression method and decompressing method can be used for communication modulation
The compressed encoding of signal and storage are transmitted.
Background technology
It is growing with type of traffic and portfolio, the data volume being transmitted is needed in communication network drastically
Increase, so that more expensive channel resources and memory space, substantially increase the complexity and cost of communication system, because
This is compressed coding firstly the need of the signal or data to be transmitted, and reduces data volume, is then transmitted again, improves and passes
Defeated efficiency.
Mainly for voice and video etc. to media signal, these multi-media signals have itself existing Compress softwares method
The correlation of height simultaneously has preferable mathematics and physical model, thus with preferable compaction coding method.But communication is adjusted
Signal processed does not possess preferable correlation properties mostly, in the absence of the mathematics and physical model for being conducive to being compressed coding, leads to yet
Believing the compressed encoding of modulated signal has larger challenge, one of key technology as correlative study.Thus in recent years, exist
The communications field, especially moving communicating field, the compressed encoding of communication modulation signal have turned into the important research of association area
Hold.
Existing compression method, is that the frame initial data being input into is resolved into first and second by subset separative element
Two subsets；Estimation unit estimates yield in the second subset data using the first subset data, and then yield in the second subset subtracts second for obtaining
The valuation of subset obtains a grouping error data.First subset data by the treatment of derivative coding unit obtain subset mantissa and
Subset index gives formatting module, and error information is processed by another derivative coding unit and obtains error mantissa and error
Index also gives formatting module；Two above-mentioned derivative coding units also export the subset for reflecting the first subset codes information simultaneously
Derivative and subset Huffman tables, and reflect the error derivative and error Huffman tables of error information coding information, these are led
Number information determines the minimum amount of storage for representing that one group of floating data needs.The subset derivative that header coding unit will be received
And subset Huffman tables, error derivative and error Huffman tables and the coding parameter group from reflection coding unit encoding setting
Synthesis header gives formatting module；Header, subset mantissa and subset index that compressed data formatting module will be received
And error mantissa and error extension are according to certain format combination into coded frame data, compressed data output is formed.
Existing decompressing method, the compressed data frames that compressed data analysis module will be received resolve into header, subset
Mantissa and subset index and error mantissa and error extension；The header that header information decoder unit will be received is separated into subset and leads
Number and subset Huffman tables, error derivative and error Huffman tables；In two integrated decoding units, one utilizes subset derivative
And subset mantissa and subset index are reconstructed into the first subset data by subset Huffman tables, and one utilizes error derivative and mistake
Error mantissa and error extension are reconstructed into error information by difference Huffman tables；The first subset that estimation unit is obtained according to decoding
Data estimation goes out yield in the second subset data, and it is added with error information, obtains yield in the second subset data, the second last subset data
Processed by subset combining unit with the first subset data and obtain reconstructing data output.
Above-mentioned prior art carries out data compression and coding using the correlation between adjacent data, and this requires adjacent data
Between to have preferable continuity and correlation.However, randomness is stronger between communication modulation signal adjacent signals, and do not have
Standby preferable correlation or short-term stationarity characteristic, thus prior art can not carry out effective compressed encoding to it, cause compression
It is not higher than low, channel utilization.
The content of the invention
Regarding to the issue above, it is an object of the invention to provide a kind of Compress softwares method of communication modulation signal, to reduce
To have preferable continuity and correlation requirement between adjacent data, compression ratio and code efficiency are improved, and then improve channel
Utilization rate.
Realizing the technical scheme of the object of the invention is：Primary signal is carried out into sub-frame processing, then by the absolute of framing signal
Value carries out classification restructuring according to the reference data of setting, then carries out different codings for different classifications.Specific steps include
It is as follows：
The technical proposal of the invention is realized in this way：
Technical scheme one：
A kind of compression method of communication modulation signal, comprises the following steps：
(1) data processing step：
The L sampled data of communication modulation signal is constituted data frame Dx by (1a) according to setting frame length L, extracts data frame
The symbol composition sign bit Sn of each data in Dx, and calculate each data in data frame Dx thoroughly deserve absolute value frame
Da；
(1b) sets a reference data Dr, and the absolute value in absolute value frame Da less than reference data is demarcated as into 0 class number
According to being demarcated as 1 class data more than or equal to the absolute value of reference data, while obtaining classification information C；
All 0 class data are combined and obtain 0 class data D0 by (1c), all 1 class data are combined and obtains 1
Class data D1, reference data Dr is cut from the absolute value of 1 class data D1 and obtains 1 class data difference D2；
(2) coding step：
(2a) to reference data Dr encode and is obtained reference data code word Cr；
(2b) to 0 class data D0 encode and is obtained 0 class code word data C0；
(2c) to 1 class data difference D2 encode and is obtained 1 class data difference code word C1.
(3) frame encapsulation step：
By frame length L, sign bit Sn, classification information C, reference data code word Cr, 0 class code word data C0,1 class data difference code
Word C1 merges, and is combined into coded frame Bs, and export to transmission channel or storage medium.
Preferably, described one reference data Dr of setting, is set by one of following three kinds of modes：
One be according to data absolute value it is long when distribution character, reference data is arranged to the mathematical expectation of absolute value；
Two be according to current data frame in absolute value distribution character in short-term, if distribution character is close to being uniformly distributed in short-term,
Reference data is then set to the intermediate value of current data frame in maximum value, otherwise, reference data current data is set to
The average value of intraframe data absolute value；
Three is to be set as enabling to current data frame in smaller and larger than the absolute value quantity equal to it reference data
Than the value for meeting setting ratio.
Preferably, described classification information C, is made up of L bits, each bit corresponds to an absolute value in order, point
Not Biao Shi corresponding absolute value classification, that is, the corresponding bit of absolute value for being classified as 0 class data is set to 0, is classified as 1 class data
The corresponding bit of absolute value is set to 1.
Technical scheme two：
A kind of decompressing method of communication modulation signal, including：
1) frame deblocking step：
Coded frame Bs from transmission channel or storage medium is decomposed into frame length L, sign bit Sn, classification information C, reference
Code word data Cr, 0 class code word data C0,1 class data difference code word C1；
2) decoding step：
2a) reference data code word Cr is decoded, reconstructed reference data Dr is obtained；
2b) 0 class code word data C0 is decoded, obtains reconstructing 0 class data D0 '；
2c) 1 class data difference code word C1 is decoded, obtains reconstructing 1 class data difference D2.
3) data restoration step：
Reconstructed reference data Dr 3a) is added to 1 class data difference D2 of reconstruct, obtains reconstructing 1 class data D1；Believe according to classification
Breath C, 0 class data D0 ' of reconstruct and 1 class data D1 of reconstruct are combined according to the order before compression, obtain reconstruct data exhausted
To value frame Da '；
Corresponding sign bit Sn 3b) is added on reconstruct data absolute value frame Da ', obtains reconstructing data frame Dx ', and it is defeated
Go out.
The invention has the advantages that：
The characteristics of communication modulation signal is that signal randomness is stronger, and correlation is poor but also frequent between adjacent signal
There is the situation of sign mutation.It is short that the condition that prior art can be effectively compressed to signal is that requirement is had by compressed signal
There is stronger correlation between Shi Pingwen and adjacent signal, and communication modulation signal does not have these characteristics, so existing
Compress technique is used for the compression of communication modulation signal, and compression ratio is very low.
Compression method disclosed in this invention, is by several communication modulation signal sampling value composition data frames, by data
Frame absolute value is divided into two class data with a reference data, then two class data absolute values being interleaved with each other originally by class
Do not reconfigure respectively together；Thus the close absolute value of amplitude is respectively combined together, data can be made full use of
Frame absolute amplitude is segmented distribution character, while the also artificial correlation that increased in two class data between data；Just because of
In this way, compression method disclosed in this invention is no longer dependent on the correlation between signal adjacent signal to be compressed, it is thus possible to have
Effect improves compression ratio and code efficiency, and then is conducive to improving channel transport efficiency and storage efficiency.The present invention is also caused simultaneously
Disclosed compression method has preferable versatility.
Brief description of the drawings
Compression process figure in Fig. 1 present invention；
Compression sub-process figure in Fig. 2 present invention；
Decompression flow chart in Fig. 3 present invention；
Initial data frame schematic diagram in Fig. 4 present invention；
Data form schematic diagram in Fig. 5 present invention；
Absolute value frame schematic diagram in Fig. 6 present invention；
Classifying data frames schematic diagram in Fig. 7 present invention.
Specific embodiment
Below in conjunction with accompanying drawing, the present invention is described in further detail.
Reference picture 1, specific implementation step of the invention is as follows：
In 3G/4G GSMs, in order to reduce base station cost, using distributed base station and data remote technology,
Communication data management control section and needs are separated installed in radio frequency part more from far-off regions, centre is passed with optical fiber connection
Defeated communication modulation signal.Compress softwares method disclosed in this invention just can be used to the communication to distributed base station Optical Fiber Transmission
Modulated signal is compressed decompression, to improve Optical Fiber Transmission efficiency, so as to improve the communications throughput rate of distributed base station.
Step 1, the initial data frame Dx that reception is made up of the sampled data of L communication modulation signal, in extraction data frame
The symbol S of each data, and be combined and obtain together sign bit Sn.
As shown in figure 4, initial data frame Dx is made up of the sampled data of L communication modulation signal, L is whole more than 0
Number, described sampled data includes but is not limited to following two kinds of data：Time domain data, frequency domain data；
As shown in figure 5, the sampled data of each communication modulation signal is expressed with a complement of two's two's complement data.Binary system is mended
Code data are made up of symbol S, sign extended Se and valid data D, wherein symbol S 1 bit, sign extended Se m bits, have
Effect data D n-bits, complement of two's two's complement data bit wide W=1+m+n bits；Usual W is 8 integral multiple；
Sign bit Sn is constituted by L data symbol S in data frame as shown in Figure 4.
Step 2, calculates the L absolute value of data in initial data frame Dx, and combines and obtain absolute value frame Da.
Referring to Fig. 6, each absolute value is made up of Z and D two parts in absolute value frame Da, and wherein Z represents the bit constituted by 0
Position, this part does not carry data message, and D represents effective bit, and this part is useful data.
Step 3, sets reference data Dr.
The reference data Dr, it is set with various methods, three kinds given below but is not limited to these three：
One be according to data absolute value it is long when distribution character, reference data is arranged to the mathematical expectation of absolute value；
Two be according to current data frame in absolute value distribution character in short-term, if distribution character is close to being uniformly distributed in short-term,
Reference data is then set to the intermediate value of current data frame in maximum value, otherwise, reference data current data is set to
The average value of intraframe data absolute value；
Three is to be set as enabling to current data frame in smaller and larger than the number of the absolute value equal to it reference data
Measure the value than meeting setting ratio.
This example uses second method.
All absolute values in absolute value frame Da, using reference data Dr as threshold value, are divided into two classes by step 4.
Absolute value in absolute value frame Da is compared with reference data Dr, if the absolute value in absolute value frame Da is small
In Dr, just it is demarcated as 0 class data, is otherwise demarcated as 1 class data, while classification information C is obtained, as shown in Figure 6.
The classification information C, it is made up of L bits, and each bit corresponds to an absolute value in order, represents that institute is right respectively
The classification of absolute value is answered, that is, the corresponding bit of absolute value for being classified as 0 class data is set to 0, be classified as the absolute value correspondence of 1 class data
Bit be set to 1.
Step 5, grouped data restructuring.
The absolute value that 0 class data will be demarcated as is grouped together into 0 class data D0；
The absolute value that 1 class data will be demarcated as is grouped together into 1 class data D1, then from the absolute of 1 class data D1
Reference data Dr is cut in value and obtains 1 class data difference D2, as shown in Figure 7.
R in wherein 1 class data difference D2 represents the difference of each absolute value and reference data Dr.
Step 6, coding step.
Reference picture 2, this step is implemented as follows：
(6a) is encoded to reference data Dr, obtains reference data code word Cr
The coding of reference data Dr, using zero_failure data method, such as Huffman is encoded or arithmetic coding constant entropy coding staff
Method, or using dictionary coding methods such as LZW, it would however also be possible to employ other zero_failure data methods；
(6b) is encoded to 0 class data D0, obtains 0 class code word data C0
Coding is carried out to 0 class data D0 will consider two kinds of situations of practical application, and a kind of situation is whole Compress softwares mistake
Journey does not allow to produce distortion, and another situation is that whole Compress softwares process allows to produce certain distortion；
For the situation for not allowing generation distortion, the coding of 0 class data D0 uses zero_failure data method, for example
The dictionary coding method such as Huffman codings or arithmetic coding entropy coding method, LZW；
For the situation for allowing generation distortion, the coding of 0 class data D0 is just used distortion coding method, such as even amount
Change coding method, the coding method of Lloyd-Max non-uniform quantizings, vector quantization coding method etc.；
(6c) is encoded to 1 class data difference D2, obtains 1 class data difference code word C1
1 class data difference D2 uses zero_failure data method, such as Huffman codings or arithmetic coding entropy coding method,
Or using dictionary coding methods such as LZW, it would however also be possible to employ other zero_failure data methods.
Step 7, frame encapsulation.
By frame length L, sign bit Sn, classification information C, reference data code word Cr, 0 class code word data C0,1 class data difference code
Word C1 merges, and is combined into coded frame Bs, and export to transmission channel or storage medium.
Reference picture 3, depressurization steps of the invention are as follows：
Step one, frame deblocking.
Coded frame Bs from transmission channel or storage medium is decomposed into frame length L, sign bit Sn, classification information C, reference
Code word data Cr, 0 class code word data C0,1 class data difference code word C1；
Step 2, reconstructed reference data Dr is obtained to reference data code word Cr decodings：
The decoding of this step is carried out according to encoding corresponding method with step in compression process (6a).
Step 3, obtains reconstructing 0 class data D0 ' to 0 class code word data C0 decodings：
The decoding of this step is carried out according to encoding corresponding method with step in compression process (6b).
Step 4, obtains reconstructing 1 class data difference D2 to 1 class data difference code word C1 decodings：
The decoding of this step is carried out according to encoding corresponding method with step in compression process (6c).
Step 5, data recovery.
Reconstructed reference data Dr is added to 1 class data difference D2 of reconstruct, obtains reconstructing 1 class data D1；According to classification information
C, 0 class data D0 ' of reconstruct is combined with 1 class data D1 of reconstruct according to the order before compression, obtains reconstructing absolute value frame
Da’。
Step 6, adds corresponding sign bit Sn on reconstructing absolute value frame Da ', obtains reconstructing data frame Dx ', and defeated
Go out.
In the Compress softwares method of above-mentioned communication modulation signal, according to the difference of practical application, support Lossless Compression and
There is distortion to compress two kinds of applications.
Disclosed in this invention is a kind of Compress softwares method of communication modulation signal, can not only be to communication modulation signal
Effective compressed encoding is carried out, equally the not strong signal of correlation and nonstationary random signal can be also effectively compressed.
Above description is only example of the present invention, does not constitute any limitation of the invention.Obviously for
For one of skill in the art, after present invention and principle has been understood, all may be without departing substantially from the principle of the invention, structure
In the case of, various amendments and the change in form and details are carried out, but these are based on the amendment and change of inventive concept
Still within claims of the invention.
Claims (4)
1. a kind of compression method of communication modulation signal, including：
(1) data processing step：
The L sampled data of communication modulation signal is constituted data frame Dx, in extraction data frame Dx by (1a) according to setting frame length L
The symbol composition sign bit Sn of each data, and calculate each data in data frame Dx thoroughly deserve absolute value frame Da；
(1b) sets a reference data Dr, the absolute value in absolute value frame Da less than reference data is demarcated as into 0 class data, greatly
It is demarcated as 1 class data in the absolute value equal to reference data, while obtaining classification information C；
All 0 class data are combined and obtain 0 class data D0 by (1c), all 1 class data are combined and obtains 1 class number
According to D1, reference data Dr is cut from the absolute value of 1 class data D1 and obtains 1 class data difference D2；
(2) coding step：
(2a) to reference data Dr encode and is obtained reference data code word Cr；
(2b) to 0 class data D0 encode and is obtained 0 class code word data C0；
(2c) to 1 class data difference D2 encode and is obtained 1 class data difference code word C1；
(3) frame encapsulation step：
By frame length L, sign bit Sn, classification information C, reference data code word Cr, 0 class code word data C0,1 class data difference code word C1
Merge, be combined into coded frame Bs, and export to transmission channel or storage medium.
2. the compression method of communication modulation signal according to claim 1, one ginseng of setting wherein described in step (1b)
Data Dr is examined, is set by one of following three kinds of modes：
One be according to data absolute value it is long when distribution character, reference data is arranged to the mathematical expectation of absolute value；
Two is according to current data frame in absolute value distribution character in short-term, if distribution character, will close to being uniformly distributed in short-term
Reference data is set to the intermediate value of current data frame in maximum value, otherwise, reference data is set into current data frame in
The average value of data absolute value；
Three is to be set as reference data to enable to current data frame in smaller and larger than the absolute value quantity equal to it than full
The value of sufficient setting ratio.
3. the compression method of communication modulation signal according to claim 1, wherein the classification information C described in step (1b),
It is made up of L bits, each bit corresponds to an absolute value in order, the classification of corresponding absolute value is represented respectively, that is, is classified as 0 class
The corresponding bit of absolute value of data is set to 0, and the corresponding bit of absolute value for being classified as 1 class data is set to 1.
4. a kind of decompressing method of communication modulation signal, including：
1) frame deblocking step
Coded frame Bs from transmission channel or storage medium is decomposed into frame length L, sign bit Sn, classification information C, reference data
Code word Cr, 0 class code word data C0,1 class data difference code word C1；
2) decoding step
Reconstructed reference data Dr 2a) is obtained to reference data code word Cr decodings；
2b) 0 class code word data C0 decodings are obtained reconstructing 0 class data D0 '；
2c) 1 class data difference code word C1 decodings are obtained reconstructing 1 class data difference D2；
3) data restoration step
Reconstructed reference data Dr 3a) is added to 1 class data difference D2 of reconstruct, obtains reconstructing 1 class data D1；According to classification information C,
0 class data D0 ' of reconstruct and 1 class data D1 of reconstruct are combined according to the order before compression, obtain reconstructing data absolute value
Frame Da '；
Corresponding sign bit Sn 3b) is added on reconstruct data absolute value frame Da ', obtains reconstructing data frame Dx ', and export.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410366597.1A CN104113394B (en) | 2014-07-29 | 2014-07-29 | The compression of communication modulation signal and decompressing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410366597.1A CN104113394B (en) | 2014-07-29 | 2014-07-29 | The compression of communication modulation signal and decompressing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104113394A CN104113394A (en) | 2014-10-22 |
| CN104113394B true CN104113394B (en) | 2017-06-13 |
Family
ID=51710036
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410366597.1A Expired - Fee Related CN104113394B (en) | 2014-07-29 | 2014-07-29 | The compression of communication modulation signal and decompressing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104113394B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109512425A (en) * | 2019-01-09 | 2019-03-26 | 大悦创新（苏州）医疗科技股份有限公司 | Compression, the method and apparatus for decompressing myoelectricity data |
| CN112769820B (en) * | 2021-01-06 | 2022-10-21 | 紫光展锐(重庆)科技有限公司 | Data compression method, device, equipment, storage medium, chip and module equipment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101180886A (en) * | 2005-05-24 | 2008-05-14 | 皇家飞利浦电子股份有限公司 | Compression and decompression using corrections of predicted values |
| CN101609680A (en) * | 2009-06-01 | 2009-12-23 | 华为技术有限公司 | The method of compressed encoding and decoding, encoder and code device |
| CN102055974A (en) * | 2010-10-14 | 2011-05-11 | 华为技术有限公司 | Data compressing and uncompressing method, data compressing and uncompressing device and data compressing and uncompressing system |
-
2014
- 2014-07-29 CN CN201410366597.1A patent/CN104113394B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101180886A (en) * | 2005-05-24 | 2008-05-14 | 皇家飞利浦电子股份有限公司 | Compression and decompression using corrections of predicted values |
| CN101609680A (en) * | 2009-06-01 | 2009-12-23 | 华为技术有限公司 | The method of compressed encoding and decoding, encoder and code device |
| EP2439737A1 (en) * | 2009-06-01 | 2012-04-11 | Huawei Technologies Co., Ltd. | Compression coding and decoding method, coder, decoder and coding device |
| CN102055974A (en) * | 2010-10-14 | 2011-05-11 | 华为技术有限公司 | Data compressing and uncompressing method, data compressing and uncompressing device and data compressing and uncompressing system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104113394A (en) | 2014-10-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20210319286A1 (en) | Joint source channel coding for noisy channels using neural networks | |
| US20210351863A1 (en) | Joint source channel coding based on channel capacity using neural networks | |
| CN101795407B (en) | Method and device for encoding a bit sequence | |
| CN103873877A (en) | Image transmission method and device for remote desktop | |
| EP3065324A1 (en) | Method and device for processing signal sampling-point data | |
| CN1322405A (en) | Device and method for entropy encoding of information words and device and method for decoding entropy-encoded information words | |
| CN102438145A (en) | Image lossless compression method on basis of Huffman code | |
| CN101945286B (en) | Compression coding method, decoding decompression method, device and communication system | |
| CN110995753A (en) | Combined compression method for remote communication message in electricity consumption information acquisition system | |
| CN1622593B (en) | Apparatus and method for processing video for implementing signal to noise ratio scalability | |
| CN104113394B (en) | The compression of communication modulation signal and decompressing method | |
| CN100525262C (en) | Joint coding and decoding device and method for source channel | |
| CN102055974B (en) | Data compressing and uncompressing method, data compressing and uncompressing device and data compressing and uncompressing system | |
| CN103050123B (en) | A kind of method and system of transmitting voice information | |
| CN101657973A (en) | Have and adopt the position precision to carry out the recording medium and the device thereof of the program of Code And Decode | |
| WO2013011355A1 (en) | Method and apparatus for encoding an image | |
| CN111130697B (en) | Method for reducing complexity of communication physical layer transmission system based on automatic encoder | |
| CN105306941A (en) | Video coding method | |
| Jagadeesh et al. | An approach for image compression using adaptive Huffman coding | |
| CN110753241B (en) | Image coding and decoding method and system based on multiple description networks | |
| Langi | Lossless compression performance of a simple counter-based entropy coder | |
| Coward et al. | Robust image communication using bandwidth reducing and expanding mappings | |
| Shahbazi et al. | A novel speech-like symbol design for data transmission through gsm voice channel | |
| CN102377996A (en) | Context-adaptive variable-length coding method and apparatus thereof | |
| Kanawade et al. | Tree structured vector quantization based technique for speech compression |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170613 |