CN117294397B - Wireless communication data storage method and system - Google Patents

Wireless communication data storage method and system Download PDF

Info

Publication number
CN117294397B
CN117294397B CN202311587174.8A CN202311587174A CN117294397B CN 117294397 B CN117294397 B CN 117294397B CN 202311587174 A CN202311587174 A CN 202311587174A CN 117294397 B CN117294397 B CN 117294397B
Authority
CN
China
Prior art keywords
data
new
sequence
target
target 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
Application number
CN202311587174.8A
Other languages
Chinese (zh)
Other versions
CN117294397A (en
Inventor
张国政
张国栋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Zhengdongxing Communications Equipment Co ltd
Original Assignee
Shenzhen Zhengdongxing Communications Equipment Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shenzhen Zhengdongxing Communications Equipment Co ltd filed Critical Shenzhen Zhengdongxing Communications Equipment Co ltd
Priority to CN202311587174.8A priority Critical patent/CN117294397B/en
Publication of CN117294397A publication Critical patent/CN117294397A/en
Application granted granted Critical
Publication of CN117294397B publication Critical patent/CN117294397B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/0001Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0015Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the adaptation strategy
    • H04L1/0016Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the adaptation strategy involving special memory structures, e.g. look-up tables
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/0001Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0006Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format
    • H04L1/0007Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format by modifying the frame length
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045Arrangements at the receiver end
    • H04L1/0052Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables
    • H04L1/0053Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables specially adapted for power saving
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE 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/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

The invention relates to the technical field of data processing, in particular to a wireless communication data storage method and system, comprising the following steps: and acquiring a communication data sequence and a new communication data sequence, in the new communication data sequence, marking any data with the same data value as target data, acquiring the updating degree of the target data, obtaining the adjustment possibility of the target data according to the distribution of the target data in the new communication data sequence, marking the data sequence formed by the communication data sequence and the new communication data sequence as a total data sequence, acquiring the updating frequency of the data with the same data value in the total data sequence, obtaining the compressed data of the total data sequence by using a Huffman coding algorithm, and storing the compressed data in a database. The invention improves the coding efficiency of the Huffman coding algorithm by self-adapting the occurrence frequency of each data, thereby reducing the energy consumption, the network pressure and the occupied computing resources in the wireless communication data storage process.

Description

Wireless communication data storage method and system
Technical Field
The invention relates to the technical field of data processing, in particular to a wireless communication data storage method and system.
Background
Wireless communication data storage has become one of the key elements in the information technology and communication fields. With the development of the internet of things, the popularization of 5G networks and the increasing demand for big data analysis, the demand for efficient, scalable and secure data storage methods is also increasing. Huffman coding is widely used in wireless communications for data compression storage to reduce the bandwidth requirements of data transmission. By mapping frequently occurring data symbols to shorter codes and less frequently occurring data symbols to longer codes, huffman coding may significantly reduce the size of the data, thereby reducing the energy consumption of data transmission.
The existing problems are as follows: whenever new wireless communication data is introduced, the conventional huffman coding needs to reconstruct the coding tree and the coding table, which further causes additional computational complexity and delay, and reduces the efficiency of data compression, thereby causing more occupied computational resources, increased energy consumption and increased network pressure in the wireless communication data storage process.
Disclosure of Invention
The invention provides a wireless communication data storage method and a wireless communication data storage system, which are used for solving the existing problems.
The invention relates to a wireless communication data storage method and a system, which adopt the following technical scheme:
one embodiment of the present invention provides a wireless communication data storage method, including the steps of:
acquiring wireless communication data in any period of time to obtain a communication data sequence; after the period of time, wireless communication data in any other period of time are sequentially collected to obtain a new communication data sequence; in the new communication data sequence, any data with the same data value is recorded as target data; obtaining the updating degree of the target data according to the occurrence times of the target data in the new communication data sequence and the communication data sequence;
obtaining the continuity degree and the periodicity degree of the target data according to the distribution of the target data in the new communication data sequence;
the average value of the continuity degree and the period degree of the target data is recorded as the adjustment possibility of the target data;
according to the time sequence, the data sequence formed by the communication data sequence and the new communication data sequence is recorded as a total data sequence; obtaining the update frequency of the data with the same data value in the total data sequence according to the occurrence times of the data with the same data value in the total data sequence, the adjustment possibility and the update degree of the data with the same data value in the new communication data sequence;
in the total data sequence, according to the update frequency of the data with the same data value of all kinds, carrying out data compression processing by using a Huffman coding algorithm to obtain compressed data of the total data sequence; the compressed data of the total data sequence is stored in a database of wireless communication data.
Further, the step of obtaining the update degree of the target data according to the occurrence times of the target data in the new communication data sequence and the communication data sequence comprises the following specific steps:
dividing the occurrence frequency of the target data by the data quantity in the new communication data sequence, and recording the occurrence frequency of the target data in the new communication data sequence;
dividing the occurrence frequency of the target data by the data quantity in the communication data sequence, and recording the occurrence frequency of the target data in the communication data sequence;
and obtaining the updating degree of the target data according to the difference of the occurrence frequency of the target data in the new communication data sequence and the communication data sequence.
Further, according to the difference of the occurrence frequency of the target data in the new communication data sequence and the communication data sequence, a specific calculation formula corresponding to the update degree of the target data is obtained as follows:
wherein P is the update degree of the target data, a is the data quantity in the new communication data sequence, n is the occurrence number of the target data in the new communication data sequence, b is the data quantity in the communication data sequence,is the number of occurrences of the target data in the communication data sequence.
Further, the obtaining the continuity degree and the periodicity degree of the target data according to the distribution of the target data in the new communication data sequence comprises the following specific steps:
a data sequence segment formed by continuously adjacent target data in the new communication data sequence is marked as a target sequence segment;
obtaining the continuity degree of the target data according to the data quantity in all the target sequence segments;
recording data which is not target data in the new communication data sequence as reference data;
in the new communication data sequence, the number of reference data between any two adjacent target sequence segments is recorded as the interval between the two adjacent target sequence segments;
and obtaining the periodic degree of the target data according to the intervals of all the adjacent target sequence segments.
Further, the specific calculation formula corresponding to the continuity degree of the target data is obtained according to the data quantity in all the target sequence segments:
where L is the degree of continuity of the target data, k is the number of target sequence segments,for the data quantity in the jth target sequence segment,/->Is a linear normalization function.
Further, the specific calculation formula corresponding to the cycle degree of the target data is obtained according to the intervals of all adjacent target sequence segments:
where U is the degree of periodicity of the target data, k is the number of target sequence segments,for the interval of the jth and j+1th target sequence segments, +.>Is a linear normalization function, and is an absolute value function.
Further, the step of obtaining the update frequency of the data with the same data value in the total data sequence according to the occurrence times of the data with the same data value in the total data sequence, the adjustment possibility and the update degree of the data with the same data value in the new communication data sequence, includes the following specific steps:
recording any data with the same data value in the total data sequence as new target data;
dividing the occurrence frequency of the new target data by the number of data in the total data sequence, and recording the frequency of the new occurrence frequency of the new target data;
and obtaining the update frequency of the new target data according to the adjustment possibility and the update degree of the data with the same data value in the new communication data sequence and the new occurrence frequency of the new target data.
Further, the step of obtaining the update frequency of the new target data according to the adjustment possibility and the update degree of the data with the same data value in the new communication data sequence and the new occurrence frequency of the new target data comprises the following specific steps:
if the new communication data sequence does not contain the new target data, marking the new occurrence frequency of the new target data as the update frequency of the new target data;
and if the new target data exists in the new communication data sequence, obtaining the update frequency of the new target data according to the adjustment possibility, the update degree and the new occurrence frequency of the new target data.
Further, if new target data exists in the new communication data sequence, the update frequency of the new target data is obtained according to the adjustment possibility, the update degree and the new occurrence frequency of the new target data, and the method comprises the following specific steps:
when the adjustment possibility of the new target data is larger than a preset judgment threshold value, calculating a sum value of the adjustment possibility of the new target data and one, and recording a product of the sum value and the update degree of the new target data as an adjustment value of the new target data;
the sum of the adjustment value of the new target data and the new occurrence frequency of the new target data is recorded as the update frequency of the new target data;
and when the adjustment possibility of the new target data is smaller than or equal to a preset judgment threshold value, recording the new occurrence frequency of the new target data as the update frequency of the new target data.
The invention also provides a wireless communication data storage system, which comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the processor executes the computer program stored in the memory to realize the steps of the wireless communication data storage method.
The technical scheme of the invention has the beneficial effects that:
in the embodiment of the invention, a communication data sequence and a new communication data sequence are acquired, any data with the same data value is recorded as target data in the new communication data sequence, and the updating degree of the target data is obtained according to the occurrence times of the target data in the new communication data sequence and the communication data sequence. And obtaining the adjustment possibility of the target data according to the distribution of the target data in the new communication data sequence. The data sequence formed by the communication data sequence and the new communication data sequence is recorded as a total data sequence, and the update frequency of the data with the same data value in the total data sequence is obtained according to the occurrence times of the data with the same data value in the total data sequence, the adjustment possibility and the update degree of the data with the same data value in the new communication data sequence, and the update and the adjustment of the data occurrence frequency are completed by carrying out statistics and prediction on the data, so that the synchronous dynamic adjustment effect of the coding table along with the dynamic change of the wireless communication data is realized, and the compression efficiency and the adaptability of the data are improved. And performing data compression processing by using a Huffman coding algorithm to obtain compressed data of the total data sequence, and storing the compressed data into a database of wireless communication data. The invention improves the coding efficiency of the Huffman coding algorithm by self-adapting the occurrence frequency of each data, thereby reducing the energy consumption, the network pressure and the occupied computing resource in the wireless communication data storage process.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flowchart illustrating steps of a method for storing wireless communication data according to the present invention.
Detailed Description
In order to further describe the technical means and effects adopted by the present invention to achieve the preset purpose, the following detailed description refers to specific implementation, structure, characteristics and effects of a wireless communication data storage method and system according to the present invention with reference to the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" means that the embodiments are not necessarily the same. Furthermore, the particular features, structures, or characteristics of one or more embodiments may be combined in any suitable manner.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
The following specifically describes a specific scheme of a wireless communication data storage method and system provided by the present invention with reference to the accompanying drawings.
Referring to fig. 1, a flowchart illustrating steps of a method for storing wireless communication data according to an embodiment of the present invention is shown, the method includes the steps of:
step S001: acquiring wireless communication data in any period of time to obtain a communication data sequence; after the period of time, wireless communication data in any other period of time are sequentially collected to obtain a new communication data sequence; in the new communication data sequence, any data with the same data value is recorded as target data; and obtaining the updating degree of the target data according to the occurrence times of the target data in the new communication data sequence and the communication data sequence.
And acquiring wireless communication data in any period of time to obtain a communication data sequence. And after the period of time, sequentially collecting wireless communication data in any other period of time to obtain a new communication data sequence.
What needs to be described is: wireless communication data is typically received from data information using a cell phone or computer device. The communication data sequence is historical data, which has undergone huffman coding, and the new communication data sequence is new data collected immediately after the communication data sequence, and the huffman coding process is performed by combining the communication data sequence to obtain a huffman coding table.
In the process of storing wireless communication data, the data is dynamic, so that the coding table can be updated by a certain amount of data frequency, future data occurrence frequency prediction analysis is carried out on the quantitative data, the possibility of the data occurrence frequency in the future is determined through the continuity and periodicity of the quantitative data, and the coding table is adjusted by the data with high possibility of part of the data occurrence frequency, so that the adaptive updating and adjustment of the Huffman coding table are achieved.
The frequency of occurrence of the current newly added quantitative data statistics is compared with the data in the historical data, and when the occupation ratio of the newly added quantitative data statistics exceeds the data in the historical data, the coding table is updated.
One of the bases for updating the huffman coding table in this embodiment is that the frequency of data changes, and if the frequency of certain data increases or decreases significantly, the coding can be updated accordingly, so as to ensure that the data with high frequency can obtain shorter coding.
In the new communication data sequence, any data with the same data value is recorded as target data. The calculation formula of the update degree P of the target data is thus:
wherein P is the update degree of the target data, a is the data quantity in the new communication data sequence, n is the occurrence number of the target data in the new communication data sequence, b is the data quantity in the communication data sequence,is the number of occurrences of the target data in the communication data sequence.
What needs to be described is: dataThe number of occurrences of the target data in the sequence is the number of target data in the data sequence,for the frequency of occurrence of the target data in the new communication data sequence,/for the target data in the new communication data sequence>For the frequency of occurrence of the target data in the communication data sequence,/->Minus->The larger the difference of (c) is, the more the Huffman coding table should be adjusted in time. When->When the frequency of the new data is larger than that of the new data, the Huffman coding table needs to be dynamically adjusted for the condition that the frequency of the new data is increased. When->When the frequency of the new data is smaller than that of the new data, the new data is not adjusted, so that P is set to be 0, the adjustment value of the frequency of the subsequent target data is set to be 0, and the purpose of no adjustment is achieved.
Step S002: and obtaining the continuity degree and the periodicity degree of the target data according to the distribution of the target data in the new communication data sequence.
According to the embodiment, the frequency of the data appearing in the data is predicted and analyzed, and the updated coding table is adjusted to a certain degree to enable the data with high frequency to obtain shorter codes, so that the overall compression efficiency is improved. In this embodiment, prediction of future data may be performed by performing a pre-judgment analysis on the occurrence of subsequent data through the continuity and periodicity of the data, and adjusting the encoding table through the continuity and periodicity of the data newly added at present.
The higher the continuity of the data, the better the probability of its subsequent occurrence can be considered for the continuity and periodicity of the data, since this indicates a high probability of being non-isolated data; meanwhile, with respect to periodicity, according to the index position of the data, if the difference of the intervals of the index positions corresponding to the data is more consistent, the periodicity is better, the probability of the data appearing in the subsequent data is considered to be better, because the probability of the data being non-isolated data is high.
In the new communication data sequence, a data sequence segment formed by continuously and adjacently occurring target data is recorded as a target sequence segment.
What needs to be described is: if none of the adjacent data of a certain target data is the target data, the target data is also a target sequence segment, and the length of the sequence segment is 1.
The calculation formula of the continuity L of the target data is known as follows:
where L is the degree of continuity of the target data, k is the number of target sequence segments,is the data amount in the jth target sequence segment. />Normalizing the data values to [0,1 ] as a linear normalization function]Within the interval.
What needs to be described is: the normalized value of the product of the number of times of continuous occurrence of the target data and the length of continuous occurrence is used for representing the continuous degree of the target data, and the greater the continuous degree is, the greater the possibility that the target data is non-isolated data is indicated, and the greater the possibility that the target data is predicted to occur in the future is indicated.
In the new communication data sequence, data that is not target data is referred to as reference data.
In the new communication data sequence, the number of reference data between any two adjacent target sequence segments is recorded as the interval between the two adjacent target sequence segments.
The calculation formula of the cycle degree U of the target data can be known as follows:
where U is the degree of periodicity of the target data, k is the number of target sequence segments,is the interval between the jth and jth+1th target sequence segments. />Normalizing the data values to [0,1 ] as a linear normalization function]Within the interval. I is an absolute function.
What needs to be described is:and the inverse proportion normalized value of the sum of the differences of all the intervals and the average value of the intervals is used for representing the cycle degree of the target data. The smaller the difference between each interval and its mean value, the stronger its periodicity, so the larger the U value, the stronger its periodicity, i.e., the higher the probability that the data appears in a periodic manner, the greater the probability that the data appears in the future by prediction. The value of U is known to be 0 to 1, when k is 1, only one target sequence segment exists, so that the target data has no periodicity, and at the moment, the U is set to be the minimum value of 0.
Step S003: and (5) recording the average value of the continuity degree and the periodicity degree of the target data as the adjustment possibility of the target data.
The data continuity and periodicity are respectively used for carrying out analysis and prediction on the possibility of occurrence of future data, so that the data continuity and periodicity can be combined, the future data occurrence can be comprehensively analyzed and predicted, and the subsequent adjustment of the coding table is facilitated.
The calculation formula of the adjustment possibility W of the target data is known as follows:
wherein W is the adjustment possibility of the target data, L is the continuity degree of the target data, and U is the periodicity degree of the target data.
What needs to be described is: l and U are normalized values, and dimensional differences are eliminated, so that the average value of L and U is used for representing the adjustment possibility of target data. The larger the W value, the greater the likelihood that future target data will appear through prediction, the more should its frequency in the encoding table be adjusted, ensuring that data of higher frequency can be encoded shorter.
In the above manner, the adjustment possibility of the data with the same value for each data in the new communication data sequence is obtained.
Step S004: according to the time sequence, the data sequence formed by the communication data sequence and the new communication data sequence is recorded as a total data sequence; and obtaining the update frequency of the data with the same data value in the total data sequence according to the occurrence times of the data with the same data value in the total data sequence, the adjustment possibility and the update degree of the data with the same data value in the new communication data sequence.
The frequency of the data with high occurrence probability in the coding table is adjusted, so that the aim of enabling the data with high occurrence frequency to correspond to shorter codes is fulfilled by dynamically adjusting the data coding table.
The data sequence formed by the communication data sequence and the new communication data sequence is recorded as a total data sequence according to the time sequence.
In the total data sequence, any data with the same data value is recorded as new target data.
In the total data sequence, the number of occurrences of the new target data divided by the number of data in the total data sequence is recorded as the new occurrence frequency of the new target data.
The judgment threshold set in this embodiment is 0.2, which is described as an example, and other values may be set in other embodiments, and this embodiment is not limited thereto.
And if the new target data does not exist in the new communication data sequence, marking the new occurrence frequency of the new target data as the update frequency of the new target data.
If new target data exists in the new communication data sequence, when the adjustment possibility of the new target data is smaller than or equal to the judgment threshold value 0.2, marking the new occurrence frequency of the new target data as the update frequency of the new target data.
What needs to be described is: when new target data does not exist in the new communication data sequence or the new target data exists, but the adjustment possibility is smaller than or equal to the judgment threshold value of 0.2, the new target data is indicated not to appear in the currently acquired data, or the adjustment possibility is smaller and is insufficient as a standard for predicting and adjusting future data, so that the appearance frequency of the new target data is unchanged, and the consequences of no increase and no decrease of compression efficiency caused by over prediction of the data are avoided.
If new target data exists in the new communication data sequence, when the adjustment possibility of the new target data is larger than the judgment threshold value 0.2, the update frequency of the new target dataThe calculation formula of (2) is as follows:
wherein the method comprises the steps ofFor the update frequency of the new target data, +.>For the new frequency of occurrence of new target data, +.>For the update degree of the new target data +.>The adjustment possibility for the new target data.
What needs to be described is:the larger the adjustment value representing the new target data, the higher the frequency of the new target data appearing in the following and the possibility of the new target data appearing in the future, so that the new frequency of the new target data needs to be increased so as to reduce the coding length of the Huffman coding and improve the overall coding efficiency, therefore ++>Adding toRepresenting the update frequency of the new target data.
In the above manner, the update frequency of the data with the same value of each data in the total data sequence is obtained.
Step S005: in the total data sequence, according to the update frequency of the data with the same data value of all kinds, carrying out data compression processing by using a Huffman coding algorithm to obtain compressed data of the total data sequence; the compressed data of the total data sequence is stored in a database of wireless communication data.
And in the total data sequence, according to the update frequency of the data with the same data value of all kinds, carrying out data compression processing by using a Huffman coding algorithm to obtain compressed data of the total data sequence. The huffman coding algorithm is a known technique, and a specific method is not described here.
The compressed data of the total data sequence is stored in a database of wireless communication data.
The present invention has been completed.
In summary, in the embodiment of the present invention, the communication data sequence and the new communication data sequence are collected, in the new communication data sequence, any data with the same data value is recorded as the target data, and the update degree of the target data is obtained according to the occurrence times of the target data in the new communication data sequence and the communication data sequence. And obtaining the adjustment possibility of the target data according to the distribution of the target data in the new communication data sequence. And recording a data sequence formed by the communication data sequence and the new communication data sequence as a total data sequence, and obtaining the update frequency of the data with the same data value in the total data sequence according to the occurrence times of the data with the same data value in the total data sequence, the adjustment possibility and the update degree of the data with the same data value in the new communication data sequence. And performing data compression processing by using a Huffman coding algorithm to obtain compressed data of the total data sequence, and storing the compressed data into a database of wireless communication data. The invention improves the coding efficiency of the Huffman coding algorithm by self-adapting the occurrence frequency of each data, thereby reducing the energy consumption, the network pressure and the occupied computing resources in the wireless communication data storage process.
The invention also provides a wireless communication data storage system, which comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the processor executes the computer program stored in the memory to realize the steps of the wireless communication data storage method.
The above description is only of the preferred embodiments of the present invention and is not intended to limit the invention, but any modifications, equivalent substitutions, improvements, etc. within the principles of the present invention should be included in the scope of the present invention.

