← Back to Patent Explorer
US5374926A Expired / Lapsed US ⏱️ 0.0 years remaining

Communications circuit having an interface for external address decoding

Assignee: Texas Instruments Inc
•
Filing: 1993-10-27
•
Granted: 1994-12-20
•
Expires: 2013-10-27
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An adapter circuit for a local area network is disclosed, which contains logic external to the protocol handler for address comparison. The adapter uses random-access memory to store the data fields arriving after the address fields in the serial input data stream during such time as the adapter is comparing the address fields to its own address. The portion of memory used for the data storage is overwritten (recovered) by the next frame of data if the particular adapter was not addressed by the prior frame; the portion of memory used for the data storage is not overwritten if the data was addressed to the adapter. The protocol handler circuit performs an address comprising internally thereto, for intra-ring communication, and controls the recovery of the memory dependent upon the results of the comparison. The external logic performs an address comparison, primarily in inter-ring communication. An interface is provided within the protocol handler circuit to disable the recovery of the memory in the event of a true comparison found by the external logic, regardless of the results of the comparison performed by the protocol handler circuit itself. Two bi-directional signal lines are used for communication between the protocol handler circuit and the external logic. The protocol handler circuit sets a logic state on both lines to indicate the beginning of a frame, and one line or the other is set by the external logic to communicate its results.

Inventors

  • 👤 Andre Szczepanek

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-31 20:19
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/46; H04L12/4637; H04L12/4604; H04L12/462; H04L12/4625; H04L45/00; H04L45/74; H04L45/742

Claims Analysis

