CN108155912A - A kind of I/Q data compression retrieving algorithm and device - Google Patents
A kind of I/Q data compression retrieving algorithm and device Download PDFInfo
- Publication number
- CN108155912A CN108155912A CN201810094800.2A CN201810094800A CN108155912A CN 108155912 A CN108155912 A CN 108155912A CN 201810094800 A CN201810094800 A CN 201810094800A CN 108155912 A CN108155912 A CN 108155912A
- Authority
- CN
- China
- Prior art keywords
- data
- compressed
- value
- bits
- group
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000013144 data compression Methods 0.000 title claims abstract description 19
- 230000005540 biological transmission Effects 0.000 claims abstract description 36
- 238000007906 compression Methods 0.000 claims description 18
- 230000006835 compression Effects 0.000 claims description 18
- 238000011084 recovery Methods 0.000 claims description 3
- 238000011946 reduction process Methods 0.000 abstract description 2
- 230000009021 linear effect Effects 0.000 description 4
- 230000001360 synchronised effect Effects 0.000 description 4
- 238000006073 displacement reaction Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000006837 decompression Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000009432 framing Methods 0.000 description 1
- 238000000034 method Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
- 230000005945 translocation Effects 0.000 description 1
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The present invention provides a kind of I/Q data compression retrieving algorithm and device, the data that will be compressed are grouped, and every group includes n data, and n is positive integer；The value of maximum absolute value in this group of data is found out, takes its absolute value Mt, is set data compression as j bits, by the full scale value Mf divided by Mt of j bits, the quotient being divided by is as compressibility factor k；Data in the group are multiplied respectively with k, the data of j bits before the result interception of multiplication, obtained data are compressed data；Mt and n compressed data of data are formed into a data block and are sent into transmission channel, transmission channel is by transmission of data blocks to recipient；Recipient receives data block, takes out data Mt, and the data compressed are multiplied respectively with Mt, the data being restored after multiplication so that data compression obtains smaller, and the error vector magnitude of signal becomes smaller in reduction process.
Description
Present patent application is the hair that invention and created name is " a kind of I/Q data synchronous compression retrieving algorithm and device "
The divisional application of bright patent, applying date of original application are August in 2014 8 days, original application application No. is 201410387719.5.
Technical field
The present invention relates to data processing field more particularly to a kind of I/Q data compression retrieving algorithms and device.
Background technology
In wireless telecommunications distributed system, proximal device and remote equipment pass through wired or wirelessly carry out big
Two-way I, Q (real part, imaginary part) data transmission of amount, data are all to use binary representation.
As the standard of single device support is increasing, the frequency range of support was originally wider, number of carrier wave is more and more, need
Big data quantity requirement is transmitted to be continuously increased.Proximal device and remote equipment carry out data usually using optical fiber, cable, microwave etc.
Transmission, for example, the LTE signals of two 20M bandwidth are transmitted between far and near end, if I, Q (real part, imaginary part) data bit of transmission
Width is 14bit, needs the optical port carrying of a 2.5G；In the case where meeting performance, data are carried out with certain compression, can be subtracted
The data volume of transmission data is so as to improve the power system capacity of equipment less, and then reduces equipment cost.
The linear compression of I/Q data compression scheme being currently known and non-linear compression；Wherein non-linear compression, as JZW is pressed
Realize more complicated for compression algorithm, A rule compression algorithm etc. opposite linears compressions, more existing at present is mostly calculating data
Absolute value or performance number maximum value, the full scale maximum value of maximum value and compression goal bit wide is compared and is counted
According to compressibility factor, then data are carried out with cut position one by one and obtains compressed data, by compressibility factor and compressed data one
Rise be transmitted to receiving terminal, receiving terminal obtains translocation factor according to compressibility factor in data, by the data compressed according to displacement because
Son carry out displacement restore data, this similar compression scheme is all that data directly are truncated processing, signal is caused compared with
Big distortion, show in realization the EVM (error vector magnitude) of signal is deteriorated it is serious.
Invention content
The technical problems to be solved by the invention are：There is provided a kind of I/Q data compression retrieving algorithm and device so that data
Smaller is compressed to obtain, and the error vector magnitude of signal becomes smaller in reduction process.
In order to solve the above-mentioned technical problem, a kind of technical solution for using of the present invention for：
A kind of I/Q data synchronous compression retrieving algorithm, includes the following steps：
Step 1, the I/Q data that will be compressed are grouped, and every group includes n data, and n is positive integer；
Step 2, the value for finding out maximum absolute value in this group of data take its absolute value Mt, set data compression as j ratios
Special position, j are positive integer, and by the full scale value Mf divided by Mt of j bits, the quotient being divided by is as compressibility factor k；
Data in the group are multiplied by step 3 with k respectively, and the data of j bits, obtain before the result interception of multiplication
Data are compressed data；
Mt and n compressed data of data are formed a data block feeding transmission channel by step 4, and transmission channel will
Transmission of data blocks is to recipient；
Step 5, recipient receive data block, take out data Mt, and the data compressed are multiplied respectively with Mt, phase
The data being restored after multiplying.
Further, the step 4 is specially further：
Mt is placed on first of compressed all data, n+1 data are formed a data block and are sent into transmit and are led to
Road, transmission channel transfer data to recipient.
Further, the full scale value Mf, which is the number on j-1 bits on each bit, represents when being 1
Unsigned value.
In order to solve the above technical problem, the present invention provides another technical solution be：
A kind of I/Q data synchronous compression reduction apparatus, including following module：
Grouping module, the I/Q data that will be compressed are grouped, and every group includes n data, and n is positive integer；
Compressibility factor module finds out the value of maximum absolute value in this group of data, takes its absolute value Mt, sets data compression
For j bits, j is positive integer, and by the full scale value Mf divided by Mt of j bits, the quotient being divided by is as compressibility factor k；
Data in the group are multiplied by compression module with k respectively, and the data of j bits, obtain before the result interception of multiplication
Data be compressed data；
Mt and n compressed data of data are formed a data block and are sent into transmission channel, transmission by sending/receiving module
Channel is by transmission of data blocks to recipient；
Recovery module, recipient receive data block, take out data Mt, and the data compressed are carried out phase with Mt respectively
Multiply, the data being restored after multiplication.
Further, the sending/receiving module is specially further：
Mt is placed on first of compressed all data, n+1 data are formed a data block and are sent into transmit and are led to
Road, transmission channel transfer data to recipient.
Further, the full scale value Mf, which is the number on j-1 bits on each bit, represents when being 1
Unsigned value.
The beneficial effects of the present invention are：A kind of I/Q data synchronous compression retrieving algorithm of the present invention and device so that compression
Data smaller afterwards further reduces the quantity of transmission data, increases power system capacity, reduce equipment cost.
Description of the drawings
Fig. 1 is the method for the present invention execution flow chart.
Specific embodiment
For the technology contents that the present invention will be described in detail, the objects and the effects, below in conjunction with embodiment and coordinate attached
Figure is explained.
As shown in Figure 1, I/Q data compression retrieving algorithm of the present invention, includes the following steps：
Step 1, the I/Q data that will be compressed are grouped, and every group includes n data, and n is positive integer；
Step 2, the value for finding out maximum absolute value in this group of data take its absolute value Mt, set data compression as j ratios
Special position, j are positive integer, and by the full scale value Mf divided by Mt of j bits, the quotient being divided by is as compressibility factor k, the full scale
Value Mf is the unsigned value represented when the number on each bit is 1 on j-1 bits；
Data in the group are multiplied by step 3 with k respectively, and the data of j bits, obtain before the result interception of multiplication
Data are compressed data；
Mt and n compressed data of data are formed a data block feeding transmission channel by step 4, and transmission channel will
Transmission of data blocks is to recipient：Mt is placed on first of compressed all data, n+1 data are formed into a data block
Transmission channel is sent into, transmission channel transfers data to recipient；
Step 5, recipient receive data block, take out data Mt, and the data compressed are multiplied respectively with Mt, phase
The data being restored after multiplying.
I/Q data of the present invention compresses reduction apparatus, including following module：
Grouping module, the I/Q data that will be compressed are grouped, and every group includes n data, and n is positive integer；
Compressibility factor module finds out the value of maximum absolute value in this group of data, takes its absolute value Mt, sets data compression
For j bits, j is positive integer, and by the full scale value Mf divided by Mt of j bits, the quotient being divided by is as compressibility factor k, institute
The unsigned value that state full scale value Mf, which be number on j-1 bits on each bit, represents when being 1；
Data in the group are multiplied by compression module with k respectively, and the data of j bits, obtain before the result interception of multiplication
Data be compressed data；
Mt and n compressed data of data are formed a data block and are sent into transmission channel, transmission by sending/receiving module
Channel is by transmission of data blocks to recipient：Mt is placed on first of compressed all data, n+1 data are formed one
Data block is sent into transmission channel, and transmission channel transfers data to recipient；
Recovery module, recipient receive data block, take out data Mt, and the data compressed are carried out phase with Mt respectively
Multiply, the data being restored after multiplication.
Specific embodiment is as follows：
The data that will be compressed are grouped, and every group of data bulk is N number of after grouping, and the value of N can be according to practical feelings
Condition selects, and time delay that can transmit signaling mode, requirement is selected, and wherein N is positive integer.
Seek data maximum value in a packet：A temporary variable TMP is defined, is starting to count each data
TMP is zeroed out when block, calculate the absolute value of data one by one and is compared with TMP, if the data absolute value is more than
The data absolute value is then substituted TMP current values by TMP value, and no person TMP keeps initial value, at the end of entire data block comparison, TMP
Value be the grouped data maximum absolute value value Tmax.
Seek compressibility factor：The maximum value of the data of transmission bit wide divided by previous step calculate after definition is compressed
Tmax obtains compressibility factor K, defined in compress after transmission bit wide data the wide deduction sign bit of maximum value transmitted data bits
The unsigned value represented when all bits are all 1 afterwards, such as compressed transmitted bit are 7 bits, are transmitted after this compression
The maximum value of the data of bit wide be binary one 11111, i.e., metric 63.
Compressed data：Data in grouping are multiplied by compressibility factor one by one successively, the result after multiplication is cut from left to right
Take the data of setting bit wide, the data being compressed with；
Framing transmits：Tmax absolute values are placed on first data, are then sequentially placed compressed N number of data, form N
The data block of+1 data, by the transmission of data blocks of N+1 data composition to receiving module；
Receive decompression data：First data of data block of the N+1 length received are taken out, respectively with N later
A data are multiplied, and the data of multiplication are truncated, N number of data after being decompressed.
The invention has the advantages that：A kind of I/Q data compression retrieving algorithm of the present invention and device so that compressed number
According to smaller, the quantity of transmission data is further reduced, power system capacity is increased, reduces equipment cost.
The foregoing is merely the embodiment of the present invention, are not intended to limit the scope of the invention, every to utilize this hair
The equivalents that bright specification and accompanying drawing content are made directly or indirectly are used in relevant technical field, similarly include
In the scope of patent protection of the present invention.
Claims (6)
1. a kind of I/Q data compresses retrieving algorithm, which is characterized in that includes the following steps：
Step 1, the I/Q data that will be compressed are grouped, and every group includes n data, and n is positive integer；
Step 2, for every group of data, find out the value of maximum absolute value in this group of data, take its absolute value Mt, set data pressure
J bits are condensed to, j is positive integer, and by the full scale value Mf divided by Mt of j bits, the quotient being divided by is as compressibility factor k；
Data in the group are multiplied by step 3 with k respectively, the data of j bits, obtained data before the result interception of multiplication
As compressed data；
Data Mt and n compressed data are formed a data block and are sent into transmission channels by step 4, and transmission channel is by data
Block is transferred to recipient；
Step 5, recipient receive data block, data Mt are taken out, and the data compressed are multiplied respectively with Mt, after multiplication
The data being restored.
2. a kind of I/Q data compression retrieving algorithm according to claim 1, which is characterized in that the step 4 further has
Body is：
Mt is placed on first of compressed all data, n+1 data are formed a data block is sent into transmission channel, passes
Defeated channel transfers data to recipient.
3. a kind of I/Q data compression retrieving algorithm according to claim 1, which is characterized in that the full scale value Mf is j-
The unsigned value that number on 1 bit on each bit represents when being 1.
4. a kind of I/Q data compresses reduction apparatus, which is characterized in that including following module：
Grouping module, the I/Q data that will be compressed are grouped, and every group includes n data, and n is positive integer；
Compressibility factor module for every group of data, finds out the value of maximum absolute value in this group of data, takes its absolute value Mt, setting
It is j bits by data compression, j is positive integer, and by the full scale value Mf divided by Mt of j bits, the quotient being divided by is as pressure
Contracting factor k；
Data in the group are multiplied by compression module with k respectively, the data of j bits, obtained number before the result interception of multiplication
According to as compressed data；
Mt and n compressed data of data are formed a data block and are sent into transmission channel, transmission channel by sending/receiving module
Transfer data to recipient；
Recovery module, recipient receive data block, take out data Mt, and the data compressed are multiplied respectively with Mt, phase
The data being restored after multiplying.
5. a kind of I/Q data compression reduction apparatus according to claim 4, which is characterized in that the sending/receiving module into
One step is specially：
Mt is placed on first of compressed all data, n+1 data are formed a data block is sent into transmission channel, passes
Defeated channel transfers data to recipient.
6. a kind of I/Q data compression reduction apparatus according to claim 4, which is characterized in that the full scale value Mf is j-
The unsigned value that number on 1 bit on each bit represents when being 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810094800.2A CN108155912B (en) | 2014-08-08 | 2014-08-08 | IQ data compression and reduction algorithm and device |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410387719.5A CN104135452B (en) | 2014-08-08 | 2014-08-08 | A kind of I/Q data synchronous compression retrieving algorithm and device |
| CN201810094800.2A CN108155912B (en) | 2014-08-08 | 2014-08-08 | IQ data compression and reduction algorithm and device |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410387719.5A Division CN104135452B (en) | 2014-08-08 | 2014-08-08 | A kind of I/Q data synchronous compression retrieving algorithm and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108155912A true CN108155912A (en) | 2018-06-12 |
| CN108155912B CN108155912B (en) | 2021-04-13 |
Family
ID=51807976
Family Applications (4)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810095577.3A Active CN108134805B (en) | 2014-08-08 | 2014-08-08 | Data synchronous compression and reduction algorithm and device |
| CN201810094798.9A Active CN108134804B (en) | 2014-08-08 | 2014-08-08 | Data compression algorithm and device |
| CN201810094800.2A Active CN108155912B (en) | 2014-08-08 | 2014-08-08 | IQ data compression and reduction algorithm and device |
| CN201410387719.5A Active CN104135452B (en) | 2014-08-08 | 2014-08-08 | A kind of I/Q data synchronous compression retrieving algorithm and device |
Family Applications Before (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810095577.3A Active CN108134805B (en) | 2014-08-08 | 2014-08-08 | Data synchronous compression and reduction algorithm and device |
| CN201810094798.9A Active CN108134804B (en) | 2014-08-08 | 2014-08-08 | Data compression algorithm and device |
Family Applications After (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410387719.5A Active CN104135452B (en) | 2014-08-08 | 2014-08-08 | A kind of I/Q data synchronous compression retrieving algorithm and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (4) | CN108134805B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108965333A (en) * | 2018-08-30 | 2018-12-07 | 北京锐安科技有限公司 | A kind of data compression, decompression method, system and electronic equipment |
| CN109512425A (en) * | 2019-01-09 | 2019-03-26 | 大悦创新（苏州）医疗科技股份有限公司 | Compression, the method and apparatus for decompressing myoelectricity data |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105763287B (en) * | 2014-12-16 | 2019-12-03 | 中兴通讯股份有限公司 | Data transmission method and device |
| WO2016191987A1 (en) | 2015-05-29 | 2016-12-08 | 华为技术有限公司 | 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 |
| CN106304190A (en) * | 2016-07-28 | 2017-01-04 | 武汉虹信通信技术有限责任公司 | A kind of CPRI interface data compression transmitting method and system |
| CN107961034A (en) * | 2016-10-19 | 2018-04-27 | 北京东软医疗设备有限公司 | The method and device for the treatment of channel data |
| CN109769255B (en) * | 2018-12-21 | 2020-11-06 | 京信通信系统（中国）有限公司 | Data compression method and device, computer equipment and storage medium |
| CN112134568A (en) * | 2020-09-15 | 2020-12-25 | 广州市埃信电信有限公司 | Lossy data compression and decompression method and system |
| CN114629502B (en) * | 2022-03-21 | 2022-11-22 | 和睿沐康(成都)医疗科技有限公司 | Method, device, system and medium for compressing, uploading and decompressing sampled data |
| CN118101091B (en) * | 2024-04-28 | 2024-08-02 | 杭州捷孚电子技术有限公司 | Adaptive signal processing method and system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102075467A (en) * | 2010-12-17 | 2011-05-25 | 中兴通讯股份有限公司 | Inphase quadrature signal intelligence quotient (IQ) data compression method and device |
| CN102790656A (en) * | 2012-05-30 | 2012-11-21 | 新邮通信设备有限公司 | Method and system for compressing IQ data |
| CN103634273A (en) * | 2012-08-21 | 2014-03-12 | 电信科学技术研究院 | Data compression transmitting and decompression method and apparatus |
| CN102821072B (en) * | 2011-06-08 | 2017-02-08 | 中兴通讯股份有限公司 | Sending method, receiving method, sending system, receiving system, sending device and receiving device for IQ (In-phase quadrature) data |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH0774985B2 (en) * | 1989-11-22 | 1995-08-09 | インターナショナル・ビジネス・マシーンズ・コーポレーション | Data compression system |
| WO2001093525A2 (en) * | 2000-05-26 | 2001-12-06 | Citrix Systems, Inc. | Method and system for efficiently reducing graphical display data for transmission over a low bandwidth transport protocol mechanism |
| US8290782B2 (en) * | 2008-07-24 | 2012-10-16 | Dts, Inc. | Compression of audio scale-factors by two-dimensional transformation |
| CN102215199A (en) * | 2010-04-09 | 2011-10-12 | 电信科学技术研究院 | In-phase/quadrature (IQ) data transmission method and device |
| CN102244552A (en) * | 2010-05-13 | 2011-11-16 | 中兴通讯股份有限公司 | Method and device for transmitting and receiving data |
| CN102055974B (en) * | 2010-10-14 | 2013-04-17 | 华为技术有限公司 | Data compressing and uncompressing method, data compressing and uncompressing device and data compressing and uncompressing system |
| CN102790999B (en) * | 2011-05-19 | 2016-07-27 | 中兴通讯股份有限公司 | A kind of data compression, transmission, reception and decompression method and related device |
| CN102843720B (en) * | 2011-06-24 | 2017-03-22 | 中兴通讯股份有限公司 | Method, device and system for compressing and uncompressing data in distributed base station system |
| CN103458460B (en) * | 2012-05-31 | 2017-04-12 | 国际商业机器公司 | Method and device for compressing and decompressing signal data |
| CN103312336A (en) * | 2013-06-28 | 2013-09-18 | 京信通信系统（中国）有限公司 | Data compression method and device |
| CN103812608B (en) * | 2013-12-26 | 2017-04-26 | 西安交通大学 | Method and system for compressing IQ data |
-
2014
- 2014-08-08 CN CN201810095577.3A patent/CN108134805B/en active Active
- 2014-08-08 CN CN201810094798.9A patent/CN108134804B/en active Active
- 2014-08-08 CN CN201810094800.2A patent/CN108155912B/en active Active
- 2014-08-08 CN CN201410387719.5A patent/CN104135452B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102075467A (en) * | 2010-12-17 | 2011-05-25 | 中兴通讯股份有限公司 | Inphase quadrature signal intelligence quotient (IQ) data compression method and device |
| CN102821072B (en) * | 2011-06-08 | 2017-02-08 | 中兴通讯股份有限公司 | 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 |
| CN103634273A (en) * | 2012-08-21 | 2014-03-12 | 电信科学技术研究院 | Data compression transmitting and decompression method and apparatus |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108965333A (en) * | 2018-08-30 | 2018-12-07 | 北京锐安科技有限公司 | A kind of data compression, decompression method, system and electronic equipment |
| CN108965333B (en) * | 2018-08-30 | 2021-02-19 | 北京锐安科技有限公司 | Data compression method, data decompression method, data compression system, data decompression system and electronic equipment |
| CN109512425A (en) * | 2019-01-09 | 2019-03-26 | 大悦创新（苏州）医疗科技股份有限公司 | Compression, the method and apparatus for decompressing myoelectricity data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104135452A (en) | 2014-11-05 |
| CN104135452B (en) | 2018-05-01 |
| CN108134804A (en) | 2018-06-08 |
| CN108134804B (en) | 2021-03-09 |
| CN108155912B (en) | 2021-04-13 |
| CN108134805A (en) | 2018-06-08 |
| CN108134805B (en) | 2021-04-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104135452B (en) | A kind of I/Q data synchronous compression retrieving algorithm and device | |
| CN103458460B (en) | Method and device for compressing and decompressing signal data | |
| EP2890076B1 (en) | Method and device for data compression, transmission, and decompression | |
| CN102790656B (en) | A kind of I/Q data compression method and system | |
| CN105763287B (en) | Data transmission method and device | |
| CN104429007B (en) | For handling digital data frames and transmission frame to reduce the method and device of transmission bandwidth | |
| GB201119224D0 (en) | Methods and network devices for communicating data packets | |
| US11765086B2 (en) | Wireless traffic optimization for ISM radios | |
| CN103312336A (en) | Data compression method and device | |
| WO2021072953A1 (en) | Data compression method and apparatus, and computer device and computer-readable storage medium | |
| CN106452972A (en) | Method and device for acquiring data packet delay time | |
| 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 | |
| WO2014136193A1 (en) | Base station device, base station system and iq data compression method | |
| US9831894B2 (en) | Data compression apparatus | |
| US7342902B2 (en) | Two stage loss-less compressor for a clear channel over a packet network | |
| US8489665B2 (en) | Communication apparatus, method of checking received data size, multiple determining circuit, and multiple determination method | |
| CN108599891A (en) | Coding method, code device and communication device | |
| CN104320810B (en) | A kind of head compression method, device and decompression method, device | |
| WO2020130421A3 (en) | Method and apparatus for performing dual header compression schemes in wireless communication system | |
| EP3284174A1 (en) | Improved compression and/or encryption of a file | |
| CN109257145A (en) | D2D cooperation transmission process optimization method and apparatus towards RLNC auxiliary | |
| CN109379376B (en) | Radio monitoring equipment and system based on data compression and data compression method | |
| CN117768233B (en) | Telnet protocol-based server state query method and medium | |
| EP3284175A1 (en) | Improved compression and/or encryption of a file | |
| CN103686864A (en) | Bilateral optimization method for mobile network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address |
Address after: 350000 Building 28, Fuzhou Software Park C, 89 Software Avenue, Gulou District, Fuzhou City, Fujian Province Patentee after: Ankexun (Fujian) Technology Co.,Ltd. Address before: 350400 Tongpan Road Software Avenue, Gulou District, Fuzhou City, Fujian Province, No. 89 Software Park Industrial Base, Area C, 28 Patentee before: FUJIAN SUNNADA NETWORK TECHNOLOGY Co.,Ltd. |
|
| CP03 | Change of name, title or address |