公开(公告)号：AU655303B2

公开(公告)日：1994-12-15

申请号：AU2201992

申请日：1992-09-01

Applicant: MOTOROLA INC

Inventor： ARMBRUSTER PETER J ,  STEPHENS JAMES A

IPC: G06F13/00 ,  G06F9/52 ,  G06F13/376 ,  G06F13/38 ,  G06F15/16 ,  G06F15/177 ,  H04L12/413 ,  G06F13/14

Abstract: A method and apparatus for data collision detection and resolution in a multi-processor communication system. The system includes a plurality of processors (1, 2, 3, 4, 5, 6, 7, 8) coupled via a common bus (9). When it is required that one processor (1, 2, 3, 4, 5, 6, 7 or 8) communicate with another processor (1, 2, 3, 4, 5, 6, 7 or 8), the first processor (1, 2, 3, 4, 5, 6, 7 or 8) determines whether a data collision flag is set. The processor (1, 2, 3, 4, 5, 6, 7 or 8) then checks a number of indicators to determine whether the identity of the transmitting processor (1, 2, 3, 4, 5, 6, 7 or 8) is what it is expected to be. If a data collision is found, the processor (1, 2, 3, 4, 5, 6, 7 or 8) waits a selective time before transmitting a message (30). The processor (1, 2, 3, 4, 5, 6, 7 or 8) then repeats the data collision checking and transmitting the message (30) to the other processor (1, 2, 3, 4, 5, 6, 7 or 8) when no data collision is found. The time to wait is dependent upon the identity of the processor (1, 2, 3, 4, 5, 6, 7 or 8) and is table driven.

公开(公告)号：NO923372A

公开(公告)日：1993-05-03

申请号：NO923372

申请日：1992-08-28

Applicant: MOTOROLA INC

Inventor： ARMBRUSTER PETER J ,  STEPHENS JAMES A

IPC: G06F13/00 ,  G06F9/52 ,  G06F13/376 ,  G06F13/38 ,  G06F15/16 ,  G06F15/177 ,  H04L12/413 ,  H04L

CPC classification number: H04L12/40013 ,  H04L12/413

公开(公告)号：NO944464A

公开(公告)日：1995-06-28

申请号：NO944464

申请日：1994-11-22

Applicant: MOTOROLA INC

Inventor： ALTSCHULER BARRY N ,  HARDY DOUGLAS A ,  STEPHENS JAMES A ,  KISH III JOSEPH

IPC: H04W12/00 ,  H04L9/12

CPC classification number: H04L63/0428 ,  H04M1/663 ,  H04M1/667

公开(公告)号：NO923372L

公开(公告)日：1993-05-03

申请号：NO923372

申请日：1992-08-28

Applicant: MOTOROLA INC

Inventor： ARMBRUSTER PETER J ,  STEPHENS JAMES A

IPC: G06F13/00 ,  G06F9/52 ,  G06F13/376 ,  G06F13/38 ,  G06F15/16 ,  G06F15/177 ,  H04L12/413 ,  H04L

Abstract: A method and apparatus for data collision detection and resolution in a multi-processor communication system. The system includes a plurality of processors (1, 2, 3, 4, 5, 6, 7, 8) coupled via a common bus (9). When it is required that one processor (1, 2, 3, 4, 5, 6, 7 or 8) communicate with another processor (1, 2, 3, 4, 5, 6, 7 or 8), the first processor (1, 2, 3, 4, 5, 6, 7 or 8) determines whether a data collision flag is set. The processor (1, 2, 3, 4, 5, 6, 7 or 8) then checks a number of indicators to determine whether the identity of the transmitting processor (1, 2, 3, 4, 5, 6, 7 or 8) is what it is expected to be. If a data collision is found, the processor (1, 2, 3, 4, 5, 6, 7 or 8) waits a selective time before transmitting a message (30). The processor (1, 2, 3, 4, 5, 6, 7 or 8) then repeats the data collision checking and transmitting the message (30) to the other processor (1, 2, 3, 4, 5, 6, 7 or 8) when no data collision is found. The time to wait is dependent upon the identity of the processor (1, 2, 3, 4, 5, 6, 7 or 8) and is table driven.

公开(公告)号：NO944464D0

公开(公告)日：1994-11-22

申请号：NO944464

申请日：1994-11-22

Applicant: MOTOROLA INC

Inventor： ALTSCHULER BARRY N ,  HARDY DOUGLAS A ,  STEPHENS JAMES A ,  KISH III JOSEPH

IPC: H04W12/00 ,  H04L