Claims (7)

1. A method of wireless communication data storage, the method comprising the steps of:
acquiring wireless communication data in any period of time to obtain a communication data sequence; after the period of time, wireless communication data in any other period of time are sequentially collected to obtain a new communication data sequence; in the new communication data sequence, any data with the same data value is recorded as target data; obtaining the updating degree of the target data according to the occurrence times of the target data in the new communication data sequence and the communication data sequence;
obtaining the continuity degree and the periodicity degree of the target data according to the distribution of the target data in the new communication data sequence;
the average value of the continuity degree and the period degree of the target data is recorded as the adjustment possibility of the target data;
according to the time sequence, the data sequence formed by the communication data sequence and the new communication data sequence is recorded as a total data sequence; obtaining the update frequency of the data with the same data value in the total data sequence according to the occurrence times of the data with the same data value in the total data sequence, the adjustment possibility and the update degree of the data with the same data value in the new communication data sequence;
in the total data sequence, according to the update frequency of the data with the same data value of all kinds, carrying out data compression processing by using a Huffman coding algorithm to obtain compressed data of the total data sequence; storing the compressed data of the total data sequence in a database of wireless communication data;
the method for obtaining the update frequency of the data with the same data value in the total data sequence according to the occurrence times of the data with the same data value in the total data sequence, the adjustment possibility and the update degree of the data with the same data value in the new communication data sequence, comprises the following specific steps:
recording any data with the same data value in the total data sequence as new target data;
dividing the occurrence frequency of the new target data by the number of data in the total data sequence, and recording the frequency of the new occurrence frequency of the new target data;
obtaining the update frequency of the new target data according to the adjustment possibility and update degree of the data with the same data value in the new communication data sequence and the new occurrence frequency of the new target data;
the method for obtaining the update frequency of the new target data according to the adjustment possibility and the update degree of the data with the same data value in the new communication data sequence and the new occurrence frequency of the new target data comprises the following specific steps:
if the new communication data sequence does not contain the new target data, marking the new occurrence frequency of the new target data as the update frequency of the new target data;
if new target data exists in the new communication data sequence, obtaining the update frequency of the new target data according to the adjustment possibility, the update degree and the new occurrence frequency of the new target data;
if new target data exists in the new communication data sequence, the update frequency of the new target data is obtained according to the adjustment possibility, the update degree and the new occurrence frequency of the new target data, and the method comprises the following specific steps:
when the adjustment possibility of the new target data is larger than a preset judgment threshold value, calculating a sum value of the adjustment possibility of the new target data and one, and recording a product of the sum value and the update degree of the new target data as an adjustment value of the new target data;
the sum of the adjustment value of the new target data and the new occurrence frequency of the new target data is recorded as the update frequency of the new target data;
and when the adjustment possibility of the new target data is smaller than or equal to a preset judgment threshold value, recording the new occurrence frequency of the new target data as the update frequency of the new target data.
2. The method for storing wireless communication data according to claim 1, wherein the step of obtaining the update degree of the target data according to the occurrence times of the target data in the new communication data sequence and the communication data sequence comprises the following specific steps:
dividing the occurrence frequency of the target data by the data quantity in the new communication data sequence, and recording the occurrence frequency of the target data in the new communication data sequence;
dividing the occurrence frequency of the target data by the data quantity in the communication data sequence, and recording the occurrence frequency of the target data in the communication data sequence;
and obtaining the updating degree of the target data according to the difference of the occurrence frequency of the target data in the new communication data sequence and the communication data sequence.
3. The method for storing wireless communication data according to claim 2, wherein the specific calculation formula corresponding to the update degree of the target data is obtained according to the difference of the occurrence frequency of the target data in the new communication data sequence and the communication data sequence:
wherein P is the update degree of the target data, a is the data quantity in the new communication data sequence, n is the occurrence number of the target data in the new communication data sequence, b is the data quantity in the communication data sequence,is the number of occurrences of the target data in the communication data sequence.
4. The method for storing wireless communication data according to claim 1, wherein the step of obtaining the continuity and periodicity of the target data according to the distribution of the target data in the new communication data sequence comprises the following steps:
a data sequence segment formed by continuously adjacent target data in the new communication data sequence is marked as a target sequence segment;
obtaining the continuity degree of the target data according to the data quantity in all the target sequence segments;
recording data which is not target data in the new communication data sequence as reference data;
in the new communication data sequence, the number of reference data between any two adjacent target sequence segments is recorded as the interval between the two adjacent target sequence segments;
and obtaining the periodic degree of the target data according to the intervals of all the adjacent target sequence segments.
5. The method for storing wireless communication data according to claim 4, wherein the specific calculation formula corresponding to the continuity degree of the target data is obtained according to the data quantity in all the target sequence segments:
where L is the degree of continuity of the target data, k is the number of target sequence segments,for the data quantity in the jth target sequence segment,/->Is a linear normalization function.
6. The method for storing wireless communication data according to claim 4, wherein the specific calculation formula corresponding to the periodicity degree of the target data obtained according to the intervals of all adjacent target sequence segments is:
where U is the degree of periodicity of the target data, k is the number of target sequence segments,for the interval of the jth and j+1th target sequence segments, +.>Is a linear normalization function, and is an absolute value function.
7. A wireless communication data storage system comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the computer program when executed by the processor performs the steps of a wireless communication data storage method as claimed in any one of claims 1 to 6.
CN202311587174.8A 2023-11-27 2023-11-27 Wireless communication data storage method and system Active CN117294397B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311587174.8A CN117294397B (en) 2023-11-27 2023-11-27 Wireless communication data storage method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311587174.8A CN117294397B (en) 2023-11-27 2023-11-27 Wireless communication data storage method and system

