Patent US5282205A successfully refreshed from Google Patents.
US5282205A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data communication terminal providing variable length message carry-on and method therefor
Assignee: Motorola Mobility LLC
•
Filing: 1992-05-29
•
Granted: 1994-01-25
•
Expires: 2012-05-29
Abstract
Abstract A data communication terminal (102) transmits messages to a plurality of data communication receivers (106), and has an input for receiving messages and assigning the same into a plurality of transmission frames which are assigned for transmission to the plurality data communication receivers. The data communication terminal (102) comprises a first memory (210) for storing the received messages, a timer (214) for generating periodic timing signals, a controller (204) responsive to the periodic timing signals, for recovering the stored messages and queueing the same into a second memory (1910) having a predetermined transmission frame queue capacity. A monitoring circuit (1902, 1908) monitors the transmission frame queue capacity of the second memory (1910), and expected transmission frame queue capacities for one or more subsequent transmission frames. The monitoring circuit (1902, 1908) determines when the messages stored within the second memory (1910) will exceed the predetermined transmission frame queue capacity, and enables the storage of the excess messages in a third memory (1912). A frame batching controller (1902) generates designating information designating one or more of the subsequent transmission frames during which the excess messages stored are to be transmitted. A transmitter (104) transmits the messages and designating information stored in the second memory (1910) within the assigned transmission frame, and transmits the excess messages stored in the third memory (1912) within the one or more of the subsequent transmission frames designated by the designating information.
Inventors
- 👤 William J. Kuznicki
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 23:04
CPC Classifications
H; H04; H04W; H04W88/00; H04W88/18; H04W88/185; H04W88/187; H04L; H04L7/00; H04L7/02; H04L7/033; H04L7/0331; H04L7/04; H04L7/041; H04W88/02; H04W88/022; H04W88/025; H04W88/026; H04L7/046
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
227 words
A data communication terminal for transmitting messages to a plurality of data communication receivers, the data communication terminal having an input for receiving messages and assigning the same into a plurality of transmission frames which are assigned for transmission to the plurality data communication receivers, said data communication terminal comprising: first memory means for storing the received messages; timing means for generating periodic timing signals; means responsive to the periodic timing signals, for recovering the stored messages and queueing the same into a second memory means having a predetermined transmission frame queue capacity; means for monitoring the transmission frame queue capacity of said second memory means, and expected transmission frame queue capacities for one or more subsequent transmission frames, said monitoring means determining when the messages stored within said second memory means will exceed the predetermined transmission frame queue capacity, and for storing the excess messages in a third memory means; means, responsive to said monitoring means, for generating designating information designating one or more of the subsequent transmission frames during which the excess messages stored are to be transmitted; and means for transmitting the messages and designating information stored in said second memory means within the assigned transmission frame, and for transmitting the excess messages stored in said third memory means within the one or more of the subsequent transmission frames designated by the designating information.
Claim 2
Dependent Claim
227 words
A data communication terminal for transmitting messages to a plurality of data communication receivers, the data communication terminal having an input for receiving messages and assigning the same into a plurality of transmission frames which are assigned for transmission to the plurality data communication receivers, said data communication terminal comprising: first memory means for storing the received messages; timing means for generating periodic timing signals; means responsive to the periodic timing signals, for recovering the stored messages and queueing the same into a second memory means having a predetermined transmission frame queue capacity; means for monitoring the transmission frame queue capacity of said second memory means, and expected transmission frame queue capacities for one or more subsequent transmission frames, said monitoring means determining when the messages stored within said second memory means will exceed the predetermined transmission frame queue capacity, and for storing the excess messages in a third memory means; means, responsive to said monitoring means, for generating designating information designating one or more of the subsequent transmission frames during which the excess messages stored are to be transmitted; and means for transmitting the messages and designating information stored in said second memory means within the assigned transmission frame, and for transmitting the excess messages stored in said third memory means within the one or more of the subsequent transmission frames designated by the designating information.
Claim 3
Dependent Claim
50 words
The data communication terminal according to claim 1, wherein said means for recovering and queueing comprises: controller means for controlling the recovery of the stored messages during the assigned transmission frame; decoding means for decoding the transmission frame assignment information to enable queueing the messages for the assigned transmission frame.
Claim 4
Dependent Claim
59 words
The data communication terminal according to claim 2, wherein the data communication receivers are assigned to one of a plurality of message transmission phases, and said first memory means comprises a plurality of message storage areas corresponding to the message transmission phases, wherein the messages are stored in the message storage area corresponding to the assigned message transmission phase.
Claim 5
Dependent Claim
21 words
The data communication terminal according to claim 2, wherein said first memory means is a dual-port first-in, first-out random access memory.
Claim 6
Dependent Claim
51 words
The data communication terminal according to claim 2, wherein said monitoring means comprises: first means, coupled to said controller means, for counting the messages recovered for the assigned transmission frame; and second means, coupled to said controller means, for counting the messages recovered for the one or more subsequent transmission frames.
Claim 7
Dependent Claim
24 words
The data communication terminal according to claim 5, wherein said first and second means for counting generate counts representative of the received message length.
Claim 8
Dependent Claim
42 words
The data communication terminal according to claim 6, wherein said controller means further comprises means for detecting when the first and second counts generated by said first and second counting means exceed a count corresponding to the predetermined transmission frame queue capacity.
Claim 9
Dependent Claim
30 words
The data communication terminal according to claim 1 wherein the messages stored in said third memory means are transmitted in one or more subsequent transmission frames having unused queue capacity.
Claim 10
Dependent Claim
28 words
The data communication terminal according to claim 1 wherein the messages stored in said third memory means are transmitted in a selected one of the subsequent transmission frames.
Claim 11
Dependent Claim
21 words
The data communication terminal according to claim 1 wherein said second memory means is a partition of said first memory means.
Claim 12
Dependent Claim
21 words
The data communication terminal according to claim 1 wherein said third memory means is a partition of said second memory means.
Claim 13
Independent Claim
203 words
A method for queueing messages for transmission in a data communication terminal having an input for receiving messages and for assigning the same into a plurality of transmission frames assigned for transmission to a plurality of data communication receivers, said method comprising the steps of: storing the received messages in a first memory area; generating periodic timing signals; recovering the stored messages from the first memory in response to the periodic timing signals being generated; queueing the recovered messages for the assigned transmission frame into a second memory area having a predetermined queue capacity; monitoring the second memory queue capacity, and expected queue capacities for one or more subsequent transmission frames; determining when the messages stored within the second memory area exceed the predetermined queue capacity; storing the excess messages recovered in a third memory area; generating designating information designating one or more subsequent transmission frames during which the excess messages stored in the third memory area are to be transmitted; and transmitting the messages and designating information stored in the second memory area within the assigned transmission frame; and transmitting the excess messages stored in the third memory area within the one or more subsequent transmission frames designated by the designating information.
Claim 14
Independent Claim
203 words
A method for queueing messages for transmission in a data communication terminal having an input for receiving messages and for assigning the same into a plurality of transmission frames assigned for transmission to a plurality of data communication receivers, said method comprising the steps of: storing the received messages in a first memory area; generating periodic timing signals; recovering the stored messages from the first memory in response to the periodic timing signals being generated; queueing the recovered messages for the assigned transmission frame into a second memory area having a predetermined queue capacity; monitoring the second memory queue capacity, and expected queue capacities for one or more subsequent transmission frames; determining when the messages stored within the second memory area exceed the predetermined queue capacity; storing the excess messages recovered in a third memory area; generating designating information designating one or more subsequent transmission frames during which the excess messages stored in the third memory area are to be transmitted; and transmitting the messages and designating information stored in the second memory area within the assigned transmission frame; and transmitting the excess messages stored in the third memory area within the one or more subsequent transmission frames designated by the designating information.
Claim 15
Dependent Claim
33 words
The method for queueing messages according to claim 12, further comprising the step of decoding the transmission frame assignment information enables queueing the messages in the second memory for the assigned transmission frame.
Claim 16
Dependent Claim
34 words
The method for queueing messages according to claim 13, wherein the step of decoding the transmission frame assignment information further enables monitoring the expected queue capacities in the one or more subsequent transmission frames.
Claim 17
Dependent Claim
63 words
The method for queueing messages according to claim 12, wherein the data communication receivers are assigned to one of a plurality of message transmission phases, and first memory comprises a plurality of message storage areas representing message transmission phases, and wherein said method further comprises the step of storing the messages into the message storage area corresponding to the assigned message transmission phase.
Claim 18
Dependent Claim
52 words
The method for queueing messages according to claim 12, wherein said step of monitoring comprises the steps of: generating a first count of the messages recovered for transmission in the assigned transmission frame; and generating a second count of the messages recovered for transmission in the one or more subsequent transmission frames.
Claim 19
Dependent Claim
33 words
The method for queueing messages according to claim 16, further comprising the steps of: detecting when the first and second counts generated exceed a count corresponding to the predetermined transmission frame queue capacity.
Claim 20
Dependent Claim
36 words
The method for queueing messages according to claim 12, wherein said step of transmitting the messages stored in the third memory area, transmits the messages in one or more subsequent transmission frames having unused queue capacity.
Claim 21
Dependent Claim
34 words
The method for queueing messages according to claim 12, wherein said step of transmitting the messages stored in the third memory area, transmits the messages in a selected one of the subsequent transmission frames.
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) | 1997-01-24 | 1997-07-26 | 1998-01-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-01-24 | 2001-07-26 | 2002-01-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-01-24 | 2005-07-26 | 2006-01-25 | $7700.00 | Window Closed / Lapsed |