CN104113394A - Communication modulating signal compressing and decompressing method - Google Patents
Communication modulating signal compressing and decompressing method Download PDFInfo
- Publication number
- CN104113394A CN104113394A CN201410366597.1A CN201410366597A CN104113394A CN 104113394 A CN104113394 A CN 104113394A CN 201410366597 A CN201410366597 A CN 201410366597A CN 104113394 A CN104113394 A CN 104113394A
- Authority
- CN
- China
- Prior art keywords
- data
- class
- frame
- absolute value
- code word
- 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
Links
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention discloses a communication modulating signal compressing and decompressing method. The communication modulating signal compressing and decompressing method mainly solves the problems that the existing compressing and decompressing method is not high in communication modulating signal compression ratio and poor in universality. The achievement scheme of the communication modulating signal compressing and decompressing method comprises 1, forming samples of a plurality of communication modulating signals into data frames and calculating data absolute values in the data frames; 2, setting one reference data to be a threshold value and sorting the absolute values into two categories according to the size relative to the reference data and recombining according to category; 3, directly encoding the data category which is smaller than the reference data, calculating the difference between the reference data and the data of the data category which is larger than or equal to the reference data and encoding the difference value; 4, packaging encoding results into frames and transmitting; 5, deblocking receiving frames and decoding and reconstructing reference data obtained from decoding and the two categories of data into data frames. The communication modulating signal compressing and decompressing method solves the problem that the prior art depends on the correlation between adjacent signals, improves the compressing efficiency and is good in universality.
Description
Technical field
The invention belongs to communication technical field, particularly a kind of compression method and decompressing method, compressed encoding and the storage transmission of the modulation signal that can be used for communicating by letter.
Background technology
Growing along with type of traffic and traffic carrying capacity, in communication network, need the data volume of transmitting sharply to increase, thereby channel resource and the memory space of the more costlinesses of needs, complexity and the cost of communication system have greatly been improved, therefore first need signal or data to transmitting to carry out compressed encoding, reduce data volume, and then transmit, improve efficiency of transmission.
Existing Compress softwares method is mainly for voice and video etc. to media signal, and these multi-media signals self have the correlation of height and have good mathematics and physical model, thereby have good compaction coding method.Yet communication modulation signal does not mostly possess good correlation properties, does not have yet and is beneficial to mathematics and the physical model that carries out compressed encoding, the compressed encoding of communication modulation signal has larger challenge, becomes one of key technology of correlative study.Thereby in recent years, in the communications field, moving communicating field especially, the compressed encoding of communication modulation signal has become the important research contents of association area.
Existing compression method is, by subset separative element, one frame initial data of input is resolved into the first and second two subsets; Estimation unit utilizes the first subset data to estimate the second subset data, and the valuation that then the second subset deducts the second subset obtaining obtains grouping error data.The first subset data obtains subset mantissa through a derivative coding unit processing and subset index is given formatting module, and error information obtains error mantissa through another derivative coding unit processing and error extension is also given formatting module; Two above-mentioned derivative coding units are also exported subset derivative and the subset Huffman table that reflects the first subset coded message simultaneously, and the error derivative of reflection error information coded message and error Huffman table, these derivative information have determined to represent the minimum memory space of one group of floating data needs.Header coding unit is shown the subset derivative receiving and subset Huffman table, error derivative and error Huffman and be combined into header from the coding parameter that reflects coding unit encoding setting to give formatting module; Packed data formatting module becomes coded frame data with error extension according to certain format combination by the header of reception, subset mantissa and subset index and error mantissa, forms packed data output.
Existing decompressing method, packed data analysis module resolves into header, subset mantissa and subset index and error mantissa and error extension by the compressed data frames receiving; Header information decoder unit is separated into subset derivative and subset Huffman table, error derivative and error Huffman table by the header of receiving; In two integrated decoding units, one is utilized subset derivative and subset Huffman Biao Jiang subset mantissa and subset index to reconstitute the first subset data, and one is utilized error derivative and error Huffman Biao Jiang error mantissa and error extension to reconstitute error information; The first subset data that estimation unit obtains according to decoding estimates the second subset data, and itself and error information are added, and obtains the second subset data, and the second last subset data and the first subset data obtain reconstruct data by the processing of subset combining unit and export.
Above-mentioned prior art utilizes the correlation between adjacent data to carry out data compression and coding, and this requires will have good continuity and correlation between adjacent data.Yet randomness is stronger between communication modulation signal adjacent signals, and do not possess good correlation or smooth performance in short-term, thereby prior art can not carry out effective compressed encoding to it, cause that compression ratio is low, channel utilization is not high.
Summary of the invention
For the problems referred to above, the object of this invention is to provide a kind of Compress softwares method of the modulation signal of communicating by letter, to reduce having good continuity and correlation requirement between adjacent data, improve compression ratio and code efficiency, and then improve channel utilization.
The technical scheme that realizes the object of the invention is: divide frame to process primary signal, then by the absolute value of minute frame signal according to the reference data of the setting restructuring of classifying, then for difference, classify and carry out different codings.Concrete steps comprise as follows:
Technical scheme of the present invention is achieved in that
Technical scheme one:
The communicate by letter compression method of modulation signal, comprises the steps:
(1) data processing step:
(1a) according to setting frame length L, the sampled data of L communication modulation signal is formed to Frame Dx, extracts the symbol composition sign bit Sn of each data in Frame Dx, and in calculated data frame Dx each data thoroughly deserve absolute value frame Da;
(1b) set a reference data Dr, the absolute value that is less than reference data in absolute value frame Da is demarcated as to 0 class data, the absolute value that is more than or equal to reference data is demarcated as 1 class data, obtains classified information C simultaneously;
(1c) all 0 class data are combined and obtained 0 class data D0, all 1 class data are combined and obtained 1 class data D1, from the absolute value of 1 class data D1, cut reference data Dr and obtain 1 class data difference D2;
(2) coding step:
(2a) reference data Dr is encoded and obtains reference data code word Cr;
(2b) 0 class data D0 is encoded and obtains 0 class code word data C0;
(2c) 1 class data difference D2 is encoded and obtains 1 class data difference code word C1.
(3) frame encapsulation step:
By frame length L, sign bit Sn, classified information C, reference data code word Cr, 0 class code word data C0,1 class data difference code word C1 merge, and are combined into coded frame Bs, and output to transmission channel or storage medium.
As preferably, described reference data Dr of setting, sets by one of following three kinds of modes:
The one, distribution character when long according to data absolute value, is arranged to the mathematical expectation of absolute value with reference to data;
The 2nd, according to the distribution character in short-term of absolute value in current data frame, if distribution character approaches and is uniformly distributed in short-term, with reference to data, be set to the intermediate value of maximum value in current data frame, otherwise, with reference to data, be set to the mean value of current data intraframe data absolute value;
The 3rd, with reference to data setting for the absolute value quantity that can make to be less than and to be more than or equal in current data frame it is than the value that meets preset proportion.
As preferably, described classified information C, is comprised of L bit, each bit is a corresponding absolute value in order, represent respectively the classification of corresponding absolute value, bit corresponding to absolute value that is classified as 0 class data is set to 0, bit corresponding to absolute value that is classified as 1 class data is set to 1.
Technical scheme two:
The communicate by letter decompressing method of modulation signal, comprising:
1) frame deblocking step:
Coded frame Bs from transmission channel or storage medium is decomposed into frame length L, sign bit Sn, classified information C, reference data code word Cr, 0 class code word data C0,1 class data difference code word C1;
2) decoding step:
2a), to reference data code word Cr decoding, obtain reconstructed reference data Dr;
2b), to 0 class code word data C0 decoding, obtain reconstruct 0 class data D0 ';
2c), to 1 class data difference code word C1 decoding, obtain reconstruct 1 class data difference D2.
3) data recovering step:
3a) reconstructed reference data Dr is added to reconstruct 1 class data difference D2, obtains reconstruct 1 class data D1; According to classified information C, reconstruct 0 class data D0 ' and reconstruct 1 class data D1 are combined according to the order before compression, obtain reconstruct data absolute value frame Da ';
3b) on reconstruct data absolute value frame Da ', add corresponding sign bit Sn, obtain reconstruct data frame Dx ', and output.
Tool of the present invention has the following advantages:
The feature of communication modulation signal is that signal randomness is stronger, and between adjacent signal, correlation is poor but also often occur the situation of sign mutation.The condition that prior art can be carried out effectively compression to signal is that the compressed signal of requirement has in short-term and steadily and between adjacent signal has stronger correlation, and communication modulation signal does not have these characteristics, so existing compress technique is for the compression of the modulation signal of communicating by letter, compression ratio is very low.
Compression method disclosed in this invention, that several communication modulation signal sampled values are formed to Frame, Frame absolute value is divided into two class data by a reference data, then the two class data absolute value categories that originally interweave is mutually reconfigured respectively together; So just the close absolute value of amplitude is combined respectively, can be made full use of Frame absolute amplitude segmentation distribution character, simultaneously also artificial increase the correlation between data in two class data; Just because of this, compression method disclosed in this invention is no longer dependent on the correlation between signal adjacent signal to be compressed, thereby can effectively improve compression ratio and code efficiency, and then is conducive to improve channel transport efficiency and storage efficiency.Also make compression method disclosed in this invention there is good versatility simultaneously.
Accompanying drawing explanation
Compression process figure in Fig. 1 the present invention;
Compression sub-process figure in Fig. 2 the present invention;
Decompress(ion) flow chart in Fig. 3 the present invention;
Initial data frame schematic diagram in Fig. 4 the present invention;
Data format schematic diagram in Fig. 5 the present invention;
Absolute value frame schematic diagram in Fig. 6 the present invention;
Classifying data frames schematic diagram in Fig. 7 the present invention.
Embodiment
Below in conjunction with accompanying drawing, the present invention is described in further detail.
With reference to Fig. 1, specific embodiment of the invention step is as follows:
In 3G/4G mobile communication system, in order to reduce base station cost, adopt distributed base station and data remote technology, communication data management control section with need to be arranged on radio frequency part more from far-off regions and separate, centre connects to come transport communication modulation signal with optical fiber.Compress softwares method disclosed in this invention just can be used for the communication modulation signal of distributed base station Optical Fiber Transmission to carry out Compress softwares, to improve Optical Fiber Transmission efficiency, thus the communications throughput rate of raising distributed base station.
Step 1, receives the initial data frame Dx that the sampled data by L communication modulation signal forms, the symbol S of each data in extraction Frame, and combined and obtain sign bit Sn.
As shown in Figure 4, initial data frame Dx is comprised of the sampled data of L communication modulation signal, and L is greater than 0 integer, and described sampled data includes, but are not limited to two kinds of data below: time domain data, frequency domain data;
As shown in Figure 5, the sampled data of each communication modulation signal is expressed by a complement of two's two's complement data.Complement of two's two's complement data are comprised of symbol S, sign extended Se and valid data D, wherein 1 bit for symbol S, m bit, valid data D n bit for sign extended Se, complement of two's two's complement data bit wide W=1+m+n bit; Conventionally the integral multiple that W is 8;
In Frame as shown in Figure 4, L data symbol S forms sign bit Sn.
Step 2, calculates the absolute value of L data in initial data frame Dx, and combines and obtain absolute value frame Da.
Referring to Fig. 6, in absolute value frame Da, each absolute value is comprised of Z and D two parts, and wherein Z represents the bit forming by 0, and this part does not carry data message, and D represents effective bit, and this part is useful data.
Step 3, arranges reference data Dr.
Described reference data Dr, it be set with several different methods, below provide three kinds but be not limited to these three kinds:
The one, distribution character when long according to data absolute value, is arranged to the mathematical expectation of absolute value with reference to data;
The 2nd, according to the distribution character in short-term of absolute value in current data frame, if distribution character approaches and is uniformly distributed in short-term, with reference to data, be set to the intermediate value of maximum value in current data frame, otherwise, with reference to data, be set to the mean value of current data intraframe data absolute value;
The 3rd, with reference to data setting for the quantity of absolute value that can make to be less than and to be more than or equal in current data frame it is than the value that meets preset proportion.
This example adopts second method.
Step 4, usings reference data Dr as threshold value, and all absolute values in absolute value frame Da are divided into two classes.
Absolute value in absolute value frame Da and reference data Dr are compared, if the absolute value in absolute value frame Da is less than Dr, be just demarcated as 0 class data, otherwise be demarcated as 1 class data, obtain classified information C, as shown in Figure 6 simultaneously.
Described classified information C, it is comprised of L bit, and each bit is a corresponding absolute value in order, represent respectively the classification of corresponding absolute value, bit corresponding to absolute value that is classified as 0 class data is set to 0, and bit corresponding to absolute value that is classified as 1 class data is set to 1.
Step 5, grouped data restructuring.
The absolute value that is demarcated as 0 class data is combined and formed 0 class data D0;
The absolute value that is demarcated as 1 class data is combined and formed 1 class data D1, then from the absolute value of 1 class data D1, cut reference data Dr and obtain 1 class data difference D2, as shown in Figure 7.
Wherein the R in 1 class data difference D2 represents the difference of each absolute value and reference data Dr.
Step 6, coding step.
With reference to Fig. 2, being implemented as follows of this step:
(6a) reference data Dr is encoded, obtain reference data code word Cr
The coding of reference data Dr, adopts undistorted coding method, as entropy coding methods such as Huffman coding or arithmetic codings, or adopts the dictionary encoding methods such as LZW, also can adopt other undistorted coding method;
(6b) 0 class data D0 is encoded, obtain 0 class code word data C0
0 class data D0 is encoded and will consider two kinds of situations of practical application, and a kind of situation is that whole Compress softwares process does not allow to produce distortion, and another kind of situation is that whole Compress softwares process allows to produce certain distortion;
For the situation that does not allow to produce distortion, the coding of 0 class data D0 adopts undistorted coding method, dictionary encoding methods such as Huffman coding or arithmetic coding entropy coding method, LZW;
For the situation that allows to produce distortion, the coding of 0 class data D0 just adopts and has distortion coding method, such as uniform quantization coding method, the coding method of Lloyd-Max non-uniform quantizing, vector quantization coding method etc.;
(6c) 1 class data difference D2 is encoded, obtain 1 class data difference code word C1
1 class data difference D2 adopts undistorted coding method, as entropy coding methods such as Huffman coding or arithmetic codings, or adopts the dictionary encoding methods such as LZW, also can adopt other undistorted coding method.
Step 7, frame encapsulation.
By frame length L, sign bit Sn, classified information C, reference data code word Cr, 0 class code word data C0,1 class data difference code word C1 merge, and are combined into coded frame Bs, and output to transmission channel or storage medium.
With reference to Fig. 3, decompress(ion) step of the present invention is as follows:
Step 1, frame deblocking.
Coded frame Bs from transmission channel or storage medium is decomposed into frame length L, sign bit Sn, classified information C, reference data code word Cr, 0 class code word data C0,1 class data difference code word C1;
Step 2, to reference data code word Cr, decoding obtains reconstructed reference data Dr:
The decoding of this step is according to carrying out with step in compression process (6a) the corresponding method of encoding.
Step 3, obtains reconstruct 0 class data D0 ' to 0 class code word data C0 decoding:
The decoding of this step is according to carrying out with step in compression process (6b) the corresponding method of encoding.
Step 4, obtains reconstruct 1 class data difference D2 to 1 class data difference code word C1 decoding:
The decoding of this step is according to carrying out with step in compression process (6c) the corresponding method of encoding.
Step 5, data are recovered.
Reconstructed reference data Dr is added to reconstruct 1 class data difference D2, obtains reconstruct 1 class data D1; According to classified information C, reconstruct 0 class data D0 ' and reconstruct 1 class data D1 are combined according to the order before compression, obtain reconstruct absolute value frame Da '.
Step 6 adds corresponding sign bit Sn on reconstruct absolute value frame Da ', obtains reconstruct data frame Dx ', and output.
In the Compress softwares method of above-mentioned communication modulation signal, according to the difference of practical application, support Lossless Compression and have two kinds of application of distortion compression.
Disclosed in this invention is a kind of Compress softwares method of the modulation signal of communicating by letter, and not only can carry out effective compressed encoding to communication modulation signal, equally also can effectively compress the not strong signal of correlation and nonstationary random signal.
More than describing is only example of the present invention, does not form any limitation of the invention.Obviously for those skilled in the art; after having understood content of the present invention and principle; all may be in the situation that not deviating from the principle of the invention, structure; carry out various corrections and change in form and details, but these corrections based on inventive concept and changing still within claim protection range of the present invention.
Claims (4)
1. the communicate by letter compression method of modulation signal, comprising:
(1) data processing step:
(1a) according to setting frame length L, the sampled data of L communication modulation signal is formed to Frame Dx, extracts the symbol composition sign bit Sn of each data in Frame Dx, and in calculated data frame Dx each data thoroughly deserve absolute value frame Da;
(1b) set a reference data Dr, the absolute value that is less than reference data in absolute value frame Da is demarcated as to 0 class data, the absolute value that is more than or equal to reference data is demarcated as 1 class data, obtains classified information C simultaneously;
(1c) all 0 class data are combined and obtained 0 class data D0, all 1 class data are combined and obtained 1 class data D1, from the absolute value of 1 class data D1, cut reference data Dr and obtain 1 class data difference D2;
(2) coding step:
(2a) reference data Dr is encoded and obtains reference data code word Cr;
(2b) 0 class data D0 is encoded and obtains 0 class code word data C0;
(2c) 1 class data difference D2 is encoded and obtains 1 class data difference code word C1.
(3) frame encapsulation step:
By frame length L, sign bit Sn, classified information C, reference data code word Cr, 0 class code word data C0,1 class data difference code word C1 merge, and are combined into coded frame Bs, and output to transmission channel or storage medium.
2. the compression method of communication modulation signal according to claim 1, described reference data Dr of setting of step (1b) wherein, sets by one of following three kinds of modes:
The one, distribution character when long according to data absolute value, is arranged to the mathematical expectation of absolute value with reference to data;
The 2nd, according to the distribution character in short-term of absolute value in current data frame, if distribution character approaches and is uniformly distributed in short-term, with reference to data, be set to the intermediate value of maximum value in current data frame, otherwise, with reference to data, be set to the mean value of current data intraframe data absolute value;
The 3rd, with reference to data setting for the absolute value quantity that can make to be less than and to be more than or equal in current data frame it is than the value that meets preset proportion.
3. the compression method of communication modulation signal according to claim 1, the described classified information C of step (1b) wherein, by L bit, formed, each bit is a corresponding absolute value in order, represent respectively the classification of corresponding absolute value, bit corresponding to absolute value that is classified as 0 class data is set to 0, and bit corresponding to absolute value that is classified as 1 class data is set to 1.
4. the communicate by letter decompressing method of modulation signal, comprising:
1) frame deblocking step
Coded frame Bs from transmission channel or storage medium is decomposed into frame length L, sign bit Sn, classified information C, reference data code word Cr, 0 class code word data C0,1 class data difference code word C1;
2) decoding step
2a) to reference data code word Cr, decoding obtains reconstructed reference data Dr;
2b) 0 class code word data C0 decoding is obtained to reconstruct 0 class data D0 ';
2c) 1 class data difference code word C1 decoding is obtained to reconstruct 1 class data difference D2.
3) data recovering step
3a) reconstructed reference data Dr is added to reconstruct 1 class data difference D2, obtains reconstruct 1 class data D1; According to classified information C, reconstruct 0 class data D0 ' and reconstruct 1 class data D1 are combined according to the order before compression, obtain reconstruct data absolute value frame Da ';
3b) on reconstruct data absolute value frame Da ', add corresponding sign bit Sn, obtain reconstruct data frame Dx ', and output.
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 true CN104113394A (en) | 2014-10-22 |
| CN104113394B CN104113394B (en) | 2017-06-13 |
Family
ID=51710036
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410366597.1A Active 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) |
Cited By (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 |
| CN112769820A (en) * | 2021-01-06 | 2021-05-07 | 紫光展锐(重庆)科技有限公司 | 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 active Active
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 |
Cited By (3)
| 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 |
| CN112769820A (en) * | 2021-01-06 | 2021-05-07 | 紫光展锐(重庆)科技有限公司 | Data compression method, device, equipment, storage medium, chip and module equipment |
| CN112769820B (en) * | 2021-01-06 | 2022-10-21 | 紫光展锐(重庆)科技有限公司 | Data compression method, device, equipment, storage medium, chip and module equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104113394B (en) | 2017-06-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP5905099B2 (en) | Hierarchical entropy encoding and decoding | |
| CN101932002B (en) | Method for realizing matching between uplink transmission rate and downlink transmission rate as well as BBU and RRU | |
| CN103873877A (en) | Image transmission method and device for remote desktop | |
| EP3065324A1 (en) | Method and device for processing signal sampling-point data | |
| CN101945286B (en) | Compression coding method, decoding decompression method, device and communication system | |
| US11601135B2 (en) | Internet of things data compression system and method | |
| CN106776663B (en) | Audio file compression method and device | |
| CN101080008B (en) | A multi-description coding and decoding method based on alternate function system | |
| CN105100801A (en) | Large compression ratio data compression method based on big data | |
| CA2289858C (en) | Lossless image compression with tree coding | |
| CN102982807B (en) | Method and system for multi-stage vector quantization of speech signal LPC coefficients | |
| CN104113394A (en) | Communication modulating signal compressing and decompressing method | |
| CN111479286B (en) | Data processing method for reducing communication flow of edge computing system | |
| CN102055974B (en) | Data compressing and uncompressing method, data compressing and uncompressing device and data compressing and uncompressing system | |
| CN112866196A (en) | Short wave digital signal interpretation and reduction method | |
| CN103746701A (en) | Rapid encoding option selecting method applied to Rice lossless data compression | |
| WO2023011472A1 (en) | Method for feeding back channel state information, method for receiving channel state information, and terminal, base station, and computer-readable storage medium | |
| WO2022183335A1 (en) | Image encoding and decoding methods, encoder, decoder, and storage medium | |
| CN116863949A (en) | Communication receiving method and device thereof | |
| CN108848385B (en) | Block data compression method suitable for micro-nano satellite | |
| CN102377996B (en) | Context-adaptive variable-length coding method and apparatus thereof | |
| CN105578183A (en) | Compression sensing video encoding and decoding method based on Gaussian mixture model (GMM) | |
| CN101634702A (en) | Fraction bit rate BAQ method based on Lloyd-Max quantizer | |
| CN117060930B (en) | Data intelligent communication system for docking station | |
| CN110753241B (en) | Image coding and decoding method and system based on multiple description networks |
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 |