CN113364511B - Equilibrium transfer computing method and system based on CCSDS packet telemetry - Google Patents
Equilibrium transfer computing method and system based on CCSDS packet telemetry Download PDFInfo
- Publication number
- CN113364511B CN113364511B CN202110513325.XA CN202110513325A CN113364511B CN 113364511 B CN113364511 B CN 113364511B CN 202110513325 A CN202110513325 A CN 202110513325A CN 113364511 B CN113364511 B CN 113364511B
- Authority
- CN
- China
- Prior art keywords
- telemetry
- packet
- downloading
- matrix
- period
- 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
- 238000004364 calculation method Methods 0.000 title claims abstract description 63
- 238000012546 transfer Methods 0.000 title description 6
- 239000011159 matrix material Substances 0.000 claims abstract description 73
- 238000000034 method Methods 0.000 claims abstract description 41
- 230000005540 biological transmission Effects 0.000 claims abstract description 38
- 238000009432 framing Methods 0.000 claims abstract description 9
- 230000000737 periodic effect Effects 0.000 claims abstract description 7
- 230000008569 process Effects 0.000 claims description 7
- 102100027731 Endogenous retrovirus group K member 16 Rec protein Human genes 0.000 claims 3
- 101000580913 Homo sapiens Endogenous retrovirus group K member 16 Rec protein Proteins 0.000 claims 3
- 238000005259 measurement Methods 0.000 description 10
- 238000010586 diagram Methods 0.000 description 3
- 230000003044 adaptive effect Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000002457 bidirectional effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000012938 design process Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/1851—Systems using a satellite or space-based relay
- H04B7/18513—Transmission in a satellite or space-based system
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9057—Arrangements for supporting packet reassembly or resequencing
-
- 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/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- Aviation & Aerospace Engineering (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a method and a system for balanced transmission calculation based on CCSDS packet telemetry, which comprises the following steps: step 1: judging whether the PCM telemetry periodic downloading channel can download all telemetry packets or not; step 2: establishing a download matrix and an initial download allowance; and step 3: according to a telemetry packet priority non-frame-crossing transmission method, calculating according to a telemetry packet downloading period and a telemetry packet length to obtain a downloading matrix; and 4, step 4: judging whether all the telemetry packets can be downloaded in a plurality of PCM telemetry downloading channels in an updating period; and 5: and recalculating the initial matrix according to a telemetry packet unpacking and framing transmission method to finally obtain a telemetry packet balanced downloading time initial value table. The invention is simple to implement, can flexibly adapt to the requirements of telemetering packets with different lengths, different downloading periods and different telemetering packet numbers, ensures that all telemetering packets can be downloaded periodically through simple calculation statistics and condition judgment, and provides accurate telemetering downloading time.
Description
Technical Field
The invention relates to the technical field of spacecraft telemetry, in particular to a method and a system for equilibrium transfer calculation based on CCSDS (consultative Committee for space data System) sub-packet telemetry.
Background
Nowadays, with the continuous improvement of the technical level of space in China, the development of satellite platforms and load application is continuous, and the amount of data which needs to be processed and downloaded on the satellite in real time is continuously increased. However, due to the fact that the downlink code rate of a physical channel is limited by multiple factors, the telemetry actually transmitted to the ground is still limited, how to completely download the telemetry on the satellite in the limited transmission channel and reflect the real on-orbit situation of the spacecraft in real time is the most important ring in the actual telemetry downlink design process.
A CCSDS-based packet telemetry system carries out dynamic hierarchical management on telemetry data in a periodically updated packet mode, different data of multiple information sources and multiple users are packaged into independent telemetry packets, and a satellite processor acquires all the telemetry packets and then fills the telemetry packets into PCM transmission frames at proper time to wait for a telemetry channel to periodically download to the ground. The remote measuring package filling time needs to measure the resource capacity of the current remote measuring downlink channel on the basis of the general requirements of a remote measuring package user, and simultaneously, the remote measuring downlink channel can be ensured to transmit a remote measuring source package completely.
A packet telemetry scheduling algorithm based on CCSDS AOS protocol (measurement and control technology, vol.36, no. 94 of 2017) is a packet scheduling algorithm based on cyclic prearrangement, emphasizes that the length of each telemetry packet at the same download frequency is required to be the same, and performs scheduling by analyzing the matching between the telemetry frequency of a subsystem and the transmission frequency of a physical channel. The calculation method provided by the invention can adapt to different telemetry packet lengths and periodically supports customization. The article does not emphasize the initial telemetry download of the subsystem, i.e. at which point the transmission of telemetry packet data is started.
The "scheme for adaptive telemetry channel rate packetized telemetry scheduling" (aircraft academy of control, volume 35, no. 4, 2016) describes a method for packetized scheduling according to a predetermined telemetry cycle, where the process of generating the periodic scheduling initial value of the telemetry packet is not mentioned. The method provides a general calculation mode for indicating which telemetry packet is scheduled at which time point, and ensures that all telemetry packets can be transmitted stably and uniformly.
Patent document CN109639351A (application number: CN 201811620993.7) discloses a unified laser measurement and control method, which utilizes a laser link to implement high-speed data transmission, remote measurement, distance measurement and speed measurement, and time-frequency transmission, and includes a laser link transmission frame format design implemented by a new measurement and control system, and distance, speed, and clock error measurement based on a bidirectional laser communication link, transmission frame capture and "measurement frame" identification, and "measurement frame" arrival time accurate measurement, but the compatibility is much worse than that of the present invention.
Disclosure of Invention
Aiming at the defects in the prior art, the invention aims to provide a method and a system for computing the balanced transmission based on CCSDS packet telemetry.
The invention provides a balanced transmission computing method based on CCSDS (consultative Committee for space data System) packet telemetry, which comprises the following steps:
step 1: judging whether the PCM telemetry periodic downloading channel can download all telemetry packets or not;
step 2: establishing a download matrix and an initial download allowance R;
and step 3: according to a telemetry packet priority non-frame-crossing transmission method, calculating according to a telemetry packet downloading period and a telemetry packet length to obtain a downloading matrix;
and 4, step 4: judging whether all the telemetry packets can be downloaded in a plurality of PCM telemetry downloading channels in an updating period;
and 5: and recalculating the initial matrix according to a telemetry packet unpacking and framing transmission method to finally obtain a telemetry packet balance downloading time initial value table.
Preferably, the step 1 comprises: judging whether the length L of a multiplex protocol data unit M-PDU in the PCM telemetry frame is more than or equal to the total telemetry download amount total;
if L is larger than or equal to total, entering the step 2 to continue calculation; otherwise, the telemetry packet downloading period needs to be readjusted 1 ～period j Or telemetry packet length 1 ～length j And comparing again;
the total telemetry download amount total refers to the sum of lengths obtained by converting all telemetry packets according to a download channel update period T, and the calculation formula is as follows:
wherein j is more than or equal to 1 and less than or equal to n, and n is the number of the downloaded telemetry packets.
Preferably, the step 2 comprises: established download matrix a = (a) ij ) y×(n+1) The expression of (c) is:
wherein, { e { 1 ,e 2 ,…e n All initial values are 0, { e } n+1 The initial value is L, v 1 Coefficient representing the first row in matrix A, a 11 Representing telemetry data in the first row and column of matrix a, and y is the number of rows in matrix a.
Preferably, the step 3 comprises:
step 3.1: establishing a maximum limit D of the telemetering downloading channel;
D＝max(max(length(d(e j )＝0)),max(e n+1 ))
wherein,
denotes the sum of the j-th column of matrix A, max (length (d (e) j ) = 0)) represents the longest telemetry packet length for the sum of columns in a to 0;
step 3.2: establishing a temporary matrix B, wherein the initial value is equal to A;
step 3.3: calculating the total data quantity to be downloaded of the PCM telemetry frame downloading channel, namely, according to the downloading period to the q-th column of the matrix B q Filling the column number corresponding to the telemetry packet length, and calculating to obtain a value e 'of the n +1 th column in the matrix B' n+1 And a minimum margin Rmin and a maximum margin Rmax:
p＝min 1≤i≤y (max(e′ n+1 ))
Rmin＝min(b i(n+1) )
Rmax＝max(b i(n+1) )
wherein p is e 'of the current B' n+1 Minimum line number, q pairs, corresponding to maximum valueThe minimum column number should be column sum 0, fq represents the download frequency of the q-th telemetry packet, F q ＝period q T, and d (v' i ) Representing the sum of ith line data
Step 3.4: judging whether the PCM telemetry frame downloading channel can download all filled telemetry packets according to Rmin and Rmax:
if Rmin is greater than R, indicating that the cycle has a margin, continuously downloading other telemetering packets, and entering step 3.5 to continue calculation;
if Rmin is less than or equal to R and Rmax is less than or equal to D, downloading all packets, and entering the step 3.6 for calculation;
if Rmin is less than or equal to R, rmax is greater than D, the currently filled telemetry packet cannot be completely downloaded, and the step 3.7 is carried out for calculation;
step 3.5: judgment and period q Whether telemetry packet number j of the same download period has been downloaded in its entirety, i.e., d (e ') in B' j ) Whether or not =0 is true;
if d (e' j ) If =0, then step 3.3 is entered to continue to fill in the next telemetry packet, where p is not changed, q is the next column and the minimum column number of 0; otherwise, go to step 3.6 to continue calculating;
step 3.6: assigning all the values of B to the matrix A, and entering the step 3.8 to continue calculation;
step 3.7: step 3.3 is entered, and period is downloaded to the q-th column of the matrix A according to the downloading period q Filling the column number corresponding to the length of the telemetry packet, and calculating to obtain the value e of the n +1 th column in the matrix A n+1 Continuing to calculate in step 3.8; p is not changed in the calculation process, q represents the minimum column number with the column sum of 0 in A and the longest telemetry packet length, and the calculation method is as follows:
step 3.8: judging whether all the telemetering packets are downloaded or not, namely judging d (e) in A j )＝0,1≤j≤n；
If d (e) j ) =0, finishing the generation of the downloading matrix A; else { e in A n+1 R is equal to { e } n+1 Mean of the values greater than or equal to 6, jump back to step 3.1 to start a cycle of telemetry packet initial value calculation.
Preferably, the step 4 comprises: determine { e n+1 The sum of all positive numbers sum is greater than or equal to 0;
if sum is more than or equal to 0, the telemetering packet is indicated to be transmitted in a balanced manner, and the telemetering packet is transmitted in an initial time table { time } 1 ,time 2 ,…time n }＝{e 1 ,e 2 ,…e n The line number of the first non-0 value in the };
if sum is less than 0, go to step 5 to continue the calculation.
Preferably, the only difference between the telemetry packet unpacking and framing transmission method in the step 5 and the telemetry packet priority non-frame-crossing transmission method is in the step 3.5 calculation judgment, when d (e) j ') =0 step 3.3, and p and q are recalculated to fill in the next telemetry packet.
Preferably, the telemetry packet downloading period referred to in step 1 1 ～period j Is an integral multiple of the update period T of the download channel;
the matrix A related to the step 2 needs to be sorted according to the downloading period and the telemetry packet length, and the column sequence number needs to be the column sequence number j and the packet length j And packet download period j One-to-one correspondence is realized;
the row number y = M/T of the matrix A involved in the step 2, wherein M is the telemetry packet downloading period 1 ～period j The least common multiple of.
Preferably, step 3.3 calculates the value of row 1, column n +1, b (i-1)(n+1) ＝0；
In the calculation in step 3.8, if { e of A n+1 All values in are less than 6, then e n+1 R and R are assigned 0.
Preferably, the telemetry packet with the fastest download period is preferentially considered in the calculation process, and the telemetry packet with the longest length is preferentially considered in the same download period.
According to the equilibrium transmission computing system based on CCSDS packet telemetry provided by the invention, the following modules are called by adopting the equilibrium transmission computing method based on CCSDS packet telemetry:
a module M1: judging whether the PCM telemetry periodic downloading channel can download all telemetry packets or not;
a module M2: establishing a downloading matrix and an initial downloading allowance R;
a module M3: according to a telemetry packet priority non-frame-crossing transmission method, calculating according to a telemetry packet downloading period and a telemetry packet length to obtain a downloading matrix;
a module M4: judging whether all the telemetry packets can be downloaded in a plurality of PCM telemetry downloading channels in an updating period;
a module M5: and recalculating the initial matrix according to a telemetry packet unpacking and framing transmission method to finally obtain a telemetry packet balanced downloading time initial value table.
Compared with the prior art, the invention has the following beneficial effects:
(1) The method can provide accurate telemetering downloading time, and ensure that all telemetering packets can be downloaded uniformly according to the downloading period;
(2) The invention is suitable for using a sub-packet telemetry downloading scheme, can compatibly calculate the downloading period and the length of various telemetry packets, and is adaptive to the downloading capability of a PCM channel.
Drawings
Other features, objects and advantages of the invention will become more apparent upon reading of the detailed description of non-limiting embodiments with reference to the following drawings:
FIG. 1 is a schematic diagram of a computing flow of equalization transmission based on CCSDS packet telemetry;
FIG. 2 is a schematic diagram of a preferred non-frame-crossing transfer method for telemetry packets;
fig. 3 is a diagram illustrating a telemetry packet unpacking and framing transfer method.
Detailed Description
The present invention will be described in detail with reference to specific examples. The following examples will assist those skilled in the art in further understanding the invention, but are not intended to limit the invention in any way. It should be noted that it would be obvious to those skilled in the art that various changes and modifications can be made without departing from the spirit of the invention. All falling within the scope of the present invention.
The embodiment is as follows:
the length L of an M-PDU (M-protocol data unit) of a spacecraft multiplexing protocol is 450 bytes, the updating period T of a downloading channel is 0.5s, 52 telemetry packets are totally waited for downloading, and the packet length and the downloading period are shown in the table 1.
Table 1 list of telemetry packets to be downloaded
Referring to fig. 1, the method for computing the equalization transmission based on the CCSDS packet telemetry is as follows:
s1, judging whether a PCM telemetry periodic downloading channel can download all telemetry packets, namely whether the length L of a multiplex protocol data unit M-PDU in a PCM telemetry frame is more than or equal to the total telemetry downloading amount total;
if L is more than or equal to total, the step S2 is entered for continuous calculation; otherwise, the telemetry packet downloading period needs to be readjusted 1 ～period j Or telemetry packet length 1 ～length j (j is more than or equal to 1 and less than or equal to n, and n is the number of the downloaded telemetry packets), and comparing again;
and obtaining total =344.9063 and 450>344.9063 according to a telemetering download total amount calculation formula, and performing the next calculation.
S2, establishing a downloading matrix A = (a) ij ) y×(n+1) And an initial download margin R:
wherein, { e 1 ,e 2 ,…e n All initial values are 0, { e } n+1 The initial value is L =450,the initial value of R is L-total =450-344.9063=105.0938, and an initial download matrix A is established 256×53 . For the convenience of calculation, a orders the packet numbers according to the download period and the packet length.
| 13 | 1 | 2 | 3 | 4 | 5 | 7 | 8 | …… | 51 | ||
| 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | …… | 0 | 450 |
| 2 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | …… | 0 | 450 |
| 3 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | …… | 0 | 450 |
| …… | …… | …… | …… | …… | …… | …… | …… | …… | …… | …… | …… |
| 256 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | …… | 0 | 450 |
As shown in fig. 2, S3, according to the telemetry packet priority non-frame-crossing transmission method, calculating to obtain a download matrix a according to the telemetry packet download period and the telemetry packet length;
and finally obtaining a new matrix A meeting the conditions after calculation by a priority non-frame-crossing transmission method.
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | …… | 52 | 53 | |
| 1 | 65 | 12 | 134 | 0 | 0 | 0 | 0 | 0 | …… | 0 | 119 |
| 2 | 65 | 12 | 0 | 136 | 0 | 0 | 0 | 0 | …… | 0 | 117 |
| 3 | 65 | 12 | 0 | 0 | 130 | 0 | 0 | 0 | …… | 0 | 123 |
| …… | …… | …… | …… | …… | …… | …… | …… | …… | …… | …… | …… |
| 256 | 65 | 12 | 0 | 0 | 0 | 0 | 0 | 0 | …… | 0 | 135 |
S4, judging whether y PCM telemetry download channel update cycles can download all telemetry packets, namely { e n+1 The sum of all positive numbers sum is greater than or equal to 0;
and (4) calculating sum =26767 to be more than or equal to 0, wherein the initial value of the downloading time of the telemetry packet is shown in the following table:
in this case, the method of performing telemetry packet transmission preferentially without crossing frames can obtain the final download initial value, and specifically includes the following steps:
step 1, firstly, establishing a maximum limit D of the telemetering downloading channel:
D＝max(max(length(d(e j )＝0)),max(e n+1 ))
wherein
Denotes the sum of the jth column of matrix A, max (length (d (e) j ) = 0)) represents the longest telemetry packet length for the sum of columns in a to 0;
before each download period is estimated, a new maximum limit value is calculated, wherein the new maximum limit value is equal to the maximum value of the longest length value and the maximum download allowance value in the telemetry packet to be downloaded and is used for evaluating whether the download amount of the period meets the requirement or not. Downloading a first telemetry packetSince A is the initial matrix, where the longest telemetry packet length with a column sum of 0 is 120 bytes, max (e) n+1 ) =450, so the maximum limit D =450.
Step 2, establishing a temporary matrix B, wherein the initial value is equal to A;
as shown in fig. 3, considering that the original matrix a may be reused by a telemetry packet unpacking and framing transfer method, a temporary matrix B is established to record the whole calculation process, and after the conditions are met, the calculation result is filled as a final download matrix a.
Step 3, calculating the total data amount required to be downloaded by a downloading channel of the PCM telemetry frame, namely, according to the downloading period to the q-th column of the matrix B q Filling the column number corresponding to the telemetry packet length, and calculating to obtain a value e 'of the n +1 th column in the matrix B' n+1 And a minimum margin Rmin and a maximum margin Rmax:
p＝min 1≤i≤y (max(e′ n+1 ))
Rmin＝min(b i(n+1) )
Rmax＝max(b i(n+1) )
wherein p is e 'of current B' n+1 Minimum row number for maximum value, q minimum column number for column sum 0, fq represents the download frequency of the qth telemetry packet, F q ＝period q Divorce T; and d (v' i ) Represents the sum of ith line data
This step is equivalent to populating the matrix table with all telemetry packet lengths in terms of the download cycle, and calculating that if the telemetry packets are downloaded for that cycle, the total telemetry channel remaining is represented by the last column.
Since the first telemetry packet is downloaded with 0 in the first n columns of B, q =1,p =1,F q =0.5 ÷ 0.5=1, so the first column of B is filled with 120,b in its entirety (1,53) =450-120=330, rmin = rmax =330, so the matrix B values are as follows:
| 13 | 1 | 3 | 4 | 25 | 29 | 5 | 7 | …… | 51 | 53 | |
| 1 | 120 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | …… | 0 | 450-120 |
| 2 | 120 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | …… | 0 | 450-120 |
| 3 | 120 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | …… | 0 | 450-120 |
| …… | …… | …… | …… | …… | …… | …… | …… | …… | …… | …… | …… |
| 128 | 120 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | …… | 0 | 450-120 |
and 4, judging whether all the filled telemetry packets can be downloaded by the PCM telemetry frame downloading channel according to Rmin and Rmax:
if Rmin > R: indicating that the period has a margin, continuously downloading other telemetering packets, and entering the step 5 to continuously calculate;
if Rmin is less than or equal to R, rmax is less than or equal to D: all packets can be downloaded and the calculation in step 6 is carried out;
if Rmin is less than or equal to R, rmax is greater than D: the currently filled telemetry packet cannot be completely downloaded, and the step 7 is carried out for calculation;
step 5, judging and period q Telemetry packet number j of the same download period isNo complete download has occurred, i.e. d (e ') in B' j ) If 0 is true.
If d (e' j ) =0, indicating that the telemetry packet in the same period is not filled, and entering step 3 to continue filling the telemetry packet in the same period, wherein p is not changed; if d (e' j ) Not equal to 0, indicating that the telemetry packets in the same period are all filled, and entering the step 6 to continue to fill the telemetry packets in the next period;
step 6, assigning all the values of B to the matrix A, filling telemetry packets to meet all the conditions, and entering step 8 to continue calculation;
step 7, filling the telemetry packet B according to the current state, if the download condition can not be met, re-entering the step 3, and filling the longest telemetry packet which is not downloaded currently into the matrix A, namely the q-th column according to the download period q Filling the column number corresponding to the length of the telemetry packet, and calculating to obtain the value e of the n +1 th column in the matrix A n+1 Entering step 8 to continue calculation; p is not changed in the calculation process, q represents the minimum column number with the column sum of 0 in A and the longest telemetry packet length, and the calculation method is as follows:
step 8, judging whether all the telemetering packets are downloaded, namely judging d (e) in A j )＝0，1≤j≤n；
If d (e) j ) =0, finishing the generation of the downloading matrix A; else { e n+1 R is equal to { e } n+1 Mean of values greater than or equal to 6 in a packet, jump back to step 1 to start the initial value calculation of the telemetry packet for the next cycle until each column in a is filled with data.
Those skilled in the art will appreciate that, in addition to implementing the systems, apparatus, and various modules thereof provided by the present invention in purely computer readable program code, the same procedures can be implemented entirely by logically programming method steps such that the systems, apparatus, and various modules thereof are provided in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers and the like. Therefore, the system, the apparatus, and the modules thereof provided by the present invention may be considered as a hardware component, and the modules included in the system, the apparatus, and the modules for implementing various programs may also be considered as structures in the hardware component; modules for performing various functions may also be considered to be both software programs for performing the methods and structures within hardware components.
The foregoing description of specific embodiments of the present invention has been presented. It is to be understood that the present invention is not limited to the specific embodiments described above, and that various changes or modifications may be made by one skilled in the art within the scope of the appended claims without departing from the spirit of the invention. The embodiments and features of the embodiments of the present application may be combined with each other arbitrarily without conflict.
Claims (6)
1. A balanced transmission computing method based on CCSDS packet telemetry is characterized by comprising the following steps:
step 1: judging whether the PCM telemetry periodic downloading channel can download all telemetry packets or not;
step 2: establishing a downloading matrix and an initial downloading allowance R;
and step 3: according to a telemetry packet priority non-frame-crossing transmission method, calculating according to a telemetry packet downloading period and a telemetry packet length to obtain a downloading matrix;
and 4, step 4: judging whether all the telemetry packets can be downloaded in a plurality of PCM telemetry downloading channels in an updating period;
and 5: recalculating the initial matrix according to a telemetry packet unpacking and framing transmission method to finally obtain a telemetry packet balance downloading time initial value table;
the step 1 comprises the following steps: judging whether the length L of a multiplex protocol data unit M-PDU in the PCM telemetry frame is more than or equal to the total telemetry download amount total;
if L is larger than or equal to total, entering the step 2 to continue calculation; otherwise, the telemetry packet downloading period needs to be readjusted 1 ～period j Or telemetry packet length 1 ～length j And comparing again;
the total telemetry download amount total refers to the sum of lengths obtained by converting all telemetry packets according to a download channel update period T, and the calculation formula is as follows:
wherein j is more than or equal to 1 and less than or equal to n, and n is the number of the downloaded telemetry packets;
the step 2 comprises the following steps: established download matrix a = (a) ij ) y×(n+1) The expression of (a) is:
wherein, { e 1 ,e 2 ,…e n All initial values are 0, { e } n+1 The initial value is L, v 1 Coefficient representing the first row in matrix A, a 11 Representing telemetry data of a first row and a first column in the matrix A, and y is the row number of the matrix A;
the step 3 comprises the following steps:
step 3.1: establishing a maximum limit D of the telemetering downloading channel;
D＝max(max(length(d(e j )＝O)),max(e n+i ))
wherein,
denotes the sum of the j-th column of matrix A, max (length (d (e) j ) = 0)) represents the longest telemetry packet length for the sum of columns in a to 0;
step 3.2: establishing a temporary matrix B, wherein the initial value is equal to A;
step 3.3: calculating the total data quantity to be downloaded of the PCM telemetry frame downloading channel, namely, according to the downloading period to the q-th column of the matrix B q Filling the column number corresponding to the telemetry packet length, and calculating to obtain a value e 'of the n +1 th column in the matrix B' n+1 And a minimum margin Rmin and a maximum margin Rmax:
p＝min 1≤i≤y (max(e′ n+1) )
Rmin＝min(b i(n+1) )
Rmax＝max(b i(n+i) )
wherein p is e 'of current B' n+1 Minimum row number corresponding to maximum value, q corresponding to column and minimum column number of 0, fq representing the download frequency of the q-th telemetry packet, F q ＝period q T, and d (v' i ) Representing the sum of ith line data
Step 3.4: judging whether the PCM telemetry frame downloading channel can download all filled telemetry packets according to Rmin and Rmax:
if Rmin is greater than R, indicating that the cycle has a margin, continuing to download other telemetering packets, and entering step 3.5 to continue calculation;
if Rmin is less than or equal to R and Rmax is less than or equal to D, downloading all packets, and entering the step 3.6 for calculation;
if Rmin is less than or equal to R, rmax is greater than D, indicating that the currently filled telemetry packet cannot be completely downloaded, and entering step 3.7 for calculation;
step 3.5: judgment and period q Whether telemetry packet number j of the same download period has been downloaded in its entirety, i.e., d (e ') in B' j ) Whether or not =0 is true;
if d (e' j ) If =0, then step 3.3 is entered to continue to fill in the next telemetry packet, where p is not changed, q is the next column and the minimum column number of 0; otherwise, go to step 3.6 to continue calculating;
step 3.6: assigning all the values of B to the matrix A, and entering the step 3.8 to continue calculation;
step 3.7: step 3.3 is entered, and period is downloaded to the q-th column of the matrix A according to the downloading period q Filling the column number corresponding to the length of the telemetry packet, and calculating to obtain the value e of the n +1 th column in the matrix A n+1 Continuing to calculate in step 3.8; p is not changed in the calculation process, q represents the minimum column number with the column sum of 0 in A and the longest telemetry packet length, and the calculation method is as follows:
step 3.8: judging whether all the telemetering packets are downloaded or not, namely judging d (e) in A j )＝0,1≤j≤n；
If d (e) j ) =0, finishing the generation of the downloading matrix A; else { e in A n+1 R is equal to { e } n+1 Mean of the values greater than or equal to 6 in the method, jump back to step 3.1, and start calculation of the initial value of the telemetry packet in one period;
the step 4 comprises the following steps: judgment { e n+1 The sum of all positive numbers sum is greater than or equal to 0;
if sum is more than or equal to 0, the telemetering packet is indicated to be transmitted in a balanced manner, and the telemetering packet is transmitted in an initial time table { time } 1 ,time 2 ,…time n }＝{e 1 ,e 2 ,…e n The line number of the first non-0 value in the };
if sum is less than 0, go to step 5 to continue the calculation.
2. The CCSDS-packetized telemetry-based balanced transmission calculation method as claimed in claim 1, wherein the only difference between the telemetry packet unpacking and framing transmission method in step 5 and the telemetry packet priority non-frame-crossing transmission method is that in the calculation judgment of step 3.5, when d (e' j ) Step 3.3 is entered for =0 and p and q are recalculated to fill in the next telemetry packet.
3. The CCSDS packet telemetry-based equalization transmission calculation method of claim 1 wherein the steps areTelemetry packet download period related to 1 1 ～period j Is an integral multiple of the update period T of the download channel;
the matrix A related to the step 2 needs to be sorted according to the downloading period and the telemetry packet length, and the column sequence number needs to be the column sequence number j and the packet length j And packet download period j One-to-one correspondence is realized;
the row number y = M/T of the matrix A involved in the step 2, wherein M is the telemetry packet downloading period 1 ～period j The least common multiple of.
4. The CCSDS packet telemetry based equalization transmission calculation method of claim 1 wherein step 3.3 when calculating row 1, column n +1 value, b (i-1)(n+1) ＝0；
In the calculation in step 3.8, if { e of A n+1 All values in are less than 6, then e n+1 R and R are assigned 0.
5. The method as claimed in claim 1, wherein the telemetry packet with the fastest download period is prioritized in the calculation process, and the telemetry packet with the longest length is prioritized in the same download period.
6. A system for computing balanced transmission based on CCSDS packet telemetry, characterized in that the following modules are invoked by using the method for computing balanced transmission based on CCSDS packet telemetry according to any one of claims 1 to 5:
a module M1: judging whether the PCM telemetry periodic downloading channel can download all telemetry packets or not;
a module M2: establishing a downloading matrix and an initial downloading allowance R;
a module M3: according to a telemetry packet priority non-frame-crossing transmission method, calculating according to a telemetry packet downloading period and a telemetry packet length to obtain a downloading matrix;
a module M4: judging whether all the telemetry packets can be downloaded in a plurality of PCM telemetry downloading channels in an updating period;
a module M5: recalculating the initial matrix according to a telemetry packet unpacking and framing transmission method to finally obtain a telemetry packet balance downloading time initial value table;
the module M1 comprises: judging whether the length L of a multiplex protocol data unit M-PDU in the PCM telemetry frame is more than or equal to the total telemetry download amount total;
if L is larger than or equal to total, entering a module M2 to continue calculation; otherwise, the telemetry packet downloading period needs to be readjusted 1 ～period j Or telemetry packet length 1 ～length j And comparing again;
the total telemetry download amount total refers to the sum of lengths obtained by converting all telemetry packets according to a download channel update period T, and the calculation formula is as follows:
j is more than or equal to 1 and less than or equal to n, and n is the number of the downloaded telemetry packets;
the module M2 comprises: established download matrix a = (a) ij ) y×(n+1) The expression of (c) is:
wherein, { e 1 ,e 2 ,…e n All initial values are 0, { e } n+1 The initial value is L, v 1 Coefficient representing the first row in matrix A, a 11 Representing telemetry data of a first row and a first column in the matrix A, and y is the row number of the matrix A;
the module M3 comprises:
module M3.1: establishing a maximum limit D of the telemetering downloading channel;
D＝max(max(length(d(e j )＝0)),max(e n+1 ))
wherein,
represents the second of the matrix AThe sum of j columns, max (length (d (e)) j ) = 0)) represents the longest telemetry packet length for the sum of columns in a to 0; />
Module M3.2: establishing a temporary matrix B, wherein the initial value is equal to A;
module M3.3: calculating the total data quantity to be downloaded of the PCM telemetry frame downloading channel, namely, according to the downloading period to the q-th column of the matrix B q Filling the column number corresponding to the telemetry packet length, and calculating to obtain a value e 'of the n +1 th column in the matrix B' n+1 And a minimum margin Rmin and a maximum margin Rmax:
p＝min 1≤i≤y (max(e′ n+1 ))
Rmin＝min(b i(n+1) )
Rmax＝max(b i(n+i) )
wherein p is e 'of the current B' n+1 Minimum row number corresponding to maximum value, q corresponding to column and minimum column number of 0, fq representing the download frequency of the q-th telemetry packet, F q ＝period q T, and d (v' i ) Representing the sum of ith line data
Module M3.4: judging whether the PCM telemetry frame downloading channel can download all filled telemetry packets according to Rmin and Rmax:
if Rmin is greater than R, indicating that the cycle has a margin, continuously downloading other telemetering packets, and entering a module M3.5 to continuously calculate;
if Rmin is less than or equal to R and Rmax is less than or equal to D, downloading all packets, and entering a module M3.6 for calculation;
if Rmin is less than or equal to R, rmax is greater than D, the currently filled telemetry packet cannot be completely downloaded, and a module M3.7 is used for calculation;
module M3.5: judgment and period q Whether telemetry packet number j of the same download period has been downloaded in its entirety, i.e., d (e ') in B' j ) Whether or not =0 is true;
if d (e' j ) If =0, the entering module M3.3 continues to fill in the next telemetry packet, where p is not changed, q is the next column and the minimum column number of 0; otherwise, entering a module M3.6 to continue calculating;
module M3.6: assigning all the values of B to the matrix A, and entering a module M3.8 for continuous calculation;
module M3.7: entering a module M3.3, and periodically downloading to the q-th column of the matrix A according to the downloading period q Filling the column number corresponding to the length of the telemetry packet, and calculating to obtain the value e of the n +1 th column in the matrix A n+1 Entering a module M3.8 to continue calculation; p is unchanged during calculation, q represents the minimum column number with column sum 0 in A and the longest telemetry packet length, and the calculation method is as follows:
module M3.8: judging whether all the telemetering packets are downloaded or not, namely judging d (e) in A j )＝0,1≤j≤n；
If d (e) j ) =0, finishing the generation of the downloading matrix A; else { e in A n+1 R is equal to { e } n+1 The average Mean of the values greater than or equal to 6 in the module jumps back to the module M3.1 to start the calculation of the initial value of the telemetry packet in one period;
the module M4 comprises: judgment { e n+1 The sum of all positive numbers sum is greater than or equal to 0;
if sum is more than or equal to 0, the telemetering packet is indicated to be transmitted in a balanced manner, and the telemetering packet is transmitted in an initial time table { time } 1 ,time 2 ,…time n }＝{e 1 ,e 2 ,…e n The line number of the first non-0 value in the };
if sum <0, then module M5 is entered to continue the calculation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110513325.XA CN113364511B (en) | 2021-05-11 | 2021-05-11 | Equilibrium transfer computing method and system based on CCSDS packet telemetry |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110513325.XA CN113364511B (en) | 2021-05-11 | 2021-05-11 | Equilibrium transfer computing method and system based on CCSDS packet telemetry |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113364511A CN113364511A (en) | 2021-09-07 |
| CN113364511B true CN113364511B (en) | 2023-04-07 |
Family
ID=77526142
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110513325.XA Active CN113364511B (en) | 2021-05-11 | 2021-05-11 | Equilibrium transfer computing method and system based on CCSDS packet telemetry |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113364511B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102799665A (en) * | 2012-07-13 | 2012-11-28 | 中国航天空气动力技术研究院 | Unmanned aerial vehicle video data processing method |
| CN110175051A (en) * | 2019-04-11 | 2019-08-27 | 上海卫星工程研究所 | The integrated telemetering configuring management method in star ground |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7397774B1 (en) * | 2003-05-23 | 2008-07-08 | The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration | Downlink data multiplexer |
| CN103163782B (en) * | 2013-02-28 | 2015-07-08 | 北京空间飞行器总体设计部 | Spacecraft delay telemetering downloading strategy computing method |
| CN105281822B (en) * | 2014-06-26 | 2018-08-24 | 上海新跃仪表厂 | The different hardware framing telemetering aligning methods for passing period fixation radio frequency channel status requirement down |
| CN109756514B (en) * | 2019-02-26 | 2021-07-13 | 北京控制工程研究所 | Telemetry data dynamic processing method of spacecraft complex protocol |
| CN110932929B (en) * | 2019-11-12 | 2021-08-24 | 上海卫星工程研究所 | Method, system and medium for classifying and extracting satellite telemetry packets in CCSDS system |
-
2021
- 2021-05-11 CN CN202110513325.XA patent/CN113364511B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102799665A (en) * | 2012-07-13 | 2012-11-28 | 中国航天空气动力技术研究院 | Unmanned aerial vehicle video data processing method |
| CN110175051A (en) * | 2019-04-11 | 2019-08-27 | 上海卫星工程研究所 | The integrated telemetering configuring management method in star ground |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113364511A (en) | 2021-09-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Bello et al. | Schedulability analysis of Time-Sensitive Networks with scheduled traffic and preemption support | |
| US7788667B2 (en) | Extensible scheduling of tasks in time-triggered distributed embedded systems | |
| CN111861412B (en) | Completion time optimization-oriented scientific workflow scheduling method and system | |
| CN110175051B (en) | Satellite-ground integrated remote measurement configuration management method | |
| US7339948B2 (en) | Industrial controller providing deterministic communication on ethernet | |
| US7457296B2 (en) | Method and apparatus for sorting packets in packet schedulers using a connected trie data structure | |
| CN108848146B (en) | Scheduling optimization method based on time-triggered communication service | |
| US8473563B2 (en) | Extensible scheduling of messages on time-triggered busses | |
| Tanasa et al. | Reliability-aware frame packing for the static segment of FlexRay | |
| US7843940B2 (en) | Filling token buckets of schedule entries | |
| CN111198754B (en) | Task scheduling method and device | |
| CN107623728B (en) | FC-AE-ASM data universal analysis method based on product interface control file | |
| Lange et al. | Guaranteeing real-time message deadlines in the FlexRay static segment using a on-line scheduling approach | |
| CN115827250A (en) | Data storage method, device and equipment | |
| CN109597687A (en) | Data synchronous resource allocation methods, device, storage medium and electronic equipment | |
| CN113364511B (en) | Equilibrium transfer computing method and system based on CCSDS packet telemetry | |
| Mundhenk et al. | Policy-based message scheduling using FlexRay | |
| Di Natale et al. | On the applicability of an MILP solution for signal packing in CAN-FD | |
| CN114443716A (en) | Gaia platform water line dynamic adjustment method and device based on event time window | |
| US20110188520A1 (en) | Method for operating a time-controlled bus system | |
| Liu et al. | Controller and architecture co-design of wireless cyber-physical systems | |
| Siyoum et al. | Symbolic analysis of dataflow applications mapped onto shared heterogeneous resources | |
| CN115115292B (en) | Power generation distribution information generation method, device, apparatus, medium, and program product | |
| Ashjaei et al. | SEtSim: A modular simulation tool for switched Ethernet networks | |
| CN113906720A (en) | Traffic scheduling method, device and storage medium |
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 |