SERIAL LINK COMMUNICATIONS PROTOCOL

Abstract: A transmission-economized serial bus protocol comprising at least one eight-bit word further comprising at least an operation code and a subargument (Fig. 2). The operation code and subargument comprise, respectively, either a start-of-message character or a start-of-reply character and either a device destination address or the device's source addresse (Fig. 3). Further, an error detection device is provided comprising an even parity bit. Moreover, there is provided an optimized method of bus contention comprising monitoring the bus (230) for an idle or busy bus condition and either attempting an asynchronous bus access if the bus is idle or synchronously attempting a prioritized retry after a busy bus condition is sensed, after a bus access collision is sensed, and upon initial power-up, synchronized to the current message completion. The prioritization comprises a constant time delay plus a bit-time delay proportional to an accessing device's address identification (Fig. 5). Finally, there is provided an optimized method of inter-device (120, 140, 150, 180, 190, 200) message addressing and handshaking in a multi-access, bussed system, each device having a source and destination address, comprising addressing a message to a destination address and awaiting the addressed destination device to acknowledge by echoing its corresponding source address and also monitoring the bus (230) for an announcement of a source addressed event and performing a function accordingly.

Description: SERIAL LINK COMMUNICATIONS PROTOCOL Cross References to Related Applications The instant patent application is related to the following patent applications filed on even date herewith and are hereby incorporated by reference thereto and made part hereof as if fully set forth herein: Internally Register-Modelled, Serially-Bussed Radio System Method of Communications Between Register-Modelled Radio Devices The Field of Invention The invention disclosed herein is, generally, concerned with serial communication protocols. More particularly, this invention relates to serial link communication protocols for serially bussed two-way radios. Background of the Invention The need for this invention arose from problems in serially communicating information between radio subsystems in an internally-bussed two-way radio. Specifically, the problems to be addressed were those of transmission economy, bus contention, error detection and subsystem device addressing. Register modeling and serial linkage of radio subsystems is at the heart of the architecture for the latest generation of two-way radios. The radios are constructed by interconnecting independent radio subsystems, control heads and accessories with the basic R.F. modem over a bidirectional serial link, as illustrated in Figure 1. The serial link interfaces with the radio devices via standard universal Asynchronous Receiver/Transmitter (UART) devices. Thus, message protocols must be based upon sequences of eight-bit words, each with start and stop bits, as is customary with these devices. Others have attempted to solve the problem by asynchronous ASCII character packet transmission, randomized bus access retry, checksum or cyclical redundancy check error detection, and source and destination addressing. A general purpose protocol has the ability to communicate data and control information between devices. Typically, a general purpose protocol defines a primitive set of operations that a device can perform. An operation code is usually transmitted near the beginning of a message to instruct the recipient as to how to treat the remaining transmission. The currently accepted methodology is to reserve a unique eight-bit word within the permissible character set as a recognizable start-of-message. Its meaning is reserved and will, therefore, not appear anywhere else in the message. The start-of-message contains no other information and owes its sole existence to designating the legitimate start of the message. For example, a message that is started and aborted due to collision or device failure, can confidently be ignored when the next start-of-message word is seen. This is infinitely preferable to the reception and misinterpretation of an aborted message. Accordingly, the start-of-message word must maintain its uniqueness by not serving any other function - it must be a reserved word. 3 A multi-device, multi-access protocol must also reserve a number of words to identify various devices on the serial bus. To provide for acknowledgment of received messages and handshaking between devices, often, protocols transmit both the address of the originating device and the address of the device to which the message Is destined. For error detection, many protocols append checksum or other error detection contrivance. In multiple access busses, collision avoidance and bus contention must be anticipated and orchestrated. Many systems provide for randomized retry for bus access, hoping that randomization will reduce the- possibility of further collisions. However, each of these considerations take thei toll in protocol design sacrificing transmission efficiency with starts-of-messages, source addresses, destination addresses, and checksums and requiring bus contention randomization overhead. The instant invention solves these problems by economizing and optimizing transmissions, eliminating randomization overhead, simplifying bus contention and simplifying device addressing. This invention represents a significant advance over the prior art and over this technical field b providing an economized, optimized serial communications protocol with simplified addressing and bus contention. Brief Summary of the Invention It is the object of the present invention t provide an economized, optimized serial communication protocol with simplified addressing and bus contention. It is a further object of the invention to provide economized and optimized transmissions. Another object of the present invention is to simplify subsystem device addressing. Yet another object of the present invention is to eliminate randomization overhead upon bus access retry. A final object of the invention is to simplify bus contention. The ultimate object is to provide an economized, optimized serial communications protocol with simplified addressing and bus contention. In accordance with the present invention, there is provided an optimized, transmission-economized serial bus protocol comprising at least one eight-bit word further comprising at least an operation code and a subargument. The operation code and subargument comprise, respectively, either a start-of-message character or a start-of-reply character and either a device destination address or the device's source address. Further, an error detection device is provided comprising an even parity bit. Moreover, there is provided an optimized method of bus contention comprising monitoring the bus for an idle or busy bus condition and either attempting an asynchronous bus access if the bus is idle or synchronously attempting a prioritized retry after a busy bus condition is sensed, after a bus access collision is sensed, and upon initial power-up, synchronized to the current message completion. The prioritization comprises a constant time delay plus a bit-time delay proportional to the accessing device's address identification. Finally, there is provided an optimized method of inter-device message addressing and handshaking in a multi-access, bussed system, each device having a source and destination address, comprising addressing a message to a destination address and awaiting the addressed destination device to acknowledge by echoing its corresponding source address and also monitoring the bus for an announcement of a source addressed event and performing a function in response thereto. Thus, there has been provided an economized, optimized serial communications protocol with simplifie addressing and bus contention. Brief Description of the Drawings Additional objects, features, and advantages, i accordance with the present invention, will be mor clearly understood, by way of unrestricted example, fro the following detailed description, taken together wit the accompanying drawings, in which: FIGURE 1 is a block diagram illustrating serially- bussed, register-modelled, subsystem addressabl radio system in which the preferred embodiment of th present invention is utilized. FIGURE 2 is a bit diagram illustrating th signalling format used in the preferred embodiment of th present invention. FIGURE 3 is a time line illustrating the messag protocol used in the preferred embodiment of the presen invention. FIGURE 4 is a time line illustrating th announcement protocol used in the preferred embodiment o the present invention. FIGURE 5 is a timing diagram illustrating the bus access prioritization of the preferred embodiment of the present invention. The invention will be readily appreciated by reference to the detailed description when considered in conjunction with the accompanying drawings in which like reference numerals designate like parts throughout the Figures. The Description of the Preferred Embodiment The preferred embodiment of the disclosed serial link protocol comprises an inventive method of: economizing and optimizing transmissions without making the protocol special purpose by including a start-of- message and start-of-response character in the character set and making it .unique by combining it with a unique device address, supporting both individual, device-destined messages that require acknowledgments and announcement messages that do not require acknowledgment, thereby increasing transmission economy by eliminating the necessity of transmitting both source and destination addresses with each message, and accessing the serial bus without collision retry randomization overhead by synchronously prioritizing the retrys in accordance with its device identification address. Character Formats FIGURE 2, is a bit diagram illustrating the signalling format used in the preferred embodiment of the present invention. Each and every character is composed of the illustrated subcharacter fields. Bits 4-6 contain a three-bit operation code. Bits 0-4 contain a four-bit subargument of the operation code. Bit 7 is an even parity, error detecting bit. Op-code Characteristics There are eight unique op-codes corresponding to bits 4-6 illustrated in Figure 2. They are: Op-code Definition 0 Start-of-Message 1 Start-of-Reply 2 Function 3 Primary Data 4 Bit Clear 5 Write 6 Bit Set 7 Read Start of Transmission By defining the start-of- essage and start-of-reply as an operation code, rather than merely one of the characters in a data set (e.g., ASCII), and combining each with the unique four-bit device address in the subargument field, thirty two non-reoccurring characters are generated. Accordingly, eight devices can be defined on the system, each having a destination address and a different source address. Thus, each device has a dual identification. Depending upon the type of message to be sent, the eight-bit word will contain either a destination-specific or its own source address in the subargument field. A destination address subargument specifies which device is to receive the message whereas a source address subargument specifies the originating device. As illustrated in Figure 3, when a destination-specific message is transmitted, the designated recipient acknowledges with its own source address as the subargument to a start-of-response op-code. As illustrated in Figure 4, when a device wants to announce a local event to whomever is interested, it will broadcast an announcement with its own source address as the subargument to a start-of-message op-code. No acknowledgment is required. With this inventive protocol, economy of transmission is achieved without making the protocol special-purpose. The start-of-transmission indicators have been combined with device addresses to generate thirty two non-reoccurring, unique eight-bit words that are uniquely recognizable. Each message is identifiable as to its destination. Each acknowledged message receipt is identifiable by its echoed source address. Each broadcasted announcement is identifiable by the source address of its origin. Transmission efficiency is achieved by compacting all of that information into a single, eight-bit word with parity as opposed to transmitting a three-word preamble containing a start-of-message indication, a source address and a destination address and a postambled checksum with each transmission. Further tranmission economies are realized though an inventive bus access protocol. The protocol is, basically, a Carrier Sense, Multiple Access (CSMA) technique with collision detection. This implies that when the bus is sensed to be idle, any device wishing to initiate a transmission may asynchronously do so at any moment. Collision detection is provided by requiring the transmitting device to read back each word transmitted to ensure data integrity. This protocol differs from others in the way it accesses the bus when busy. Referring to Figure 5, each device must wait a specific period of time following eac word seen on the bus before deciding that the link is free. The time delay is minimally long enough to ensur that the gap following the last observed word is not a inter-word gap within a message dialog (i.e., an addresse device must respond within this gap) . In addition to th required inter-word gap, each device must wait prioritized period of time. In the preferred embodiment, the priority is based upon the device's address or I.D. Thus, each device will attempt to access the bus at different time after the completion of the previou message. Since the waiting period is prioritized, lowe I.D.'s are able to access the bus at least one bit befor the next highest prioritized device. Therefore, collisio should never occur except when the bus has been idle for long time. In that event, the device with the lowest I.D. will retry for bus access first, without collision. Thus, there has been provided an economized, optimized serial communications protocol with simplifie addressing and bus contention. Further, there has been provided a serial lin communications protocol that has economized and optimize transmissions, simplified subsystem device addressing, n randomization overhead upon bus access retry, an simplified bus contention. It will be appreciated by those skilled in the ar of serial communication protocols that the foregoin description of the various embodiments are merel illustrative of the broad inventive concept comprehende by the invention and has been given for clarity of understanding by way of unrestricted example. However, it is not intended to cover all changes and modifications which do not constitute departures from the spirit and scope of the invention.

