Motorola Corporation

Other

Michael P Nolan

Dale Robert Buchholz

Hungkun J Chang

Thomas A Freeburg

William K Doss

Richard E White

Brian J Wesselman

Paul Odlyzko

Alan D Muehlfeld

John M Kaczmarczyk

Lisa B Johanson

John E Shaver

James D McGrath

John W McKown

Dana M Sheahen

Charles D Macenski

Kevin P Hardin

Farzad Farhangnia

Mark Taylor

Jeffrey W Manning

John T Morrisey

Gerald M Hira

Pamela L Wilson

William Kevin Doss

John Mckown

A refillable dispenser including a casing and a platform for receiving consumable material. A knob rotatably mounted at a bottom end of the dispenser is mechanically coupled to the platform such that rotating the knob moves the platform up or down within the dispenser. Gripping arms connected to the platform are configured to flex toward a longitudinal axis and engage the consumable material when the platform is away from a top travel position such that the consumable material is secured to the platform. The gripping arms are configured to flex away from the longitudinal axis and release the consumable material from the platform when the platform is at the top travel position.

Dispenser with replaceable material

In a wireless TDMA network a control module (CM) sends a time stamp relative to the beginning of its frame in a synchronization packet allowing each of a plurality of user modules (UM) to maintain synchronization relative to the CM. The CM uses a plurality of directional antennas and transmits the synchronization packets over each antenna over a predetermined number of frames. The UMs use a receive time stamp to identify the beginning of a received synchronization packet. The difference between the time stamps combined with a delay constant is used by the UMs to adjust time synchronization to the CM frame.

Synchronization method and apparatus for a wireless packet network

A hierarchical addressing technique is employed in a packet communications system to enhance flexibility in storing and referencing packet information. This method permits packet message data and certain packet control data to be stored in memory locations without having to be duplicated at a different memory location prior to transmission of the packet. This method is preferably employed in a ring configuration in which a series of packets have addressing mechanisms which points sequentially to each other to form a ring of packets received or to be transmitted.

Addressing technique for storing and referencing packet data

A method for handing off user devices (131-134) between network control processors (110, 120) in a frequency hopping communication system (100) includes establishing a set of synchronization frequencies (A-D) for use by said NCPs (110, 120), informing the plurality of user devices (131-134) of said synchronization frequencies (A-D) and assigning a synchronization frequency (A, B, C or D) to each respective NCP, each NCP transmitting synchronization information at its assigned synchronization frequency (A, B, C or D) during each hopping dwell (1-82). Upon a determination that a user device hand-off is necessary, said user device in question (133) tunes to a synchronization frequency (B) different from the synchronization frequency (A) employed by the currently serving NCP (110) and synchronizes its operation to the NCP (120) transmitting synchronization information on the tuned to synchronization frequency (B).

Method for providing hand-offs in a frequency hopping communication

A CM (105) receives requests for data transfer from a series of UMs (101-103) and from an EM (104). The requests contain the UM (101-103) or EM (104) address and the size of the data packet to be transferred. The CM (105) processes the requests on a FIFO basis, stores the requests in a queue and schedules either a small data channel (415) or a large data channel (420), depending on the packet size to be transferred, an acknowledgement channel (425) and also the corresponding number of required timeslots. The CM (105) picks the first request off the queue and sends a grant to the particular UM (101-103) or EM (104) which receive the grant and immediately access either the assigned small or large data channels (415, 420) in the required number of timeslots and the acknowledgement channel (425).

Scheduling in a communication system

An antenna selection technique is used in an RF communincation system in which user modules (UM) communicate with at least one node. The UM's and nodes each have multiple antennae. The combination of each UM and node antenna is evaluated at the UM. Based on at least signal quality, the UM selects its antenna and the best node antenna for use. An alternate antenna is selected if a person is determined to be present in a predetermined area adjacent a UM corresponding to a predetermined RF power level.

Antenna pattern selection for optimized communications and avoidance of

An antenna selection technique is used in an RF communication system in which user modules (UM) communicate with at least one node. The UM's and nodes each have multiple antennae. The combination of each UM and node antenna is evaluated at the UM. Based on both signal quality and strength, the UM selects its antenna and the best node antenna for use.

Antenna pattern selection for optimized communications

Disclosed is a microprocessor operating system having a program which includes a plurality of tasks requiring periodic execution by the system, and wherein each task is comprised of a plurality of associated subtasks. The system executes the tasks in a orderly fashion by: (A) providing a time variable which is periodically updated to represent a measurement of time; (B) setting the time variable to a predetermined time period during which a first task may be executed; (C) determining whether or not the predetermined time period has lapsed; (D) executing at least one of the subtasks of the first task if the predetermined time period has not lapsed, and then proceeding to step c; and (e) executing another portion of program if the predetermined time period has lapsed, and then proceeding to step c before executing another subtask associated with the first task. When a task having a higher priority than the first task requires execution, the subtask being executing is completed and the higher priority task is executed. Once the first task is returned to for execution, the next subtask is executed. The procedure continually executes all the subtasks associated with the first task.

Microprocessor operating system for sequentially executing subtasks

A system (10) for scheduling serial message transmission on a single bus (11) having a plurality of messages to be sent stored in memory (21) with each message located between associated start and end message addresses (START, END). A message list or queue (28) of the messages to be sent is formed and stored in memory (22) wherein the list comprises message pointer blocks (27) associated with each of the messages. Each pointer block includes at least the message start and end addresses, the message unique ID code (MID), the message priority (PRI), the address of the message pointer block associated with the next message to be sent (NEXT) and the address of the message pointer block associated with the previous message to be sent (PREV). A message transmission apparatus (16, 17, 18, 19) then sequentially serially transmits the messages on the bus in accordance with the message transmission order specified in the message list. New messages are scheduled for transmission by appropriately linking a new message pointer block to the lift, and previously sent messages are rescheduled for retransmission by delinking the previous message pointer block and relinking it further down the list. The system eliminates the need for storing sent messages in buffer memory in the event a message is improperly sent and must be resent, and no movement of actual messages in memory is required to alter the message transmission sequence since this is accomplished by just appropriately relinking message pointer blocks in the list.

System for scheduling serial message transmission on a bus which is

Growing community of inventors

Lake Zurich, IL, United States of America

Michael P Nolan