CN113934650A - 1553B memory dynamic allocation method based on CCSDS - Google Patents

1553B memory dynamic allocation method based on CCSDS Download PDF

Info

Publication number
CN113934650A
CN113934650A CN202111012575.1A CN202111012575A CN113934650A CN 113934650 A CN113934650 A CN 113934650A CN 202111012575 A CN202111012575 A CN 202111012575A CN 113934650 A CN113934650 A CN 113934650A
Authority
CN
China
Prior art keywords
ccsds
address
packet
sub
memory
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202111012575.1A
Other languages
Chinese (zh)
Other versions
CN113934650B (en
Inventor
李晶心
何世民
綦艳霞
陈超
关宏
傅秀涛
谢鸣宇
陆栋宁
雷拥军
王晋鹏
刘洁
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Institute of Control Engineering
Original Assignee
Beijing Institute of Control Engineering
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Institute of Control Engineering filed Critical Beijing Institute of Control Engineering
Priority to CN202111012575.1A priority Critical patent/CN113934650B/en
Publication of CN113934650A publication Critical patent/CN113934650A/en
Application granted granted Critical
Publication of CN113934650B publication Critical patent/CN113934650B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/06Addressing a physical block of locations, e.g. base addressing, module addressing, memory dedication
    • G06F12/0646Configuration or reconfiguration
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/08Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0877Cache access modes
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00Pattern recognition
    • G06F18/20Analysing
    • G06F18/23Clustering techniques
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Artificial Intelligence (AREA)
  • Evolutionary Biology (AREA)
  • Evolutionary Computation (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Radio Relay Systems (AREA)

Abstract

A1553B memory dynamic allocation method based on CCSDS aims at the problems of low design efficiency, deficient fault management means and deficient on-track maintenance means of a traditional passive memory management method, realizes the framing of messages corresponding to various service types in the period according to protocol convention by carrying out universal configuration on a CCSDS protocol format and multiplexing configuration on various sub-addresses of 1553B and carrying out quick customized splicing and sending on packaged contents, can quickly arrange and combine any telemetering sub-packet into a specified sub-address through configuration of a telemetering table, solves the problems of low telemetering packaging efficiency and deep coupling of various types of telemetering packets and protocol details under the CCSDS protocol, and has the advantage of generalization.

Description

1553B memory dynamic allocation method based on CCSDS
Technical Field
The invention relates to a 1553B memory dynamic allocation method based on CCSDS (consultative committee for space data system), belonging to the field of aerospace embedded software.
Background
Along with the increase of the remote control and remote measurement data volume of the spacecraft, the data communication frequency is faster and faster, the requirement on the transmission reliability is higher and higher, along with the mass application of the international CCSDS standard, the application of the standard in the aerospace field in China is in a trend of accelerating development, and the application of remote sensing satellite platform software is particularly popularized. The standard realizes efficient space data communication and optimizes and utilizes space 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)1553B memory allocation is fixed, a packaging program is highly coupled with protocol content, design efficiency is low, and the transmission requirement of 1553B high-standard data streams cannot be met. Because the traditional packaging content is closely associated with the sub-address, the packaging program needs to be rewritten once for each model, which wastes time and labor, and if the protocol is adjusted, the code needs to be rewritten;
(2) the memory failure management means is lacking. After the rail fails, the suspicious target is generally downloaded through the memory downloading channel for manual judgment, but the suspicious target is limited by the fact that the failure condition of the memory downloading channel can not be accurately downloaded, and if the target memory data are changed in real time, the accuracy of specific numerical values cannot be judged manually, and the failure is difficult to locate;
(3) on-track maintenance means are lacking, and the configuration of the fixed sub-address memory causes no means to relocate to other idle memories to avoid the bad area even if a specific fault address is located. Once a sub-address is wrong, the problem that bad blocks cannot be avoided by on-track dynamic adjustment exists.
Disclosure of Invention
The technical problem solved by the invention is as follows: aiming at the problems of low design efficiency, deficient fault management means and deficient on-track maintenance means of the traditional passive memory management method in the prior art, a 1553B memory dynamic allocation method based on CCSDS is provided.
The technical scheme for solving the technical problems is as follows:
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 states of all telemetering entries in a CCSDS data packet framing information table, setting a traversal sequence number variable idx to be 0, and setting a packed length Lstlength to be 0;
(4) judging the destination sub-address of the current telemetry entry TMItem, if the destination sub-address rtAdr is equal to Rtx, entering the step (5), otherwise, entering the step (15);
(5) forming a packet header according to a CCSDS protocol and CCSDS protocol information info configuration information of a current telemetry item TMItem, putting a telemetry data packet buffer area address pbuffer first address of the current telemetry item TMItem, returning a packet header length index, and continuously carrying out data packaging by the current packet header length index;
(6) according to a CCSDS protocol, obtaining a source address pbuffer and a moving length of a telemetry item TMItem, calculating a moving length of bytes from the source address pbuffer to a target address DestAddr memory in an Rtx variable Lookup [ Rtx ] + moved length Lstlength in a sub-address memory mapping table, and entering a step (7);
(7) if the current satellite-hour Time% cktime is equal to idx, the data packet reaches the polling period of each hour, step (8) is carried out, otherwise step (12) is carried out;
(8) if the current telemetry item TMItem needs memory detection, setting the memory check permission flag IsCheck of the current telemetry item TMItem to be 1, entering the step (9), and otherwise, entering the step (12);
(9) comparing all variables of the DestAddr array and the pbuffer array one by one, wherein the comparison length is the moving length of the TMItem, if the comparison is correct, the step (12) is carried out, otherwise, the step (10) is carried out;
(10) if the comparison fails, marking the Rtx position of the ErrFlg with an error mark, 1, adding 1 to the counting ErrCnt of the fault area, telemetering and downloading the counting ErrFlg and ErrCnt, and entering the step (12);
(11) if the fault area count ErrCnt is more than 3 times, initializing a 1553 chip, and resetting the ErrCnt, otherwise, entering the step (12);
(12) and (3) if the Lstlens is equal to the length of the Lstlens + TMItem, adding 1 to the idx count, judging whether the packet frame information table of the CCSDS packet is traversed completely, counting the flow if the packet frame information table of the CCSDS packet is traversed completely, otherwise, traversing the next packet frame information table of the CCSDS packet and returning to the step (3).
In the step (1), the standard times of the fault area counting ErrCnt initialization chip can be adjusted.
And (4) adjusting the standard time of the region polling period cktime in the step (7), and performing self-defined setting according to the satellite communication period and the safety level of each data sampling packet.
The area polling period cktime standard time 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 is as follows:
optimizing before binding, carrying out cluster sorting according to RT sub-addresses rtAdr in a CCSDS data packet group frame information table, enabling each sub-address in n sub-addresses to correspond to k data packets, and comparing the optimal search time with the worst search time to estimate and improve the packing efficiency.
The packing efficiency improvement specifically comprises: 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 1553B internal memory dynamic allocation method based on the CCSDS, provided by the invention, the packaging content is quickly customized, spliced and sent through the universal configuration of the format of the CCSDS protocol and the multiplexing configuration of each sub-address of 1553B, the sent message is spliced and put into the appointed internal memory, the messages corresponding to each service type in the period are subjected to framing according to protocol convention, any telemetering sub-packet can be quickly arranged and combined into the appointed sub-address through the configuration of the telemetering table, the problems of low telemetering packaging efficiency and deep coupling of each type telemetering packet and protocol details under the CCSDS protocol are solved, the advantages of generalization are achieved, and the purpose of unifying the telemetering packaging platform of the CCSDS protocol is realized;
(2) the invention adopts autonomous fault detection and monitoring, starts periodic alternate polling to key areas of the memory, performs read-write comparison to appointed memory areas, gives specific address ranges of bad areas, identifies the bad areas in time, and reports to the ground once a certain memory area is inconsistent in read-write comparison; if the areas are inconsistent, reinitializing 1553, solving the problem that the chip fault cannot be found in time on the track, having the advantage of accurate fault detection and realizing 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 on-orbit failure has no standby adjusting means is solved, on-orbit is realized, and more safety guarantees of the chip are realized.
Drawings
FIG. 1 is a flow chart of 1553B memory dynamic allocation and management based on CCSDS provided by the invention;
FIG. 2 is a diagram of a packet framing information table of the CCSDS packet according to the present invention;
FIG. 3 is a schematic diagram of a 1553B sub-address memory mapping variable table provided by the invention;
FIG. 4 is a main flow chart of 1553B packaging and moving provided by the invention;
fig. 5 is a main flow chart of 1553B memory detection provided by the present invention;
Detailed Description
A1553B memory dynamic allocation method based on CCSDS (consultative committee for space data system) avoids the problems that dynamic adjustment cannot be carried out on fixed memories, on-track chip faults lack detection and repair means and the like by means of flexible allocation and multiplexing configuration of 1553B memories and registers and memory self-comparison, and achieves efficient and accurate self-maintenance of the memories.
Specifically, the distribution method mainly comprises the steps of designing a CCSDS data packet framing information table, taking the serial number of each telemetry packet, CCSDS packet header information, a packaging cache first address, length and a corresponding subaddress as configurable items, and configuring 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-address in the 1553B memory data block into the table. The method comprises the steps of firstly, respectively packaging telemetering entries in a table according to sub-addresses through a specially developed sub-address packaging program, then searching memory addresses corresponding to the sub-addresses in a sub-address memory mapping table, putting a packaged packet into memory data blocks pointed by the corresponding sub-address memory mapping table, completing dynamic splicing and packaging of data from packaging to a memory, and completing self-detection management of memory faults by calling a specially developed fault detection flow during packaging.
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 states of all telemetering entries in a CCSDS data packet framing information table, setting a traversal sequence number variable idx to be 0, and setting a packed length Lstlength to be 0;
(4) judging the destination sub-address of the current telemetry entry TMItem, if the destination sub-address rtAdr is equal to Rtx, entering the step (5), otherwise, entering the step (15);
(5) forming a packet header according to a CCSDS protocol and CCSDS protocol information info configuration information of a current telemetry item TMItem, putting a telemetry data packet buffer area address pbuffer first address of the current telemetry item TMItem, returning a packet header length index, and continuously carrying out data packaging by the current packet header length index;
(6) according to a CCSDS protocol, obtaining a source address pbuffer and a moving length of a telemetry item TMItem, calculating a moving length of bytes from the source address pbuffer to a target address DestAddr memory in an Rtx variable Lookup [ Rtx ] + moved length Lstlength in a sub-address memory mapping table, and entering a step (7);
(7) if the current satellite-hour Time% cktime is equal to idx, the data packet reaches the polling period of each hour, step (8) is carried out, otherwise step (12) is carried out;
(8) if the current telemetry item TMItem needs memory detection, setting the memory check permission flag IsCheck of the current telemetry item TMItem to be 1, entering the step (9), and otherwise, entering the step (12);
(9) comparing all variables of the DestAddr array and the pbuffer array one by one, wherein the comparison length is the moving length of the TMItem, if the comparison is correct, the step (12) is carried out, otherwise, the step (10) is carried out;
(10) if the comparison fails, marking the Rtx position of the ErrFlg with an error mark, 1, adding 1 to the counting ErrCnt of the fault area, telemetering and downloading the counting ErrFlg and ErrCnt, and entering the step (12);
(11) if the fault area count ErrCnt is more than 3 times, initializing a 1553 chip, and resetting the ErrCnt, otherwise, entering the step (12);
(12) and (3) if the Lstlens is equal to the length of the Lstlens + TMItem, adding 1 to the idx count, judging whether the packet frame information table of the CCSDS packet is traversed completely, counting the flow if the packet frame information table of the CCSDS packet is traversed completely, otherwise, traversing the next packet frame information table of the CCSDS packet and returning to the step (3).
In the step (1), the standard times of the fault area counting ErrCnt initialization chip are adjustable;
step (7), the standard time of the region polling period cktime is adjustable, and self-defined setting is carried out according to the satellite communication period and the safety level of each data sampling packet, wherein the standard time of the region polling 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 cluster-based sorting according to RT sub-addresses rtAdr in a CCSDS data packet group frame information table to enable each sub-address in n sub-addresses to correspond to k data packets, and comparing the optimal search time with the worst search time to estimate so as to improve the packing efficiency;
packing efficiency promotes specifically to do: nk (n-1)/2, initializing according to the optimized CCSDS data packet group frame information table.
The following is further illustrated with reference to specific examples:
in this embodiment, as shown in fig. 1, the method comprises the following steps:
step 1, initializing a CCSDS data packet framing information table, wherein the CCSDS data packet framing information table consists of telemetering entries and can be organized into an array or linked list structure, and entering step 2; the CCSDS packet framing information table is a two-dimensional vector table, as shown in fig. 2, each row is a telemetry entry, and each telemetry entry includes the following fields: 1. the CCSDS protocol information Info is used for telemetering and packaging packet header information organization; 2. the RT sub-address rtAdr represents a target sub-address sent by the telemetering packet, and a plurality of telemetering packets can correspond to one sub-address; 3. the address pbuffer of the remote sensing data packet buffer area points to the address of the remote sensing data packet buffer; 4. a length, which represents the length of the telemetry packet; 5. whether the IsCheck needs to be checked by the memory indicates whether the chip memory needs to be checked when the telemetry packet is moved to the 1553B memory, for example, when the configuration is 1, the IsCheck indicates that the chip memory needs to be checked, and when the IsCheck is configured to be 0, the IsCheck indicates that the IsCheck does not need to be checked; 6. the telemetry packet memory check period cktime;
the initial binding format of the CCSDS packet frame information table in the step (1) is shown in fig. 2.
In order to improve the search efficiency, the table is further optimized before binding, the table is sorted according to RT sub-addresses rtAdr in a group clustering mode, namely telemetry packets of the same sub-addresses are sequentially arranged, if n sub-addresses exist, each sub-address corresponds to k data packets, estimation comparison is carried out according to the optimal search time and the worst search time, and the packing efficiency can be improved by nk (n-1)/2. Examples of optimized binding tables are as follows:
Figure BDA0003239416820000061
Figure BDA0003239416820000071
step 2, initializing a sub-address memory mapping table, wherein the sub-address memory mapping table consists of 32 sending sub-address variables to form an array Lookup [32], and advancing step 3; as shown in fig. 3, each row of the memory mapping table is a sub-address variable, each sub-address variable represents a 1553B memory offset address corresponding to the sub-address, and step 3 is performed;
step 3, the subaddress Rtx group package program sequentially traverses the state of each telemetering entry of the CCSDS data packet frame information table, defines a traversal sequence number variable idx as 0, defines a packed length Lstlength as 0, and enters step 4;
step 4, taking a destination sub-address rtAdr of the current telemetry strip TMItem, if the rtAdr is equal to the Rtx, indicating that the moving destination sub-address of the telemetry packet is the Rtx, entering step 5, and otherwise, entering step 15;
step 5, entering a packaging and moving sub-process, as shown in fig. 4, and entering step 6;
step 6, taking the address pbuffer of the telemetry data packet buffer area of the current telemetry item TMItem, taking the CCSDS protocol information info of the current telemetry item TMItem, organizing a packet header according to the CCSDS protocol, putting the packet header into the head address of pbuffer, returning the length index of the packet header, and entering step 7;
step 7, packaging the packet data, storing the effective telemetering data from pbuffer [ index ], and entering step 8;
step 8, taking a Rtx variable LookupT [ Rtx ], a target address DestAddr as a moved length Lstlent + Lookup [ Rtx ], and a source address pbuffer in a sub-address memory mapping table, taking a length of a current telemetering item TMItem, and entering a step 9 from the source address to the length of the moved length of the target address;
step 9, whether the current telemetry item TMItem needs to be detected by the memory IsCheck is judged, if the IsCheck is 1, the step 10 is carried out, and if not, the step 14 is carried out;
step 10, assuming that the current satellite Time is Time, the Time takes a remainder for 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, step 11 is entered, otherwise step 14 is entered;
step 11, detecting that the sub-process starts, reading back a variable a from the DestAddr and reading back a variable B from the telemetry data packet pbuffer in sequence as shown in fig. 5, comparing the two parts, wherein the comparison length is the length of TMItem, if all the variables of the DestAddr array and the pbuffer array are uniformly and successfully compared, the comparison is correct, and the step 14 is performed, otherwise, the step 12 is performed;
step 12, marking the Rtx position 1 of the ErrFlg by an error, adding 1 to the counting ErrCnt of the fault area, telemetering and downloading the ErrFlg and the ErrCnt, and entering step 13;
step 13, if the fault area count ErrCnt is greater than 3 times and 3 is a modifiable variable, initializing 1553 chips, and clearing ErrCnt, otherwise, entering step 14;
step 14, entering step 15, when Lstlent is the length of Lstlent + TMItem;
and step 15, adding 1 to idx, judging whether the packet frame information table of the CCSDS data packet is traversed completely, ending if the packet frame information table of the CCSDS data packet is traversed completely, otherwise, traversing the next packet frame information table of the CCSDS data packet and entering the step 4.
Although the present invention has been described with reference to the preferred embodiments, it is not intended to limit the present invention, and those skilled in the art can make variations and modifications of the present invention without departing from the spirit and scope of the present invention by using the methods and technical contents disclosed above.
Those skilled in the art will appreciate that those matters not described in detail in the present specification are well known 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 states of all telemetering entries in a CCSDS data packet framing information table, setting a traversal sequence number variable idx to be 0, and setting a packed length Lstlength to be 0;
(4) judging the destination sub-address of the current telemetry entry TMItem, if the destination sub-address rtAdr is equal to Rtx, entering the step (5), otherwise, entering the step (15);
(5) forming a packet header according to a CCSDS protocol and CCSDS protocol information info configuration information of a current telemetry item TMItem, putting a telemetry data packet buffer area address pbuffer first address of the current telemetry item TMItem, returning a packet header length index, and continuously carrying out data packaging by the current packet header length index;
(6) according to a CCSDS protocol, obtaining a source address pbuffer and a moving length of a telemetry item TMItem, calculating a moving length of bytes from the source address pbuffer to a target address DestAddr memory in an Rtx variable Lookup [ Rtx ] + moved length Lstlength in a sub-address memory mapping table, and entering a step (7);
(7) if the current satellite-hour Time% cktime is equal to idx, the data packet reaches the polling period of each hour, step (8) is carried out, otherwise step (12) is carried out;
(8) if the current telemetry item TMItem needs memory detection, setting the memory check permission flag IsCheck of the current telemetry item TMItem to be 1, entering the step (9), and otherwise, entering the step (12);
(9) comparing all variables of the DestAddr array and the pbuffer array one by one, wherein the comparison length is the moving length of the TMItem, if the comparison is correct, the step (12) is carried out, otherwise, the step (10) is carried out;
(10) if the comparison fails, marking the Rtx position of the ErrFlg with an error mark, 1, adding 1 to the counting ErrCnt of the fault area, telemetering and downloading the counting ErrFlg and ErrCnt, and entering the step (12);
(11) if the fault area count ErrCnt is more than 3 times, initializing a 1553 chip, and resetting the ErrCnt, otherwise, entering the step (12);
(12) and (3) if the Lstlens is equal to the length of the Lstlens + TMItem, adding 1 to the idx count, judging whether the packet frame information table of the CCSDS packet is traversed completely, counting the flow if the packet frame information table of the CCSDS packet is traversed completely, otherwise, traversing the next packet frame information table of the CCSDS packet and returning to the step (3).
2. The method for dynamically allocating 1553B memory based on CCSDS of claim 1, wherein:
in the step (1), the standard times of the fault area counting ErrCnt initialization chip can be adjusted.
3. The method for dynamically allocating 1553B memory based on CCSDS of claim 1, wherein:
and (4) adjusting the standard time of the region polling period cktime in the step (7), and performing self-defined setting according to the satellite communication period and the safety level of each data sampling packet.
4. The method according to claim 3, wherein the 1553B internal memory dynamic allocation method based on the CCSDS is characterized in that:
the area polling period cktime standard time is not less than one hour and not more than one communication period.
5. The method for dynamically allocating 1553B memory based on CCSDS of claim 1, wherein:
in the step (1), the method for determining the initial binding format of the CCSDS data packet framing information table is as follows:
optimizing before binding, carrying out cluster sorting according to RT sub-addresses rtAdr in a CCSDS data packet group frame information table, enabling each sub-address in n sub-addresses to correspond to k data packets, and comparing the optimal search time with the worst search time to estimate and improve the packing efficiency.
6. The method according to claim 5, wherein the 1553B internal memory dynamic allocation method based on the CCSDS is characterized in that:
the packing efficiency improvement specifically comprises: nk (n-1)/2.
7. The method according to claim 6, wherein the 1553B internal memory dynamic allocation method based on CCSDS is characterized in that:
and initializing according to the optimized CCSDS data packet framing information table.
CN202111012575.1A 2021-08-31 2021-08-31 1553B memory dynamic allocation method based on CCSDS Active CN113934650B (en)

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 true CN113934650A (en) 2022-01-14
CN113934650B 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)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116866113A (en) * 2023-09-05 2023-10-10 空间液态金属科技发展(江苏)有限公司 Method for dynamically distributing and packing telemetry parameter resources of test device in cabinet

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110750473A (en) * 2019-10-18 2020-02-04 天津津航计算技术研究所 Message configuration processing method based on management table in 1553B bus BC mode
CN111541595A (en) * 2020-04-16 2020-08-14 上海航天计算机技术研究所 1553B bus data communication method and system
CN113268367A (en) * 2021-04-26 2021-08-17 北京控制工程研究所 1553B bus RT terminal address lookup table on-track monitoring and maintaining method

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110262280B (en) * 2019-02-26 2020-07-14 北京控制工程研究所 Intelligent data analysis and decision support system for spacecraft rendezvous and docking flight control

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110750473A (en) * 2019-10-18 2020-02-04 天津津航计算技术研究所 Message configuration processing method based on management table in 1553B bus BC mode
CN111541595A (en) * 2020-04-16 2020-08-14 上海航天计算机技术研究所 1553B bus data communication method and system
CN113268367A (en) * 2021-04-26 2021-08-17 北京控制工程研究所 1553B bus RT terminal address lookup table on-track monitoring and maintaining method

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
孙涛;张华春;: "基于MIL-STD-1553B协议的远程终端的FPGA实现" *
陆岚;刘欣;余晟;周波;朱剑冰;: "空间站系统航天器间1553B总线网络的路由机制研究" *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116866113A (en) * 2023-09-05 2023-10-10 空间液态金属科技发展(江苏)有限公司 Method for dynamically distributing and packing telemetry parameter resources of test device in cabinet
CN116866113B (en) * 2023-09-05 2023-11-10 空间液态金属科技发展(江苏)有限公司 Method for dynamically distributing and packing telemetry parameter resources of test device in cabinet