Claims: Claims What We claim and desire to secure by Letters Patent is: 05 1. An optimized, transmission-economized serial bus protocol comprising: at least one eight-bit word further comprising at X0 least: an operation code and a subargument. 15 20 25 30 35 0 2. An optimized protocol as claimed in Claim 1 wherein said operation code and said subargument comprise, respectively: 5 a start-of-transmission character and a device address. 3. An optimized protocol as claimed in Claim 2 wherein 0 said start-of-transmission character comprises: a start-of-message character. 4. An optimized protocol as claimed in Claim 2 or 3 5 wherein said device address comprises: a device destination address. 5. An optimized protocol as claimed in Claim 2 or 3 o wherein said device address comprises: the device's source address. 6. An optimized protocol as claimed in Claim 2 wherein 5 said start-of-transmission character comprises: a start-of-reply character. 7. An optimized protocol as claimed in Claim 2 or 6 wherein said device address comprises: the device's source address. 8. An optimized protocol as claimed in Claim 1 wherein said word further comprises: an error detection device. 9. An optimized protocol as claimed in Claim 8 wherein said error detection device comprises: a parity bit. 10. An optimized protocol as claimed in Claim 9 wherein said parity bit comprises: an even parity bit. 11. An optimized, transmission-economized serial bus protocol comprising: at least one eight-bit word further comprising: either a start-of-transmission or a start-of- reply character, either a destination or source address and an even parity, error detection bit. 12. An optimized method of bus contention comprising: monitoring the bus for an idle or busy bus condition and either attempting an asynchronous bus access if the bus is idle or synchronously attempting a prioritized retry after a busy bus condition is sensed, after a bus access collision is sensed, and upon initial power-up, synchronized to the current message completion. 13. An optimized bus contention method as claimed in Claim 12 wherein said prioritization comprises: a bit-time delay proportional to said accessing device's address identification. 14. An optimized bus contention method as claimed in Claim 13 wherein said prioritization further comprises: a constant time delay. 15. An optimized method of inter-device message addressing and handshaking in a multi-access, bussed system, each device having a source and destination address, comprising: addressing a message to a destination address and awaiting the addressed destination device to acknowledge by echoing its corresponding source address. 16. An optimized method of inter-device message addressing and handshaking in a multi-access, bussed system, each device having a source and destination address, comprising: monitoring the bus for an announcement of a source addressed event and performing a function in response thereto.

Inventors: BORRAS JAIME ANDRES, BROWAND WAYNE HARRY, COMROE RICHARD ALAN, EKL RANDY LEE, KOZLOWSKI TED ANTHONY, MITCHELL TIMOTHY ALAN, RAMOS OZZIE FRANCISCO, BORRAS, JAIME, ANDRES, BROWAND, WAYNE, HARRY, COMROE, RICHARD, ALAN, EKL, RANDY, LEE, KOZLOWSKI, TED, ANTHONY, MITCHELL, TIMOTHY, ALAN, RAMOS, OZZIE, FRANCISCO
Applicants: MOTOROLA INC, MOTOROLA, INC.
Application year: 1985
Main classification: H04Q9
IPC codes: G06F13, H04L12, H04L29