CN102790656B - A kind of I/Q data compression method and system - Google Patents
A kind of I/Q data compression method and system Download PDFInfo
- Publication number
- CN102790656B CN102790656B CN201210175639.4A CN201210175639A CN102790656B CN 102790656 B CN102790656 B CN 102790656B CN 201210175639 A CN201210175639 A CN 201210175639A CN 102790656 B CN102790656 B CN 102790656B
- Authority
- CN
- China
- Prior art keywords
- data
- group
- organized
- maximum power
- packed 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.)
- Active
Links
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a kind of I/Q data compression method and device.Described method comprises: at transmitting terminal, fixed point I/Q data is divided into groups, and for each group, determines the maximum power of these group data, this maximum power and maximum power during calibration full scale is compared, determines the translocation factor k of this group; According to often organizing corresponding translocation factor k, the I datum of I/Q data each in this group and Q data being shifted and cut position, obtaining packed data; Block length n, the translocation factor k often organized and the packed data often organized are sent to receiving terminal; Receiving terminal decompresses according to block length n, the translocation factor k often organized and the packed data often organized.It is synchronous that technical scheme of the present invention can realize IQ compression, often organizes data and only transmit a translocation factor, and can reduce the little Signal Compression error of energy, improve compression efficiency.
Description
Technical field
The present invention relates to mobile communication technology field, particularly a kind of I/Q data compression method and system.
Background technology
In mobile communication system, base station comprises baseband processing unit (BBU) and Remote Radio Unit (RRU), adopts Fiber connection, transmitted in both directions I/Q data between BBU and RRU.I/Q data is baseband digital signal.Baseband digital signal comprises I road signal and Q road signal, and namely baseband digital signal can be expressed as I+jQ, and I is real part, and Q is imaginary part.
In the base station of TDD-LTE system, IR(Interface betweenthe BBU and the RRU is adopted between BBU and RRU) agreement to be to carry out the transmission of I/Q data, along with the transmission data of eating dishes without rice or wine improve constantly, the pressure causing IR to transmit and cost constantly rise, industry has multiple producer to propose multiple diverse ways, compresses the bit wide of I/Q data transmission.
The linear compression of I/Q data compression scheme known at present and non-linear compression.Non-linear compression, realizes more complicated as the opposite linear compressions such as A rule compression scheme.Current a kind of linear compression scheme is as follows:
Descending IQ is divided into groups, a continuous m I/Q data is divided into one group, and obtain the numerical value maximum data of I and Q in each group of data respectively; Intercept the high-order valid data of continuous n-bit from the bit containing ' 1 ' and the sign bit of numerical value maximum data described in this group data, and delete remaining low number of bits certificate in described numerical value maximum data; Intercept the high-order valid data of the described continuous n-bit of other m-1 data and sign bit in this group data, and delete remaining low number of bits certificate described in described other m-1 data; Determine the compressibility factor of this group according to the figure place of the low number of bits certificate of deleting, and send the I/Q data after described compressibility factor and compression.Data are reduced according to compressibility factor in decompressor end.
This linear compression scheme foundation often organizes the maximum of the mould of I and Q in data, and the number according to its high order zero judges translocation factor, needs the compression of I and Q separate computations, and for comprising the small signal compression loss of negative obviously.
Summary of the invention
The invention provides a kind of I/Q data compression method and system, it is synchronous that technical scheme of the present invention can realize IQ compression, often organizes data and only transmit a translocation factor, and can reduce the little Signal Compression error of energy, improve compression efficiency.
For achieving the above object, technical scheme of the present invention is achieved in that
The invention discloses a kind of I/Q data compression method, the method comprises:
At transmitting terminal, fixed point I/Q data divided into groups, often group comprises n I/Q data;
For each group, determine the maximum power of these group data, this maximum power and maximum power during calibration full scale are compared, determines the translocation factor k of this group;
According to often organizing corresponding translocation factor k, the I datum of I/Q data each in this group and Q data being shifted and cut position, obtaining packed data;
Block length n, the translocation factor k often organized and the packed data often organized are sent to receiving terminal;
Receiving terminal decompresses according to block length n, the translocation factor k often organized and the packed data often organized.
Described for each group, determine the maximum power of these group data, this maximum power and maximum power during calibration full scale are compared, determines that the translocation factor k of this group comprises:
By the power utilizing formula I2+Q2 to calculate I/Q data, find out the I/Q data with maximum power value in this group;
What round downwards after the ratio of maximum power and described maximum power value during calibration full scale is removed 4 obtains k again.
Before dividing into groups, the method comprises further:
According to the calibration mode of specifying, the conversion process of floating-point to fixed point is carried out to I/Q data.
Described block length n equals 1024,2048,15360 or 30720.
Described basis is often organized corresponding translocation factor k and is shifted and cut position to the I datum of I/Q data each in this group and Q data, obtains packed data and comprises:
By the binary bits beyond the divided-by symbol position of each I datum to the k position that moves to left, afterbody mends k individual 0, then intercepts high N-k bit, obtains I packed data;
Equally, by the binary bits beyond the divided-by symbol position of each Q data to the k position that moves to left, afterbody mends k, then intercepts high N-k bit, obtains Q packed data;
Wherein, N is the bit wide of I datum and Q data.
Described receiving terminal is according to block length n, and the translocation factor k often organized and the packed data often organized carry out decompression and comprise:
Receiving terminal determines the boundary often organized according to block length n;
For each I packed data/Q packed data often organized in packed data, move right the binary bits beyond divided-by symbol position k position, wherein, when its sign bit is 0, in shifting process, mend 0, when its sign bit is 1, in shifting process, mend 1, to obtain after decompress(ion) Q data after I datum/decompress(ion).
The invention also discloses a kind of I/Q data compressibility, this system comprises makes a start and receiving terminal;
Transmitting terminal, for fixed point I/Q data being divided into groups, often group comprises n I/Q data; For each group, determine the maximum power of these group data, this maximum power and maximum power during calibration full scale are compared, determines the translocation factor k of this group; According to often organizing corresponding translocation factor k, the I datum of I/Q data each in this group and Q data being shifted and cut position, obtaining packed data; Block length n, the translocation factor k often organized and the packed data often organized are sent to receiving terminal;
Receiving terminal, for decompressing according to block length n, the translocation factor k often organized and the packed data often organized.
Described transmitting terminal, by utilizing formula I
2+ Q
2calculate the power of I/Q data, find out the I/Q data with maximum power value in this group, what round downwards after maximum power during calibration full scale and the ratio of described maximum power value are removed 4 obtains k again.
Described transmitting terminal, for by the binary bits beyond the divided-by symbol position of each I datum to the k position that moves to left, afterbody mends k 0, then intercepts high N-k bit, obtains I packed data; Equally, by the binary bits beyond the divided-by symbol position of each Q data to the k position that moves to left, afterbody mends k individual 0, then intercepts high N-k bit, obtains Q packed data;
Wherein, N is the bit wide of I datum and Q data.
Described receiving terminal, for the boundary determining often to organize according to block length n; For each I packed data/Q packed data often organized in packed data, move right the binary bits beyond divided-by symbol position k position, wherein, when its sign bit is 0, in shifting process, mend 0, when its sign bit is 1, in shifting process, mend 1, to obtain after decompress(ion) Q data after I datum/decompress(ion).
From above-mentioned, the present invention is this at transmitting terminal, fixed point I/Q data is divided into groups, for each group, determine the maximum power of these group data, this maximum power and maximum power during calibration full scale are compared, determine the translocation factor k of this group, according to often organizing corresponding translocation factor k, the I datum of I/Q data each in this group and Q data are shifted and cut position, obtain packed data, then by block length n, the translocation factor k often organized and the packed data often organized send to receiving terminal, receiving terminal is according to block length n, the translocation factor k often organized and the packed data often organized carry out the technical scheme decompressed, IQ compression can be realized synchronous, often organize data and only transmit a translocation factor, and owing to determining translocation factor based on signal power, therefore, it is possible to reduce the little Signal Compression error of energy, improve compression efficiency.
Accompanying drawing explanation
Fig. 1 is the flow chart of a kind of I/Q data compression method in the present invention;
Fig. 2 is the schematic diagram of an I datum;
Fig. 3 is the schematic diagram that data shown in Fig. 2 carry out moving to left after benefit 0;
Fig. 4 is the schematic diagram after data shown in Fig. 3 carry out cut position;
Fig. 5 is the schematic diagram of the packed data that receiving terminal receives;
Fig. 6 is the schematic diagram after data shown in Fig. 5 carry out afterbody benefit 0;
Fig. 7 is the schematic diagram that data shown in Fig. 6 carry out moving to right after benefit 0;
Fig. 8 is the schematic diagram of a kind of I/Q data compressibility in the present invention.
Embodiment
For making the object, technical solutions and advantages of the present invention clearly, below in conjunction with accompanying drawing, embodiment of the present invention is described further in detail.
Fig. 1 is the flow chart of a kind of I/Q data compression method in the present invention.As shown in Figure 1, the method comprises:
101, at transmitting terminal, fixed point I/Q data divided into groups, often group comprises n I/Q data, and each I/Q data comprises I portion (also referred to as I datum) and Q portion (also referred to as Q data);
102, for each group, determine the maximum power of these group data, this maximum power and maximum power during calibration full scale are compared, determines the translocation factor k of this group;
103, according to often organizing corresponding translocation factor k, the I datum of I/Q data each in this group and Q data being shifted and cut position, obtaining packed data;
104, block length n, the translocation factor k often organized and the packed data often organized are sent to receiving terminal;
105, receiving terminal decompresses according to block length n, the translocation factor k often organized and the packed data often organized.
It is synchronous that scheme shown in Fig. 1 can realize IQ compression, often organizes data and only transmit a translocation factor, and can reduce the little Signal Compression error of energy, improve compression efficiency.
In one embodiment of the invention, the specific implementation process of method shown in Fig. 1 is as follows:
Transmitting terminal
1, according to the calibration mode of specifying, the conversion process of floating-point to fixed point is carried out to I/Q data.
In floating number, the position of decimal point is unfixed, represents with exponent and mantissa; Fixed-point number refers to that the position of decimal point in number is changeless.
Here calibration mode comprises: the determination of the position of bit wide, sign bit and decimal point.Such as, a kind of calibration mode of specifying in the present embodiment is: determine that the I portion of I/Q data and the bit wide in Q portion are all 16 bits, a leftmost bit is-symbol position in 16 bits, 1 is negative, 0 is just, the position of decimal point is positioned at from after left side number the 3rd bit (these 3 bits comprise sign bit), before the 4th bit.
2, I/Q data is divided into groups.
Often group comprises n I/Q data, and namely block length is n.N be specifically as follows 1024 or 2048(OFDM symbol) or 15360(time slot) or 30720(subframe); The actual selected value of n is selected according to real system, and the result of the compression scheme of the value of simulation result display said n is basically identical.
3, translocation factor (i.e. compressibility factor) is judged according to power
For each group, determine the maximum power of these group data, this maximum power and maximum power during calibration full scale are compared, determines the translocation factor k of this group.
Specifically: by utilizing formula I
2+ Q
2calculate the performance number of an I/Q data, find out the I/Q data with maximum power value in this group; By the ratio of maximum power and described maximum power value during calibration full scale except a data that moves to left of data under 4(binary system increases 2 times, by power calculation during owing to calculating translocation factor, therefore need to remove 2 square, namely 4) after round downwards again obtain k.
Such as, be determine that the I portion of I/Q data and the bit wide in Q portion are all 16 bits for calibration mode, a leftmost bit is-symbol position in 16 bits, 1 is negative, 0 is just, the position of decimal point is positioned at from the situation after left side number the 3rd bit (these 3 bits comprise sign bit): represent that the data bit of numerical value has 15 bits, between decimal point on the left side number the 2nd bit and the 3rd bit then, calibration full scale is 11.1111111111111, here have 15 ' 1 ', do not comprise sign bit.Maximum power (11.1111111111111) 2 during calibration full scale, now the computing formula of translocation factor k is as follows:
Wherein, symbol
represent and round downwards.
The implication of such definition translocation factor k is: for the binary system I/Q data of this group maximum power, if I/Q data is positive number, divided-by symbol position 0 outside, first ' 1 ' bit position is found from the left side, ' 0 ' bit position number between this and sign bit is k, move to left k position from first ' 1 ' bit position, mends 0 at the end of binary system bit position.Similarly, if I/Q data corresponding to described maximum power value is negative, so k value is followed the example of on the contrary, namely divided-by symbol position 1 outside, from the left side, find first ' 0 ' bit position, ' 1 ' bit position number between this and sign bit is k.
4, carry out being shifted and cut position compression according to translocation factor k
According to often organizing corresponding translocation factor k, the I datum of I/Q data each in this group and Q data being shifted and cut position, obtaining packed data, specifically:
By the binary bits beyond the divided-by symbol position of each I datum to the k position that moves to left, afterbody mends k individual 0, then intercepts high N-k bit, obtains I packed data;
Equally, by the binary bits beyond the divided-by symbol position of each Q data to the k position that moves to left, afterbody mends k individual 0, then intercepts high N-k bit, obtains Q packed data;
Wherein, N is the bit wide of I datum and Q data; The sign bit of I datum (or Q data) be no matter 0 or for 1(be 0 expression just, be that 1 expression is born), afterbody all mends k 0.
Such as, as k=4, the compression process for an I datum 0000011111111111 is as follows:
See Fig. 2, first of this I datum is sign bit, and below 15 is data bit;
See Fig. 3, to the binary bits beyond divided-by symbol position to the k=4 position that moves to left, afterbody mends 40;
See Fig. 4, intercept high 16-k=12bit, obtain the packed data of this I datum.
5, block length n, the translocation factor k often organized and the packed data often organized are sent to receiving terminal.
Receiving terminal
Receiving terminal decompresses according to block length n, the translocation factor k often organized and the packed data often organized.Specifically comprise:
1, receiving terminal determines the boundary often organized according to block length n; Namely receiving terminal determines which packed data belongs to one group.
2, for each I packed data often organized in packed data, move right the binary bits beyond divided-by symbol position k position, wherein, when the sign bit of this I packed data is 0,0 is mended in shifting process, when the sign bit of this I packed data is 1, in shifting process, mend 1, obtain I datum after decompress(ion);
Equally, for each Q packed data often organized in packed data, move right the binary bits beyond divided-by symbol position k position, wherein, when the sign bit of this Q packed data is 0, in shifting process, mend 0, when the sign bit of this Q packed data is 1, in shifting process, mend 1, obtain Q data after decompress(ion).
Such as,
See Fig. 5, the 12bit packed data received; Belonging to it, the k of group is 4;
See Fig. 6, afterbody zero padding is carried out to 16bit to packed data, in this example, mend 4 zero;
See Fig. 7, carry out the zero padding operation that moves to right, obtain the decompressed data of 16bit.
A kind of I/Q data compressibility in the present invention is provided according to above-described embodiment, as shown in Figure 8,
This system comprises makes a start and receiving terminal;
Transmitting terminal, for fixed point I/Q data being divided into groups, often group comprises n I/Q data; For each group, determine the maximum power of these group data, this maximum power and maximum power during calibration full scale are compared, determines the translocation factor k of this group; According to often organizing corresponding translocation factor k, the I datum of I/Q data each in this group and Q data being shifted and cut position, obtaining packed data; By block length n, the translocation factor k often organized and the packed data often organized send to receiving terminal;
Receiving terminal, for according to block length n, the translocation factor k often organized and the packed data often organized decompress.
Described transmitting terminal, by utilizing formula I
2+ Q
2calculate the power of I/Q data, find out the I/Q data with maximum power value in this group, what round downwards after maximum power during calibration full scale and the ratio of described maximum power value are removed 4 obtains k again.
Described transmitting terminal, for by the binary bits beyond the divided-by symbol position of each I datum to the k position that moves to left, afterbody mends k 0, then intercepts high N-k bit, obtains I packed data; Equally, by the binary bits beyond the divided-by symbol position of each Q data to the k position that moves to left, afterbody mends k individual 0, then intercepts high N-k bit, obtains Q packed data;
Wherein, N is the bit wide of I datum and Q data.
Described receiving terminal, for the boundary determining often to organize according to block length n; For each I packed data/Q packed data often organized in packed data, move right the binary bits beyond divided-by symbol position k position, wherein, when its sign bit is 0, in shifting process, mend 0, when its sign bit is 1, in shifting process, mend 1, to obtain after decompress(ion) Q data after I datum/decompress(ion).
When transmitting terminal is BBU, receiving terminal is RRU; When transmitting terminal is RRU, receiving terminal is BBU.
In sum, the present invention is this at transmitting terminal, fixed point I/Q data is divided into groups, for each group, determine the maximum power of these group data, this maximum power and maximum power during calibration full scale are compared, determine the translocation factor k of this group, according to often organizing corresponding translocation factor k, the I datum of I/Q data each in this group and Q data are shifted and cut position, obtain packed data, then by block length n, the translocation factor k often organized and the packed data often organized send to receiving terminal, receiving terminal is according to block length n, the translocation factor k often organized and the packed data often organized carry out the technical scheme decompressed, IQ compression can be realized synchronous, often organize data and only transmit a translocation factor, and owing to determining translocation factor based on signal power, therefore, it is possible to reduce the little Signal Compression error of energy, improve compression efficiency.Visible technical scheme of the present invention not only achieves the bit wide compression of the I/Q data between BBU and RRU, and realize improving base station Optical Fiber Transmission efficiency when influential system does not require upstream sensitivity and dynamic range and descending EVM etc., often organize I/Q data and only have a translocation factor k, so that IQ two paths of data is compressed simultaneously, and avoid the excessive loss that the cut position of small-signal compresses.
The foregoing is only preferred embodiment of the present invention, be not intended to limit protection scope of the present invention.All any amendments done within the spirit and principles in the present invention, equivalent replacement, improvement etc., be all included in protection scope of the present invention.
Claims (8)
1. an I/Q data compression method, is characterized in that, the method comprises:
At transmitting terminal, fixed point I/Q data divided into groups, often group comprises n I/Q data;
For each group, determine the maximum power of these group data, this maximum power and maximum power during calibration full scale are compared, determines the translocation factor k of this group;
According to often organizing corresponding translocation factor k, the I datum of I/Q data each in this group and Q data being shifted and cut position, obtaining packed data;
Block length n, the translocation factor k often organized and the packed data often organized are sent to receiving terminal;
Receiving terminal decompresses according to block length n, the translocation factor k often organized and the packed data often organized;
Wherein, described for each group, determine the maximum power of these group data, this maximum power and maximum power during calibration full scale are compared, determines that the translocation factor k of this group comprises:
By utilizing formula I
2+ Q
2calculate the power of I/Q data, find out the I/Q data with maximum power value in this group;
Round downwards again after the ratio of maximum power and described maximum power value during calibration full scale is removed 4 and obtain k.
2. method according to claim 1, is characterized in that, before dividing into groups, the method comprises further:
According to the calibration mode of specifying, the conversion process of floating-point to fixed point is carried out to I/Q data.
3. method according to claim 1, is characterized in that, described block length n equals 1024,2048,15360 or 30720.
4. method according to claim 1, is characterized in that, described basis is often organized corresponding translocation factor k and is shifted and cut position to the I datum of I/Q data each in this group and Q data, obtains packed data and comprises:
By the binary bits beyond the divided-by symbol position of each I datum to the k position that moves to left, afterbody mends k individual 0, then intercepts high N-k bit, obtains I packed data;
Equally, by the binary bits beyond the divided-by symbol position of each Q data to the k position that moves to left, afterbody mends k individual 0, then intercepts high N-k bit, obtains Q packed data;
Wherein, N is the bit wide of I datum and Q data.
5. method according to claim 4, is characterized in that, described receiving terminal carries out decompression according to block length n, the translocation factor k often organized and the packed data often organized and comprises:
Receiving terminal determines the boundary often organized according to block length n;
For each I packed data/Q packed data often organized in packed data, move right the binary bits beyond divided-by symbol position k position, wherein, when its sign bit is 0, in shifting process, mend 0, when its sign bit is 1, in shifting process, mend 1, to obtain after decompress(ion) Q data after I datum/decompress(ion).
6. an I/Q data compressibility, is characterized in that, this system comprises transmitting terminal and receiving terminal;
Transmitting terminal, for fixed point I/Q data being divided into groups, often group comprises n I/Q data; For each group, determine the maximum power of these group data, this maximum power and maximum power during calibration full scale are compared, determines the translocation factor k of this group; According to often organizing corresponding translocation factor k, the I datum of I/Q data each in this group and Q data being shifted and cut position, obtaining packed data; Block length n, the translocation factor k often organized and the packed data often organized are sent to receiving terminal;
Receiving terminal, for decompressing according to block length n, the translocation factor k often organized and the packed data often organized;
Described transmitting terminal, by utilizing formula I
2+ Q
2calculate the power of I/Q data, find out the I/Q data with maximum power value in this group, round downwards again after maximum power during calibration full scale and the ratio of described maximum power value are removed 4 and obtain k.
7. system according to claim 6, is characterized in that,
Described transmitting terminal, for by the binary bits beyond the divided-by symbol position of each I datum to the k position that moves to left, afterbody mends k 0, then intercepts high N-k bit, obtains I packed data; Equally, by the binary bits beyond the divided-by symbol position of each Q data to the k position that moves to left, afterbody mends k individual 0, then intercepts high N-k bit, obtains Q packed data;
Wherein, N is the bit wide of I datum and Q data.
8. system according to claim 7, is characterized in that,
Described receiving terminal, for the boundary determining often to organize according to block length n; For each I packed data/Q packed data often organized in packed data, move right the binary bits beyond divided-by symbol position k position, wherein, when its sign bit is 0, in shifting process, mend 0, when its sign bit is 1, in shifting process, mend 1, to obtain after decompress(ion) Q data after I datum/decompress(ion).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210175639.4A CN102790656B (en) | 2012-05-30 | 2012-05-30 | A kind of I/Q data compression method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210175639.4A CN102790656B (en) | 2012-05-30 | 2012-05-30 | A kind of I/Q data compression method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102790656A CN102790656A (en) | 2012-11-21 |
| CN102790656B true CN102790656B (en) | 2015-10-28 |
Family
ID=47155964
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210175639.4A Active CN102790656B (en) | 2012-05-30 | 2012-05-30 | A kind of I/Q data compression method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102790656B (en) |
Families Citing this family (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103312336A (en) * | 2013-06-28 | 2013-09-18 | 京信通信系统（中国）有限公司 | Data compression method and device |
| CN104378117B (en) * | 2013-08-15 | 2017-11-14 | 京信通信系统（中国）有限公司 | Data compression method and device, data transmission method and system |
| CN104749633A (en) * | 2013-12-25 | 2015-07-01 | 中国科学院地质与地球物理研究所 | High-efficiency and high-precision seismic exploration data compression method |
| CN103812608B (en) * | 2013-12-26 | 2017-04-26 | 西安交通大学 | Method and system for compressing IQ data |
| WO2016015286A1 (en) * | 2014-07-31 | 2016-02-04 | Telefonaktiebolaget L M Ericsson (Publ) | Methods and apparatuses for data compression and decompression |
| CN108155912B (en) * | 2014-08-08 | 2021-04-13 | 福建三元达网络技术有限公司 | IQ data compression and reduction algorithm and device |
| EP3294000B1 (en) | 2015-05-29 | 2020-05-06 | Huawei Technologies Co., Ltd. | Method, apparatus and system for transmitting i/q signal |
| CN105846828A (en) * | 2016-03-23 | 2016-08-10 | 北京裕源大通科技股份有限公司 | 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 |
| CN107315535B (en) * | 2016-04-27 | 2019-09-20 | 北京京东尚科信息技术有限公司 | Information processing method and device |
| CN106027446B (en) * | 2016-05-19 | 2019-06-11 | 京信通信系统（中国）有限公司 | Multi-carrier expansion processing method, apparatus and system |
| CN106249045A (en) * | 2016-07-14 | 2016-12-21 | 江阴长仪集团有限公司 | A kind of wide-range electric power meter and metering method thereof |
| CN106788919A (en) * | 2016-11-24 | 2017-05-31 | 中国电子科技集团公司第四十研究所 | Self adaptation cut position I/Q data real-time monitoring implementation method in a kind of gridding receiver |
| CN112134568A (en) * | 2020-09-15 | 2020-12-25 | 广州市埃信电信有限公司 | Lossy data compression and decompression method and system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101945431A (en) * | 2010-08-30 | 2011-01-12 | 京信通信系统（中国）有限公司 | Lossy data compression method and lossy data compression-based digital communication system |
| CN102065470A (en) * | 2009-11-18 | 2011-05-18 | 中兴通讯股份有限公司 | Data transmission method, device and distributed base station system |
| CN102244552A (en) * | 2010-05-13 | 2011-11-16 | 中兴通讯股份有限公司 | Method and device for transmitting and receiving data |
| CN102291773A (en) * | 2011-07-18 | 2011-12-21 | 电信科学技术研究院 | Data compression method and equipment |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8340209B2 (en) * | 2009-09-04 | 2012-12-25 | Panasonic Corporation | Method and apparatus for providing high efficiency cartesian modulation |
-
2012
- 2012-05-30 CN CN201210175639.4A patent/CN102790656B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102065470A (en) * | 2009-11-18 | 2011-05-18 | 中兴通讯股份有限公司 | Data transmission method, device and distributed base station system |
| CN102244552A (en) * | 2010-05-13 | 2011-11-16 | 中兴通讯股份有限公司 | Method and device for transmitting and receiving data |
| CN101945431A (en) * | 2010-08-30 | 2011-01-12 | 京信通信系统（中国）有限公司 | Lossy data compression method and lossy data compression-based digital communication system |
| CN102291773A (en) * | 2011-07-18 | 2011-12-21 | 电信科学技术研究院 | Data compression method and equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102790656A (en) | 2012-11-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102790656B (en) | A kind of I/Q data compression method and system | |
| CN101932002B (en) | Method for realizing matching between uplink transmission rate and downlink transmission rate as well as BBU and RRU | |
| CN102065470B (en) | Data transmission method, device and distributed base station system | |
| CN102075467B (en) | Inphase quadrature signal intelligence quotient (IQ) data compression method and device | |
| CN108134805B (en) | Data synchronous compression and reduction algorithm and device | |
| CN104378117B (en) | Data compression method and device, data transmission method and system | |
| CN103634273A (en) | Data compression transmitting and decompression method and apparatus | |
| WO2016095577A1 (en) | Data transmission method and apparatus | |
| CN105027520A (en) | Compression and de-compression of complex valued ofdm data for a radio base station | |
| KR101410249B1 (en) | data compression and decompression method between digital unit and radio unit in cloud radio access network | |
| 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 | |
| US10419161B2 (en) | Method and communications device for transmitting information | |
| CN103458460A (en) | Method and device for compressing and decompressing signal data | |
| CN102244552A (en) | Method and device for transmitting and receiving data | |
| CN108965333B (en) | Data compression method, data decompression method, data compression system, data decompression system and electronic equipment | |
| WO2014136193A1 (en) | Base station device, base station system and iq data compression method | |
| CN111416645A (en) | Precoding matrix indication method and related equipment | |
| CN112134568A (en) | Lossy data compression and decompression method and system | |
| US9831894B2 (en) | Data compression apparatus | |
| CN103812608B (en) | Method and system for compressing IQ data | |
| CN102238628A (en) | Method and device for transmitting IQ (Intelligence Quotient) data | |
| WO2018161946A1 (en) | Data processing method and device | |
| CN201898627U (en) | Digital broadband radio remote unit based on data compression | |
| WO2022057582A1 (en) | Coding method and device | |
| Yu et al. | The compression of wireless base station LTE-IR data using adaptive frequency domain floating-point coding |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20170830 Address after: 100070, No. 188, building 25, No. eighteen, South Fourth Ring Road, Fengtai District, Beijing, 1, 101 Patentee after: Beijing Haiyun Technology Co. Ltd. Address before: 510663, No. 3, color road, Science City, Guangzhou Development Zone, Guangdong Patentee before: New Post Communication Equipment Co., Ltd. |