Also Published As

Publication number Publication date
CN113934650B (en) 2023-07-18

Similar Documents

Publication Publication Date Title
CN101877659B (en) Method, device and system for monitoring packet loss
CN105191235A (en) Cut-through processing for slow and fast ports
WO2018171641A1 (en) Method and device for transmitting and receiving network management information, transmitting apparatus and receiving apparatus
CN106878164A (en) A kind of message transmitting method and device
CN111327687A (en) Data transmission method and device, electronic equipment and storage medium
CN105207794A (en) Statistics counting equipment and realization method thereof, and system with statistics counting equipment
CN109474614B (en) Multi-protocol analysis method and system
CN104954431A (en) Network selection method, device and system
US7933953B2 (en) Dual processing system capable of ensuring real-time processing in protocol conformance test
CN113934650A (en) 1553B memory dynamic allocation method based on CCSDS
CN114363320A (en) Cross-network data returning method, storage medium and system
CN111010423A (en) System, method, device, equipment and readable storage medium for downloading update package
CN100499516C (en) Packet-switcher flow monitoring and inquiry method and line card picker
CN107783728A (en) Date storage method, device and equipment
CN108243056B (en) Method and device for acquiring abnormal information
CN104780123A (en) Network packet receiving and sending processing device and design method thereof
CN101594305A (en) A kind of message processing method and device
CN101634939B (en) Fast addressing device and method thereof
CN112699000A (en) Data processing method and device, readable storage medium and electronic equipment
CN104468190A (en) Wifi data package capturing method and device and intelligent terminal
CN101599852A (en) The veneer of the communication means of multimode, multi-software module, communication apparatus between veneer
US8554966B2 (en) Method for data exchange
CN114970428A (en) Verification system and method for Flexray bus controller in SoC
CN101505242B (en) Router fault detection method and router device
CN100561953C (en) A kind of method of recording and diagnosing data

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant