Patent classifications
H04L5/02
Zero-collapsing compression with random access
A data compressor a zero-value remover, a zero bit mask generator, a non-zero values packer, and a row-pointer generator. The zero-value remover receives 2.sup.N bit streams of values and outputs 2.sup.N non-zero-value bit streams having zero values removed from each respective bit stream. The zero bit mask generator receives the 2.sup.N bit streams of values and generates a zero bit mask for a predetermined number of values of each bit stream in which each zero bit mask indicates a location of a zero value in the predetermined number of values corresponding to the zero bit mask. The non-zero values packer receives the 2.sup.N non-zero-value bit streams and forms a group of packed non-zero values. The row-pointer generator that generates a row-pointer for each group of packed non-zero values.
COMPUTER-GENERATED SEQUENCE DESIGN FOR BINARY PHASE SHIFT KEYING MODULATION DATA
Methods, systems, and devices for wireless communications are described. A device (e.g., a base station or a user equipment (UE)) may identify a sequence length corresponding to a number of resource blocks, and select a modulation scheme based on the sequence length. The device may select, from a set of sequences associated with the modulation scheme, a sequence having the sequence length. In some examples, the set of sequences may include at least one of a set of time domain phase shift keying computer-generated sequences or a set of frequency domain phase shift keying computer-generated sequences. The device may generate a reference signal for a data transmission based on the sequence and transmit the reference signal within the number of resource blocks.
Scheduling data transmissions between a mobile terminal and a base station in a wireless communications network using component carriers
A method of scheduling wireless data transmissions between a mobile terminal (701) and a base station using multiple component carrier signals is disclosed. The method comprises the steps of: receiving in the mobile terminal information from the base station indicating available component carriers; detecting in the mobile terminal at least one dynamic parameter indicative of the mobile terminal's current ability to handle component carriers having non-contiguous bandwidths; determining in the mobile terminal in dependence of the at least one dynamic parameter which of the available component carriers to utilize; and transmitting from the mobile terminal to the base station information indicating the component carriers determined to utilize. By doing this the mobile terminal may choose to limit the number of component carriers used in situations where it is disadvantageous, such as situations where the power consumption of supporting multiple component carriers is high or situations where complex hardware is needed.
Methods and systems for adaptive content delivery
Devices, systems and methods are provided for delivering media content from different types of content sources to different destination devices across an outdoor/indoor interface using an outdoor hub device. An exemplary hub device includes a first input interface to receive a broadcast signal, a second input interface to receive a telecommunications signal from a telecommunications network, and an output interface. The device further includes a content stream management module coupled to the first input interface and the second input interface to multiplex broadcast and telecommunications content into a multiplexed content stream, an encapsulation module coupled to the content stream management module to encapsulate the multiplexed content stream into a packetized multiplexed content stream, and a communications interface coupled to the encapsulation module and the output interface to transmit the packetized multiplexed content stream to an indoor gateway device via the output interface.
DESIGN OF SYMBOL-GROUP BASED SPREADING SCHEMES
Methods, systems, and devices for the design of symbol-group based spreading schemes are described. An exemplary method for wireless communication includes transmitting, by a terminal, a first spread signal that is generated by spreading a first group of N data symbols using a first set of N sequences, where N is a symbol-group length, L is a spreading length, each of the first set of N sequences is from an orthogonal spreading sequence set that comprises L sequences, and each of the L sequences is of length L. Another exemplary method for wireless communication includes transmitting, by a network node, an indication of a first set of N sequences, and receiving a first spread signal comprising a group of N data symbols spread using the first set of N sequences.
Error control method, medium access control (MAC) frame designing method, and terminal registration method in wireless communication system and recording medium
The MAC frame in a wireless communication system includes a terminal ID allocated to each of multiple terminals. At least one connection ID is allocated to each terminal having the terminal ID, and sub-carrier allocation information is allocated to each connection having the connection ID. The sub-carrier allocation information includes a sub-carrier allocation status for each sub-carrier, and the number of allocated information bits for each sub-carrier. The sub-carrier allocation status and the number of allocated information bits for each sub-carrier can be allocated, by sub-carriers, to the sub-carrier allocation information using a same number of bits; or the information on the sub-carrier allocation status is first allocated to the sub-carrier allocation information and the number of allocated information bits for each sub-carrier is allocated.
Methods and nodes for handling updated subscriber data
The embodiments herein relate to a method in a first mobility management node (108a) for handling updated subscriber data associated with a UE (101). The UE (101) is currently unreachable by the first mobility management node (108a). The first mobility management node (108a) receives, from a subscriber database (128), updated subscriber data associated with the UE (101). At least part of the updated subscriber data is modified. The first mobility management node (108a) determines that transmission of the updated subscriber data to a gateway node (110) should be postponed until the UE (101) has become reachable.
Methods and nodes for handling updated subscriber data
The embodiments herein relate to a method in a first mobility management node (108a) for handling updated subscriber data associated with a UE (101). The UE (101) is currently unreachable by the first mobility management node (108a). The first mobility management node (108a) receives, from a subscriber database (128), updated subscriber data associated with the UE (101). At least part of the updated subscriber data is modified. The first mobility management node (108a) determines that transmission of the updated subscriber data to a gateway node (110) should be postponed until the UE (101) has become reachable.
Multiplexing downlink control information of same aggregation level by coding together
Certain aspects of the present disclosure relate to a technique for multiplexing downlink control information (DCI) signals for multiple user equipments (UEs) at an aggregation level (AL) by coding the DCI signals together in a control channel and transmitting the control channel. In an exemplary method, a BS multiplexes a first plurality of downlink control information (DCI) signals for a first plurality of user equipments (UEs) at a first aggregation level (AL) coded together in a first control channel and transmits the control channel.
MIXED-PRECISION COMPRESSION WITH RANDOM ACCESS
A data compressor includes a zero-value remover, a zero bit mask generator and a non-zero values packer. The zero-value remover receives 2.sup.N bit streams of values and outputs 2.sup.N non-zero-value bit streams having zero values removed from each respective bit stream based on a selected granularity of compression for values contained in the bit streams. The zero bit mask generator receives the 2.sup.N bit streams of values and generates a zero bit mask corresponding to the selected granularity of compression. Each zero bit mask indicates a location of a zero value based on the selected granularity of compression. The non-zero values packer receives the 2.sup.N non-zero-value bit streams and forms at least one first group of packed non-zero values.