CN114244757A - Method for rapidly analyzing bit stream protocol data - Google Patents
Method for rapidly analyzing bit stream protocol data Download PDFInfo
- Publication number
- CN114244757A CN114244757A CN202111546091.5A CN202111546091A CN114244757A CN 114244757 A CN114244757 A CN 114244757A CN 202111546091 A CN202111546091 A CN 202111546091A CN 114244757 A CN114244757 A CN 114244757A
- Authority
- CN
- China
- Prior art keywords
- bit stream
- data
- bit
- byte
- stream 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/18—Protocol analysers
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Abstract
The disclosed embodiment relates to a method for rapidly parsing bit stream protocol data. The method comprises the following steps: constructing a variant feature code sequence according to the original feature code; analyzing bit stream protocol data frame by frame, comparing each frame of bit stream data byte by byte with the variation characteristic code sequence, and determining variation characteristic code position and bit offset; and parsing and restoring the bit stream data byte by byte according to the bit offset. According to the data coding characteristics, the variation characteristic code sequence is reconstructed in a mode of expanding the original characteristic code, bitwise calculation search is optimized to byte-wise comparison search, heavy bitwise calculation process is eliminated, and bit offset of original bit stream data can be rapidly given according to the position of the sequence of the variation characteristic code.
Description
Technical Field
The embodiment of the disclosure relates to the technical field of measurement and numerical control, in particular to a method for rapidly analyzing bit stream protocol data.
Background
The parsing and restoring of the bit stream protocol data requires two-dimensional searching of the position of the feature code and the bit offset. The original method adopts multi-pass one-dimensional search, calculates and searches the feature codes from the data head according to bit offset of 0 to 7 in sequence, has huge calculation amount and search amount and extremely low efficiency, and seriously restricts the improvement of data processing efficiency.
Accordingly, there is a need to ameliorate one or more of the problems with the related art solutions described above.
It is noted that this section is intended to provide a background or context to the disclosure as recited in the claims. The description herein is not admitted to be prior art by inclusion in this section.
Disclosure of Invention
An object of the embodiments of the present disclosure is to provide a method for fast parsing of bitstream protocol data, thereby overcoming, at least to some extent, one or more of the problems due to the limitations and disadvantages of the related art.
According to an embodiment of the present disclosure, a method for fast parsing bit stream protocol data is provided, where the method includes:
constructing a variant feature code sequence according to the original feature code;
analyzing the bit stream protocol data frame by frame, comparing each frame of bit stream data byte by byte with the variation characteristic code sequence, and determining the position and bit offset of the variation characteristic code;
and analyzing and restoring the bit stream data of each frame byte by byte according to the bit offset.
In an embodiment of the disclosure, the process of constructing the bit shift sequence of the variant feature code includes:
and sequentially left-shifting the original feature code according to the displacement amount of 0 to 7 bits to obtain a feature code displacement sequence, and selecting the next-lowest byte of the feature code displacement sequence to obtain the variant feature code sequence.
In an embodiment of the present disclosure, the raw feature code has at least 2 bytes.
In an embodiment of the present disclosure, determining the variant signature position and the bit offset includes:
the original feature codes are repeatedly arranged at fixed intervals, and after any one of the variant feature codes in the variant feature code sequence is found in the bit stream data, bytes at positions 1 time and 2 times the interval behind the variant feature code in the bit stream data are taken for repeatability verification;
after the position of the variation characteristic code is determined, calculating the bit offset, taking bit stream data of two bytes before and after the variation characteristic code, and reducing the variation characteristic code according to the bit stream data of the three bytes;
and comparing and verifying the reduction result with the original feature code.
In an embodiment of the disclosure, parsing and restoring the bitstream data byte by byte for each frame includes:
and restoring each frame of the bit stream data byte by byte, outputting complete byte data after bit offset correction of the bit stream data, recording bit information of less than 1 byte of the bit information, and splicing with the bit stream data of the next frame after analysis and restoration.
In an embodiment of the disclosure, the calculating the bit offset process includes:
the variant feature code sequence has a corresponding bit offset sequence, and the bit offset is obtained by searching the position of the feature code in the variant feature code sequence.
In an embodiment of the present disclosure, the method further includes:
and decoding the current frame bit stream data according to the bit offset of the previous frame bit stream data, searching the original feature code and repeatedly verifying.
In an embodiment of the present disclosure, if the repeatability is verified correctly, the bit offset of the current frame of bit stream data is consistent with the remaining bit length of the previous frame of bit stream data, and the splicing data of the frame end of the previous frame of bit stream data and the frame head of the current frame of bit stream data is output.
In an embodiment of the present disclosure, if the repeatability verification is incorrect, the variation signature position and the bit offset search are performed again, and the bit offset of the current frame bitstream data is recorded.
In an embodiment of the present disclosure, when the verification is incorrect, the method further includes:
restoring the current frame bit stream data to obtain complete byte data after bit offset correction of the current frame bit stream data, detecting whether the sum of the lengths of the head of the current frame bit stream data after analysis and restoration and the tail of the previous frame bit stream data after analysis and restoration is 8, outputting the byte if the sum is 8, otherwise, discarding all the bytes.
The technical scheme provided by the embodiment of the disclosure can have the following beneficial effects:
in the embodiment of the disclosure, by the bit stream protocol data fast parsing method, the variation feature code sequence is reconstructed by adopting a mode of expanding the original feature code according to the data coding characteristics, the bitwise calculation search is optimized to the byte-wise comparison search, the heavy bitwise calculation process is eliminated, and the bit offset of the original data can be fast given according to the position of the sequence of the variation feature code.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure. It is to be understood that the drawings in the following description are merely exemplary of the disclosure, and that other drawings may be derived from those drawings by one of ordinary skill in the art without the exercise of inventive faculty.
FIG. 1 illustrates a diagram of steps of a bitstream protocol data fast parsing method according to the present disclosure;
FIG. 2 is a schematic diagram of a variant signature structure;
FIG. 3 illustrates a two-dimensional search and correctness verification diagram of the present disclosure;
fig. 4 shows a bitstream protocol data parsing output flow diagram of the present disclosure.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
Furthermore, the drawings are merely schematic illustrations of embodiments of the disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus their repetitive description will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities.
The present exemplary embodiment first provides a method for fast parsing bitstream protocol data. Referring to fig. 1, the bitstream protocol data fast parsing method may include: step S101 to step S103.
Step S101: constructing a variant feature code sequence according to the original feature code;
step S102: dividing bit stream protocol data into a plurality of frames of bit stream data, comparing each frame of bit stream data with the variant feature code sequence byte by byte, and determining the position and bit offset of the variant feature code;
step S103: and analyzing and restoring the streaming data byte by byte according to the bit offset.
According to the bit stream protocol data rapid analysis method, the original feature code is expanded according to the data coding characteristics, the variation feature code sequence is reconstructed, the bitwise calculation search is optimized to the byte-wise comparison search, the heavy bitwise calculation process is eliminated, and the bit offset of the original data can be rapidly given according to the position of the sequence of the variation feature code.
Hereinafter, each step of the above-described bitstream protocol data fast parsing method in the present exemplary embodiment will be described in more detail with reference to fig. 1 to 4.
Step S101: and constructing a variant feature code sequence according to the original feature code.
In an embodiment of the present disclosure, the raw feature code has at least 2 bytes.
Specifically, if the original feature code has only 1 byte, because data after each feature code is inconsistent, the shift sequence of the obtained feature code is not fixed after left shift, and thus a variant feature code cannot be obtained; when the original feature code has two or more bytes, the original feature code is shifted to the left 8 times, and the second lowest byte of the obtained feature code displacement sequence is only formed by the offset of the last two bytes of the original feature code and only has 8 fixed bytes, so that the next lowest byte can be used as the variant feature code.
In one embodiment, the original feature code is left-shifted in sequence according to a shift amount of 0 to 7 bits to obtain a feature code shift sequence, and the next-lowest byte of the feature code shift sequence is selected to obtain the variant feature code sequence.
Specifically, the original feature code is shifted left for 8 times in order according to 0 to 7 bits to obtain 8 different feature codes, and a feature code shift sequence is formed, because the original feature code is at least two bytes, the next-lower byte of the obtained feature code shift sequence is only formed by shifting the last two bytes of the original feature code, and only has 8 fixed bytes, and the selected area shifts the next-lower byte, namely the last-but-second byte, of the feature code shift sequence to obtain 8 different variant feature codes, and the variant feature code sequence is formed.
Step S102: analyzing the bit stream protocol data frame by frame, comparing each frame of bit stream data byte by byte with the variation characteristic code sequence, and determining the position and bit offset of the variation characteristic code.
In one embodiment, determining the variant signature position and the bit offset comprises: the original feature codes are repeatedly arranged at fixed intervals, and after any one of the variant feature codes in the variant feature code sequence is found in the bit stream data, bytes at positions 1 time and 2 times the interval behind the variant feature code in the bit stream data are taken for repeatability verification; after the position of the variation characteristic code is determined, calculating the bit offset, taking bit stream data of two bytes before and after the variation characteristic code, and reducing the variation characteristic code according to the bit stream data of the three bytes; and comparing and verifying the reduction result with the original feature code.
Specifically, after the variation feature code is found by comparing each frame of bit stream data byte by byte with the variation feature code in the variation feature code sequence one by one, using the characteristic of feature code fixed interval repetition, taking the bytes at 1 time of the interval and 2 times of the interval after the found variation feature code position for repeatability verification, and if the verification is wrong, continuing to compare the bit stream data with the variation feature code; if the verification is correct, the position of the feature code is proved to be correct, then bit stream data of two bytes before and after the found variation feature code is taken, the feature code of the two bytes is restored from the second byte according to (the current bit stream byte > > bit offset) | (the previous bit stream byte < (8-bit offset)) in sequence according to the bit stream data of the three bytes, the restored result is compared with the original feature code, if the comparison is correct, the bit offset is correct, and if the comparison fails, the bit stream data is continuously compared with the variation feature code until the verification is correct.
Step S103: and analyzing and restoring the streaming data byte by byte according to the bit offset.
In one embodiment, the parsing the bitstream data byte by byte for restoration comprises: and after restoring the bit stream data byte by byte, outputting complete byte data after bit offset correction of the bit stream data, recording bit information of less than 1 byte remained, and splicing with the bit stream data of the next frame after analysis and restoration.
Specifically, according to the measurement and control data transmission integrated protocol, bit stream data is filled into a data field with an indefinite length and is transmitted in frames, which may cause the last valid byte of single-frame carried bit stream data to be possibly segmented, so that residual bits need to be retained and spliced with the next frame data after parsing and restoring to be output, and data loss is avoided.
In one embodiment, said calculating said bit offset process comprises: the variant signature sequence has a corresponding bit offset sequence, and the bit offset is obtained by searching the position of the variant signature sequence by the signature.
Specifically, all the variant feature codes in the variant feature code sequence correspond to a bit offset, so that a bit offset sequence can be formed, and after the variant feature codes are determined, corresponding bit offsets can be obtained according to the bit offset sequence.
In one embodiment, the method further comprises: and decoding the current frame bit stream data according to the bit offset of the previous frame bit stream data, searching the original feature code and repeatedly verifying.
Specifically, under the condition that the length of each frame of bit stream data is consistent and the data is not lost, the bit offset of each frame of bit stream data is the same, so that the current frame of bit stream data can be decoded according to the bit offset of the previous frame of bit stream data, then the original feature code is searched, the feature code repeated at fixed intervals is utilized to perform repeatability verification, if the current frame of bit stream data is complete, the verification is successful, if the length of the current frame of bit stream data is changed or the current frame of bit stream data is incomplete, the verification fails, the position and the bit offset of the feature code are determined again for the current frame of bit stream data, the time is greatly saved, and the efficiency is improved.
In addition, if the repeatability verification is correct, the bit offset of the current frame bit stream data is consistent with the residual bit length of the previous frame bit stream data, and the splicing data of the frame tail of the previous frame bit stream data and the frame head of the current frame bit stream data is output.
Specifically, if the verification is correct, the data is not lost, the bit offset of the current frame bit stream data is consistent with the remaining bit length of the previous frame bit stream data, and meanwhile, the frame tail data retained by the previous frame bit stream data is spliced with the frame head of the current frame bit stream data and output, so that the integrity of the data is ensured.
And if the repeatability verification is incorrect, the variation characteristic code position and the bit offset search are carried out again, and the bit offset of the current frame bit stream data is recorded.
Specifically, the repeatability verification is incorrect, the variation signature position and the bit offset search are performed again, after a new bit offset is determined, the recording and the storage are performed, and the bit offset is used for processing when the next frame of bit stream data is processed.
In one embodiment, when the verification is incorrect, further comprising: restoring the current frame bit stream data to obtain complete byte data after bit offset correction of the current frame bit stream data, detecting whether the sum of the lengths of the head of the current frame bit stream data after analysis and restoration and the tail of the previous frame bit stream data after analysis and restoration is 8, outputting the byte if the sum is 8, otherwise, discarding all the bytes.
Specifically, when the verification is incorrect, it indicates that the length of the bit stream data of the current frame changes or the frame header data of the current frame is lost, and after the frame data is restored, it is detected whether the frame header data and the frame tail data of the previous frame can be spliced into 1 byte, the spliced byte can be output, and all the bytes cannot be discarded.
The following gives an implementation procedure taking simulation data as an example.
Assume that the original signature is 0xDA 50. The received bitstream protocol data are 0x59, 0xA7, 0x04, 0xB6, 0x94, 0x0A … ….
Firstly, shifting 0 to 7 bits left in sequence for the feature code 0xDA50 to obtain a new feature code bit shift sequence: 0xDA50, 0x1B4a0, 0x36940, 0x6D280, 0xDA500, 0x1B4a00, 0x369400, 0x6D 2800. Sequentially taking the next lower bytes of the feature code sequence to form a variant feature code sequence with the length of 8 bytes: 0xDA, 0xB4, 0x69, 0xD2, 0xA5, 0x4A, 0x94, 0x 28.
And secondly, performing two-dimensional search of the position of the characteristic code and the bit offset of the bit stream protocol data by using the variant characteristic code sequence. When the start is 0, the variant signature 0x94 is searched in the 4 th byte, thereby determining that the signature position search result is 4 and the bit offset is 6. 0xB6940A was right-shifted by 6 bits to 0x2DA50, consistent with the original signature 0xDA 50.
Thirdly, after correcting the bit offset, the bit stream data is parsed and output to be 0x66, 0x9C, 0x12, 0xDA, 0x50 … ….
According to the bit stream protocol data rapid analysis method, the original feature code is expanded according to the data coding characteristics, the variation feature code sequence is reconstructed, the bitwise calculation search is optimized to the byte-wise comparison search, the heavy bitwise calculation process is eliminated, and the bit offset of the original data can be rapidly given according to the position of the sequence of the variation feature code. And tests show that the method can accurately identify the variation feature codes and quickly determine the bit offset, and shortens the analysis time of the bit stream data to one tenth of the original time.
Furthermore, the terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of the embodiments of the present disclosure, "a plurality" means two or more unless specifically limited otherwise.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present disclosure. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples described in this specification can be combined and combined by those skilled in the art.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
Claims (10)
1. A method for fast parsing bit stream protocol data is characterized by comprising the following steps:
constructing a variant feature code sequence according to the original feature code;
analyzing the bit stream protocol data frame by frame, comparing each frame of bit stream data byte by byte with the variation characteristic code sequence, and determining the position and bit offset of the variation characteristic code;
and analyzing and restoring the bit stream data of each frame byte by byte according to the bit offset.
2. The bitstream protocol data fast parsing method as claimed in claim 1, wherein the constructing the variant signature bit shift sequence comprises:
and sequentially left-shifting the original feature code according to the displacement amount of 0 to 7 bits to obtain a feature code displacement sequence, and selecting the next-lowest byte of the feature code displacement sequence to obtain the variant feature code sequence.
3. The method for fast parsing protocol data in bit stream according to claim 2, wherein said original signature code has at least 2 bytes.
4. The method for fast parsing protocol data in bit stream according to claim 1, wherein determining the variant signature position and the bit offset comprises:
the original feature codes are repeatedly arranged at fixed intervals, and after any one of the variant feature codes in the variant feature code sequence is found in the bit stream data, bytes at positions 1 time and 2 times the interval behind the variant feature code in the bit stream data are taken for repeatability verification;
after the position of the variation characteristic code is determined, calculating the bit offset, taking bit stream data of two bytes before and after the variation characteristic code, and reducing the variation characteristic code according to the bit stream data of the three bytes;
and comparing and verifying the reduction result with the original feature code.
5. The method for fast parsing protocol data in bitstream according to claim 1, wherein parsing and restoring the bitstream data per frame byte by byte comprises:
and restoring each frame of the bit stream data byte by byte, outputting complete byte data after bit offset correction of the bit stream data, recording bit information of less than 1 byte of the bit information, and splicing with the bit stream data of the next frame after analysis and restoration.
6. The method for fast parsing protocol data in bitstream according to claim 4, wherein said calculating the bit offset procedure comprises:
the variant feature code sequence has a corresponding bit offset sequence, and the bit offset is obtained by searching the position of the feature code in the variant feature code sequence.
7. The bitstream protocol data fast parsing method according to claim 4, wherein the method further comprises:
and decoding the current frame bit stream data according to the bit offset of the previous frame bit stream data, searching the original feature code and repeatedly verifying.
8. The method for fast parsing bit stream protocol data according to claim 7, wherein if the repeatability is verified to be correct, the bit offset of the current frame bit stream data is consistent with the remaining bit length of the previous frame bit stream data, and the concatenated data of the frame end of the previous frame bit stream data and the frame head of the current frame bit stream data is outputted.
9. The method for fast parsing protocol data in bitstream according to claim 7, wherein if the repeatability verification is incorrect, the search for the position of the variant signature and the bit offset is performed again, and the bit offset of the current frame bitstream data is recorded.
10. The method for fast parsing protocol data in bit stream according to claim 9, wherein when said verification is incorrect, further comprising:
restoring the current frame bit stream data to obtain complete byte data after bit offset correction of the current frame bit stream data, detecting whether the sum of the lengths of the head of the current frame bit stream data after analysis and restoration and the tail of the previous frame bit stream data after analysis and restoration is 8, outputting the byte if the sum is 8, otherwise, discarding all the bytes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111546091.5A CN114244757B (en) | 2021-12-17 | 2021-12-17 | Fast analysis method for bit stream protocol data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111546091.5A CN114244757B (en) | 2021-12-17 | 2021-12-17 | Fast analysis method for bit stream protocol data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114244757A true CN114244757A (en) | 2022-03-25 |
| CN114244757B CN114244757B (en) | 2023-06-02 |
Family
ID=80757382
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111546091.5A Active CN114244757B (en) | 2021-12-17 | 2021-12-17 | Fast analysis method for bit stream protocol data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114244757B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101924703A (en) * | 2010-09-03 | 2010-12-22 | 北京全路通信信号研究设计院 | Method and device for decoding BTM (Balise Transmission Module) message, and train control system based on balise |
| WO2012093390A2 (en) * | 2011-01-05 | 2012-07-12 | Aeronautics Ltd. | Data transmission framing system & method |
| CN105743826A (en) * | 2016-05-11 | 2016-07-06 | 上海上大鼎正软件股份有限公司 | Miller subcarrier decoding method |
| CN107171890A (en) * | 2017-05-31 | 2017-09-15 | 电子科技大学 | Frame counter method for fast searching |
| CN113127864A (en) * | 2019-12-31 | 2021-07-16 | 奇安信科技集团股份有限公司 | Feature code extraction method and device, computer equipment and readable storage medium |
-
2021
- 2021-12-17 CN CN202111546091.5A patent/CN114244757B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101924703A (en) * | 2010-09-03 | 2010-12-22 | 北京全路通信信号研究设计院 | Method and device for decoding BTM (Balise Transmission Module) message, and train control system based on balise |
| WO2012093390A2 (en) * | 2011-01-05 | 2012-07-12 | Aeronautics Ltd. | Data transmission framing system & method |
| CN105743826A (en) * | 2016-05-11 | 2016-07-06 | 上海上大鼎正软件股份有限公司 | Miller subcarrier decoding method |
| CN107171890A (en) * | 2017-05-31 | 2017-09-15 | 电子科技大学 | Frame counter method for fast searching |
| CN113127864A (en) * | 2019-12-31 | 2021-07-16 | 奇安信科技集团股份有限公司 | Feature code extraction method and device, computer equipment and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114244757B (en) | 2023-06-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP5241832B2 (en) | Incremental structure of the search tree including signature pointers for multimedia content identification | |
| Cohen | Advanced carving techniques | |
| KR101969848B1 (en) | Method and apparatus for compressing genetic data | |
| EP2149138B1 (en) | Method and apparatus for processing encoded audio data | |
| US8156414B2 (en) | String reconstruction using multiple strings | |
| US20130226923A1 (en) | Method and Device for Reassembling a Data File | |
| CN114253484B (en) | Big data cloud storage server | |
| CN116594572A (en) | Floating point number stream data compression method, device, computer equipment and medium | |
| CN110990603B (en) | Method and system for format recognition of segmented image data | |
| CN114244757A (en) | Method for rapidly analyzing bit stream protocol data | |
| CN111063394B (en) | Method, system and medium for quickly searching and constructing library of species based on gene sequence | |
| CN109743581B (en) | Processing method at encoding end, processing method at decoding end and method for preventing pseudo initial code | |
| CN105790768A (en) | Data storage method and system | |
| KR100500196B1 (en) | Apparatus and method for encoding/decoding multimedia meta-data in error-resilient manner | |
| FI115350B (en) | Method and apparatus for using a data structure for data compression | |
| CN114388053B (en) | SSD data testing method and device, storage medium and testing equipment | |
| CN113836367B (en) | Method and device for character reverse matching | |
| CN114050831A (en) | Decoding method, system, device and medium based on LZ77 | |
| EP0871295A2 (en) | Method and apparatus for compression and decompression of data | |
| CN113595557B (en) | Data processing method and device | |
| JP2002259216A (en) | Method for detecting electronic file alteration, method for describing electronic file for the same and communication equipment | |
| CN117271202B (en) | Optimal extraction method for multi-pass retransmission data | |
| CN112134644A (en) | Encoding method, apparatus and storage medium | |
| Hilgert et al. | Syntactical File Carving and Automated Generation of Reproducible Datasets | |
| EP4029023B1 (en) | Method for the compression of genome sequence data |
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 |