CN113934650B - 1553B memory dynamic allocation method based on CCSDS - Google Patents
1553B memory dynamic allocation method based on CCSDS Download PDFInfo
- Publication number
- CN113934650B CN113934650B CN202111012575.1A CN202111012575A CN113934650B CN 113934650 B CN113934650 B CN 113934650B CN 202111012575 A CN202111012575 A CN 202111012575A CN 113934650 B CN113934650 B CN 113934650B
- Authority
- CN
- China
- Prior art keywords
- ccsds
- address
- sub
- memory
- telemetry
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/06—Addressing a physical block of locations, e.g. base addressing, module addressing, memory dedication
- G06F12/0646—Configuration or reconfiguration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F12/0877—Cache access modes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/23—Clustering techniques
-
- 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)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Life Sciences & Earth Sciences (AREA)
- Artificial Intelligence (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Bioinformatics & Computational Biology (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Evolutionary Biology (AREA)
- Evolutionary Computation (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Radio Relay Systems (AREA)
Abstract
A1553B memory dynamic allocation method based on CCSDS (compact packet data service) aims at solving the problems of low design efficiency, lack of fault management means and lack of on-orbit maintenance means existing in the traditional passive memory management method, and by carrying out general configuration on CCSDS protocol format and multiplexing configuration on all sub-addresses of 1553B, and carrying out rapid customized splicing and sending on packing contents, the method realizes that messages corresponding to all service types in the period are framed according to protocol conventions, can be quickly arranged and combined into appointed sub-addresses through telemetry table configuration on any telemetry sub-packet, solves the problems of packing of telemetry packets of all types and deep coupling of protocol details under the CCSDS protocol, and has low telemetry packing efficiency, and has the advantage of generalization.
Description
Technical Field
The invention relates to a 1553B memory dynamic allocation method based on CCSDS, and belongs to the field of space embedded software.
Background
With the increase of remote control and telemetry data volume of a spacecraft, the data communication frequency is faster and faster, the requirement on transmission reliability is higher and higher, with the massive application of the international CCSDS standard, the application of the standard in the aerospace field of China is a trend of accelerating development, and the application of the standard is more popular particularly in remote sensing satellite platform software. The standard realizes efficient spatial data communication and optimizes the utilization of spatial resources. The traditional passive 1553B memory management method cannot meet the flexible memory management requirement, and the following application problems need to be solved:
(1) The 1553B memory allocation is fixed, the packaging program is highly coupled with the protocol content, the design efficiency is low, and the 1553B high-standard data stream transmission requirement cannot be met. Because the traditional packing content is closely related to the sub-address, each model needs to be rewritten with a packing program, which is time-consuming and labor-consuming, and if the protocol is adjusted, the code needs to be rewritten;
(2) Memory failure management approaches are lacking. After the rail fails, the suspicious target is downloaded and manually judged through the memory downloading channel, but the fault condition of the channel limited by the memory downloading can not be accurately downloaded, and if the target memory data is changed in real time, the accuracy of specific numerical values can not be manually judged, and the fault positioning is difficult and heavy;
(3) The lack of on-track maintenance means, fixed address memory configuration results in no means to relocate to other idle memory to avoid bad blocks even if a specific failed address is located. Once a certain sub address is wrong, the problems that bad blocks can not be avoided by on-track dynamic adjustment exist.
Disclosure of Invention
The invention solves the technical problems that: aiming at the problems of low design efficiency, lack of fault management means and lack of on-orbit maintenance means existing in the traditional passive memory management method in the prior art, the invention provides a 1553B memory dynamic allocation method based on CCSDS.
The invention solves the technical problems by the following technical proposal:
A1553B memory dynamic allocation method based on CCSDS comprises the following steps:
(1) Initializing a CCSDS data packet framing information table;
(2) Acquiring an initialized sub-address memory mapping table;
(3) Traversing the state of each telemetry item in the CCSDS data packet framing information table, and setting a traversing sequence number variable idx=0 and a packed length Lstenth=0;
(4) Judging a destination sub-address of the current telemetry item TMItem, if the destination sub-address rtAdr is equal to Rtx, entering a step (5), otherwise, entering a step (15);
(5) According to CCSDS protocol and CCSDS protocol information info configuration information of a current telemetry item TMItem, forming a packet header, placing a telemetry data packet buffer area address pbuffer head address of the current telemetry item TMItem, simultaneously returning to a packet header length index, and continuing data packaging by the current packet header length index;
(6) According to CCSDS protocol, obtaining the source address pbuffer and the moving length of the telemetry item TMItem, calculating Rtx variable Lookup [ Rtx ] +the moving length Lstent in the target address DestAddr=sub-address memory mapping table, and moving the bytes from the source address pbuffer to the target address DestAddr memory, and entering the step (7);
(7) If the current Time percent cktime is equal to idx, the data packet reaches the polling period of each hour, and the step (8) is entered, otherwise, the step (12) is entered;
(8) If the current telemetry item TMItem needs memory detection, a memory check permission flag IsCheck of the current telemetry item TMItem is 1, a step (9) is entered, otherwise, a step (12) is entered;
(9) Comparing all variables of the DestAddr array and the pfuffer array one by one, wherein the comparison length is the moving length of the TMItem, if the comparison is correct, the step (12) is entered, and otherwise, the step (10) is entered;
(10) Comparing the error mark ErrFlg with the Rtx position 1, adding 1 to the fault area count ErrCnt, and remotely measuring ErrFlg, errCnt count to download, and entering the step (12);
(11) Initializing 1553 chips if the fault area count ErrCnt is greater than 3 times, and resetting the ErrCnt, otherwise, entering the step (12);
(12) If lstlet=lstlet+tmitem length, the idx count is incremented by 1, whether the CCSDS packet framing information table is traversed is judged, if so, the flow is counted, otherwise, the CCSDS packet framing information table is traversed to the next piece and returns to step (3).
In the step (1), the standard number of times of initializing the chip by the fault area count ErrCnt is adjustable.
And (7) the standard time of the regional round trip detection period cktime is adjustable, and the self-defined setting is carried out according to the satellite communication period and the security level of each data sampling packet.
The standard time of the regional round checking period cktime is not less than one hour and not more than one communication period.
In the step (1), the method for determining the initial binding format of the CCSDS data packet framing information table comprises the following steps:
optimizing before binding, carrying out clustering ordering according to groups according to RT sub-addresses rtAdr in a CCSDS data packet framing information table, enabling each sub-address in the n sub-addresses to correspond to k data packets, and comparing the optimal search time with the worst search time estimation so as to improve the packing efficiency.
The packaging efficiency is improved specifically as follows: nk (n-1)/2.
And initializing according to the optimized CCSDS data packet framing information table.
Compared with the prior art, the invention has the advantages that:
(1) According to the CCSDS-based 1553B memory dynamic allocation method provided by the invention, the packaging content is quickly customized, spliced and transmitted through the common configuration of CCSDS protocol format and the multiplexing configuration of all sub-addresses of 1553B, and the message to be transmitted is spliced and packaged into a designated memory, so that the message corresponding to each service type in the period is assembled and framed according to protocol convention, any telemetry sub-packet can be quickly arranged and combined into the designated sub-address through telemetry table configuration, the problems of packaging of telemetry packets of all types and deep coupling of protocol details under the CCSDS protocol are solved, the problem of low telemetry packaging efficiency is solved, the advantage of universalization is achieved, and the unified aim of a CCSDS protocol telemetry packaging platform is realized;
(2) The method adopts autonomous fault detection monitoring, starts periodic rotation polling detection on a key memory area, performs read-write comparison on a designated memory area, gives out a specific address range of a bad area, timely identifies the bad area, and reports the ground once the read-write comparison is inconsistent in a certain memory area; if a plurality of inconsistent areas occur, the method re-initializes 1553, solves the problem that the chip fault cannot be found in time on orbit, has the advantage of accurate fault detection, and realizes the rapid detection of the chip;
(3) According to the invention, through the initialization configuration of the 1553B memory sub-address lookup table, the memory area mapped by the sub-address can be adjusted, the on-orbit abnormal RAM area is avoided, the problem that no standby adjustment means exists when on-orbit faults occur is solved, the on-orbit sub-address lookup table has the on-orbit function, and more security guarantee of chips is realized.
Drawings
FIG. 1 is a flow chart of dynamic allocation and management of 1553B memory based on CCSDS;
FIG. 2 is a schematic diagram of a CCSDS packet framing information table according to the present invention;
FIG. 3 is a diagram of a 1553B sub-address memory map variable table according to the present invention;
FIG. 4 is a flowchart of a 1553B packing and moving main process provided by the invention;
FIG. 5 is a flowchart of a 1553B memory test method according to the present invention;
Detailed Description
A1553B memory dynamic allocation method based on CCSDS (compact disk storage system) solves the problems that memory fixation cannot be dynamically adjusted, an on-orbit chip fault lacks detection and repair means and the like by flexibly allocating and multiplexing configuration and memory self-comparison of memories and registers of 1553B, and achieves efficient and accurate self-maintenance of memories.
Specifically, the main principle of the allocation method is to design a CCSDS data packet framing information table, take each telemetry packet sequence number, CCSDS packet header information, a packet buffer head address, a length and a corresponding sub address as configurable items, and configure each telemetry packet information item into the table according to each attribute. And simultaneously designing a sub-address memory mapping table, and filling the mapping relation of the sub-addresses in the 1553B memory data block into the table. Firstly, respectively grouping telemetry items in a table according to sub addresses through a specially developed sub address grouping program, then searching memory addresses corresponding to the sub addresses in a sub address memory mapping table, putting the well-packed packets into memory data blocks pointed by the memory mapping table of the corresponding sub addresses, completing dynamic splicing and packing of data from packing to a memory, and completing self-detection management of the memory faults by calling a specially developed fault detection flow when packing.
The specific allocation and management steps are as follows:
(1) Initializing a CCSDS data packet framing information table;
(2) Acquiring an initialized sub-address memory mapping table;
(3) Traversing the state of each telemetry item in the CCSDS data packet framing information table, and setting a traversing sequence number variable idx=0 and a packed length Lstenth=0;
(4) Judging a destination sub-address of the current telemetry item TMItem, if the destination sub-address rtAdr is equal to Rtx, entering a step (5), otherwise, entering a step (15);
(5) According to CCSDS protocol and CCSDS protocol information info configuration information of a current telemetry item TMItem, forming a packet header, placing a telemetry data packet buffer area address pbuffer head address of the current telemetry item TMItem, simultaneously returning to a packet header length index, and continuing data packaging by the current packet header length index;
(6) According to CCSDS protocol, obtaining the source address pbuffer and the moving length of the telemetry item TMItem, calculating Rtx variable Lookup [ Rtx ] +the moving length Lstent in the target address DestAddr=sub-address memory mapping table, and moving the bytes from the source address pbuffer to the target address DestAddr memory, and entering the step (7);
(7) If the current Time percent cktime is equal to idx, the data packet reaches the polling period of each hour, and the step (8) is entered, otherwise, the step (12) is entered;
(8) If the current telemetry item TMItem needs memory detection, a memory check permission flag IsCheck of the current telemetry item TMItem is 1, a step (9) is entered, otherwise, a step (12) is entered;
(9) Comparing all variables of the DestAddr array and the pfuffer array one by one, wherein the comparison length is the moving length of the TMItem, if the comparison is correct, the step (12) is entered, and otherwise, the step (10) is entered;
(10) Comparing the error mark ErrFlg with the Rtx position 1, adding 1 to the fault area count ErrCnt, and remotely measuring ErrFlg, errCnt count to download, and entering the step (12);
(11) Initializing 1553 chips if the fault area count ErrCnt is greater than 3 times, and resetting the ErrCnt, otherwise, entering the step (12);
(12) If lstlet=lstlet+tmitem length, the idx count is incremented by 1, whether the CCSDS packet framing information table is traversed is judged, if so, the flow is counted, otherwise, the CCSDS packet framing information table is traversed to the next piece and returns to step (3).
In the step (1), the standard times of the fault area count ErrCnt initialization chip are adjustable;
the standard time of the regional round trip detection period cktime is adjustable, and is self-defined according to the satellite communication period and the security level of each data sampling packet, wherein the standard time of the regional round trip detection period cktime is not less than one hour and not more than one communication period;
the method for determining the initial binding format of the CCSDS data packet framing information table comprises the following steps:
optimizing before binding, carrying out clustering ordering according to groups according to RT sub addresses rtAdr in a CCSDS data packet framing information table, enabling each sub address in the n sub addresses to correspond to k data packets, and estimating and comparing the optimal searching time and the worst searching time so as to improve the packing efficiency;
the packing efficiency promotes specifically to: and nk (n-1)/2, initializing according to the optimized CCSDS data packet framing information table.
Further description of specific embodiments follows:
in this embodiment, as shown in fig. 1, the steps are as follows:
step 1, initializing a CCSDS data packet framing information table, wherein the CCSDS data packet framing information table consists of telemetry items and can be organized into an array or a linked list structure, and entering step 2; the CCSDS data packet framing information table is a two-dimensional vector table, as shown in fig. 2, for each action, one telemetry entry, each telemetry entry including the following fields: 1. CCSDS protocol information Info for telemetering package packet head information organization; 2. RT sub-address rtAdr, which represents the target sub-address sent by the telemetry packet, can be that a plurality of telemetry packets correspond to one sub-address; 3. a telemetry data packet buffer address pbuffer pointing to a buffer address of the telemetry data packet; 4. length, representing the length of the telemetry packet; 5. whether an IsCheck is required for memory check indicates whether the telemetry packet is required to check the piece of memory when moving to 1553B memory, for example, if configured as 1, it indicates that checking is required, and if configured as 0, it indicates that checking is not required; 6. the telemetry packet memory check period cktime;
the initial binding format of the CCSDS packet framing information table in step (1) is shown in fig. 2.
In order to improve the searching efficiency, the table is further optimized before binding, and cluster ordering is performed according to the RT sub-address rtAdr, namely telemetry packets of the same sub-address are sequentially arranged, if n sub-addresses are arranged, each sub-address corresponds to k data packets, and according to the optimal searching time and the worst searching time estimation comparison, the packing efficiency can be improved by nk (n-1)/2. Examples of optimized binding tables are as follows:
step 2, initializing a sub-address memory mapping table, wherein the sub-address memory mapping table comprises an array Lookup [32] formed by 32 transmitting sub-address variables, and step 3 is advanced; as shown in fig. 3, each row of the memory mapping table is a sub-address variable, and each sub-address variable represents a 1553B memory offset address corresponding to the sub-address, and step 3 is entered;
step 3, the sub-address Rtx packet program sequentially traverses the state of each telemetry entry of the CCSDS data packet framing information table, defines a traversal sequence number variable idx=0, defines a packed length lstleth=0, and enters step 4;
step 4, taking the destination sub-address rtAdr of the current telemetry bar TMItem, if rtAdr is equal to Rtx, indicating that the moving destination address sub-address of the telemetry packet is Rtx, entering step 5, otherwise entering step 15;
step 5, entering a packing and moving sub-process, as shown in fig. 4, entering step 6;
step 6, taking a telemetry data packet buffer area address pbuffer of the current telemetry item TMItem, taking CCSDS protocol information info of the current telemetry item TMItem, organizing a packet header according to the CCSDS protocol, placing the packet header into a pbuffer head address, returning to a packet header length index, and entering step 7;
step 7, packaging the package data, storing the effective telemetry data from the pfuffer index, and entering step 8;
step 8, taking the Rtx variable Lookup [ Rtx ] in the sub-address memory mapping table, taking the destination address DestAddr=the moved length Lstly+Lookup [ Rtx ], taking the source address as pbuffer, taking the length lenth of the current telemetry item TMItem, moving the length from the source address to the destination address, and entering step 9;
step 9, taking whether the memory of the current telemetry item TMItem is required to detect Ischeck, if Ischeck=1, entering step 10, otherwise entering step 14;
step 10, assuming that the current star Time is Time, the Time is the remainder of cktime seconds, the cktime seconds are modifiable variables, if the remainder is equal to idx, the data packet reaches a polling detection period of each hour, and the step 11 is entered, otherwise, the step 14 is entered;
step 11, starting a detection sub-flow, as shown in fig. 5, sequentially reading a variable a from DestAddr, reading a variable B from a telemetry data packet pbuffer, comparing the two sides, wherein the comparison length is the length of the TMItem, if the uniform comparison of all the variables of the DestAddr array and the pbuffer array is successful, the comparison is correct, and then entering a step 14, otherwise, entering a step 12;
step 12, marking the Rtx position 1 of the ErrFlg in error, adding 1 to the fault area count ErrCnt, remotely measuring and downloading the ErrFlg and the ErrCnt, and entering the step 13;
step 13, initializing 1553 chips if the fault area count ErrCnt is greater than 3 times and 3 is a modifiable variable, and resetting ErrCnt, otherwise, entering step 14;
step 14, lstlent=lstlent+tmitem length, go to step 15;
and 15, adding 1 to the idx, judging whether the CCSDS data packet framing information table is traversed, and ending the process if the CCSDS data packet framing information table is traversed, otherwise, traversing the next CCSDS data packet framing information table and entering the step 4.
Although the present invention has been described in terms of the preferred embodiments, it is not intended to be limited to the embodiments, and any person skilled in the art can make any possible variations and modifications to the technical solution of the present invention by using the methods and technical matters disclosed above without departing from the spirit and scope of the present invention, so any simple modifications, equivalent variations and modifications to the embodiments described above according to the technical matters of the present invention are within the scope of the technical matters of the present invention.
What is not described in detail in the present specification is a well known technology to those skilled in the art.
Claims (7)
1. A1553B memory dynamic allocation method based on CCSDS is characterized by comprising the following steps:
(1) Initializing a CCSDS data packet framing information table;
(2) Acquiring an initialized sub-address memory mapping table;
(3) Traversing the state of each telemetry item in the CCSDS data packet framing information table, and setting a traversing sequence number variable idx=0 and a packed length Lstenth=0;
(4) Judging a destination sub-address of the current telemetry item TMItem, if the destination sub-address rtAdr is equal to Rtx, entering a step (5), otherwise, entering a step (15);
(5) According to CCSDS protocol and CCSDS protocol information info configuration information of a current telemetry item TMItem, forming a packet header, placing a telemetry data packet buffer area address pbuffer head address of the current telemetry item TMItem, simultaneously returning to a packet header length index, and continuing data packaging by the current packet header length index;
(6) According to CCSDS protocol, obtaining source address pbuffer of telemetry item TMItem, moving the length, calculating Rtx variable Lookup [ Rtx ] + moved length Lstent in target address DestAddr=sub address memory mapping table, moving the length bytes from source address pbuffer to target address DestAddr memory, and entering step (7);
(7) If the current Time percent cktime is equal to idx, the data packet reaches the polling period of each hour, and the step (8) is entered, otherwise, the step (12) is entered; wherein cktime is the regional round robin period;
(8) If the current telemetry item TMItem needs memory detection, a memory check permission flag IsCheck of the current telemetry item TMItem is 1, a step (9) is entered, otherwise, a step (12) is entered;
(9) Comparing all variables of the DestAddr array and the pfuffer array one by one, wherein the comparison length is the moving length of the TMItem, if the comparison is correct, the step (12) is entered, and otherwise, the step (10) is entered;
(10) Comparing the error mark ErrFlg with the Rtx position 1, adding 1 to the fault area count ErrCnt, and remotely measuring ErrFlg, errCnt count to download, and entering the step (12);
(11) Initializing 1553 chips if the fault area count ErrCnt is greater than 3 times, and resetting the ErrCnt, otherwise, entering the step (12);
(12) If Lstl=Lstl+TMItem length, the idx count is increased by 1, judging whether the CCSDS data packet framing information table is traversed, if so, counting the flow, otherwise, traversing the next CCSDS data packet framing information table and returning to the step (3); and if the number of the traversal sequence number variable idx is the same as the number of the CCSDS data packet framing information table, the traversal is completed.
2. The dynamic allocation method of 1553B memory based on CCSDS according to claim 1, wherein the method is characterized in that:
in the step (1), the standard number of times of initializing the chip by the fault area count ErrCnt is adjustable.
3. The dynamic allocation method of 1553B memory based on CCSDS according to claim 1, wherein the method is characterized in that:
and (7) the standard time of the regional round trip detection period cktime is adjustable, and the self-defined setting is carried out according to the satellite communication period and the security level of each data sampling packet.
4. The dynamic allocation method of 1553B memory based on CCSDS according to claim 3, wherein the method is characterized in that:
the standard time of the regional round checking period cktime is not less than one hour and not more than one communication period.
5. The dynamic allocation method of 1553B memory based on CCSDS according to claim 1, wherein the method is characterized in that:
in the step (1), the method for determining the initial binding format of the CCSDS data packet framing information table comprises the following steps:
optimizing before binding, carrying out clustering ordering according to groups according to RT sub-addresses rtAdr in a CCSDS data packet framing information table, enabling each sub-address in the n sub-addresses to correspond to k data packets, and comparing the optimal search time with the worst search time estimation so as to improve the packing efficiency.
6. The dynamic allocation method of 1553B memory based on CCSDS according to claim 5, wherein the method is characterized in that:
the packaging efficiency is improved specifically as follows: nk (n-1)/2.
7. The dynamic allocation method of 1553B memory based on CCSDS according to claim 6, wherein the method is characterized in that:
and initializing according to the optimized CCSDS data packet framing information table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111012575.1A CN113934650B (en) | 2021-08-31 | 2021-08-31 | 1553B memory dynamic allocation method based on CCSDS |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111012575.1A CN113934650B (en) | 2021-08-31 | 2021-08-31 | 1553B memory dynamic allocation method based on CCSDS |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113934650A CN113934650A (en) | 2022-01-14 |
| CN113934650B true CN113934650B (en) | 2023-07-18 |
Family
ID=79274683
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111012575.1A Active CN113934650B (en) | 2021-08-31 | 2021-08-31 | 1553B memory dynamic allocation method based on CCSDS |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113934650B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116866113B (en) * | 2023-09-05 | 2023-11-10 | 空间液态金属科技发展(江苏)有限公司 | Method for dynamically distributing and packing telemetry parameter resources of test device in cabinet |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110262280A (en) * | 2019-02-26 | 2019-09-20 | 北京控制工程研究所 | Spacecraft Rendezvous docked flight controls Intelligent data analysis and DSS |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110750473B (en) * | 2019-10-18 | 2023-06-02 | 天津津航计算技术研究所 | Message configuration processing method based on management table in 1553B bus BC mode |
| CN111541595B (en) * | 2020-04-16 | 2022-02-15 | 上海航天计算机技术研究所 | 1553B bus data communication method and system |
| CN113268367B (en) * | 2021-04-26 | 2023-07-14 | 北京控制工程研究所 | On-orbit monitoring and maintaining method for 1553B bus RT terminal address lookup table |
-
2021
- 2021-08-31 CN CN202111012575.1A patent/CN113934650B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110262280A (en) * | 2019-02-26 | 2019-09-20 | 北京控制工程研究所 | Spacecraft Rendezvous docked flight controls Intelligent data analysis and DSS |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113934650A (en) | 2022-01-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108093070B (en) | Internet of things data service middleware system | |
| CN102820959B (en) | In Modbus main website and the method for carrying out big data quantity between slave station and communicating | |
| CN102946616B (en) | Internet of things middleware performance testing system and testing method | |
| CN109743301B (en) | Modbus protocol-based data receiving and transmitting system and method | |
| CN105207794A (en) | Statistics counting equipment and realization method thereof, and system with statistics counting equipment | |
| CN113934650B (en) | 1553B memory dynamic allocation method based on CCSDS | |
| CN102301671A (en) | Message Communication Techniques | |
| CN113179216B (en) | Remote configuration method of register, computer equipment and storage medium | |
| CN113015145B (en) | Multi-protocol supported spatio-temporal information network adapter | |
| CN110855686B (en) | SPI protocol communication method, system, equipment and computer storage medium | |
| US7933953B2 (en) | Dual processing system capable of ensuring real-time processing in protocol conformance test | |
| CN110213756A (en) | A kind of data transmission method, device and its relevant device | |
| CN114095535B (en) | Method for automatically mapping time sequence variable of physical equipment into digital model | |
| CN106656778A (en) | BDS (BeiDou Navigation Satellite System) communication gateway and communication method thereof | |
| CN107783728A (en) | Date storage method, device and equipment | |
| CN100499516C (en) | Packet-switcher flow monitoring and inquiry method and line card picker | |
| CN104780123A (en) | Network packet receiving and sending processing device and design method thereof | |
| CN102333003B (en) | Simulation test system of data casting distribution network | |
| CN104468190A (en) | Wifi data package capturing method and device and intelligent terminal | |
| CN112637370B (en) | Data processing method, device, equipment and storage medium | |
| CN110602211B (en) | Out-of-order RDMA method and device with asynchronous notification | |
| CN101938453A (en) | Device and method for realizing data transmission between central processing unit and Ethernet | |
| CN105577462A (en) | Mobile device flow statistical method and device | |
| CN116166640A (en) | Real-time acquisition and management method and system for global navigation satellite observation data | |
| US10764783B2 (en) | Method for segmenting data at high efficiency |
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 |