CN111556034B - GJB289A bus message dynamic mapping method - Google Patents
GJB289A bus message dynamic mapping method Download PDFInfo
- Publication number
- CN111556034B CN111556034B CN202010295519.2A CN202010295519A CN111556034B CN 111556034 B CN111556034 B CN 111556034B CN 202010295519 A CN202010295519 A CN 202010295519A CN 111556034 B CN111556034 B CN 111556034B
- Authority
- CN
- China
- Prior art keywords
- message
- address
- word
- data
- bus
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/03—Protocol definition or specification
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/40—Bus networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/26—Special purpose or proprietary protocols or architectures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/40—Bus networks
- H04L2012/40267—Bus for use in transportation systems
- H04L2012/4028—Bus for use in transportation systems the transportation system being an aircraft
Abstract
The invention provides a dynamic mapping method of GJB289A bus messages, which relates to the field of dynamic mapping and realizes the decoupling of GJB289A bus message characteristic information and a message mapping program, wherein a bus message characteristic information table is designed, message codes corresponding to message types and meanings thereof are summarized and divided, original binary data of messages including the message types and the bus data in GJB289A bus bottom hardware are obtained, then the binary data are analyzed, RT address check is carried out on the analyzed messages according to the message types, only effective data are checked, if the binary data are completely consistent with a certain line in the table, the bus message data are proved to be in accordance with requirements, a scheduling command and message mark information are not required to be solidified in software codes, the development efficiency of GJB289A bus message application software can be greatly improved, and the code maintenance amount is reduced.
Description
Technical Field
The invention relates to the field of dynamic mapping, in particular to a GJB289A bus message dynamic mapping method.
Background
With the continuous deepening of the task complexity of the flight platform, the airborne devices exchange information in the form of an avionic bus, and currently, the avionic bus widely applied includes a GJB289A bus, a 1394b bus and the like. The GJB289A bus realizes time division multiplexing of communication resources through a scheduling mechanism, hundreds of different types of messages can be transmitted in one bus, and the GJB289A message types are distinguished through bus scheduling commands and message mark information. Currently, software for processing the GJB289A bus data usually solidifies the scheduling command and the message flag information in the software code to realize the message distinguishing function, this method needs to write a large amount of code to realize, and needs to modify the software code when the bus structure or the message type changes, the code maintenance workload is large, this defect is especially significant in the case that the GJB289 bus 289A is transplanted to a similar system.
At present, a dynamic mapping method for the bus message of the GJB289A is urgently needed to realize the decoupling of the characteristic information of the bus message of the GJB289A and the message mapping program.
Disclosure of Invention
The invention aims to: the method for dynamically mapping the GJB289A bus message is provided, the decoupling of GJB289A bus message characteristic information and a message mapping program is realized, a scheduling command and message mark information do not need to be solidified in a software code, the development efficiency of GJB289A bus message application software can be greatly improved, the code maintenance amount is reduced, adaptation can be realized only by adjusting a bus message characteristic information table when the bus structure is changed, and a large amount of working hours are saved compared with the original mode.
The technical scheme adopted by the invention is as follows:
a GJB289A bus message dynamic mapping method mainly comprises the following steps of:
step S1: designing a bus message characteristic information table, wherein the header content items mainly comprise message types, RT sending addresses, RT sending sub-addresses, RT receiving addresses and RT receiving sub-addresses;
step S2: acquiring complete message original binary data from GJB289A bus bottom layer hardware, wherein the complete message original binary data comprises a message type and bus data, and decomposing the bus data into a sending instruction word, a receiving instruction word, a sending state word, a receiving state word and a data word according to the message type;
step S3: analyzing the RT address and the RT sub-address in the instruction word and the status word;
step S4: checking whether the RT addresses in the instruction word and the state word can correspond to each other or not according to the message type, and skipping the message if the RT addresses in the instruction word and the state word do not correspond to each other;
step S5: traversing the bus message characteristic information table, checking whether the RT address and the RT subaddress analyzed from the bus message data are completely consistent with a certain line in the bus message characteristic information table according to the message type, and if so, outputting the message code of the line and the data word source code of the message.
In order to better implement the present solution, further, in step S1, each header content item is specifically as follows:
message type: code representing a GJB289A message type;
and sending the RT address: an RT address representing a sender of the message;
sending the RT sub-address: RT subaddress indicating the sender of the message;
receiving an RT address: an RT address representing a message recipient;
receiving an RT sub-address: an RT subaddress representing a message recipient;
data block number offset address: an offset address representing the data block number of the message relative to the starting byte of data;
data block number: a data block number representing a message;
message code: representing a unique code that can distinguish messages.
As shown in table 1, the message type includes a sending RT address, a sending RT sub-address, a receiving RT sub-address and a corresponding message code, and table 2 shows the meaning of the code in each message type.
| Message type | Sending RT addresses | Sending RT subaddress | Receiving an RT address | Receiving RT subaddress | Message code |
| 0xE0 | -1 | -1 | 1 | 1 | 0x55 |
| 0xE1 | 1 | 2 | -1 | -1 | 0xB1 |
| 0xE2 | 3 | 1 | 2 | 1 | 0x2C |
| 0xE6 | -1 | -1 | 31 | 12 | 0x60 |
| 0xE7 | 7 | 4 | 31 | 9 | 0x89 |
TABLE 1
| Message type | Means of | Description of the invention |
| 0xE0 | BC → RT message | Transmit RT address invalidation, transmit RT subaddress invalidation |
| 0xE1 | RT → BC message | Receive RT address invalidation, receive RT sub-address invalidation |
| 0xE2 | RT → RT message | All bus message characteristics need to be used |
| 0xE6 | BC broadcasting | Transmission RT address invalid, transmission RT sub-address invalid, reception RT address 31 |
| 0xE7 | RT broadcast | The characteristics of the bus message need to use and receive RT address of 31 |
TABLE 2
In order to better implement the present solution, further, the message type in step S2 is 1 byte, the lengths of the send instruction word, the receive instruction word, the send status word, the receive status word, and the single data word are all 2 bytes, the number n of the data words is the lower 5 bits of the corresponding instruction word and status word, and the number of bytes is all binary bytes.
In order to better implement the present solution, further, the data structure corresponding to each message type is:
0xE 0: message type + receive instruction word + data word n + receive status word;
0xE 1: message type + send instruction word + send status word + data word n;
0xE 2: message type + receive instruction word + send status word + data word n + receive status word;
0xE 6: message type + receive instruction word + data word n;
0xE 7: message type + receive instruction word + send status word + data word n.
As shown in table 3, the table shows data structures corresponding to different message types of the GJB289A bus,
TABLE 3
In order to better implement the present solution, further, the parsing method in step S3 is:
and RT address: taking 11 to 15 bits in a binary instruction word and a binary state word, and taking the lowest bit as a 0 th bit;
RT sub-address: the least significant bit is the 0 th bit, which is the 5 to 9 bits of the binary instruction word.
In order to better implement the present solution, further, the checking conditions of the RT address and the RT sub-address in step S4 are as follows:
0xE 0: receiving the RT address in the instruction word, namely receiving the RT address in the status word;
0xE 1: the RT address in the sending instruction word is the RT address in the sending state word;
0xE 2: the RT address in the receive instruction word is the RT address in the receive status word,
and the RT address in the send instruction word is the RT address in the send status word;
0xE 6: none;
0xE 7: the RT address in the send instruction word is the RT address in the send status word.
Table 4 shows the conditions for checking the RT address and the RT sub-address
TABLE 4
In order to better implement the present solution, in step S5, when it is checked whether the RT address and the RT sub-address parsed from the bus message data completely coincide with a certain line in the bus message characteristic information table, only valid data is checked.
In the prior art, a scheduling command and message flag information are usually solidified in a software code to realize a message distinguishing function, and this method needs to write a large amount of codes to realize the function, and needs to modify the software code when a bus structure or a message type changes, and the code maintenance workload is large, which is particularly significant in the case of using a GJB289A bus to transplant to a similar system, this scheme designs a bus message characteristic information table, summarizes and divides the message code corresponding to the message type and the meaning thereof, and simultaneously obtains the message original binary data including the message type and the bus data in GJB289A bus bottom layer hardware, then analyzes the binary data, performs RT address check on the analyzed message according to the message type, only checks valid data, and if the message type is completely consistent with a certain line in Table 1, it indicates that the bus message data meets the requirements, the message code of the line and the data word source code of the message can be output for the next data processing module to use.
In summary, due to the adoption of the technical scheme, the invention has the beneficial effects that:
1. the GJB289A bus message dynamic mapping method realizes the decoupling of GJB289A bus message characteristic information and a message mapping program, does not need to solidify a scheduling command and message mark information in a software code, can greatly improve the development efficiency of GJB289A bus message application software, and reduces the code maintenance amount;
2. the dynamic mapping method of the GJB289A bus message realizes the decoupling of the GJB289A bus message characteristic information and the message mapping program, does not need to solidify the scheduling command and the message mark information in a software code, can be adapted only by adjusting the bus message characteristic information table when the bus structure is changed, and saves a large amount of working hours compared with the original mode
Drawings
In order to more clearly illustrate the technical solution, the drawings needed to be used in the embodiments are briefly described below, and it should be understood that, for those skilled in the art, other related drawings can be obtained according to the drawings without creative efforts, wherein:
fig. 1 is a schematic flow diagram of the present invention.
Detailed Description
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it should be understood that the described embodiments are only a part of the embodiments of the present invention, and not all embodiments, and therefore should not be considered as a limitation to the scope of protection. All other embodiments, which can be obtained by a person skilled in the art without any inventive step based on the embodiments of the present invention, are within the scope of the present invention.
In the description of the present invention, it is to be noted that, unless otherwise explicitly specified or limited, the terms "disposed," "connected," and "connected" are to be construed broadly, and may be, for example, fixedly connected, detachably connected, or integrally connected; can be mechanically or electrically connected; they may be connected directly or indirectly through intervening media, or they may be interconnected between two elements. The specific meanings of the above terms in the present invention can be understood in specific cases to those skilled in the art.
The present invention will be described in detail with reference to fig. 1.
Example 1:
a dynamic mapping method for a GJB289A bus message, as shown in fig. 1, mainly comprising the following steps performed in sequence:
step S1: designing a bus message characteristic information table, wherein the header content items mainly comprise message types, RT sending addresses, RT sending sub-addresses, RT receiving addresses and RT receiving sub-addresses;
step S2: acquiring complete message original binary data from GJB289A bus bottom layer hardware, wherein the complete message original binary data comprises a message type and bus data, and decomposing the bus data into a sending instruction word, a receiving instruction word, a sending state word, a receiving state word and a data word according to the message type;
step S3: analyzing the RT address and the RT sub-address in the instruction word and the status word;
step S4: checking whether the RT addresses in the instruction word and the state word can correspond to each other or not according to the message type, and skipping the message if the RT addresses in the instruction word and the state word do not correspond to each other;
step S5: traversing the bus message characteristic information table, checking whether the RT address and the RT subaddress analyzed from the bus message data are completely consistent with a certain line in the bus message characteristic information table according to the message type, and if so, outputting the message code of the line and the data word source code of the message.
The working principle is as follows: in the prior art, a scheduling command and message flag information are usually solidified in a software code to realize a message distinguishing function, and this method needs to write a large amount of codes to realize the function, and needs to modify the software code when a bus structure or a message type changes, and the code maintenance workload is large, which is particularly significant in the case of using a GJB289A bus to transplant to a similar system, this scheme designs a bus message characteristic information table, summarizes and divides the message code corresponding to the message type and the meaning thereof, and simultaneously obtains the message original binary data including the message type and the bus data in GJB289A bus bottom layer hardware, then analyzes the binary data, performs RT address check on the analyzed message according to the message type, only checks valid data, and if the message type is completely consistent with a certain line in Table 1, it indicates that the bus message data meets the requirements, the message code of the line and the data word source code of the message can be output for the next data processing module to use.
Example 2:
in the present invention, based on the above embodiment 1, the header content items in step S1 are specifically as follows:
message type: code representing a GJB289A message type;
and sending the RT address: an RT address representing a sender of the message;
sending the RT sub-address: RT subaddress indicating the sender of the message;
receiving an RT address: an RT address representing a message recipient;
receiving an RT sub-address: an RT subaddress representing a message recipient;
data block number offset address: an offset address representing the data block number of the message relative to the starting byte of data;
data block number: a data block number representing a message;
message code: representing a unique code that can distinguish messages.
As shown in table 1, the message type includes a sending RT address, a sending RT sub-address, a receiving RT sub-address and a corresponding message code, and table 2 shows the meaning of the code in each message type.
| Message type | Sending RT addresses | Sending RT subaddress | Receiving an RT address | Receiving RT subaddress | Message code |
| 0xE0 | -1 | -1 | 1 | 1 | 0x55 |
| 0xE1 | 1 | 2 | -1 | -1 | 0xB1 |
| 0xE2 | 3 | 1 | 2 | 1 | 0x2C |
| 0xE6 | -1 | -1 | 31 | 12 | 0x60 |
| 0xE7 | 7 | 4 | 31 | 9 | 0x89 |
TABLE 1
| Message type | Means of | Description of the invention |
| 0xE0 | BC → RT message | Transmit RT address invalidation, transmit RT subaddress invalidation |
| 0xE1 | RT → BC message | Receive RT address invalidation, receive RT sub-address invalidation |
| 0xE2 | RT → RT message | All bus message characteristics need to be used |
| 0xE6 | BC broadcasting | Transmission RT address invalid, transmission RT sub-address invalid, reception RT address 31 |
| 0xE7 | RT broadcast | The characteristics of the bus message need to use and receive RT address of 31 |
TABLE 2
In order to better implement the present solution, further, the message type in step S2 is 1 byte, the lengths of the send instruction word, the receive instruction word, the send status word, the receive status word, and the single data word are all 2 bytes, the number n of the data words is the lower 5 bits of the corresponding instruction word and status word, and the number of bytes is all binary bytes.
In order to better implement the present solution, further, the data structure corresponding to each message type is:
0xE 0: message type + receive instruction word + data word n + receive status word;
0xE 1: message type + send instruction word + send status word + data word n;
0xE 2: message type + receive instruction word + send status word + data word n + receive status word;
0xE 6: message type + receive instruction word + data word n;
0xE 7: message type + receive instruction word + send status word + data word n.
As shown in table 3, the table shows data structures corresponding to different message types of the GJB289A bus,
TABLE 3
In order to better implement the present solution, further, the parsing method in step S3 is:
and RT address: taking 11 to 15 bits in a binary instruction word and a binary state word, and taking the lowest bit as a 0 th bit;
RT sub-address: the least significant bit is the 0 th bit, which is the 5 to 9 bits of the binary instruction word.
In order to better implement the present solution, further, the checking conditions of the RT address and the RT sub-address in step S4 are as follows:
0xE 0: receiving the RT address in the instruction word, namely receiving the RT address in the status word;
0xE 1: the RT address in the sending instruction word is the RT address in the sending state word;
0xE 2: the RT address in the receive instruction word is the RT address in the receive status word,
and the RT address in the send instruction word is the RT address in the send status word;
0xE 6: none;
0xE 7: the RT address in the send instruction word is the RT address in the send status word.
Table 4 shows the checking conditions of the RT address and the RT sub-address, and all the checking conditions corresponding to the same message type need to be satisfied.
TABLE 4
In step S5, only valid data is checked if the RT address and the RT sub-address analyzed from the bus message data are completely consistent with a certain line in the bus message characteristic information table.
This example describes the specific implementation of each step from steps S1-S5,
other parts of this embodiment are the same as those of embodiment 1, and thus are not described again.
Example 3:
in this embodiment, a certain GJB289A data is taken as an example to illustrate the process of the present scheme for dynamic mapping of bus messages, and the original data is: E210231C 231800 ED CB 019500001000, which performs dynamic mapping according to the following steps:
step S1: designing a bus message characteristic information table, wherein the table head content items are the message type, the sending RT address, the sending RT subaddress, the receiving RT address and the receiving RT subaddress in sequence, as shown in table 5,
| message type | Sending RT addresses | Sending RT subaddress | Receiving an RT address | Receiving RT subaddress | Message code |
| 0xE0 | -1 | -1 | 1 | 1 | 0x55 |
| 0xE1 | 1 | 2 | -1 | -1 | 0xB1 |
| 0xE2 | 3 | 1 | 2 | 1 | 0x2C |
| 0xE6 | -1 | -1 | 31 | 12 | 0x60 |
| 0xE7 | 7 | 4 | 31 | 9 | 0x89 |
TABLE 5
Step S2: the bus data is decomposed into a sending instruction word, a receiving instruction word, a sending status word, a receiving status word and a data word according to the type of the message. According to the message type 0xE2, the message type is RT → RT message, and according to the GJB289A bus data structure table, the received command word is 0x1023, the sent command word is 0x1C23, the sent status word is 0x1800, the number of data words is 3 (i.e. binary 00011), the source code of the data word is ED CB 01950000, and the received status word is 0x 1000.
Step S3: and analyzing the RT address and the RT sub-address in the instruction word and the status word to obtain that the RT address in the receiving instruction word is 2, the RT sub-address is 1, the RT address in the sending instruction word is 3, the RT sub-address is 1, the RT address in the sending status word is 3, and the RT address in the receiving status word is 2.
Step S4: and checking according to the RT address and the RT sub-address checking condition, wherein the RT addresses in the receiving instruction word and the receiving status word are consistent, the RT addresses in the sending instruction word and the sending status word are consistent, and the checking is passed.
Step S5: and traversing the bus message characteristic information table to know that the message code of the message is 0x2C, and outputting the message code and the data word source code.
The above description is only a preferred embodiment of the present invention, and is not intended to limit the present invention in any way, and all simple modifications and equivalent variations of the above embodiments according to the technical spirit of the present invention are included in the scope of the present invention.
Claims (7)
1. A GJB289A bus message dynamic mapping method is characterized in that: mainly comprises the following steps which are carried out in sequence:
step S1: designing a bus message characteristic information table, wherein the header content items mainly comprise message types, RT sending addresses, RT sending sub-addresses, RT receiving addresses and RT receiving sub-addresses;
step S2: acquiring complete message original binary data from GJB289A bus bottom layer hardware, wherein the complete message original binary data comprises a message type and bus data, and decomposing the bus data into a sending instruction word, a receiving instruction word, a sending state word, a receiving state word and a data word according to the message type;
step S3: analyzing the RT address and the RT sub-address in the instruction word and the status word;
step S4: checking whether the RT addresses in the instruction word and the state word can correspond to each other or not according to the message type, and skipping the message if the RT addresses in the instruction word and the state word do not correspond to each other;
step S5: traversing the bus message characteristic information table, checking whether the RT address and the RT subaddress analyzed from the bus message data are completely consistent with a certain line in the bus message characteristic information table according to the message type, and if so, outputting the message code of the line and the data word source code of the message.
2. The method according to claim 1, wherein the GJB289A bus message dynamic mapping method comprises: in step S1, the header content items are specifically as follows:
message type: code representing a GJB289A message type;
and sending the RT address: an RT address representing a sender of the message;
sending the RT sub-address: RT subaddress indicating the sender of the message;
receiving an RT address: an RT address representing a message recipient;
receiving an RT sub-address: an RT subaddress representing a message recipient;
data block number offset address: an offset address representing the data block number of the message relative to the starting byte of data;
data block number: a data block number representing a message;
message code: representing a unique code that can distinguish messages.
3. The method according to claim 1, wherein the GJB289A bus message dynamic mapping method comprises: the message type in step S2 is 1 byte, the lengths of the send instruction word, the receive instruction word, the send status word, the receive status word, and the single data word are all 2 bytes, the number n of the data words is the lower 5 bits of the corresponding instruction word and status word, and the number of bytes is all binary byte number.
4. The method as claimed in claim 1 or 3, wherein the GJB289A bus message dynamic mapping method comprises: the data structure corresponding to each message type is as follows:
0xE 0: message type + receive instruction word + data word n + receive status word;
0xE 1: message type + send instruction word + send status word + data word n;
0xE 2: message type + receive instruction word + send status word + data word n + receive status word;
0xE 6: message type + receive instruction word + data word n;
0xE 7: message type + receive instruction word + send status word + data word n.
5. The method according to claim 1, wherein the GJB289A bus message dynamic mapping method comprises: the analysis method in step S3 includes:
and RT address: taking 11 to 15 bits in a binary instruction word and a binary state word, and taking the lowest bit as a 0 th bit;
RT sub-address: the least significant bit is the 0 th bit, which is the 5 to 9 bits of the binary instruction word.
6. The method according to claim 1, wherein the GJB289A bus message dynamic mapping method comprises: the checking conditions of the RT address and the RT sub-address in step S4 are as follows:
0xE 0: RT address in the receive instruction word = RT address in the receive status word;
0xE 1: RT address in send instruction word = RT address in send status word;
0xE 2: RT address in the receive instruction word = RT address in the receive status word,
and RT address in the send instruction word = RT address in the send status word;
0xE 6: none;
0xE 7: RT address in the send instruction word = RT address in the send status word.
7. The method according to claim 1, wherein the GJB289A bus message dynamic mapping method comprises: in step S5, only valid data is checked if the RT address and the RT sub-address analyzed from the bus message data are completely consistent with a certain line in the bus message characteristic information table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010295519.2A CN111556034B (en) | 2020-04-15 | 2020-04-15 | GJB289A bus message dynamic mapping method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010295519.2A CN111556034B (en) | 2020-04-15 | 2020-04-15 | GJB289A bus message dynamic mapping method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111556034A CN111556034A (en) | 2020-08-18 |
| CN111556034B true CN111556034B (en) | 2021-08-03 |
Family
ID=72002957
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010295519.2A Active CN111556034B (en) | 2020-04-15 | 2020-04-15 | GJB289A bus message dynamic mapping method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111556034B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112114981B (en) * | 2020-09-09 | 2023-12-12 | 天津津航计算技术研究所 | 1553B bus message scheduling method based on linked list |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102088332B (en) * | 2010-12-15 | 2013-11-06 | 北京航空航天大学 | Method and device for expansion 1553B bus to perform file transfer from BC to RT |
| CN102508754B (en) * | 2011-09-22 | 2014-08-20 | 航天科工惯性技术有限公司 | Method for detecting 1553B communication interface |
| CN103368693B (en) * | 2013-07-04 | 2016-12-28 | 国家电网公司 | A kind of method of power distribution network interexchange bus reliable data transmission |
| CN105099504A (en) * | 2014-05-20 | 2015-11-25 | 中国科学院空间科学与应用研究中心 | Ultra-wideband pulse-based satellite-bone high-speed data network system |
| CN106506308B (en) * | 2016-10-19 | 2019-07-02 | 北京空间飞行器总体设计部 | A kind of spacecraft 1553B bus communication system based on time synchronization |
| CN106936647B (en) * | 2017-04-26 | 2020-02-14 | 成都成电光信科技股份有限公司 | Novel GJB289A bus configuration method |
| CN109922009B (en) * | 2019-01-25 | 2022-07-29 | 北京临近空间飞行器系统工程研究所 | 1553B bus message distribution configuration unit based on data characteristics |
| CN109946991B (en) * | 2019-02-18 | 2022-07-26 | 中国科学院国家空间科学中心 | Satellite counting simulation platform based on 1553B bus protocol encapsulation |
| CN109992554B (en) * | 2019-03-12 | 2020-11-06 | 中国科学院国家空间科学中心 | Method for realizing 1553B bus communication protocol based on general Schema structure description |
-
2020
- 2020-04-15 CN CN202010295519.2A patent/CN111556034B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN111556034A (en) | 2020-08-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| DE60337023D1 (en) | PROCESSING DATA UNITS FOR TRANSFERING OVER THE SAME CHANNEL | |
| CN110083088A (en) | Signal controls conversion equipment and signal controls conversion method | |
| CN103875206A (en) | Data transmission method, and data forwarding equipment and system | |
| CN111556034B (en) | GJB289A bus message dynamic mapping method | |
| CN109861998B (en) | Plug-in type dynamic analysis system and method based on Beidou short message protocol | |
| CN1816042A (en) | Method for transmission of data between processors | |
| WO2014178275A1 (en) | Transmission device for wireless transmission of continuous data by means of packets, reception device, communication device, program, transmission method, and reception method | |
| US20120102149A1 (en) | Inter-Board Communication Apparatus, Method for Transmitting and Receiving Message of Inter-Board Communication | |
| CN113703843B (en) | Register data processing method, device and memory | |
| CN101431801B (en) | Transmission method for control information of receiving equipment | |
| CN111818060B (en) | Communication protocol, method and system for supporting hybrid and discrete data transmission | |
| CN109951458B (en) | RapidIO/FC protocol conversion system and method applied to simulation ICP environment | |
| CN110830386B (en) | Message order preserving method, device and system | |
| CN109462530B (en) | Airplane digital audio transmission method based on RS422 bus and Slip protocol | |
| CN103997415A (en) | Apparatus and method for realizing message statistics | |
| CN108108316B (en) | Interface expansion method and system based on field programmable gate array | |
| CN102780639B (en) | Router wire card and data processing method | |
| CN116055534A (en) | Multi-serial device data forwarding system and method | |
| CN113268446B (en) | Information processing method and device for multiple airborne bus accesses | |
| CN111262729B (en) | Configurable information flow management method of carrier rocket test control system | |
| CN113347195A (en) | Dynamic mounting system and method for communication protocol packet of Internet of things equipment | |
| CN115225591B (en) | Method for processing control message of exchange chip | |
| EP1752877A2 (en) | A processing module | |
| Esparza et al. | Transitioning applications from CAN 2.0 to CAN FD | |
| CN109558107A (en) | A kind of FC message sink management method of shared buffer |
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 |