Publications (2)

Publication Number Publication Date
CN117294397A CN117294397A (en) 2023-12-26
CN117294397B true CN117294397B (en) 2024-02-20

Family

ID=89257537

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311587174.8A Active CN117294397B (en) 2023-11-27 2023-11-27 Wireless communication data storage method and system

Country Status (1)

Country Link
CN (1) CN117294397B (en)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1995019662A1 (en) * 1994-01-13 1995-07-20 Telco Systems, Inc. Data compression apparatus and method
CN112968751A (en) * 2021-01-27 2021-06-15 伊之密机器人自动化科技(苏州)有限公司 Industrial time sequence data compression method and system
CN114096959A (en) * 2019-07-15 2022-02-25 微软技术许可有限责任公司 Time series data compression and graphical signature analysis
CN116153453A (en) * 2023-04-20 2023-05-23 深圳市魔样科技有限公司 Intelligent ring information management method and system based on cloud edge cooperation
CN116151740A (en) * 2023-04-21 2023-05-23 北京明苑风华文化传媒有限公司 Inventory transaction data process safety management system and cloud platform
CN116505955A (en) * 2023-06-30 2023-07-28 深圳市思拓通信系统有限公司 Method for monitoring and managing health state of disk use
CN116681036A (en) * 2023-08-02 2023-09-01 天津轻工职业技术学院 Industrial data storage method based on digital twinning
CN116702708A (en) * 2023-08-04 2023-09-05 陕西交通电子工程科技有限公司 Road pavement construction data management system

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1995019662A1 (en) * 1994-01-13 1995-07-20 Telco Systems, Inc. Data compression apparatus and method
CN114096959A (en) * 2019-07-15 2022-02-25 微软技术许可有限责任公司 Time series data compression and graphical signature analysis
CN112968751A (en) * 2021-01-27 2021-06-15 伊之密机器人自动化科技(苏州)有限公司 Industrial time sequence data compression method and system
CN116153453A (en) * 2023-04-20 2023-05-23 深圳市魔样科技有限公司 Intelligent ring information management method and system based on cloud edge cooperation
CN116151740A (en) * 2023-04-21 2023-05-23 北京明苑风华文化传媒有限公司 Inventory transaction data process safety management system and cloud platform
CN116505955A (en) * 2023-06-30 2023-07-28 深圳市思拓通信系统有限公司 Method for monitoring and managing health state of disk use
CN116681036A (en) * 2023-08-02 2023-09-01 天津轻工职业技术学院 Industrial data storage method based on digital twinning
CN116702708A (en) * 2023-08-04 2023-09-05 陕西交通电子工程科技有限公司 Road pavement construction data management system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
民用GPS数据准无损压缩算法;任维政;徐连明;邓中亮;;《数据采集与处理》;第25卷(第02期);第245-249页 *