Total Claims: 17
Claim 1
Independent Claim 211 words
A method of selectively communicating a data frame from a first data ring network to a second data ring network, wherein each data ring network includes a plurality of addressable stations, each station associated with at least one adapter circuit for receiving the data frame, the data frame including a fixed destination address and fixed inter-ring routing information containing at least one segment address, comprising the steps of: transmitting the data frame to a bridge station, wherein the bridge station is locally addressable by the first data ring network through a first adapter circuit and locally addressable by the second data ring network through a second adapter circuit; determining, at the bridge station but independently and externally from the first and second adapter circuits, that the data frame contains inter-ring routing information therein; comparing, at the bridge station but independently and externally from the first and second adapter circuits, any segment address within the inter-ring routing information of the data frame to a predetermined segment address; transferring the data frame to the second adapter circuit upon a match of any segment address to the predetermined segment address; and comparing, at the bridge station but internally within the second adapter circuit, the destination address with a pre-assigned address for the bridge station.
Claim 2
Independent Claim 211 words
A method of selectively communicating a data frame from a first data ring network to a second data ring network, wherein each data ring network includes a plurality of addressable stations, each station associated with at least one adapter circuit for receiving the data frame, the data frame including a fixed destination address and fixed inter-ring routing information containing at least one segment address, comprising the steps of: transmitting the data frame to a bridge station, wherein the bridge station is locally addressable by the first data ring network through a first adapter circuit and locally addressable by the second data ring network through a second adapter circuit; determining, at the bridge station but independently and externally from the first and second adapter circuits, that the data frame contains inter-ring routing information therein; comparing, at the bridge station but independently and externally from the first and second adapter circuits, any segment address within the inter-ring routing information of the data frame to a predetermined segment address; transferring the data frame to the second adapter circuit upon a match of any segment address to the predetermined segment address; and comparing, at the bridge station but internally within the second adapter circuit, the destination address with a pre-assigned address for the bridge station.
Claim 3
Dependent Claim 38 words
The method of claim 1 and further comprising the step of generating a failed comparison signal if all of the segment addresses within the inter-ring routing information of the data frame do not match the predetermined segment address.
Claim 4
Dependent Claim 20 words
The method of claim 1 and further comprising the step of determining whether the data frame is a broadcast frame.
Claim 5
Dependent Claim 40 words
The method of claim 3 and further comprising the step of indicating that all bridge stations between the first and second data ring networks should copy the data frame if the data frame is determined to be a broadcast frame.
Claim 6
Dependent Claim 41 words
The method of claim 3 and further comprising the step of comparing any segment address within the inter-ring routing information of the data frame to a predetermined segment address if the data frame is determined not to be a broadcast frame.
Claim 7
Dependent Claim 40 words
The method of claim 5 and further comprising the step of copying the data frame into the second adapter circuit if any of the segment addresses within the inter-ring routing information of the data frame matches the predetermined segment address.
Claim 8
Dependent Claim 38 words
The method of claim 5 and further comprising the step of generating a failed match condition if all of the segment addresses within the inter-ring routing information of the data frame do not match the predetermined segment address.
Claim 9
Dependent Claim 21 words
The method of claim 1 and further comprising the step of determining whether the data frame includes an escape sequence therein.
Claim 10
Dependent Claim 25 words
The method of claim 8 and further comprising the step of generating a failed comparison signal if an escape sequence exists within the data frame.
Claim 11
Dependent Claim 266 words
A bridge station for communicating from a first data ring network to a second data ring network a data frame containing a fixed destination address and fixed inter-ring routing information including at least one segment address, wherein each data ring network includes a plurality of locally addressable processing stations, the bridge station comprising: input means for receiving the data frame originating in the first data ring network; protocol handler circuitry, comprising: a first address register, connected to the input means, for storing the destination address of the data frame; a second address register for storing a pre-assigned address; and an intra-ring comparator, connected to the first address register and the second address register, for comparing the destination address to the pre-assigned address; a local data bus, connected to the input means, for storing the data frame externally from the protocol handler circuitry; external address comparison circuitry operating externally and independently from the protocol handler circuitry, comprising: a first segment address register, connected to the local data bus, for storing inter-ring routing information; a second segment address register for storing a predetermined segment address; an inter-ring comparator, connected to the first segment address register and the second segment address register, for comparing any segment address within the inter-ring routing information to the predetermined segment address; and interface terminals for passing comparison signals to the protocol handler circuitry; and decision logic responsive to both the protocol handler circuitry and the external address comparison circuitry for causing the data frame on the local data bus to be stored into a memory for presentation to the second data ring network.
Claim 12
Dependent Claim 266 words
A bridge station for communicating from a first data ring network to a second data ring network a data frame containing a fixed destination address and fixed inter-ring routing information including at least one segment address, wherein each data ring network includes a plurality of locally addressable processing stations, the bridge station comprising: input means for receiving the data frame originating in the first data ring network; protocol handler circuitry, comprising: a first address register, connected to the input means, for storing the destination address of the data frame; a second address register for storing a pre-assigned address; and an intra-ring comparator, connected to the first address register and the second address register, for comparing the destination address to the pre-assigned address; a local data bus, connected to the input means, for storing the data frame externally from the protocol handler circuitry; external address comparison circuitry operating externally and independently from the protocol handler circuitry, comprising: a first segment address register, connected to the local data bus, for storing inter-ring routing information; a second segment address register for storing a predetermined segment address; an inter-ring comparator, connected to the first segment address register and the second segment address register, for comparing any segment address within the inter-ring routing information to the predetermined segment address; and interface terminals for passing comparison signals to the protocol handler circuitry; and decision logic responsive to both the protocol handler circuitry and the external address comparison circuitry for causing the data frame on the local data bus to be stored into a memory for presentation to the second data ring network.
Claim 13
Dependent Claim 19 words
The bridge station of claim 10 wherein the protocol handler circuitry and the external address comparison circuitry operate independently.
Claim 14
Dependent Claim 26 words
The bridge station of claim 10 wherein the interface terminals pass match and fail signals responsive to the results of the comparison in the inter-ring comparator.
Claim 15
Dependent Claim 42 words
The bridge station of claim 10 wherein the data frame containing a fixed destination address and fixed inter-ring routing information including at least one segment address remains unmodified while communicated from the first data ring network to the second data ring network.
Claim 16
Dependent Claim 44 words
The bridge station of claim 10 wherein a first data frame stored on the local bus is overwritten by a second data frame received by the input means upon a failed comparison of both the protocol handler circuitry and the external address comparison circuitry.
Claim 17
Dependent Claim 43 words
The bridge station of claim 10 wherein segment addresses within the fixed inter-ring routing information are stored in sequence and a match of the predetermined segment address with the last segment address in sequence initiates an intra-ring transfer using the fixed destination address.

References Cited (Backward Citations)

US3731002A Cited
US4287592A Cited
US4597078A Cited
US4638477A Cited
US4571675A Cited
US4627052A Cited
US4621362A Cited
US4706081A Cited
US4680756A Cited
US4674086A Cited
US4715030A Cited
US4737953A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1997-12-19 1998-06-20 1998-12-20 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2001-12-19 2002-06-20 2002-12-20 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2005-12-19 2006-06-20 2006-12-20 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag