US4291196A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Circuit for handling conversation data in a distributed processing telex exchange
Assignee: Plantronics Futurecomms Inc
•
Filing: 1979-11-06
•
Granted: 1981-09-22
•
Expires: 1999-11-06
Abstract
Abstract A circuit for the systematic handling of conversation data from a calling party to a called party for use in a distributed processing telex exchange is disclosed. The customer terminations connected to the exchange are divided into a predetermined number of groups of terminations having a predetermined number of terminations in each group. Associated with each group of terminations is a frame memory which has memory capacity for storing a single bit of conversation data from every termination connected to the exchange. Associated with each frame memory is a vector memory which has a memory location associated with each termination in a group. Each vector memory location contains a frame memory address that addresses the location in frame memory containing the conversation data to be forwarded down to the termination associated with the current vector memory address. In addition, each vector memory location contains an active bit which is included with the conversation data forwarded to the called party termination to indicate that a call is in progress for that termination.
Inventors
- 👤 John W. Spaniol
- 👤 John J. Bowerman
- 👤 Marvin Perlman
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 20:31
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/50
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
189 words
For use in a distributed procesing telex exchange in which the customer terminations connected to the exchange are divided into a predetermined number of groups having a predetermined number of terminations in each group and where each call to or from each termination involves the handling or serialized conversation data bits, a circuit for enabling the systematic handling of the conversation data from a calling party to a called party comprising: (a) a plurality of frame memories, each memory having an addressable memory location associated with each termination connected to the exchange, for temporarily storing the conversation data generated by every termination connected to the exchange; and (b) a plurality of vector memories, one vector memory from said plurality of vector memories associated with a corresponding frame memory from said plurality of said frame memories, each said vector memory having addressable memory locations associated with each of the predetermined number of terminations in a group, for storing in each vector memory location the address within its associated frame memory of the conversation data to be forwarded to the termination within the group that corresponds to the vector memory address.
Claim 2
Dependent Claim
189 words
For use in a distributed procesing telex exchange in which the customer terminations connected to the exchange are divided into a predetermined number of groups having a predetermined number of terminations in each group and where each call to or from each termination involves the handling or serialized conversation data bits, a circuit for enabling the systematic handling of the conversation data from a calling party to a called party comprising: (a) a plurality of frame memories, each memory having an addressable memory location associated with each termination connected to the exchange, for temporarily storing the conversation data generated by every termination connected to the exchange; and (b) a plurality of vector memories, one vector memory from said plurality of vector memories associated with a corresponding frame memory from said plurality of said frame memories, each said vector memory having addressable memory locations associated with each of the predetermined number of terminations in a group, for storing in each vector memory location the address within its associated frame memory of the conversation data to be forwarded to the termination within the group that corresponds to the vector memory address.
Claim 3
Dependent Claim
103 words
The circuit according to claim 1 wherein each said vector memory comprises: (a) a right vector memory for storing the frame memory address containing the conversation data to be forwarded to the terminations corresponding to the vector memory addresses; and (b) a left vector memory for storing a duplicate copy of the data stored in said right vector memory, the data stored in said left vector memory addressed in synchronization with said right vector memory, the data outputted by said left vector memory compared with the data outputted by said right vector memory, the results of the data compare functioning as error codes.
Claim 4
Dependent Claim
37 words
The circuit according to claim 1 wherein each vector memory location contains an active bit which indicates to the termination that a call is in progress for that termination and that the conversation data should be used.
Claim 5
Dependent Claim
95 words
The circuit according to claim 2 further comprising: (a) data storing means for storing in the vector memory locations the frame memory address which contains the conversation data for the termination corresponding to the vector memory address; (b) address counters for generating sequential vector memory addresses; and (c) a comparing means, for comparing the right and left vector memory addresses and for comparing the data outputted by said right and left vector memories from those addressed locations, the results of the address compare for each memory address being stored in each address as error codes.
Claim 6
Dependent Claim
120 words
The circuit of claim 4 wherein said data storing means comprises: (a) right and left source registers, for inputting to said right and left vector memories, respectively, the frame memory address of the source of conversation data to be forwarded to the termination corresponding to the vector memory address; (b) right and left destination registers for inputting to said right and left vector memories, respectively, the address in which the current contents of said right and left source registers are to be stored; and (c) a control means, for controlling said vector memory read/write cycles and for selecting between said address counters and said right and left destination registers as the address of said right and left vector memories, respectively.
Claim 7
Dependent Claim
26 words
The circuit according to claim 4 wherein said address counters comprise right and left address counters for sequentially addressing said right and left vector memories, respectively.
Claim 8
Dependent Claim
131 words
The circuit according to claim 1 wherein each said frame memory comprises: (a) an input data buffering means for receiving and buffering the conversation data received for each termination in each group of terminations connected to the exchange; (b) a plurality of memory units, each unit associated with a group of terminations connected to the exchange and responsive to said vector memory, for storing and outputting the conversation data generated by each termination in each group, the conversation data from each group of terminations stored in its associated memory unit; and (c) an output selector responsive to said vector memory, for selecting the conversation data outputted from one of said plurality of memory units as the conversation data to be forwarded to a termination under control of this said frame memory.
Claim 9
Dependent Claim
32 words
The circuit according to claim 7 wherein the output of said input data buffering means is recorded in said memory units after the contents of the currently addressed locations are read out.
Claim 10
Dependent Claim
28 words
The circuit according to claim 7 wherein each said frame memory stores both the conversation data bit and its logical inverse as the conversation data for each termination.
References Cited (Backward Citations)
US3636243A
Cited
US3924081A
Cited
US3932844A
Cited
US3812297A
Cited
US3969701A
Cited
US3882455A
Cited
US4027098A
Cited
US3974343A
Cited
US4074072A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1984-09-21 | 1985-03-23 | 1985-09-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1988-09-21 | 1989-03-23 | 1989-09-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1992-09-21 | 1993-03-23 | 1993-09-22 | $7700.00 | Window Closed / Lapsed |