CN108134805B - Data synchronous compression and reduction algorithm and device - Google Patents
Data synchronous compression and reduction algorithm and device Download PDFInfo
- Publication number
- CN108134805B CN108134805B CN201810095577.3A CN201810095577A CN108134805B CN 108134805 B CN108134805 B CN 108134805B CN 201810095577 A CN201810095577 A CN 201810095577A CN 108134805 B CN108134805 B CN 108134805B
- Authority
- CN
- China
- Prior art keywords
- data
- value
- compressed
- group
- tmp
- 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
Images
Abstract
The invention provides a method and a device for synchronously compressing and restoring data, wherein the data to be compressed are grouped, each group comprises n data, and n is a positive integer; finding out the maximum absolute value in the group of data, taking the absolute value Mt, setting the data to be compressed into j bit, dividing the full-scale value Mf of the j bit by Mt, and taking the divided quotient as a compression factor k; multiplying the data in the group by k respectively, and intercepting the data of the front j bits by the multiplication result to obtain the data which is compressed data; forming a data block by the data Mt and the n compressed data and sending the data block to a transmission channel, and transmitting the data block to a receiver by the transmission channel; and the receiving party receives the data block, takes out the data Mt, multiplies the compressed data by the Mt respectively to obtain recovered data after multiplication, so that the data are compressed to be smaller, and the error vector amplitude of the signal becomes smaller in the reduction process.
Description
The patent application of the invention is a divisional application of an invention patent named 'IQ data synchronous compression and reduction algorithm and device', the application date of the original application is 2014, 8 and 8, and the application number of the original application is 201410387719.5.
Technical Field
The invention relates to the field of data processing, in particular to a data synchronous compression and reduction algorithm and a device.
Background
In a wireless communication distribution system, a near-end device and a far-end device perform a great amount of bidirectional I, Q (real part and imaginary part) data transmission in a wired or wireless mode, and the data are all represented by binary.
With the increasing system supported by a single device, the original wider frequency band supported by the device, and the increasing number of carriers, the requirement for transmitting large data volume is increased continuously. The near-end device and the far-end device generally use optical fiber, cable, microwave, etc. for data transmission, for example, two LTE signals with 20M bandwidth are transmitted between the far end and the near end, if the bit width of transmitted I, Q (real part, imaginary part) data is 14bit, a 2.5G optical interface is required for carrying; under the condition of meeting the performance, the data is compressed to a certain extent, so that the data volume of the transmitted data can be reduced, the system capacity of the equipment is improved, and the equipment cost is reduced.
The currently known IQ data compression schemes have linear compression and nonlinear compression; the non-linear compression, such as JZW compression algorithm, a law compression algorithm, etc., is relatively complex to realize in terms of linear compression, most of the existing methods are to calculate the absolute value of data or the maximum value of a power value, compare the maximum value with the full-scale maximum value of a compression target bit width to obtain a data compression factor, then truncate the data one by one to obtain compressed data, transmit the compression factor and the compressed data to a receiving end together, the receiving end obtains a shift factor in the data according to the compression factor, and shifts the compressed data according to the shift factor to recover the data.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: a data synchronous compression and reduction algorithm and a device are provided, so that data is compressed to be smaller, and the error vector magnitude of signals in the reduction process becomes smaller.
In order to solve the technical problems, the invention adopts a technical scheme that:
a data synchronous compression and reduction algorithm comprises the following steps:
step 1, grouping IQ data to be compressed, wherein each group comprises n data, and n is a positive integer;
step 2, finding out the maximum absolute value in the group of data, taking the absolute value Mt, setting the data to be compressed into j bit, wherein j is a positive integer, dividing the full-scale value Mf of the j bit by Mt, and taking the divided quotient as a compression factor k;
step 3, multiplying the data in the group by k respectively, and intercepting the data of the front j bits by the multiplication result to obtain the data which is compressed data;
step 4, forming a data block by the data Mt and the n compressed data and sending the data block to a transmission channel, and transmitting the data block to a receiver by the transmission channel;
and 5, receiving the data block by the receiving party, taking out the data Mt, multiplying the compressed data by the Mt respectively, and multiplying to obtain the recovered data.
Further, the step 4 is further specifically:
and (3) placing the Mt at the first bit of all the compressed data, forming a data block by n +1 data, and sending the data block to a transmission channel, wherein the transmission channel transmits the data to a receiving party.
Further, the full scale value Mf is an unsigned value represented when the number of each bit on the j-1 bit is 1.
In order to solve the above technical problems, another technical solution provided by the present invention is:
a data synchronous compression reduction device comprises the following modules:
the grouping module is used for grouping IQ data to be compressed, each group comprises n data, and n is a positive integer;
the compression factor module finds out the maximum absolute value in the group of data, takes the absolute value Mt of the maximum absolute value, sets the compression of the data into j bit positions, wherein j is a positive integer, divides the full-scale value Mf of the j bit positions by Mt, and takes the divided quotient as a compression factor k;
the compression module multiplies the data in the group by k respectively, and the result of the multiplication intercepts the data of the front j bits, so that the obtained data is compressed data;
the transmitting and receiving module is used for forming a data block by the data Mt and the n compressed data and transmitting the data block to a transmission channel, and the transmission channel transmits the data block to a receiving party;
and the recovery module is used for receiving the data block by the receiver, taking out the data Mt, multiplying the compressed data by the Mt respectively, and multiplying the multiplied data to obtain recovered data.
Further, the sending and receiving module is further specifically:
and (3) placing the Mt at the first bit of all the compressed data, forming a data block by n +1 data, and sending the data block to a transmission channel, wherein the transmission channel transmits the data to a receiving party.
Further, the full scale value Mf is an unsigned value represented when the number of each bit on the j-1 bit is 1.
The invention has the beneficial effects that: the algorithm and the device for synchronously compressing and restoring the data enable the compressed data to be smaller, further reduce the quantity of transmitted data, increase the system capacity and reduce the equipment cost.
Drawings
FIG. 1 is a flow chart of the method of the present invention.
Detailed Description
In order to explain technical contents, achieved objects, and effects of the present invention in detail, the following description is made with reference to the accompanying drawings in combination with the embodiments.
As shown in fig. 1, the data synchronous compression and reduction algorithm of the present invention includes the following steps:
step 1, grouping IQ data to be compressed, wherein each group comprises n data, and n is a positive integer;
step 2, finding out the maximum absolute value in the group of data, taking the absolute value Mt, setting the data to be compressed into j bit positions, wherein j is a positive integer, dividing the full scale value Mf of the j bit positions by Mt, and taking the divided quotient as a compression factor k, and the full scale value Mf is an unsigned numerical value represented when the number of each bit position on j-1 bit positions is 1;
step 3, multiplying the data in the group by k respectively, and intercepting the data of the front j bits by the multiplication result to obtain the data which is compressed data;
and 4, forming a data block by the data Mt and the n compressed data and sending the data block to a transmission channel, wherein the transmission channel transmits the data block to a receiver: placing Mt at the first position of all the compressed data, forming n +1 data into a data block and sending the data block to a transmission channel, and transmitting the data to a receiving party by the transmission channel;
and 5, receiving the data block by the receiving party, taking out the data Mt, multiplying the compressed data by the Mt respectively, and multiplying to obtain the recovered data.
The invention relates to a data synchronous compression and reduction device, which comprises the following modules:
the grouping module is used for grouping IQ data to be compressed, each group comprises n data, and n is a positive integer;
the compression factor module is used for finding out the maximum absolute value in the group of data, taking the absolute value Mt of the maximum absolute value, setting the compression of the data into j bit positions, wherein j is a positive integer, dividing the full-scale range value Mf of the j bit positions by Mt, and taking the divided quotient as a compression factor k, and the full-scale range value Mf is an unsigned numerical value represented when the number of each bit position on j-1 bit positions is 1;
the compression module multiplies the data in the group by k respectively, and the result of the multiplication intercepts the data of the front j bits, so that the obtained data is compressed data;
the sending and receiving module is used for forming a data block by the data Mt and the n compressed data and sending the data block to the transmission channel, and the transmission channel transmits the data block to the receiving party: placing Mt at the first position of all the compressed data, forming n +1 data into a data block and sending the data block to a transmission channel, and transmitting the data to a receiving party by the transmission channel;
and the recovery module is used for receiving the data block by the receiver, taking out the data Mt, multiplying the compressed data by the Mt respectively, and multiplying the multiplied data to obtain recovered data.
The specific embodiment is as follows:
the data to be compressed are grouped, the number of each group of data after grouping is N, the value of N can be selected according to the actual situation, and can be selected according to the transmission signal system and the required time delay, wherein N is a positive integer.
Finding the maximum absolute value of the data in a data packet: defining a temporary variable TMP, clearing the TMP when beginning to count each data block, calculating the absolute value of the data one by one and comparing the absolute value with the TMP, if the absolute value of the data is greater than the TMP value, replacing the current value of the TMP with the absolute value of the data, and if the absolute value of the data is not greater than the TMP value, keeping the original value of the TMP, and when the comparison of the whole data block is finished, the value of the TMP is the maximum value Tmax of the absolute value of the grouped data.
And (3) solving a compression factor: dividing the maximum value of the data defining the transmission bit width after compression by Tmax calculated in the previous step to obtain a compression factor K, where all bits of the maximum value of the data defining the transmission bit width after compression are unsigned values represented when the sign bit is subtracted from the transmission data bit width, for example, the transmission bits after compression are 7 bits, and the maximum value of the data defining the transmission bit width after compression is binary 111111, that is, decimal 63.
Compressing data: multiplying the data in the packet by compression factors one by one in sequence, and intercepting the data with set bit width from left to right of the multiplied result to obtain compressed data;
framing transmission: placing the absolute value of Tmax in the first data, then sequentially placing the compressed N data to form data blocks of N +1 data, and transmitting the data blocks formed by the N +1 data to a receiving module;
receiving the decompressed data: and taking out the first data of the received data block with the length of N +1, multiplying the first data by the next N data respectively, and truncating the multiplied data to obtain the N decompressed data.
The invention has the following advantages: the algorithm and the device for synchronously compressing and restoring the data enable the compressed data to be smaller, further reduce the quantity of transmitted data, increase the system capacity and reduce the equipment cost.
The above description is only an embodiment of the present invention, and not intended to limit the scope of the present invention, and all equivalent changes made by using the contents of the present specification and the drawings, or applied directly or indirectly to the related technical fields, are included in the scope of the present invention.
Claims (6)
1. A data synchronous compression reduction algorithm is characterized by comprising the following steps:
step 1, grouping IQ data to be compressed, wherein each group comprises n data, and n is a positive integer;
step 2, for each group of data, finding out the maximum absolute value of the group of data, taking the absolute value Mt of the maximum absolute value, setting the data to be compressed into j bit positions, wherein j is a positive integer, dividing the full-scale value Mf of the j bit positions by Mt, and taking the divided quotient as a compression factor k;
step 3, multiplying the data in the group by k respectively, and intercepting the data of the front j bits by the multiplication result to obtain the data which is compressed data;
step 4, forming a data block by the data Mt and the n compressed data and sending the data block to a transmission channel, and transmitting the data block to a receiver by the transmission channel;
step 5, the receiving party receives the data block, takes out the data Mt, multiplies the compressed data by the Mt respectively, and obtains the recovered data after multiplication;
wherein, the finding out the maximum absolute value in the group of data in the step 2 specifically includes: defining a temporary variable TMP, clearing the TMP when the group of data is counted, calculating absolute values of the data one by one and comparing the absolute values with the TMP, replacing the current value of the TMP with the absolute value of the data if the absolute value of the data is greater than the TMP value, otherwise, keeping the original value of the TMP, and when the group of data is compared, determining the value of the TMP as the maximum value of the absolute value in the group of data.
2. The algorithm for synchronous compression and recovery of data according to claim 1, wherein the step 4 is further embodied as:
and (3) placing the Mt at the first bit of all the compressed data, forming a data block by n +1 data, and sending the data block to a transmission channel, wherein the transmission channel transmits the data to a receiving party.
3. The algorithm according to claim 1, wherein the full scale value Mf is an unsigned value represented when the number of each bit in the j-1 bits is 1.
4. The device for synchronously compressing and restoring the data is characterized by comprising the following modules:
the grouping module is used for grouping IQ data to be compressed, each group comprises n data, and n is a positive integer;
the compression factor module is used for finding out the maximum absolute value in the group of data for each group of data, taking the absolute value Mt of the maximum absolute value, setting the compression of the data into j bit positions, wherein j is a positive integer, dividing the full-scale value Mf of the j bit positions by Mt, and taking the divided quotient as a compression factor k;
the compression module multiplies the data in the group by k respectively, and the result of the multiplication intercepts the data of the front j bits, so that the obtained data is compressed data;
the transmitting and receiving module is used for forming a data block by the data Mt and the n compressed data and transmitting the data block to a transmission channel, and the transmission channel transmits the data to a receiving party;
the recovery module is used for receiving the data block by the receiver, taking out the data Mt, multiplying the compressed data by the Mt respectively, and obtaining recovered data after multiplication;
wherein, finding out the maximum absolute value in the group of data in the compression factor module specifically includes: defining a temporary variable TMP, clearing the TMP when the group of data is counted, calculating absolute values of the data one by one and comparing the absolute values with the TMP, replacing the current value of the TMP with the absolute value of the data if the absolute value of the data is greater than the TMP value, otherwise, keeping the original value of the TMP, and when the group of data is compared, determining the value of the TMP as the maximum value of the absolute value in the group of data.
5. The apparatus for synchronous compression and recovery of data according to claim 4, wherein the sending and receiving module is further specifically:
and (3) placing the Mt at the first bit of all the compressed data, forming a data block by n +1 data, and sending the data block to a transmission channel, wherein the transmission channel transmits the data to a receiving party.
6. The apparatus according to claim 4, wherein the full scale value Mf is an unsigned value represented when the number of each bit in the j-1 bits is 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810095577.3A CN108134805B (en) | 2014-08-08 | 2014-08-08 | Data synchronous compression and reduction algorithm and device |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810095577.3A CN108134805B (en) | 2014-08-08 | 2014-08-08 | Data synchronous compression and reduction algorithm and device |
| CN201410387719.5A CN104135452B (en) | 2014-08-08 | 2014-08-08 | A kind of I/Q data synchronous compression retrieving 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 |
|---|---|
| CN108134805A CN108134805A (en) | 2018-06-08 |
| CN108134805B true CN108134805B (en) | 2021-04-30 |
Family
ID=51807976
Family Applications (4)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| 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 |
| CN201810094798.9A Active CN108134804B (en) | 2014-08-08 | 2014-08-08 | Data compression algorithm and device |
| CN201810095577.3A Active CN108134805B (en) | 2014-08-08 | 2014-08-08 | Data synchronous compression and reduction algorithm and device |
Family Applications Before (3)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| 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 |
| CN201810094798.9A Active CN108134804B (en) | 2014-08-08 | 2014-08-08 | Data compression algorithm and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (4) | CN108155912B (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105763287B (en) * | 2014-12-16 | 2019-12-03 | 中兴通讯股份有限公司 | Data transmission method 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 |
| 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 |
| CN108965333B (en) * | 2018-08-30 | 2021-02-19 | 北京锐安科技有限公司 | Data compression method, data decompression method, data compression system, data decompression system and electronic equipment |
| CN109769255B (en) * | 2018-12-21 | 2020-11-06 | 京信通信系统（中国）有限公司 | Data compression method and device, computer equipment and storage medium |
| CN109512425A (en) * | 2019-01-09 | 2019-03-26 | 大悦创新（苏州）医疗科技股份有限公司 | Compression, the method and apparatus for decompressing myoelectricity data |
| 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 |
Citations (2)
| 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 |
| CN102215199A (en) * | 2010-04-09 | 2011-10-12 | 电信科学技术研究院 | In-phase/quadrature (IQ) data transmission method and device |
Family Cites Families (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH0774985B2 (en) * | 1989-11-22 | 1995-08-09 | インターナショナル・ビジネス・マシーンズ・コーポレーション | Data compression system |
| AU2001274972A1 (en) * | 2000-05-26 | 2001-12-11 | 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 |
| 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 |
| 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 |
| CN102843720B (en) * | 2011-06-24 | 2017-03-22 | 中兴通讯股份有限公司 | Method, device and system for compressing and uncompressing data in distributed base station system |
| CN102790656B (en) * | 2012-05-30 | 2015-10-28 | 新邮通信设备有限公司 | A kind of I/Q data compression method and system |
| CN103458460B (en) * | 2012-05-31 | 2017-04-12 | 国际商业机器公司 | Method and device for compressing and decompressing signal data |
| CN103634273A (en) * | 2012-08-21 | 2014-03-12 | 电信科学技术研究院 | Data compression transmitting and decompression method and apparatus |
| 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 CN201810094800.2A patent/CN108155912B/en active Active
- 2014-08-08 CN CN201410387719.5A patent/CN104135452B/en active Active
- 2014-08-08 CN CN201810094798.9A patent/CN108134804B/en active Active
- 2014-08-08 CN CN201810095577.3A patent/CN108134805B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102215199A (en) * | 2010-04-09 | 2011-10-12 | 电信科学技术研究院 | In-phase/quadrature (IQ) data transmission method and device |
| CN102075467A (en) * | 2010-12-17 | 2011-05-25 | 中兴通讯股份有限公司 | Inphase quadrature signal intelligence quotient (IQ) data compression method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108134804B (en) | 2021-03-09 |
| CN108134805A (en) | 2018-06-08 |
| CN104135452B (en) | 2018-05-01 |
| CN104135452A (en) | 2014-11-05 |
| CN108155912A (en) | 2018-06-12 |
| CN108134804A (en) | 2018-06-08 |
| CN108155912B (en) | 2021-04-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108134805B (en) | Data synchronous compression and reduction algorithm and device | |
| EP2890076B1 (en) | Method and device for data compression, transmission, and decompression | |
| CN102790656B (en) | A kind of I/Q data compression method and system | |
| CN103458460B (en) | Method and device for compressing and decompressing signal data | |
| CN103546402B (en) | Signal sending method, device and system | |
| EP3065324A1 (en) | Method and device for processing signal sampling-point data | |
| CN105763287B (en) | Data transmission method and device | |
| GB201119224D0 (en) | Methods and network devices for communicating data packets | |
| CN108599820A (en) | The extensive mimo system channel estimation methods of matching pursuit algorithm are sampled based on block structure self-adapting compressing | |
| 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 | |
| SG11201908821QA (en) | Method and device for transmitting uplink demodulation reference signal | |
| US9831894B2 (en) | Data compression apparatus | |
| CN103888146B (en) | A kind of method of data compression, device and communication equipment | |
| CN103620979B (en) | The sending, receiving method of a kind of channel condition information and device | |
| CN103812608B (en) | Method and system for compressing IQ data | |
| KR101428154B1 (en) | Apparatus and methods using an efficient golay correlator running at 1.5 the sampling rate in wireless communication systems | |
| CN101594321B (en) | Method and device for channel prediction | |
| WO2020130421A3 (en) | Method and apparatus for performing dual header compression schemes in wireless communication system | |
| CN107295568B (en) | Data compression method and system based on probability statistics in TD-LTE | |
| Yu et al. | The compression of wireless base station LTE-IR data using adaptive frequency domain floating-point coding | |
| CN103607610A (en) | Method and system for data transmission in cloud terminal system | |
| KR101307401B1 (en) | Transmission Module for Mobile Communication Network Capable of Low Fixed Delay and No Loss Compression | |
| RU2327284C1 (en) | Data receipt and transmission method | |
| CN102170297A (en) | PN (pseudo noise) offset obtaining device and method for CDMA (code division multiple access) system | |
| MX2023000721A (en) | Transport block size determination. |
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 | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 350000 Building 28, Fuzhou Software Park C, 89 Software Avenue, Gulou District, Fuzhou City, Fujian Province Applicant 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 Applicant before: FUJIAN SUNNADA NETWORK TECHNOLOGY Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |