CN103312336A - Data compression method and device - Google Patents
Data compression method and device Download PDFInfo
- Publication number
- CN103312336A CN103312336A CN2013102703952A CN201310270395A CN103312336A CN 103312336 A CN103312336 A CN 103312336A CN 2013102703952 A CN2013102703952 A CN 2013102703952A CN 201310270395 A CN201310270395 A CN 201310270395A CN 103312336 A CN103312336 A CN 103312336A
- Authority
- CN
- China
- Prior art keywords
- data
- compressed
- bit wide
- real part
- numerical value
- 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.)
- Pending
Links
Images
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention relates to the technical field of data processing, in particular to data compression method and device, and aims to solve the problem that processing by the existing data compression method is complex. The data compression method includes: grouping data to be compressed according to a compression ratio k and input bit width m of the data to be compressed; for each group of data to be compressed and according to the value of a real part and the value of an imaginary part of each data in the group of data to be compressed, compressing the group of data to be compressed. The letter m is a positive integer, and the letter k is larger than 1. According to the method, for each group of data to be compressed and according to the value of the real part and the value of the imaginary part of each data in the group of data to be compressed, the group of data to be compressed is compressed. Therefore, application of complex processes such as DCT transform in the data compression process of the existing method is avoided.
Description
Technical field
The present invention relates to technical field of data processing, relate in particular to a kind of method and device of data compression.
Background technology
The transmission of data in the communication system (such as: text, image, voice data etc.), general duplicate message or the redundant information that exists to a certain degree.If at transmitting terminal data are compressed processing by data compression technique, can reduce the redundancy of data message, can reduce like this data volume of actual transmissions, effectively improve the communication efficiency of communication system.
Along with the development of the communication technology, broadband signal becomes the main flow situation of present communication industry data transmission technology development, and its requirement has higher speed at transmission link.Adopt data compression technique, can under equal hardware cost, greatly improve transmission capacity, increase number of users; Perhaps under the prerequisite of same subscriber number, reduce the quantity of the data processing unit of data transmission link or equipment, therefore, in communication system, adopt data compression technique can improve the valid data transmission bandwidth, or providing under the prerequisite of identical valid data transmission bandwidth the cost of reduction equipment and transmission line.
Existing data compression method has multiple, such as: pulse code modulation (Pulse Code Modulation, PCM), predictive coding, transition coding etc.Be US2007147495A1, be that June 28, denomination of invention in 2007 are in open day at publication number: in the american documentation literature of " Multilevel Data Compression Using a Single Compression Engine ", a kind of multi-layer data compression method that adopts single compression equipment is disclosed, in the method, single compressor reducer sends the first and second discrete cosine transforms (Discrete cosine transform, DCT) code signal, a DCT code signal represents in a plurality of DCT coefficients each with maximum t coefficient bit.The 2nd DCT code signal uses maximum u coefficient bit, and wherein u represents each in a plurality of DCT coefficients less than t.Owing to need to going discrete cosine transform, realize complicated.
Summary of the invention
The invention provides a kind of method and apparatus of data compression, process complicated problem in order to solve existing data compression method.
The method of a kind of data compression that the embodiment of the invention provides comprises:
Input bit wide m according to compression ratio k and data to be compressed treats packed data and divides into groups, and wherein m is positive integer, k〉1;
Organize data to be compressed for each, organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, this is organized data to be compressed compress processing.
The device of a kind of data compression that the embodiment of the invention provides comprises:
Grouping module is used for the input bit wide m according to compression ratio k and data to be compressed, treats packed data and divides into groups, and wherein m is positive integer, k〉1;
The compression processing module is used for organizing data to be compressed for each, organizes the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, this is organized data to be compressed compress processing.
The embodiment of the invention provides a kind of method and apparatus of data compression, in the method, owing to organizing data to be compressed for each, organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, this is organized data to be compressed compress processing, avoided existing method in data compression process, to adopt such as complicated processing such as dct transforms.
Description of drawings
The schematic diagram of the data compression method process that Fig. 1 provides for the embodiment of the invention;
Fig. 2 is the schematic diagram that packed data compresses the procedure of processing for the treatment of of the embodiment of the invention two;
Fig. 3 is the schematic diagram of procedure of the data compression of the embodiment of the invention three;
Fig. 4 is the data memory format schematic diagram after the compression of the embodiment of the invention three;
The structural representation of the data compression device that Fig. 5 provides for the embodiment of the invention.
Embodiment
The embodiment of the invention provides a kind of method and apparatus of data compression, in the method, owing to organizing data to be compressed for each, organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, this is organized data to be compressed compress processing, avoided existing method in data compression process, to adopt such as complicated processing such as dct transforms.
Embodiments of the invention are applicable to various data transmission systems, can effectively realize data compression process.Be specially adapted to the transfer of data in Long Term Evolution (Long Term Evolution, the LTE) system.
The schematic diagram of the data compression method process that Fig. 1 provides for the embodiment of the invention, as shown in Figure 1, the method may further comprise the steps:
S101: the input bit wide m according to compression ratio k and data to be compressed, treat packed data and divide into groups, wherein m is positive integer, k〉1;
S102: organize data to be compressed for each, organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, this is organized data to be compressed compress processing.
In embodiments of the present invention, data to be compressed are plural number, and such as R+j*I, wherein, R is real part, and I is imaginary part, and R and I represent with binary form, and wherein, highest order is sign bit.The input bit wide of data to be compressed is the real part of binary system data to be compressed and the maximum bit wide of imaginary part, and comprising 1 bit sign position, the filling " 0 " in the middle of sign bit and data bit of not enough m position is so that the data bit width after filling is m.Input bit wide m=12 such as data to be compressed, one of them data to be compressed is 5-12j, then the real part of these data to be compressed is expressed as 000000000101, imaginary part is expressed as 100000001100, and wherein highest order is sign bit, " 0 " expression positive number, " 1 " expression negative, during specific implementation, also can " 1 " represent positive number, " 0 " expression negative.
Compression ratio k can decide according to the requirement that compression is processed, such as: 2:1,3:2 etc.Highest order still is sign bit in the data after the compression, is the data bit part of data after the compression subsequently, and afterbody is overhead digit, such as displacement information etc., in order to after decompressor end receives data after the compression, can correctly decompress.Suppose the input bit wide m=12 of data to be compressed, compression ratio k=3:2, then the data bit width after the compression is 8, and if overhead digit is 2, then the data highest order after the compression is sign bit, and subsequently 5 are the data bit after the compression, and minimum 2 is overhead digit.
Provide a kind of input bit wide m according to compression ratio k and data to be compressed among the embodiment one, treated the method that packed data divides into groups.Among the embodiment one, the input bit wide m according to compression ratio k and data to be compressed determines block length Q, and every Q data in the data to be compressed are divided into one group, and grouping is processed.Because all groupings all have identical length Q, the Q value can be informed decompressor end (informing mode includes but not limited to the signaling transmission of compression end and decompressor end) in advance before the packed data transmission, when transmitted data compressing, need not to have transmitted packet-length information like this.
Other group technologies can comprise: according to input bit wide m and other conditions (such as the statistical property of data to be compressed) of compression ratio k and data to be compressed, data to be compressed are divided into groups according to the unfixed mode of block length.Such as, can be according to the amplitude distribution characteristic of data to be compressed, the data that a continuous a1 amplitude are higher than default amplitude thresholds are divided into one group, the data that a continuous a2 amplitude are lower than default amplitude thresholds are divided into another group, continuous a3 amplitude fluctuations larger data is divided into one or more groups, etc., wherein a1, a2, a3 are positive integer.Actual grouping is not limited to this, and above only is example.Data in each grouping are compressed respectively, and increased packet-length information in these group data after compression or initial, the termination flag information of dividing into groups etc., so that decompressor end is received energy correct decompressed after the data after the compression.
The group technology of the fixed packet length among the embodiment one is compared with the unfixed method of block length, can reduce accessing cost for data, improves data transmission efficiency.
Embodiment two has provided two kinds and has organized data to be compressed for each, organizes the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, and this is organized the method that data to be compressed are compressed processing.Wherein, organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, determined that one is organized the relevant variable of data to be compressed with this, such as the maximum data_max of real part absolute value and imaginary part absolute value
iOr the maximum power_max of the quadratic sum of real part and imaginary part
iAccording to this variable of determining this is organized data to be compressed and compress processing, avoided being US2007147495A1, being that June 28, denomination of invention in 2007 are in open day such as the publication number of prior art: in the american documentation literature of " Multilevel Data Compression Using a Single Compression Engine ", need to treat the data processing that packed data carries out the complexity of dct transform.
Particularly, among the step S101, the input bit wide m according to compression ratio k and data to be compressed treats packed data and divides into groups, and comprising:
Input bit wide m according to compression ratio k and data to be compressed determines block length Q;
According to block length Q, treat packed data and divide into groups, wherein Q is positive integer.
Here, block length Q represents that each organizes the number of data to be compressed in the data to be compressed.
Particularly, the input bit wide m according to compression ratio k and data to be compressed determines block length Q, comprising:
Input bit wide m and displacement information bit wide n according to compression ratio k, data to be compressed determine block length Q, wherein
N is integer.
Here, symbol
Expression rounds downwards.Store respectively the data bits of displacement information in the real part of the data after displacement information bit wide n represents to compress and the imaginary part, in other words, have the n position to be used for storing displacement information in the real part of the data after the compression and the imaginary part.
During specific implementation, can set displacement information bit wide and be fixing constant, namely only determine block length Q according to the input bit wide m of compression ratio k, data to be compressed.The information bit wide that can be shifted is set to 1, to reduce the overhead data amount, under predetermined compression ratio, the data after more figure place is used for store compressed is arranged like this, has reduced the data compression loss.
Alternatively, also can determine displacement information bit wide according to the data bit width after the compression, such as: n get with
Immediate integer, namely right
Round up or down, wherein, c is default constant, 0＜c＜1, and the displacement information bit wide in the data of the implication of c after for compression accounts for the ratio of the data bit width after the compression.
Particularly, can determine block length Q according to formula 1:
Particularly, in step S102, organize data to be compressed for each, organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, this is organized data to be compressed compress processing, comprising:
Organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, this is organized data to be compressed be shifted;
Data after the displacement are carried out cut position.
In addition, also can organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, without shifting processing, directly carry out cut position and realize data compression.In the method, the bit wide of determining the cut position window according to input bit wide m and the compression ratio k of data to be compressed is 15 such as the input bit wide of data to be compressed, and according to the requirement of compression ratio k, the data bit width after the compression is 11, and then the width of cut position window is 11.
Then, determine the position of cut position window according to this numerical value of organizing the numerical value of real part of each data of data to be compressed and imaginary part, such as determining that this organizes the power statistic characteristic of data to be compressed according to this numerical value of organizing the numerical value of real part of each data of data to be compressed and imaginary part, the lowest power thresholding is set, gives up the data bit under the lowest power thresholding.The method of determining the cut position window position is not limited to this, only is example here.
At last, for this real part and imaginary part of organizing each data to be compressed of data to be compressed, give up respectively this cut position data bit outside window, the data bit after the compression that remaining is exactly.Particularly, can by this cut position window that slides, carry out the cut position processing to real part and the imaginary part of each data to be compressed.Can be a kind of of low 4, high 1 and low 3, high 2 and low 2, high 3 and low 1, high 4 etc. such as: the data bit of intercepting.
Particularly, organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, this organized data to be compressed be shifted, include but not limited to following two kinds of methods:
Method one, organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, determine that this organizes the real part absolute value of data to be compressed and the maximum data_max of imaginary part absolute value
i
According to data_max
iDetermine that this organizes the displacement bit wide w of data to be compressed
i, wherein, i=1..N, N are the grouping number of data to be compressed, N is greater than 1, w
iFor more than or equal to 0 integer;
Organize the displacement bit wide w of data to be compressed according to this
i, this real part and imaginary part of organizing each data of data to be compressed is shifted.
Wherein, can organize the displacement bit wide w of data to be compressed according to formula 2 definite these
i:
Method two, organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, determine the maximum power_max of the quadratic sum of real part that this organizes data to be compressed and imaginary part
i
According to power_max
iDetermine that this organizes the displacement bit wide w of data to be compressed
i, wherein, i=1..N, N are the grouping number of data to be compressed, N is greater than 1, w
iFor more than or equal to 0 integer;
Organize the displacement bit wide w of data to be compressed according to this
i, this real part and imaginary part of organizing each data of data to be compressed is shifted.
Wherein, can organize the displacement bit wide w of data to be compressed according to formula 3 definite these
i:
Determine that according to formula 2 or 3 each organizes the displacement bit wide w of data to be compressed
iThe visible embodiment two of method.
Particularly, organize the displacement bit wide w of data to be compressed according to this
i, this real part and imaginary part of organizing each data of data to be compressed is shifted, comprising:
This is organized in the real part of each data of data to be compressed and the imaginary part w that moves to left of the data bit outside the divided-by symbol position
iPosition, and the real part after displacement and imaginary data afterbody benefit w
iIndividual 0.
Particularly, the data to be compressed after each group displacement are carried out cut position, comprising:
Input bit wide m according to compression ratio k and data to be compressed determines cut position bit wide bit_cut;
Intercept the real part of the data to be compressed after each group is shifted and the high m-bit_cut position of imaginary part, wherein, the highest order of the data of intercepting is sign bit, and bit_cut is positive integer.
Wherein, cut position bit wide bit_cut refers to the figure place of the data bit that cut out.According to the input bit wide m of compression k and data to be compressed, the data bit width after can determining to compress not should greater than
Could satisfy the requirement of compression ratio k.Further, determine that the data bit width after the compression equals
If do not have overhead digit in the data after the compression, then the cut position bit wide
If have x position overhead digit in the data after the compression, then the cut position bit wide
Particularly, the input bit wide m according to compression ratio k and data to be compressed determines cut position bit wide bit_cut, comprising:
Input bit wide m and displacement information bit wide n according to compression ratio k, data to be compressed determine cut position bit wide bit_cut, wherein
N is integer.
Particularly, determine cut position bit wide bit_cut according to formula 4:
The prerequisite that formula 4 is set up is except the displacement information bit, not have other overhead digits in the data after the compression.
Above, the data compression method that the embodiment of the invention provides has been described.Compress processing if adopt the method for the rear cut position of displacement to treat packed data, then the data highest order after the compression is 1 bit sign position, is the data bit behind the cut position subsequently, and afterbody is overhead digit.
Compression end sends to decompressor end and decompresses after finishing the compression for the treatment of packed data.Be fixed as Q for block length, the overhead digit of afterbody only is the situation of displacement information bit, before the data of compression end after sending compression, can by the mode such as signaling or by prior agreement with data bit width m to be compressed, compression ratio k, displacement information bit wide n, compression after the data storage form, determine block length method, determine that the method etc. of displacement bit wide informs decompressor end.Decompressor end is determined before block length Q(or the data of compression end after sending compression according to m, k, directly block length Q is issued decompressor end, decompressor end need not to know the method for determining Q according to m and k like this, the Q that directly sends according to compression end processes), after the data after receiving compression, according to block length Q, displacement information bit wide n, known storage format, obtain the displacement information of the data after this group is compressed, determine the displacement bit wide w of the data after this group is compressed according to the displacement information of obtaining
i, to the real part of data after each compression and the data bit data_comp outside the imaginary part divided-by symbol position according to formula
Process data bit (the not comprising sign bit) data_decomp after obtaining decompressing, then form data after the decompression together with sign bit.
The principle of other decompression method and said method is similar, and decompressor end decompresses after the data after receiving compression according to the storage format of arranging or being apprised of in advance, compression parameters information etc.Concrete grammar repeats no more here.
Below, a kind ofly treat the method that packed data divides into groups by what the embodiment one explanation embodiment of the invention provided.
Embodiment one,
If compression ratio is k, the input bit wide of data to be compressed is m, and displacement information bit wide is n, and then the maximum bit wide of the permission of the data after the compression is
Wherein 1 is sign bit, and n should satisfy:
N is integer (alternatively, for reducing the data compression loss, can make n=1, namely adopt 1 storage displacement information).
Outside data divided-by symbol position after the compression, the displacement information bit, data bit occupies
Position, then cut position bit wide (data bits that namely should clip)
Correspondingly, displacement situation is
Plant (comprising non-wiping situation).Adopt displacement message identification displacement situation, because displacement information bit wide is n, the real part and the imaginary part that are every group of each data in the data after the compression have respectively the n position to be used for storing displacement information, then can determine when block length Q satisfies formula 5, can satisfy the memory requirement of displacement information, not waste again data resource:
Such as, m=12, k=3:2, n=1 according to formula 5, can determine block length Q=2; For another example: m=16, k=16:9, n=1 according to formula 5, can determine block length Q=2.
Below, treat a kind of method that packed data compresses processing by the embodiment two explanation embodiment of the invention.
Embodiment two,
Fig. 2 is the schematic diagram that packed data compresses the procedure of processing for the treatment of of the embodiment of the invention two.As shown in Figure 2, the method comprises the steps:
S201: organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, determine that this organizes the displacement bit wide w of data to be compressed
i
S202: will organize in the real part of each data of data to be compressed and the imaginary part w that moves to left of the data bit outside the divided-by symbol position
iThe position, and the real part after displacement and imaginary data afterbody are mended respectively w
iIndividual 0;
S203: input bit wide m and displacement information bit wide n according to compression ratio k, data to be compressed, determine cut position bit wide bit_cut, wherein
N is integer, and bit_cut is positive integer;
S204: intercept the real part of the data to be compressed after each group is shifted and the high m-bit_cut position of imaginary part.
In step S201, can adopt definite this of one of following method to organize the displacement bit wide w of data to be compressed
i:
Method 1, organize the real part absolute value of data to be compressed and the maximum data_max of imaginary part absolute value according to this
iDetermine that this organizes the displacement bit wide w of data to be compressed
i
Method 2, organize the maximum power_max of the quadratic sum of the real part of data to be compressed and imaginary part according to this
iDetermine that this organizes the displacement bit wide w of data to be compressed
i
When employing method 1, can determine w according to formula 6
i:
When employing method 2, can determine w according to formula 7
i:
In step S203, can determine cut position bit wide bit_cut according to formula 8:
Below, with reference to figure 3 and Fig. 4, the method for a kind of data compression that the embodiment of the invention provide is described by embodiment three.
Embodiment three,
In embodiment three, the input bit wide m=12 of data to be compressed, compression ratio k=3:2, displacement information bit wide n=1, the group technology of employing regular length is organized the real part absolute value of data to be compressed and the maximum data_max of imaginary part absolute value according to each
iThis is organized the be shifted compression of rear cut position of data to be compressed processes.
Fig. 3 is the schematic diagram of procedure of the data compression of embodiment three.As shown in Figure 3, the method for the data compression among the embodiment three comprises the steps:
S301: according to formula 1, determine block length Q=2, treat packed data and divide into groups, comprise two data to be compressed in every group;
Such as, for current group of data to be compressed, comprise two data data1 and data2, the real part of real (data1) expression data1, the imaginary part of the real part of real (data2) expression data2, imag (data1) expression data1, the imaginary part of imag (data2) expression data2.
S302: the maximum of determining the absolute value of real (data1), real (data2), imag (data1), imag (data2) four numbers is data_max
i, according to data_max
iNumerical value determine displacement bit wide w
i, and with the data bit except sign bit of real (data1), real (data2), imag (data1), imag (data2) the four numbers w that moves to left respectively
iThe position;
S303: according to formula 4, determine cut position bit wide bit_cut=5, real (data1), real (data2) among the intercepting step S302 after the displacement, imag (data1), imag (data2) four numbers comprise the high 7 of sign bit, be designated as data_comp.
S304: the data bit back behind cut position adds the superior displacement information bit, forms the data after compressing.
In the S302 step, if data_max
iRemoving the outer data bit highest order of sign bit is 1, namely situation a) 1 * * * * * * * * * *, the bit wide that then is shifted w
i=0, be not shifted;
If data_max data highest order is non-1, there are 5 kinds of situations
b)01×××××××××c)001××××××××
d)0001××××××××e00001××××××
f)00000××××××
For above 5 kinds of situations, displacement bit wide w
iBe respectively 1,2,3,4,5, namely respectively to data real (data1), real (data2), imag (data1), imag (data2) except the data bit of the sign bit 1-5 position that moves to left.
In the S304 step because there are the 6 kinds of situations in 0-5 position in the displacement bit wide, can represent with 3 bit data, be placed on the data behind the cut position after, its storage format is as shown in Figure 4.
In embodiment three, data after decompressor end is compressed by the winding receipts, read real part and the imaginary part of the data after the compression by the storage format among Fig. 4 of agreement, and displacement information, to the recovery that is shifted of the real part of grouped data and imaginary part, the data bit (not comprising sign bit) of data after determining to decompress
Based on same inventive concept, a kind of data compression device also is provided in the embodiment of the invention, because the principle that this data compression device is dealt with problems is similar to the method for embodiment of the invention data compression, therefore the enforcement of this data compression device can referring to the enforcement of method, repeat part and repeat no more.
The structural representation of the data compression device that Fig. 5 provides for the embodiment of the invention.This data compression device comprises:
Further, grouping module 501 specifically is used for:
Input bit wide m according to compression ratio k and data to be compressed determines block length Q; According to block length Q, treat packed data and divide into groups, wherein, Q is positive integer.
Further, grouping module concrete 501 is used for:
Input bit wide m and displacement information bit wide n according to compression ratio k, data to be compressed determine block length Q, wherein
N is integer.
Further, grouping module concrete 501 is determined block length Q according to formula 9:
Wherein m is positive integer, k〉1.
As previously mentioned, compression processing module 502 is used for organizing data to be compressed for each, organizes the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, and this is organized data to be compressed compress processing,
Further, compression processing module 502 specifically is used for:
Organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, this is organized data to be compressed be shifted; Data after the displacement are carried out cut position, the data after obtaining compressing.
Further, compression processing module 502 specifically is used for:
Organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, determine that this organizes the real part absolute value of data to be compressed and the maximum data_max of imaginary part absolute value
iAccording to data_max
iDetermine that this organizes the displacement bit wide w of data to be compressed
i, wherein, i=1..N, N are the grouping number of data to be compressed, N is greater than 1, w
iFor more than or equal to 0 integer; Organize the displacement bit wide w of data to be compressed according to this
i, this real part and imaginary part of organizing each data of data to be compressed is shifted; Perhaps
Organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, determine real part that this organizes data to be compressed and the maximum power_max of imaginary part quadratic sum
iAccording to power_max
iDetermine that this organizes the displacement bit wide w of data to be compressed
i, wherein, i=1..N, N are the grouping number of data to be compressed, N is greater than 1, w
iFor more than or equal to 0 integer; Organize the displacement bit wide w of data to be compressed according to this
i, this real part and imaginary part of organizing each data of data to be compressed is shifted.
Further, when compressing processing module 502 according to data_max
iDetermine that this organizes the displacement bit wide w of data to be compressed
iThe time, specifically organize the displacement bit wide w of data to be compressed according to formula 10 definite these
i:
When compressing processing module 502 according to power_max
iDetermine that this organizes the displacement bit wide w of data to be compressed
iThe time, specifically organize the displacement bit wide w of data to be compressed according to formula 11 definite these
i:
Further, compression processing module 502 specifically is used for:
This is organized in the real part of each data of data to be compressed and the imaginary part w that moves to left of the data bit outside the divided-by symbol position
iThe position, and the real part after displacement and imaginary data position afterbody are mended respectively w
iIndividual 0.
As previously mentioned, compression processing module 502 specifically is used for: organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, this is organized data to be compressed be shifted; Data after the displacement are carried out cut position, the data after obtaining compressing.
Further, compression processing module 502 specifically is used for:
Input bit wide m according to compression ratio k and data to be compressed determines cut position bit wide bit_cut; Intercept the real part of the data to be compressed after each group is shifted and the high m of imaginary part and deduct described cut position bit wide bit_cut position, wherein the highest order of the data of intercepting is sign bit, and bit_cut is positive integer.
Further, compression processing module 502 specifically is used for:
Input bit wide m and displacement information bit wide n according to compression ratio k, data to be compressed determine cut position bit wide bit_cut, wherein
N is integer.
Further, compression processing module 502 is determined cut position bit wide bit_cut according to formula 12:
Those skilled in the art should understand, embodiments of the invention can be provided as method, system or computer program.Therefore, the present invention can adopt complete hardware implementation example, complete implement software example or in conjunction with the form of the embodiment of software and hardware aspect.And the present invention can adopt the form of the computer program of implementing in one or more computer-usable storage medium (including but not limited to magnetic disc store, CD-ROM, optical memory etc.) that wherein include computer usable program code.
The present invention is that reference is described according to flow chart and/or the block diagram of method, equipment (system) and the computer program of the embodiment of the invention.Should understand can be by the flow process in each flow process in computer program instructions realization flow figure and/or the block diagram and/or square frame and flow chart and/or the block diagram and/or the combination of square frame.Can provide these computer program instructions to the processor of all-purpose computer, special-purpose computer, Embedded Processor or other programmable data processing device producing a machine, so that the instruction of carrying out by the processor of computer or other programmable data processing device produces the device that is used for realizing in the function of flow process of flow chart or a plurality of flow process and/or square frame of block diagram or a plurality of square frame appointments.
These computer program instructions also can be stored in energy vectoring computer or the computer-readable memory of other programmable data processing device with ad hoc fashion work, so that the instruction that is stored in this computer-readable memory produces the manufacture that comprises command device, this command device is realized the function of appointment in flow process of flow chart or a plurality of flow process and/or square frame of block diagram or a plurality of square frame.
These computer program instructions also can be loaded on computer or other programmable data processing device, so that carry out the sequence of operations step producing computer implemented processing at computer or other programmable devices, thereby be provided for realizing the step of the function of appointment in flow process of flow chart or a plurality of flow process and/or square frame of block diagram or a plurality of square frame in the instruction that computer or other programmable devices are carried out.
Although described the preferred embodiments of the present invention, in a single day those skilled in the art get the basic creative concept of cicada, then can make other change and modification to these embodiment.So claims are intended to all changes and the modification that are interpreted as comprising preferred embodiment and fall into the scope of the invention.
Obviously, those skilled in the art can carry out various changes and modification to the present invention and not break away from the spirit and scope of the present invention.Like this, if of the present invention these are revised and modification belongs within the scope of claim of the present invention and equivalent technologies thereof, then the present invention also is intended to comprise these changes and modification interior.
Claims (26)
1. the method for a data compression is characterized in that, comprising:
Input bit wide m according to compression ratio k and data to be compressed treats packed data and divides into groups, and wherein m is positive integer, k〉1;
Organize data to be compressed for each, organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, this is organized data to be compressed compress processing.
2. the method for claim 1 is characterized in that, described input bit wide m according to compression ratio k and data to be compressed treats packed data and divides into groups, and comprising:
Input bit wide m according to compression ratio k and data to be compressed determines block length Q;
According to block length Q, treat packed data and divide into groups, wherein Q is positive integer.
3. method as claimed in claim 2 is characterized in that, described input bit wide m according to compression ratio k and data to be compressed determines block length Q, comprising:
Input bit wide m and displacement information bit wide n according to compression ratio k, data to be compressed determine block length Q, wherein
N is integer,
Expression rounds downwards.
4. method as claimed in claim 3 is characterized in that, determines block length Q according to following formula, wherein
Expression rounds downwards:
5. the method for claim 1 is characterized in that, describedly organizes the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, this is organized data to be compressed compress processing, comprising:
Organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, this is organized data to be compressed be shifted;
Data after this group displacement are carried out cut position.
6. method as claimed in claim 5 is characterized in that, describedly organizes the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, this is organized data to be compressed be shifted, and comprising:
Organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, determine that this organizes the real part absolute value of data to be compressed and the maximum data_max of imaginary part absolute value
i
According to data_max
iDetermine that this organizes the displacement bit wide w of data to be compressed
i, wherein, i=1..N, N are the grouping number of data to be compressed, N is greater than 1, w
iFor more than or equal to 0 integer;
Organize the displacement bit wide w of data to be compressed according to this
i, this real part and imaginary part of organizing each data of data to be compressed is shifted.
7. method as claimed in claim 6 is characterized in that, determines that according to following formula this organizes the displacement bit wide w of data to be compressed
i, wherein
Expression rounds downwards:
8. method as claimed in claim 5 is characterized in that, describedly organizes the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, this is organized data to be compressed be shifted, and comprising:
Organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, determine the maximum power_max of the quadratic sum of real part that this organizes data to be compressed and imaginary part
i
According to power_max
iDetermine that this organizes the displacement bit wide w of data to be compressed
i, wherein, i=1..N, N are the grouping number of data to be compressed, N is greater than 1, w
iFor more than or equal to 0 integer;
Organize the displacement bit wide w of data to be compressed according to this
i, this real part and imaginary part of organizing each data of data to be compressed is shifted.
9. method as claimed in claim 8 is characterized in that, determines that according to following formula this organizes the displacement bit wide w of data to be compressed
i, wherein
Expression rounds downwards:
10. such as each described method of claim 6～9, it is characterized in that, describedly organize the displacement bit wide w of data to be compressed according to this
i, this real part and imaginary part of organizing each data of data to be compressed is shifted, comprising:
This is organized in the real part of each data of data to be compressed and the imaginary part w that moves to left of the data bit outside the divided-by symbol position
iThe position, and the real part after displacement and imaginary part afterbody are mended respectively w
iIndividual 0.
11. method as claimed in claim 5 is characterized in that, the data after this group displacement are carried out cut position, comprising:
Input bit wide m according to compression ratio k and data to be compressed determines cut position bit wide bit_cut;
Intercept the real part of the data to be compressed after this group is shifted and the high m of imaginary part and deduct described cut position bit wide bit_cut position, wherein the highest order of the data of intercepting is sign bit, and bit_cut is positive integer.
12. method as claimed in claim 11 is characterized in that, described input bit wide m according to compression ratio k and data to be compressed determines cut position bit wide bit_cut, comprising:
Input bit wide m and displacement information bit wide n according to compression ratio k, data to be compressed determine cut position bit wide bit_cut, wherein
N is integer,
Expression rounds downwards.
13. method as claimed in claim 12 is characterized in that, determines cut position bit wide bit_cut according to following formula, wherein
Expression rounds downwards:
14. the device of a data compression is characterized in that, comprising:
Grouping module is used for the input bit wide m according to compression ratio k and data to be compressed, treats packed data and divides into groups, and wherein m is positive integer, k〉1;
The compression processing module is used for organizing data to be compressed for each, organizes the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, this is organized data to be compressed compress processing.
15. device as claimed in claim 14 is characterized in that, described grouping module specifically is used for:
Input bit wide m according to compression ratio k and data to be compressed determines block length Q; According to block length Q, treat packed data and divide into groups, wherein, Q is positive integer.
16. device as claimed in claim 15 is characterized in that, described grouping module specifically is used for:
Input bit wide m and displacement information bit wide n according to compression ratio k, data to be compressed determine block length Q, wherein
N is integer,
Expression rounds downwards.
17. device as claimed in claim 16 is characterized in that, described grouping module is determined block length Q according to following formula, wherein
Expression rounds downwards:
18. device as claimed in claim 14 is characterized in that, described compression processing module specifically is used for:
Organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, this is organized data to be compressed be shifted; Data after this group displacement are carried out cut position, the data after obtaining compressing.
19. device as claimed in claim 18 is characterized in that, described compression processing module specifically is used for:
Organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, determine that this organizes the real part absolute value of data to be compressed and the maximum data_max of imaginary part absolute value
iAccording to data_max
iDetermine that this organizes the displacement bit wide w of data to be compressed
i, wherein, i=1..N, N are the grouping number of data to be compressed, N is greater than 1, w
iFor more than or equal to 0 integer; Organize the displacement bit wide w of data to be compressed according to this
i, this real part and imaginary part of organizing each data of data to be compressed is shifted.
20. device as claimed in claim 19 is characterized in that, described compression processing module determines that according to following formula this organizes the displacement bit wide w of data to be compressed
i, wherein
Expression rounds downwards:
21. device as claimed in claim 18 is characterized in that, described compression processing module specifically is used for:
Organize the numerical value of real part of each data of data to be compressed and the numerical value of imaginary part according to this, determine real part that this organizes data to be compressed and the maximum power_max of imaginary part quadratic sum
iAccording to power_max
iDetermine that this organizes the displacement bit wide w of data to be compressed
i, wherein, i=1..N, N are the grouping number of data to be compressed, N is greater than 1, w
iFor more than or equal to 0 integer; Organize the displacement bit wide w of data to be compressed according to this
i, this real part and imaginary part of organizing each data of data to be compressed is shifted.
22. device as claimed in claim 21 is characterized in that, described compression processing module determines that according to following formula this organizes the displacement bit wide w of data to be compressed
i, wherein
Expression rounds downwards:
23. such as each described device of claim 19～22, it is characterized in that, described compression processing module specifically is used for:
This is organized in the real part of each data of data to be compressed and the imaginary part w that moves to left of the data bit outside the divided-by symbol position
iThe position, and the real part after displacement and imaginary data position afterbody are mended respectively w
iIndividual 0.
24. device as claimed in claim 18 is characterized in that, described compression processing module specifically is used for:
Input bit wide m according to compression ratio k and data to be compressed determines cut position bit wide bit_cut; Intercept the real part of the data to be compressed after this group is shifted and the high m of imaginary part and deduct described cut position bit wide bit_cut position, wherein the highest order of the data of intercepting is sign bit, and bit_cut is positive integer.
25. device as claimed in claim 24 is characterized in that, described compression processing module specifically is used for:
Input bit wide m and displacement information bit wide n according to compression ratio k, data to be compressed determine cut position bit wide bit_cut, wherein
N is integer,
Expression rounds downwards.
26. device as claimed in claim 25 is characterized in that, determines cut position bit wide bit_cut according to following formula, wherein
Expression rounds downwards:
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2013102703952A CN103312336A (en) | 2013-06-28 | 2013-06-28 | Data compression method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2013102703952A CN103312336A (en) | 2013-06-28 | 2013-06-28 | Data compression method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103312336A true CN103312336A (en) | 2013-09-18 |
Family
ID=49137185
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2013102703952A Pending CN103312336A (en) | 2013-06-28 | 2013-06-28 | Data compression method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103312336A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104135452A (en) * | 2014-08-08 | 2014-11-05 | 福建三元达通讯股份有限公司 | Synchronous compression and recovery algorithm and device for IQ (Intelligence Quotient) data |
| CN104661263A (en) * | 2013-11-25 | 2015-05-27 | 普天信息技术研究院有限公司 | Method for transmitting interface data |
| WO2015143602A1 (en) * | 2014-03-24 | 2015-10-01 | 华为技术有限公司 | Method for transmitting physical layer data and data transmission device |
| CN108153483A (en) * | 2016-12-06 | 2018-06-12 | 南京南瑞继保电气有限公司 | A kind of time series data compression method based on attribute grouping |
| CN109309501A (en) * | 2018-09-12 | 2019-02-05 | 成都宝通天宇电子科技有限公司 | Polycyclic data compression method in high precision |
| CN109700454A (en) * | 2018-12-03 | 2019-05-03 | 联想(北京)有限公司 | A kind of information processing method, device, equipment and storage medium |
| CN110019184A (en) * | 2017-09-04 | 2019-07-16 | 北京字节跳动网络技术有限公司 | A kind of method of the orderly integer array of compression and decompression |
| CN112134568A (en) * | 2020-09-15 | 2020-12-25 | 广州市埃信电信有限公司 | Lossy data compression and decompression method and system |
| CN115147070A (en) * | 2022-06-17 | 2022-10-04 | 广东省国土资源技术中心(广东省基础地理信息中心) | Land area reduction method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7355533B2 (en) * | 2003-06-10 | 2008-04-08 | Jan-Olov Strombert | Method for compression of data |
| CN102244552A (en) * | 2010-05-13 | 2011-11-16 | 中兴通讯股份有限公司 | Method and device for transmitting and receiving data |
| CN102790656A (en) * | 2012-05-30 | 2012-11-21 | 新邮通信设备有限公司 | Method and system for compressing IQ data |
| CN102821072A (en) * | 2011-06-08 | 2012-12-12 | 中兴通讯股份有限公司 | Sending method, receiving method, sending system, receiving system, sending device and receiving device for IQ (In-phase quadrature) data |
-
2013
- 2013-06-28 CN CN2013102703952A patent/CN103312336A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7355533B2 (en) * | 2003-06-10 | 2008-04-08 | Jan-Olov Strombert | Method for compression of data |
| CN102244552A (en) * | 2010-05-13 | 2011-11-16 | 中兴通讯股份有限公司 | Method and device for transmitting and receiving data |
| CN102821072A (en) * | 2011-06-08 | 2012-12-12 | 中兴通讯股份有限公司 | Sending method, receiving method, sending system, receiving system, sending device and receiving device for IQ (In-phase quadrature) data |
| CN102790656A (en) * | 2012-05-30 | 2012-11-21 | 新邮通信设备有限公司 | Method and system for compressing IQ data |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104661263B (en) * | 2013-11-25 | 2018-08-24 | 普天信息技术研究院有限公司 | A kind of method of coffret data |
| CN104661263A (en) * | 2013-11-25 | 2015-05-27 | 普天信息技术研究院有限公司 | Method for transmitting interface data |
| WO2015143602A1 (en) * | 2014-03-24 | 2015-10-01 | 华为技术有限公司 | Method for transmitting physical layer data and data transmission device |
| CN104135452A (en) * | 2014-08-08 | 2014-11-05 | 福建三元达通讯股份有限公司 | Synchronous compression and recovery algorithm and device for IQ (Intelligence Quotient) data |
| CN108153483B (en) * | 2016-12-06 | 2021-04-20 | 南京南瑞继保电气有限公司 | Time sequence data compression method based on attribute grouping |
| CN108153483A (en) * | 2016-12-06 | 2018-06-12 | 南京南瑞继保电气有限公司 | A kind of time series data compression method based on attribute grouping |
| CN110019184A (en) * | 2017-09-04 | 2019-07-16 | 北京字节跳动网络技术有限公司 | A kind of method of the orderly integer array of compression and decompression |
| CN110019184B (en) * | 2017-09-04 | 2021-04-27 | 北京字节跳动网络技术有限公司 | Method for compressing and decompressing ordered integer array |
| CN109309501A (en) * | 2018-09-12 | 2019-02-05 | 成都宝通天宇电子科技有限公司 | Polycyclic data compression method in high precision |
| CN109309501B (en) * | 2018-09-12 | 2022-04-29 | 成都宝通天宇电子科技有限公司 | High-precision multi-ring data compression method |
| CN109700454A (en) * | 2018-12-03 | 2019-05-03 | 联想(北京)有限公司 | A kind of information processing method, device, equipment and storage medium |
| CN112134568A (en) * | 2020-09-15 | 2020-12-25 | 广州市埃信电信有限公司 | Lossy data compression and decompression method and system |
| CN115147070A (en) * | 2022-06-17 | 2022-10-04 | 广东省国土资源技术中心(广东省基础地理信息中心) | Land area reduction method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103312336A (en) | Data compression method and device | |
| US10505671B2 (en) | Polar code encoding method and device | |
| CN104135452B (en) | A kind of I/Q data synchronous compression retrieving algorithm and device | |
| CN101702639B (en) | Check value calculation method and device of cyclic redundancy check | |
| CN116506073B (en) | Industrial computer platform data rapid transmission method and system | |
| CN103458460A (en) | Method and device for compressing and decompressing signal data | |
| CN105763287B (en) | Data transmission method and device | |
| CN112202623B (en) | Data processing method and device | |
| CN103346800B (en) | A kind of data compression method and device | |
| CN102571820A (en) | Method used for transmitting data, compression server and terminal | |
| CN103281156A (en) | Methods and devices for compressing and decompressing data | |
| CN105846828A (en) | Compression method and device of IQ data, decompression method and device of IQ data, transmission method of IQ data and transmission system of IQ data | |
| CN103716056A (en) | Data compression method, data decompression method and devices | |
| CN111555984A (en) | Method and device for data transmission, smart home equipment and storage medium | |
| CN103888146A (en) | Method, device and communication device for data compression | |
| CN116489236B (en) | Electroencephalogram signal real-time lossless compression method and device, electronic equipment and storage medium | |
| US8452902B2 (en) | Methods for transmitting buffer size information | |
| CN104780120A (en) | Method and device for transmitting files in local area network | |
| CN102780618B (en) | Method and device for data message transmission | |
| CN113141508A (en) | Arithmetic encoder, method for realizing arithmetic encoding and image encoding method | |
| CN105306386A (en) | Resource allocation method and device in local area network | |
| CN111147083B (en) | Method for compressing and transmitting time information | |
| CN110266814B (en) | Transmission method and transmission device | |
| CN105357532A (en) | Compression method, uncompression method, compression apparatus and uncompression apparatus | |
| EP2485420A1 (en) | Data transmitting apparatus, data generating program and data transmitting/receiving method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20130918 |
|
| RJ01 | Rejection of invention patent application after publication |