Patent US4016367A successfully refreshed from Google Patents.
US4016367A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Communication multiplexer module
Assignee: Unisys Corp
•
Filing: 1975-04-11
•
Granted: 1977-04-05
•
Expires: 1995-04-11
Abstract
Abstract A communications multiplexer module (CMM) used to provide an interface between a plurality of line adapters and a host computer. A control memory is provided for storing control words, one word for each adapter. A scanner scans the adapters and at the same time addresses the memory to read out the control word associated with that adapter. The control word contains a bit or bits for designating whether the multiplexer is to operate in an input or an output mode for that adapter. Data bits are received from the line adapters serial by bits are assembled in an assembly/disassembly area of the control word. After each character is assembled it is transferred to the host computer interface. Common multiplexed circuitry is provided for performing parity checking, longitudinal redundancy checking and cyclic redundancy checking of messages.
Inventors
- 👤 Wendell A. Law
- 👤 William G. Barrett
- 👤 Norman F. Priebe
- 👤 Harry D. Wise
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 05:35
CPC Classifications
G; G06; G06F; G06F13/00; G06F13/38; G06F13/382; G06F13/385
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
255 words
In a communications multiplexer module for transferring messages between a host computer and a plurality of line adapters, the improvement comprising: a memory including a plurality of addressable storage locations, one for each of said line adapters, each said addressable storage location including, a first storage means for temporarily storing each character of a message as it is transferred between the computer and the associated line adapter, and a second storage means for storing longitudinal redundancy check characters generated as a message is transferred through the multiplexer module; a time shared modulo 2 adder means having first and second inputs connected to said memory for receiving said characters of said messages from said first storage means and said longitudinal redundancy check characters from said second storage means to thereby generate longitudinal redundancy check characters; said adder means having an output connected to said memory for applying generated longitudinal redundancy check characters to said second storage means; and, addressing means for addressing said addressable storage locations in a predetermined sequence, whereby the characters stored in the first and second storage means of a given addressable storage location are concurrently applied to said adder means and the characters stored in the first and second storage means of successive addressable storage locations are applied to said adder means in said predetermined sequence, and the longitudinal redundancy check characters generated by said adder means represent the longitudinal check characters for said messages from the beginning of said messages through and including the last one applied to said adder means.
Claim 2
Dependent Claim
255 words
In a communications multiplexer module for transferring messages between a host computer and a plurality of line adapters, the improvement comprising: a memory including a plurality of addressable storage locations, one for each of said line adapters, each said addressable storage location including, a first storage means for temporarily storing each character of a message as it is transferred between the computer and the associated line adapter, and a second storage means for storing longitudinal redundancy check characters generated as a message is transferred through the multiplexer module; a time shared modulo 2 adder means having first and second inputs connected to said memory for receiving said characters of said messages from said first storage means and said longitudinal redundancy check characters from said second storage means to thereby generate longitudinal redundancy check characters; said adder means having an output connected to said memory for applying generated longitudinal redundancy check characters to said second storage means; and, addressing means for addressing said addressable storage locations in a predetermined sequence, whereby the characters stored in the first and second storage means of a given addressable storage location are concurrently applied to said adder means and the characters stored in the first and second storage means of successive addressable storage locations are applied to said adder means in said predetermined sequence, and the longitudinal redundancy check characters generated by said adder means represent the longitudinal check characters for said messages from the beginning of said messages through and including the last one applied to said adder means.
Claim 3
Dependent Claim
43 words
The improvement as claimed in claim 1 and further comprising means for sensing the end of an output message, and means for transmitting the longitudinal redundancy check character associated with said message to a line adapter at the end of said output message.
Claim 4
Dependent Claim
47 words
The improvement as claimed in claim 1 and further comprising means for determining if any of said second storage means contain a zero value at the end of the input message associated therewith if said input message has a longitudinal redundancy check character as a part thereof.
Claim 5
Dependent Claim
150 words
The improvement as claimed in claim 1 and further comprising means for sensing each message character in each of said first storage means, means responsive to the sensing means for inhibiting the operation of said adder means for any addressed storage location wherein a sensed character has a first predetermined code; further means set in response to said predetermined code for storing an indication that said code was sensed, said further means inhibiting operation of said adder means with the addressed storage location containing said sensed characters even after the character temporarily stored therein has been transmitted, and resume means responsive to a second predetermined code sensed in said first storage means for resetting said further means, whereby selected characters in a given message occurring between said characters having said first and second predetermined codes are excluded from the computation of the longitudinal redundancy check character for said given message.
Claim 6
Dependent Claim
59 words
The improvement as claimed in claim 4 wherein said further means comprises a third storage means in each of said addressable storage locations, and said sensing means is connected to said memory to set only the third storage means of the addressable storage location wherein the first storage means thereof contains said sensed character having said first predetermined code.
Claim 7
Dependent Claim
271 words
In a communications multiplexer module for transferring messages between a host computer and a plurality of line adapters, the improvement comprising: a memory having a plurality of storage locations, one for each of said line adapters, each said storage location including: a first multibit storage means for receiving message chracters a bit at a time from the associated line adapter or for transmitting characters a bit at a time to the associated line adapter, and a second multibit storage means for storing a cyclic redundancy check character for the message passing between said first storage means and said associated line adapter; means for addressing said storage locations in a predetermined sequence to read out and to read in to said first and second storage means; means for generating a multibit constant; means for shifting said character bits in each of said first storage means one position when its storage location is addressed and a data bit is transmitted from or received therein; means connected to said memory for sensing one bit position in each of the first and second storage means of an addressed location, said sensing means producing a control signal when the sensed bit positions are equal; a modulo-2 adder responsive to said control means and having one input connected to said constant generating means and a second input and an output connected to said memory whereby said adder updates the cyclic redundancy check character in the second storage means of an addressed storage location when said sensing means senses that said one bit position in the first and second storage means of the addressed storage location are equal.
Claim 8
Dependent Claim
271 words
In a communications multiplexer module for transferring messages between a host computer and a plurality of line adapters, the improvement comprising: a memory having a plurality of storage locations, one for each of said line adapters, each said storage location including: a first multibit storage means for receiving message chracters a bit at a time from the associated line adapter or for transmitting characters a bit at a time to the associated line adapter, and a second multibit storage means for storing a cyclic redundancy check character for the message passing between said first storage means and said associated line adapter; means for addressing said storage locations in a predetermined sequence to read out and to read in to said first and second storage means; means for generating a multibit constant; means for shifting said character bits in each of said first storage means one position when its storage location is addressed and a data bit is transmitted from or received therein; means connected to said memory for sensing one bit position in each of the first and second storage means of an addressed location, said sensing means producing a control signal when the sensed bit positions are equal; a modulo-2 adder responsive to said control means and having one input connected to said constant generating means and a second input and an output connected to said memory whereby said adder updates the cyclic redundancy check character in the second storage means of an addressed storage location when said sensing means senses that said one bit position in the first and second storage means of the addressed storage location are equal.
Claim 9
Dependent Claim
50 words
The combination as claimed in claim 6 wherein each said storage location includes a third storage means for storing bits defining different cyclic redundancy checks, said means generating said multibit constant being responsive to said bits defining the cycle redundancy check for generating one of a plurality of multibit constants.
Claim 10
Dependent Claim
25 words
The combination as claimed in claim 7 wherein the third storage means in different storage locations may simultaneously store bits defining different cyclic redundancy checks.
Claim 11
Dependent Claim
28 words
The combination as claimed in claim 6 and further comprising means for transferring a cyclic redundancy check character from the second storage means to the associated line adapter.
Claim 12
Dependent Claim
124 words
In a communications multiplexer module for transferring messages between a first device and a plurality of second devices, said multiplexer module including a memory having a plurality of addressable storage locations which are addressed in a predetermined sequence, there being one location for each of said second devices, the improvement wherein: said addressable storage locations each have first and second means for storing first and second characters, respectively; and, a time shared modulo-2 adder having first and second inputs for receiving said first and second characters from said first and second storages means of an addressed storage location, said adder having an output connected to said memory for storing in the second storage means of said addressed storage location a longitudinal redundancy check character.
Claim 13
Dependent Claim
124 words
In a communications multiplexer module for transferring messages between a first device and a plurality of second devices, said multiplexer module including a memory having a plurality of addressable storage locations which are addressed in a predetermined sequence, there being one location for each of said second devices, the improvement wherein: said addressable storage locations each have first and second means for storing first and second characters, respectively; and, a time shared modulo-2 adder having first and second inputs for receiving said first and second characters from said first and second storages means of an addressed storage location, said adder having an output connected to said memory for storing in the second storage means of said addressed storage location a longitudinal redundancy check character.
Claim 14
Dependent Claim
60 words
The improvement as claimed in claim 10 and further comprising: a third storage means in each said storage location for storing a multibit code; and means responsive to said memory for inhibiting the generation of longitudinal check characters for storage in the second storage means of any storage location wherein the corresponding multibit code does not have a predetermined value.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1980-04-04 | 1980-10-04 | 1981-04-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1984-04-04 | 1984-10-04 | 1985-04-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1988-04-04 | 1988-10-04 | 1989-04-05 | $7700.00 | Window Closed / Lapsed |