Abstract: A call is connected between secure terminals (16) through a network (12). If a network address for the call is included on an approved list (46), a secure call setup procedure (54) is performed automatically. One terminal (16) automatically sends an auto-secure signal. If the other terminal detects the auto-secure signal, secure call setup procedure (54) is performed automatically. The secure call setup procedure (54) determines a current user-identity for the opposing party. If the current user-identity corresponds to a user-identity included on an approved list (76), an abbreviated secure call setup process (80) is performed. If the current user identity is not approved, a full secure call setup process (78) is performed. The abbreviated process (80) differs from the full process (78) in that it uses a traffic key obtained from a prior secure communication session and may be performed more quickly.

公开(公告)号：NO944464L

公开(公告)日：1995-06-28

申请号：NO944464

申请日：1994-11-22

Applicant: MOTOROLA INC

Inventor： ALTSCHULER BARRY N ,  HARDY DOUGLAS A ,  STEPHENS JAMES A ,  KISH III JOSEPH

IPC: H04W12/00 ,  H04L9/12

Abstract: A call is connected between secure terminals (16) through a network (12). If a network address for the call is included on an approved list (46), a secure call setup procedure (54) is performed automatically. One terminal (16) automatically sends an auto-secure signal. If the other terminal detects the auto-secure signal, secure call setup procedure (54) is performed automatically. The secure call setup procedure (54) determines a current user-identity for the opposing party. If the current user-identity corresponds to a user-identity included on an approved list (76), an abbreviated secure call setup process (80) is performed. If the current user identity is not approved, a full secure call setup process (78) is performed. The abbreviated process (80) differs from the full process (78) in that it uses a traffic key obtained from a prior secure communication session and may be performed more quickly.

公开(公告)号：IE922611A1

公开(公告)日：1993-05-05

申请号：IE922611

申请日：1992-08-26

Applicant: MOTOROLA INC

Inventor： ARMBRUSTER PETER J ,  STEPHENS JAMES A

IPC: G06F13/00 ,  G06F9/52 ,  G06F13/376 ,  G06F13/38 ,  G06F15/16 ,  G06F15/177 ,  H04L12/413 ,  G06F13/42

Abstract: A method and apparatus for data collision detection and resolution in a multi-processor communication system. The system includes a plurality of processors (1, 2, 3, 4, 5, 6, 7, 8) coupled via a common bus (9). When it is required that one processor (1, 2, 3, 4, 5, 6, 7 or 8) communicate with another processor (1, 2, 3, 4, 5, 6, 7 or 8), the first processor (1, 2, 3, 4, 5, 6, 7 or 8) determines whether a data collision flag is set. The processor (1, 2, 3, 4, 5, 6, 7 or 8) then checks a number of indicators to determine whether the identity of the transmitting processor (1, 2, 3, 4, 5, 6, 7 or 8) is what it is expected to be. If a data collision is found, the processor (1, 2, 3, 4, 5, 6, 7 or 8) waits a selective time before transmitting a message (30). The processor (1, 2, 3, 4, 5, 6, 7 or 8) then repeats the data collision checking and transmitting the message (30) to the other processor (1, 2, 3, 4, 5, 6, 7 or 8) when no data collision is found. The time to wait is dependent upon the identity of the processor (1, 2, 3, 4, 5, 6, 7 or 8) and is table driven.

公开(公告)号：NO923372D0

公开(公告)日：1992-08-28

申请号：NO923372

申请日：1992-08-28

Applicant: MOTOROLA INC

Inventor： ARMBRUSTER PETER J ,  STEPHENS JAMES A

IPC: G06F13/00 ,  G06F9/52 ,  G06F13/376 ,  G06F13/38 ,  G06F15/16 ,  G06F15/177 ,  H04L12/413 ,  H04L

Abstract: A method and apparatus for data collision detection and resolution in a multi-processor communication system. The system includes a plurality of processors (1, 2, 3, 4, 5, 6, 7, 8) coupled via a common bus (9). When it is required that one processor (1, 2, 3, 4, 5, 6, 7 or 8) communicate with another processor (1, 2, 3, 4, 5, 6, 7 or 8), the first processor (1, 2, 3, 4, 5, 6, 7 or 8) determines whether a data collision flag is set. The processor (1, 2, 3, 4, 5, 6, 7 or 8) then checks a number of indicators to determine whether the identity of the transmitting processor (1, 2, 3, 4, 5, 6, 7 or 8) is what it is expected to be. If a data collision is found, the processor (1, 2, 3, 4, 5, 6, 7 or 8) waits a selective time before transmitting a message (30). The processor (1, 2, 3, 4, 5, 6, 7 or 8) then repeats the data collision checking and transmitting the message (30) to the other processor (1, 2, 3, 4, 5, 6, 7 or 8) when no data collision is found. The time to wait is dependent upon the identity of the processor (1, 2, 3, 4, 5, 6, 7 or 8) and is table driven.