Also Published As

Publication number Publication date
CN117294397A (en) 2023-12-26

Similar Documents

Publication Publication Date Title
CN111401552B (en) Federal learning method and system based on batch size adjustment and gradient compression rate adjustment
CN116681036B (en) Industrial data storage method based on digital twinning
EP4350527A1 (en) Data compression method and apparatus, and computing device and storage medium
CN115599757A (en) Data compression method and device, computing equipment and storage system
CN111866518B (en) Self-adaptive three-dimensional point cloud compression method based on feature extraction
CN117097810B (en) Data center transmission optimization method based on cloud computing
CN115269526B (en) Method and system for processing semiconductor production data
CN116610265B (en) Data storage method of business information consultation system
CN111199740A (en) Unloading method for accelerating automatic voice recognition task based on edge calculation
CN104023216B (en) Face video compression method
CN108764458B (en) Method and system for reducing storage space consumption and calculation amount of mobile equipment
CN117294397B (en) Wireless communication data storage method and system
CN105120276A (en) Adaptive Motion JPEG coding method and system
CN116934487B (en) Financial clearing data optimal storage method and system
CN117097906B (en) Method and system for efficiently utilizing regional medical resources
CN112702600B (en) Image coding and decoding neural network layered fixed-point method
CN116524941A (en) Self-adaptive quantization compression method and system for voice model and electronic equipment
CN100518323C (en) Method for performing matching compression to image using rotary compressed codebook
CN115913248A (en) Live broadcast software development data intelligent management system
Xu et al. Low complexity rate-adaptive deep joint source channel coding for wireless image transmission using tensor-train decomposition
CN116644783A (en) Model training method, object processing method and device, electronic equipment and medium
CN114096006A (en) Resource allocation and data compression joint optimization method in mobile edge computing system
CN112906640A (en) Space-time situation prediction method and device based on deep learning and readable storage medium
CN117880767B (en) Short message data transmission method with low delay
CN113726342B (en) Segmented difference compression and inert decompression method for large-scale graph iterative computation

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