Abstract: A system and method which permit the RNC to control purging of data buffered in the Node B. The RNC monitors for a triggering event, which initiates the purging process. The RNC then informs the Node B of the need to purge data by transmitting a purge command, which prompts the Node B to delete at least a portion of buffered data. The purge command can include instructions for the Node B to purge all data for a particular UE, data in one or several user priority transmission queues or in one or more logical channels in the Node B, depending upon the particular data purge triggering event realized in the RNC.

Abstract: A system and method for avoiding stall of an H-ARQ reordering buffer in a receiver is disclosed. The present invention reduces the latency of the H-ARQ reordering buffers within a receiver and uses a Last-In-First-Out (LIFO) policy for loading the transmitting H-ARQ processors. The LIFO loading policy increases the probability that the UE will be able to determine at an earlier time whether the missed TSN is due to delay in retransmission or due to the release of a transmission by the Node B by reading the new H-ARQ processor identifier (ID).

Abstract: A system and method which improve the performance of a wireless transmission system by intelligent use of the control of the flow of data between a radio network controller (RNC) and a Node B. The system monitors certain criteria and, if necessary, adaptively increases or decreases the data flow between the RNC and the Node B. This improves the performance of the transmission system by allowing retransmitted data, signaling procedures and other data to be successfully received at a faster rate, by minimizing the amount of data buffered in the Node B. Flow control is exerted to reduce buffering in the Node B upon degradation of channel qualities, and prior to a High Speed Downlink Shared Channel (HS-DSCH) handover.

Abstract: A wireless communication system is configured to monitor transmission sequence numbers (TSNs) assigned to protocol data units (PDUs) processed by the system. The system includes at least one user equipment (UE) having, a queue, and a Node B in communication with the UE. The UE determines that a data block having an expected TSN was not received, and generates a TSN status report message. The Node B retransmits a data block including the expected TSN to the UE in response to the TSN status report message. The retransmitted data block is placed in a specific location in the queue designated by the TSN status report message.

Abstract: A system and method for avoiding stall of an H-ARQ reordering buffer in a receiver is disclosed. The present invention reduces the latency of the H-ARQ reordering buffers within a receiver and uses a Last-In-First-Out (LIFO) policy for loading the transmitting H-ARQ processors. The LIFO loading policy increases the probability that the UE will be able to determine at an earlier time whether the missed TSN is due to delay in retransmission or due to the release of a transmission by the Node B by reading the new H-ARQ processor identifier (ID).

Abstract: A wireless communication method system for detecting and correcting transmission errors. The system includes at least one Wireless Transmit/Receive Unit (WTRU) in communication with a Node B. The Node B sends a transmission signal (e.g., containing a protocol data unit (PDU)) to the WTRU. The WTRU generates a Revert Message having a first field and a second field to indicate whether the transmission signal was successfully received at the WTRU. The WTRU inserts a NACK or ACK message into the first field and inserts a respective channel quality identifier (CQI) value corresponding to a worst or best possible value of CQI into the second field. The WTRU transmits the Revert Message to the Node B. The Node B compares the contents of the first field to the contents of the second field. The Node B resends the transmission signal to the WTRU if the contents of the first and second fields are not logically consistent.

Abstract: The present invention relates to efficient recovery of High Speed Downlink Packet Access (HSDPA) data following handover. The present invention discloses a method and system for the UE to perform a serial of actions in order to reduce the latency and potentially prevent loss of PDU transmission during the serving HS-DSCH cell change procedure. A new criterion is introduced for UE generation of the status report of RLC PDU. The UE generates status report of the PDUs as soon as possible following notification of the HS-DSCH cell change indicated by the RRC procedure to more efficiently recover source Node B buffered data. PDU status may be signaled for each AM RLC instance associated with the HS-DSCH transport channel. Furthermore, upon Inter Node B serving HS-DSCH cell change the SRNC may wait for PDU status report before initiating transmission of new data in target cell.

Abstract: The present invention provides for a Time Division Duplex - Radio Local Area Network (TDD-RLAN) which includes a Radio Access Network Internet Protocol (RAN IP) gateway that enables connectivity to the public Internet. The system may serve as a stand-alone system or be incorporated into a UMTS used with conventional Core Network, particularly for tracking and implementing AAA functions in the Core Network.

Abstract: The present invention provides for a Time Division Duplex - Radio Local Area Network (TDD-RLAN) which includes a Radio Access Network Internet Protocol (RAN IP) gateway that enables connectivity to the public Internet. The system may serve as a stand-alone system or be incorporated into a UMTS used with conventional Core Network, particularly for tracking and implementing AAA functions in the Core Network.

Abstract: A user equipment (UE) for multiplexed scheduling of information blocks from multiple sources on a single communication channel divided into multiple address positions. The information block from each source has a repetition period and is divided into a number of segments. The UE includes determining the total number of positions on the channel to be scheduled; mapping positions in a non-sequential order corresponding to nodes in a binary tree, whereby each layer of the binary tree corresponds to a repetition period; ordering the blocks by repetition period, starting with the smallest repetition period; assigning information segments of each block to unassigned positions; and marking as assigned all child nodes of the assigned position node in the layer corresponding to the repetition period.

Abstract: A method for processing a received communication which includes periodic transmissions of a set of information segments. A first transmission of the set of information segments is received and processed to identify each of the segments as valid or invalid. The valid segments of the first set are then stored. Where all segments of the set are not stored, subsequent transmissions of the set of information segments are received and only those segments not previously stored are processed to identify each such segment as valid or invalid. The valid segments so identified are then stored. Subsequent transmissions are repeatedly received unless all segments of the set have been stored.

Abstract: A method for multiplexed scheduling of information blocks from multiple sources on a single communication channel divided into multiple address positions. The information block from each source has a repetition period and is divided into a number of segments. The method includes determining the total number of positions on the channel to be scheduled; mapping positions in a non-sequential order corresponding to nodes in a binary tree, whereby each layer of the binary tree corresponds to a repetition period; ordering the blocks by repetition period, starting with the smallest repetition period; assigning information segments of each block to unassigned positions, and marking as assigned all child nodes of the assigned position node in the layer corresponding to the repetition period.