CN108170797B - Source packet fuzzy time extraction method based on multi-layer information joint index - Google Patents
Source packet fuzzy time extraction method based on multi-layer information joint index Download PDFInfo
- Publication number
- CN108170797B CN108170797B CN201711453390.8A CN201711453390A CN108170797B CN 108170797 B CN108170797 B CN 108170797B CN 201711453390 A CN201711453390 A CN 201711453390A CN 108170797 B CN108170797 B CN 108170797B
- Authority
- CN
- China
- Prior art keywords
- index
- source packet
- time code
- substep
- reading
- 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
- 238000000605 extraction Methods 0.000 title claims abstract description 20
- 230000005540 biological transmission Effects 0.000 claims description 11
- 238000007689 inspection Methods 0.000 claims description 2
- 230000003287 optical effect Effects 0.000 claims description 2
- 238000012795 verification Methods 0.000 claims description 2
- 238000000034 method Methods 0.000 abstract description 12
- 230000008030 elimination Effects 0.000 abstract description 5
- 238000003379 elimination reaction Methods 0.000 abstract description 5
- 238000012163 sequencing technique Methods 0.000 abstract description 2
- 238000012545 processing Methods 0.000 description 7
- 238000001514 detection method Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000003672 processing method Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000005293 physical law Methods 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2477—Temporal data queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/13—File access structures, e.g. distributed indices
- G06F16/134—Distributed indices
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Mathematical Physics (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Probability & Statistics with Applications (AREA)
- Fuzzy Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The disclosure provides a source packet fuzzy time extraction method. The fuzzy time calculation of the source packet is carried out by utilizing the adjacent frames and the adjacent source packets to realize the extraction of the source packet time code; a multi-layer information combined index file is established to facilitate the subsequent source packet sorting and duplication elimination; the method has high filling rate on the source packet time code, so that the data integrity and the data continuity are improved; the fuzzy value method using the source packet time code has high accuracy, so that the accuracy of the subsequent source packet sequencing and duplication elimination and the data integrity are further improved.
Description
Technical Field
The invention relates to the field of space science satellite data processing, and provides a source packet fuzzy time extraction method based on multi-layer information joint index.
Background
The space science is used as a hot subject for developing the provenance evolution of universe and life and exploring basic physical laws, and a great deal of important findings and breakthroughs of the natural science are closely related to the space science. It plays a vital role in the national development and has become an important subject of great importance in various countries in the world. Successful transmission of the first man-made earth satellite in 1957 marks the beginning of modern space science. The conventional satellite data processing method performs frame and packet unpacking processing based on the virtual channel frame count (vcdu counts) and the source packet count.
The space science satellite has the characteristics of all-weather detection, large carrying load quantity and the like, and the detection data has the characteristics of large data quantity, high counting circulation speed, high requirements on data continuity and integrity and the like. The space science satellite data processing method is to perform frame and package opening processing based on virtual channel frame counting, source package counting and source package time codes. Meanwhile, due to different space science satellite manufacturing parties, the problem that the source packet time code cannot be extracted by the existing advanced on-orbit system (AOS) frame can be caused, so that the source packets cannot be sequenced and repeated, and the data processing requirement of the space science satellite cannot be met.
In summary, how to provide a source packet fuzzy time extraction method, which can achieve source packet time code extraction, facilitate subsequent source packet sorting and duplication elimination, and improve data integrity and data continuity is a technical problem that needs to be solved by researchers in the field.
Disclosure of Invention
First, the technical problem to be solved
In view of the above technical problems, the present disclosure provides a source packet ambiguity time extraction method based on multi-layer information joint indexes, which solves the problem that there is no time code in source packet data of space science satellite detection data, and performs joint operation on multi-layer information by establishing multi-layer information joint indexes of the data, and calculates ambiguity time of a source packet without time code according to time code of an associated source packet.
(II) technical scheme
The disclosure provides a source packet fuzzy time extraction method based on multi-layer information joint index, which comprises the following steps: step S101: extracting a multi-layer information joint index file from the data transmission data; step S201: reading the multi-layer information combined index file, traversing backwards from the first index, and filling an index with a time code of 0 according to a backward traversing judgment criterion; step S301: reading the multi-layer information combined index file, traversing forward from the last index, and filling an index with a time code of 0 according to a forward traversing judgment criterion; step S401: and reading the multi-layer information combined index file, traversing from the first index to the back, and filling the index with the time code of 0 according to the filling omission judgment criterion.
In some embodiments of the present disclosure, the multi-layer information joint index file includes vcdu counts, source packet counts, and source packet time codes.
In some embodiments of the present disclosure, the extracting step specifically includes: substep S101a: creating a multi-layer information joint index file and creating a source packet data file; substep S101b: reading data transmission data, searching a frame synchronization head in the data transmission data, reading frame length configuration information, and reading bytes consistent with the frame length from the position of a first frame synchronization head as a data source; judging a virtual channel from a data source, searching a source packet synchronization head, and if the virtual channel meets the condition, extracting the three types of information and adding the three types of information to a multi-layer information joint index file; substep S101c: reading the position of the next frame synchronization head, if the position can be found, repeating the substep S101b, extracting the three types of information and adding the three types of information to the multi-layer information combined index file, and if the position can not be found, storing the multi-layer information combined index file.
In some embodiments of the present disclosure, the backward traversing step specifically includes: substep S201a: reading a multi-layer information joint index file, wherein the source packet index is total to N pieces; substep S201b: reading a first index (1), judging whether the time code T1 of the index is 0, if the time code T1 is not 0, reading the next index (1+1), judging whether the vcdu count of the index (1) is continuous with the vcdu count of the index (1+1), the source packet count of the index (1) is continuous with the source packet count of the index (1+1), judging whether the time code T (1+1) of the index (1+1) is 0 or not again if the time code T is continuous, and if the time code T (1+1) =T1, completing the time code filling of the index (1+1); reading the next index (1+i), comparing the index (1) with the index (1+i) according to the judging criteria, and completing the time code filling of the index (1+i); repeating the steps until the last index; substep S201c: reading the next index, repeating the substep S201b, and filling time codes until the last index of the multi-layer information combined index file; substep S201d: and storing the multi-layer information joint index file.
In some embodiments of the present disclosure, the step of traversing forward specifically includes: substep S301a: reading a multi-layer information joint index file, wherein the source packet index is total to N pieces; substep S301b: reading the last index (N), judging whether the time code T (N) is 0, if not, reading the previous index (N-1), judging whether the vcdu count of the index (N) and the vcdu count of the index (N-1) are continuous, judging whether the source packet count of the index (N) and the source packet count of the index (N-1) are continuous, and if continuous, judging whether the time code T (N-1) of the index (N-1) is 0, and if 0, making T (N-1) =TN to finish the time code filling of the index (N-1); reading the previous index (N-i), and comparing the index (N) with the index (N-i) according to the judging criterion to finish the time code filling of the index (N-i); repeating substep S301b until a first index; substep S301c: reading the previous index (N-1), repeating the substep S301b, and filling the time code until the first index; substep S301d: and storing the multi-layer information joint index file.
In some embodiments of the present disclosure, the filling omission step specifically includes: substep S401a: reading a multi-layer information joint index file; substep S401b: taking i=1, reading an i-th index (i), judging whether the time code Ti of the index is 0, if so, reading the last index (i-1), judging whether the time code T (i-1) of the index (i-1) is 0, if not, making T (i-1) =Ti, and if so, continuing to read the last index (i-2) until the first index; reading the next index (i+1) of the ith index (i), judging whether the time code T (i+1) of the index (i+1) is 0, if not, enabling Ti=T (i+1), and if so, continuing to read the next index until the time code filling of the index (i) is completed; substep S401c: letting i be equal to 2-N respectively, repeating the sub-step 401b, and performing time code filling; substep S401d: the multi-layer information joint index file I 0 is saved.
In some embodiments of the present disclosure, in the substep S101b, if the source packet time code is not extracted, the source packet time code is set to 0; if the first frame sync header is not found, step S101 ends; performing AOS (automatic optical inspection) on frame data in a data source, judging a virtual channel and searching a source packet synchronization head if the verification is passed, otherwise, recording error information, and executing a substep S101c; if a source packet synchronization header is found, source packet information is extracted, otherwise sub-step S101c is performed.
In some embodiments of the present disclosure, in the sub-step S201b, if the time code T1 of the first index (1) is 0, the sub-step S201c is directly performed; if vcdu count of index (1), source packet count and vcdu count of index (1+i) are discontinuous, the step of returning to read next index (1+i) is continuously executed; if the time code T (1+i) of index (1+i) is not 0, the step of returning to read the next index (1+i) is continued; if the next index (1+i) is the last index, sub-step S201c is performed directly.
In some embodiments of the present disclosure, in the sub-step S301b, if the time code T (N) of the last index (N) is 0, the sub-step S301c is directly performed; if vcdu counts of index (N-i), source packet counts are not continuous with vcdu counts of index (N), the step of returning to read the previous index (N-i) is continuously executed; if the time code T (N-i) of index (N-i) is not 0, returning to the step of reading the previous index (N-i) to continue execution; if the previous index (N-i) is the first index, sub-step S301c is performed directly.
In some embodiments of the present disclosure, in the substep S401b, if the last index (i-2) read is the first index, continuing execution from the next index (i+1) read of the i-th index (i); if the next index read is the last index, sub-step S401c is performed.
(III) beneficial effects
From the above technical solution, the source packet ambiguity time extraction method based on multi-layer information joint index of the present disclosure has the following beneficial effects:
(1) The source packet time code extraction can be realized by calculating the fuzzy time of the source packet by the adjacent frames and the adjacent source packets;
(2) The multi-layer information combined index file is established, so that the subsequent source packet sorting and duplication elimination are facilitated;
(3) The source packet time code filling of most of source packets is realized, and the data integrity and the data continuity are improved;
(4) The ambiguity value method of the source packet time code has high accuracy, and the accuracy of subsequent source packet sequencing and duplication elimination and the data integrity are improved.
Drawings
FIG. 1 is a flow chart of a source packet ambiguity time extraction method according to an embodiment of the present disclosure;
FIG. 2 is a flowchart illustrating a step of extracting source packet data index of the method of FIG. 1;
FIG. 3 is a flow chart of the backward traversal fill indexing step of the method of FIG. 1;
FIG. 4 is a flow chart of the forward traversal fill index step of the method of FIG. 1;
FIG. 5 is a flow chart of the fill missing index step of the method of FIG. 1.
Detailed Description
For the purposes of promoting an understanding of the principles and advantages of the disclosure, reference will now be made to the embodiments illustrated in the drawings and specific language will be used to describe the same. In the drawings or description, like or identical parts are provided with the same reference numerals. Implementations not shown or described in the figures are well known to those of ordinary skill in the art. Additionally, although examples of parameters including particular values may be provided herein, it should be appreciated that the parameters need not be exactly equal to the corresponding values, but may be approximated to the corresponding values within acceptable error margins or design constraints.
The present disclosure relates to a source packet fuzzy time extraction method based on multi-layer information joint index, wherein a flow chart is shown in fig. 1, and the method comprises the following steps:
Step S101: the source packet multi-layer information joint index I 0 including vcdu counts, source packet time codes is extracted from the data D0, and the flowchart is shown in fig. 2.
The method specifically comprises the following steps:
Substep S101a: a multi-layer information joint index file I 0 is created, and a source packet data file D0 is created.
Substep S101b: and reading data transmission data D, wherein the data transmission data D is data transmission original data to be processed and consists of AOS data frames. In the data transmission D, the frame synchronization header 1ACFFC D is searched, the frame length configuration information L is read, and from the position of the first frame synchronization header 1ACFFC D, bytes consistent with the frame length L are read as a data source S, and the data source constitutes a source packet data file D 0 for creating the multi-layer information association index file I 0.
Judging a virtual channel from the data source S according to a satellite CCSDS protocol, searching a source packet synchronization head, extracting vcdu counts and source packet counts if the conditions are met, namely the AOS frame structure is correct and the source packet structure is correct, and extracting a source packet time code according to the data format of the data source S. If the source packet time code is not extracted, the time code is set to 0. And adding vcdu counts, source packet counts and time codes to the multi-layer information joint index file I 0.
In this sub-step, if the first frame synchronization header is not found, step S101 ends. And (3) carrying out AOS check on the frame data in the data source S, judging a virtual channel and searching a source packet synchronization head if the check is passed, otherwise, recording error information, and executing a substep S101c. If a source packet synchronization header is found, source packet information is extracted, otherwise sub-step S101c is performed.
Substep S101c: the position of the next frame synchronization header 1ACFFC D is read, and if the position can be found, the above sub-step S101b is repeated, and three kinds of information are extracted and added to the multi-layer information association index file I 0. If the location is not found, the multi-layer information federated index file I 0 is saved.
Step S201: the multi-layer information combined index file I 0 is read, traversed back from the first index, and the index with time code 0 is filled according to the first decision criterion, and the flowchart is shown in fig. 3.
The method specifically comprises the following steps:
Substep S201a: the multi-layer information association index file I 0 is read, and in the multi-layer information association index file I 0, the source packet index totals N pieces. In this sub-step, it is determined whether the multi-layer information association index file I 0 is empty, if so, step S201 ends, otherwise sub-step S201b is performed.
Substep S201b: reading a first index (1), judging whether the time code T1 is 0, if not, reading the next index (1+1), judging whether the vcdu count of the index (1) and the vcdu count of the index (1+1), the source packet count of the index (1) and the source packet count of the index (1+1) are all continuous, if continuous, judging whether the time code T (1+1) of the index (1+1) is 0, and if 0, making T (1+1) =T1, and finishing the time code filling of the index (1+1). And reading the next index (1+i), and comparing the index (1) with the index (1+i) according to the judgment criterion to finish the time code filling of the index (1+i). Repeating the above steps until the last index.
In this sub-step, if the time code T1 of the first index (1) is 0, the sub-step S201c is directly performed. If the vcdu count of index (1), the source packet count and the vcdu count of index (1+i), the source packet count are not consecutive, the step of returning to read the next index (1+i) continues. If the time code T (1+i) of index (1+i) is not 0, the step of returning to read the next index (1+i) is continued. If the next index (1+i) is the last index, sub-step S201c is performed directly.
Substep S201c: reading the next index (when the last index is index (1), the next index (2)), repeating the substep S201c, and performing time code filling until the last index of the multi-layer information combined index file I 0.
In this sub-step, the next index is sequentially read, and it is determined whether the next index is the last index, if yes, step S201 ends, otherwise, sub-step S201c is repeated for the next index to fill the time code of each index.
Substep S201d: after the processing is completed, the multi-layer information joint index file I 0 is saved.
Step S301: the multi-layer information combined index file I 0 is read, traversed forward from the last index, and the index with time code 0 is filled according to the second decision criterion, and the flowchart is shown in fig. 4.
The method specifically comprises the following steps:
Substep S301a: the multi-layer information joint index file I 0 is read. In this sub-step, it is determined whether the multi-layer information association index file I 0 is empty, if so, step S301 ends, otherwise sub-step S301b is performed.
Substep S301b: assuming that the total index number is N, reading the last index (N), judging whether the time code T (N) is 0, if not, reading the previous index (N-1), judging whether the vcdu count of index (N) and the vcdu count of index (N-1) are continuous, judging whether the source packet count of index (N) and the source packet count of index (N-1) are continuous, if continuous, judging whether the time code T (N-1) of index (N-1) is 0, and if 0, making T (N-1) =TN, and completing the time code filling of index (N-1). And reading the previous index (N-i), and comparing the index (N) with the index (N-i) according to the judging criteria to finish the time code filling of the index (N-i). Repeating the steps until the first index.
In this sub-step, if the time code T (N) of the last index (N) is 0, sub-step S301c is directly performed. If the vcdu count of index (N-i), the source packet count is not consecutive to the vcdu count of index (N), the step of returning to read the previous index (N-i) continues. If the time code T (N-i) of index (N-i) is not 0, the step of returning to read the previous index (N-i) is continued. If the previous index (N-i) is the first index, sub-step S301c is performed directly.
Substep S301c: the previous index (N-1) is read, and sub-step S301c is repeated for time code filling until the first index.
Substep S301d: after the processing is completed, the multi-layer information joint index file I 0 is saved.
Step S401: the multi-layer information combined index file I 0 is read, traversed back from the first index, and the index with time code 0 is filled according to the third decision criterion, the flowchart is shown in fig. 5.
The method specifically comprises the following steps:
Substep S401a: the multi-layer information joint index file I 0 is read. In this sub-step, it is determined whether the multi-layer information association index file I 0 is empty, and if so, step S401 ends, otherwise, sub-step S401b is performed.
Substep S401b: taking i=1, reading the ith index (i), judging whether the time code Ti of the index is 0, if so, reading the last index (i-1), judging whether the time code T (i-1) of the index (i-1) is 0, if not, making T (i-1) =Ti, and if so, continuing to read the last index (i-2) until the first index. If the last index (i-2) is not filled with time codes, reading the next index (i+1) of the i index (i), judging whether the time code T (i+1) of the index (i+1) is 0, if not, making Ti=T (i+1), and if so, continuing to read the next index until the time code filling of the index (i) is completed.
If the last index (i-2) read is the first index, execution continues from the index (i+1) next to the index (i) read. If the next index read is the last index, sub-step S401c is performed.
Substep S401c: let i equal 2 to N, respectively, repeat sub-step S401b, and perform time code filling.
Substep S401d: after the processing is completed, the multi-layer information joint index file I 0 is saved.
It should be noted that, in the drawings or the text of the specification, implementations not shown or described are all forms known to those of ordinary skill in the art, and not described in detail. Furthermore, the above definitions of the elements and steps are not limited to the specific structures, shapes or modes mentioned in the embodiments, and those of ordinary skill in the art can simply modify or replace them, and directional terms such as "upper", "lower", "front", "rear", "left", "right", etc. mentioned in the embodiments are merely directions with reference to the drawings, and are not intended to limit the scope of the present disclosure; the above embodiments may be mixed with each other or other embodiments based on design and reliability, i.e. the technical features of the different embodiments may be freely combined to form more embodiments.
In summary, the source packet fuzzy time extraction method provided by the present disclosure realizes source packet extraction, facilitates subsequent source packet sorting and de-duplication, and improves data integrity and data continuity.
While the foregoing embodiments have been described in some detail for purposes of clarity of understanding, it will be understood that the foregoing embodiments are merely illustrative of the invention and are not intended to limit the invention, and that any modifications, equivalents, improvements, etc. that fall within the spirit and principles of the present disclosure are intended to be included within the scope of the present disclosure.
Claims (5)
1. A source packet fuzzy time extraction method based on multi-layer information joint index comprises the following steps:
Step S101: extracting a multi-layer information joint index file from data transmission data, wherein the multi-layer information joint index file comprises vcdu counts, source packet counts and source packet time codes;
step S201: reading the multi-layer information combined index file, traversing backwards from the first index, and filling an index with a time code of 0 according to a backward traversing judgment criterion;
Step S301: reading the multi-layer information combined index file, traversing forward from the last index, and filling an index with a time code of 0 according to a forward traversing judgment criterion;
step S401: reading the multi-layer information combined index file, traversing from the first index to the back, and filling an index with a time code of 0 according to a filling omission judgment criterion;
the extracting step S101 specifically includes:
Substep S101a: creating a multi-layer information joint index file and creating a source packet data file;
Substep S101b: reading data transmission data, searching a frame synchronization head in the data transmission data, reading frame length configuration information, and reading bytes consistent with the frame length from the position of a first frame synchronization head as a data source; judging a virtual channel from a data source, searching a source packet synchronization head, and if the virtual channel meets the condition, extracting the three types of information and adding the three types of information to a multi-layer information joint index file;
Substep S101c: reading the position of the next frame synchronization head, if the position can be found, repeating the substep S101b, extracting the three types of information and adding the three types of information to the multi-layer information combined index file, and if the position can not be found, storing the multi-layer information combined index file;
the backward traversing step specifically comprises the following steps:
Substep S201a: reading a multi-layer information joint index file, wherein the source packet index is total to N pieces;
Substep S201b: reading a first index (1), judging whether the time code T1 of the index is 0, if the time code T1 is not 0, reading the next index (1+1), judging whether the vcdu count of the index (1) is continuous with the vcdu count of the index (1+1), the source packet count of the index (1) is continuous with the source packet count of the index (1+1), judging whether the time code T (1+1) of the index (1+1) is 0 or not again if the time code T is continuous, and if the time code T (1+1) =T1, completing the time code filling of the index (1+1); reading the next index (1+i), comparing the index (1) with the index (1+i) according to the judging criteria, and completing the time code filling of the index (1+i); repeating the steps until the last index;
Substep S201c: reading the next index, repeating the substep S201b, and filling time codes until the last index of the multi-layer information combined index file;
substep S201d: storing a multi-layer information joint index file;
the forward traversal step specifically includes:
Substep S301a: reading a multi-layer information joint index file, wherein the source packet index is total to N pieces;
Substep S301b: reading the last index (N), judging whether the time code T (N) is 0, if not, reading the previous index (N-1), judging whether the vcdu count of the index (N) and the vcdu count of the index (N-1) are continuous, judging whether the source packet count of the index (N) and the source packet count of the index (N-1) are continuous, and if continuous, judging whether the time code T (N-1) of the index (N-1) is 0, and if 0, making T (N-1) =TN to finish the time code filling of the index (N-1); reading the previous index (N-i), and comparing the index (N) with the index (N-i) according to the judging criterion to finish the time code filling of the index (Ni); repeating substep S301b until a first index;
Substep S301c: reading the previous index (N-1), repeating the substep S301b, and filling the time code until the first index;
Substep S301d: storing a multi-layer information joint index file;
The filling omission step S401 specifically includes:
substep S401a: reading a multi-layer information joint index file;
Substep S401b: taking i=1, reading an i-th index (i), judging whether the time code Ti of the index is 0, if so, reading the last index (i-1), judging whether the time code T (i-1) of the index (i-1) is 0, if not, making T (i-1) =Ti, and if so, continuing to read the last index (i-2) until the first index; reading the next index (i+1) of the ith index (i), judging whether the time code T (i+1) of the index (i+1) is 0, if not, enabling Ti=T (i+1), and if so, continuing to read the next index until the time code filling of the index (i) is completed;
Substep S401c: letting i be equal to 2-N respectively, repeating the sub-step 401b, and performing time code filling;
Substep S401d: the multi-layer information joint index file I 0 is saved.
2. The source packet ambiguity time extraction method of claim 1, wherein in the substep S101b, if the source packet time code is not extracted, the source packet time code is set to 0; if the first frame sync header is not found, step S101 ends; performing AOS (automatic optical inspection) on frame data in a data source, judging a virtual channel and searching a source packet synchronization head if the verification is passed, otherwise, recording error information, and executing a substep S101c; if a source packet synchronization header is found, source packet information is extracted, otherwise sub-step S101c is performed.
3. The source packet ambiguity time extraction method according to claim 1, wherein in said sub-step S201b, if the time code T1 of the first index (1) is 0, the sub-step S201c is directly performed; if vcdu count of index (1), source packet count and vcdu count of index (1+i) are discontinuous, the step of returning to read next index (1+i) is continuously executed; if the time code T (1+i) of index (1+i) is not 0, the step of returning to read the next index (1+i) is continued; if the next index (1+i) is the last index, sub-step S201c is performed directly.
4. The source packet ambiguity time extraction method according to claim 1, wherein in said substep S301b, if the time code T (N) of the last index (N) is 0, the substep S301c is directly performed; if vcdu counts of index (N-i), source packet counts are not continuous with vcdu counts of index (N), the step of returning to read the previous index (N-i) is continuously executed; if the time code T (N-i) of index (N-i) is not 0, returning to the step of reading the previous index (N-i) to continue execution; if the previous index (N-i) is the first index, sub-step S301c is performed directly.
5. The source packet ambiguity time extraction method according to claim 1, wherein in said substep S401b, if the last index (i-2) read is the first index, then execution is continued starting with the index (i+1) next to the index (i) read; if the next index read is the last index, sub-step S401c is performed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711453390.8A CN108170797B (en) | 2017-12-27 | 2017-12-27 | Source packet fuzzy time extraction method based on multi-layer information joint index |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711453390.8A CN108170797B (en) | 2017-12-27 | 2017-12-27 | Source packet fuzzy time extraction method based on multi-layer information joint index |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108170797A CN108170797A (en) | 2018-06-15 |
| CN108170797B true CN108170797B (en) | 2024-04-19 |
Family
ID=62518955
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711453390.8A Active CN108170797B (en) | 2017-12-27 | 2017-12-27 | Source packet fuzzy time extraction method based on multi-layer information joint index |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108170797B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102968488A (en) * | 2012-11-26 | 2013-03-13 | 北京空间飞行器总体设计部 | Telemetering data organization method simultaneously applicable to PCM telemetering and AOS telemetering |
| CN107317769A (en) * | 2017-05-25 | 2017-11-03 | 北京空间飞行器总体设计部 | A kind of source bag dispatching method based on orderly priority query |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070208790A1 (en) * | 2006-03-06 | 2007-09-06 | Reuter James M | Distributed data-storage system |
-
2017
- 2017-12-27 CN CN201711453390.8A patent/CN108170797B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102968488A (en) * | 2012-11-26 | 2013-03-13 | 北京空间飞行器总体设计部 | Telemetering data organization method simultaneously applicable to PCM telemetering and AOS telemetering |
| CN107317769A (en) * | 2017-05-25 | 2017-11-03 | 北京空间飞行器总体设计部 | A kind of source bag dispatching method based on orderly priority query |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108170797A (en) | 2018-06-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110941722B (en) | Knowledge graph fusion method based on entity alignment | |
| WO2017005121A1 (en) | Method, device and system for sending and receiving code block data stream | |
| CN103975533A (en) | High bandwidth decompression of variable length encoded data streams | |
| CN111010253B (en) | HIMAC frame splitting system and method based on HINOC protocol | |
| CN107679152B (en) | Data processing method based on multi-layer information joint index | |
| CN105573711B (en) | A kind of data cache method and device | |
| CN106407038A (en) | Fragmented file data recovery method | |
| CN112862088A (en) | Distributed deep learning method based on pipeline annular parameter communication | |
| CN110247730A (en) | Blind checking method and equipment based on polarization code | |
| CN104391759A (en) | Data archiving method for load sensing in erasure code storage | |
| US8542137B2 (en) | Decoding encoded data | |
| CN105119949B (en) | Method of data synchronization and system based on multi-stage slicing difference distribution statistics | |
| CN103034553B (en) | Intelligent verification algorithm, method and device for report designer | |
| CN111581390A (en) | Knowledge graph construction method and device and electronic equipment | |
| CN108966283A (en) | A kind of telemetry compression transmitting method, device and computer-readable medium | |
| CN104052495A (en) | Low density parity check code hierarchical decoding architecture for reducing hardware buffer | |
| CN108170797B (en) | Source packet fuzzy time extraction method based on multi-layer information joint index | |
| KR20210097743A (en) | Sorting methods, devices, electronic devices and media | |
| CN104796160B (en) | Interpretation method and device | |
| Muscholl et al. | Analyzing Message Sequence Charts. | |
| CN111190896B (en) | Data processing method, device, storage medium and computer equipment | |
| US10728356B2 (en) | Communication device and communication system | |
| CN110049023B (en) | Unknown protocol reverse identification method and system based on machine learning | |
| CN105302889B (en) | The conversion method and device of data store organisation | |
| US9455742B2 (en) | Compression ratio for a compression engine |
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 |