Patent application number | Description | Published |
20090267812 | Method for encoding a sequence of integers, storage device and signal carrying an encoded integer sequence and method for decoding a sequence of integers - The invention is related to a method for encoding a sequence of integers, to a storage device and to a signal carrying such encoded sequence and to a method for decoding such encoded sequence. | 10-29-2009 |
20100194610 | Method and device for encoding a bit sequence - The invention is related to a method and a device for encoding of a bit sequence. | 08-05-2010 |
20110134995 | VIDEO CODING WITH CODING OF THE LOCATIONS OF SIGNIFICANT COEFFICIENTS IN A BLOCK OF COEFFICIENTS - In known image compression, following quantisation, a very sparse distribution of significant (i.e. non-zero) amplitude coefficients of the transformed image signal may be obtained while most quantised coefficients are zeros. A costly task for a transform-based image compression in terms of resulting overall data rate is to record the locations of such significant coefficients within the coding blocks. In quartation processing, a ‘significant square’ (containing at least one non-zero amplitude coefficient in the coefficient block) is recursively divided into four smaller squares until single significant coefficients are reached, and the significance statuses of all generated squares are encoded. However, for some distribution patterns encoding the x-y-coordinates of the significant coefficients as binary numbers will lead to less coding cost. According to the invention, at least four different pattern determination or encoding modes are checked, and the encoding side selects the least costly one of these modes and transfers the corresponding mode information to the decoding side for corresponding decoding. | 06-09-2011 |
20110158323 | METHOD FOR LOSSLESS COMPRESSING PREFIX-SUFFIX-CODES, METHOD FOR DECOMPRESSING A BIT SEQUENCE REPRESENTING INTEGERS OR SYMBOLS ENCODED IN COMPRESSED PREFIX-SUFFIX-CODES AND STORAGE MEDIUM OR SIGNAL CARRYING COMPRESSED PREFIX-SUFFIX-CODES - The invention is related to lossless compression of prefix-suffix-codes wherein a prefix comprises unary code, and to corresponding decompression. The method for lossless compressing prefix-suffix-codes comprises the steps of forming a first contiguous bit sequence from the prefixes, and lossless compressing the first contiguous bit sequence by removing redundancy related to the difference between the first value's frequency in the first contiguous bit sequence and the second value's frequency in the first contiguous bit sequence. Bit values are unevenly distributed in the prefixes while distribution of bit values in the suffixes is more even. Therefore, better compression is achievable if the prefixes are compressed separately. | 06-30-2011 |
20110285708 | METHOD AND APPARATUS FOR ENCODING 3D MESH MODELS, AND METHOD AND APPARATUS FOR DECODING ENCODED 3D MESH MODELS - 3D mesh models are widely used in various applications for representing 3D objects. These models are made of vertices and corresponding triangles, which can be compressed based on prediction and residuals. The present invention improves the accuracy of parallelogram prediction, particularly near sharp features. The proposed 3D mesh model encoding comprises analyzing the spatial or dihedral angles between triangles, clustering triangles with similar or equal dihedral angles, and defining a representative dihedral angle for each cluster. Triangles of each cluster are then encoded relative to individual prediction triangles having the representative dihedral angle according to the cluster. Additionally, the prediction triangle may be mirrored. An indication of the encoding mode is inserted into each vertex of the encoded bitstream. A decoder extracts the encoding mode indication, reconstructs the individual prediction triangles based on the respective representative dihedral angles and performs triangle prediction and reconstruction. | 11-24-2011 |
20120013491 | METHOD AND DEVICE FOR ENCODING AN INPUT BIT SEQUENCE AND CORRESPONDING DECODING METHOD AND DEVICE - The invention is made in the technical field of encoding and decoding of bit sequences. The invention proposes a device for compression-encoding an input bit sequence in which Zeroes and Ones occur equally frequent, comprising an XOR gate adapted for receiving pairs of immediately succeeding bits of the input bit sequence as inputs and for outputting further bits of another bit sequence, means for adding a bit to said other bit sequence wherein the added bit is a primary bit which is equal to a primary bit of the input bit sequence or a last bit which is equal to a last bit of the input bit sequence, and means for encoding the other sequence. The XOR gate transforms the input bit sequence into the other bit sequence which comprises more uneven frequencies of occurrence of Zeroes and Ones than the input bit sequence. | 01-19-2012 |
20120019403 | METHOD AND DEVICE FOR ENCODING AND DECODING OF SYMBOL SEQUENCES WHEREIN EACH SYMBOL MAY HAVE ONE OUT OF THREE OR MORE POSSIBLE SYMBOL VALUES - A method for compressing a symbol sequence, wherein each symbol may have one out of three or more possible symbol values, said method comprises the steps of modifying the symbol sequence by replacing each run pair, which contains a first run of symbols of a most frequent symbol value and a second run of symbols of a second most frequent symbol value, by a further symbol value not comprised in the three or more possible symbol values, generating a binary sequence comprising all replaced run pairs and compression encoding the binary sequence and the modified symbol sequence. | 01-26-2012 |
20120075302 | METHOD FOR ENCODING/DECODING A 3D MESH MODEL THAT COMPRISES ONE OR MORE COMPONENTS - 3D mesh models are represented by three types of data: connectivity data, geometry data and property data. The surface of a 3D object is a triangle mesh. 3D meshes contain huge amounts of data that need to be compressed efficiently. Additionally to the common world coordinate system for the complete model and local coordinate system for a single triangle, an individual component coordinate system for each connected component is used. The component coordinate system is used to normalize the orientation of the respective component for quantization and de-quantization. This improves the accuracy of encoded 3D mesh models after quantization/de-quantization, particularly if a 3D mesh model comprises one or more distinct components. | 03-29-2012 |
20120242679 | RENDERING METHOD - As to enhance the rendering while minimizing needed computation time, the method comprises the steps of determining noise information, said noise information being representative of noise level estimated for at least a part of said image; the noise information being determined for the achromatic component of the image; sampling said part of the image according to said noise information; and rendering said at least a part of the image according to said sampling. | 09-27-2012 |
20130039594 | METHOD AND DEVICE FOR ENCODING DATA FOR RENDERING AT LEAST ONE IMAGE USING COMPUTER GRAPHICS AND CORRESPONDING METHOD AND DEVICE FOR DECODING - The invention is made in the field of image codec products. More precisely, the invention relates to encoding and decoding of data for image rendering using computer graphics. A method for decoding data for rendering at least one image using computer graphics is proposed, said method comprising decoding a portion of a bit stream, said portion comprising a syntax element and at least one parameter for a parameter based procedural computer graphics generation method for generating said computer graphics, said syntax element indicating that said portion further comprises said at least one parameter. Further, an apparatus for performing said method is proposed. | 02-14-2013 |
20130182960 | METHOD AND APPARATUS FOR ENCODING GEOMETRY PATTERNS, AND METHOD FOR APPARATUS FOR DECODING GEOMETRY PATTERNS - 3D models often have a large number of small to medium sized connected components, with small numbers of large triangles, often with arbitrary connectivity. The efficiency of compact representation of large multi-component 3D models can be improved by detecting and representing similarities between components thereof, even if the components are not exactly equal. The invention uses displacement maps for encoding two or more different but similar geometry patterns differentially, based on clustering and a cluster representative surface. A method for encoding a plurality of geometry patterns comprises detecting and encoding identical copies of geometrical patterns, detecting and clustering similar geometry patterns, and detecting partial similarity. The detecting partial similarity comprises generating a cluster representative surface, generating for at least one clustered geometry pattern a displacement map, and encoding the common surface and the displacement maps. | 07-18-2013 |
20130235047 | METHOD FOR ANIMATING CHARACTERS, WITH COLLISION AVOIDANCE BASED ON TRACING INFORMATION - A method for determining a moving direction or moving velocity for a character in a group comprises reading tracing information from a cell in a terrain map on which the character is located, determining if collision avoidance is needed, and if a collision avoiding manoeuvre is necessary then updating the tracing information in the current terrain cell. | 09-12-2013 |
20130265304 | 3D MESH MODEL AND METHOD FOR CREATING THE 3D MESH MODEL - For improving the compression efficiency of 3D model processing, easier discovering of repetitive patterns is required. The invention enables simplified and improved compression of 3D models by using a pattern-instance record table, which provides the pattern-instance relationship for all instances of repetitive patterns within a 3D object. A 3D mesh model comprises data of a first reference 3D mesh model, an electronic pattern-instance record table comprising first and second instance data, wherein the first instance data points to the first reference 3D mesh model and the second instance data points to the first or a further reference 3D mesh model, and an instance record for third instance data of at least one secondary 3D mesh model instance, wherein the third instance data comprise said first and second instance data or references to said first and second instance data. | 10-10-2013 |
20130300751 | METHOD FOR GENERATING MOTION SYNTHESIS DATA AND DEVICE FOR GENERATING MOTION SYNTHESIS DATA - A method for generating motion synthesis data from two recorded motion clips comprises transforming the motion frames to standard coordinates, separating HF motion data of the motion frames from LF motion data, determining from different motion clips at least two motion frames whose frame distance is below a threshold, and defining a transition point between the at least two motion frames, interpolating motion data between said determined motion frames separately for HF and LF motion data, and generating a motion path from three segments: one segment is transformed motion data from a first motion clip up to the transition point, one segment is the interpolated motion data, and one segment is transformed motion data from a second motion clip, starting from the transition point. | 11-14-2013 |
Patent application number | Description | Published |
20090328007 | MEMORY LEAK DIAGNOSIS - A method and an apparatus for diagnosing memory leak. The method includes: tracing the allocation of objects; recording allocation paths and allocation time of each object; giving to each object one unique identifier (ID) corresponding to an allocation path; determining the allocation path to which each object belongs; organizing the objects which are allocated but still not collected, and counting the age generations of the objects of the similar type according to the allocation time of each object; ranking the allocation paths according to the age generations of the surviving objects; and analyzing the ranking of the allocation paths, in which the allocation path with higher rank is more probable to introduce memory leaks. Thus, the suspicious allocation path possibly incurring memory leaks is selected and reported to the user for analysis. | 12-31-2009 |
20100186001 | METHOD AND APPARATUS FOR NATIVE METHOD CALLS - A method and apparatus for a native method call. The method comprises: generating, in response to a native method call-associated event, a template copy from a generic template for processing the native method call; filling information required for processing the native method call in corresponding locations in the template copy; and changing a code execution flow to execute the template copy. When a native method is called, the native method is processed by dynamically inserting the template copy in the execution path at the assembly level. | 07-22-2010 |
20100223306 | METHOD AND APPARATUS FOR DISCOVERING APPLICATION CONFIGURATION FILES IN A SYSTEM - A method and apparatus for discovering application configuration files in a system. The method includes the steps of: obtaining a process identifier of an application in concern; comparing the obtained process identifier with a process identifier of a process for operating configuration files in the system; and determining configuration files to be the configuration files of the application in concern if the obtained process identifier is identical to the process identifier of a process for operating the configuration files in the system. Application configuration files can be automatically discovered and thereby monitored, such that the change of the application configuration files can be effectively and accurately detected, so as to facilitate a user to perform various subsequent operations. | 09-02-2010 |
20110071793 | METHOD TO COMPUTE WAIT TIME - A requesting critical wait time of a given resource may be determined The requesting critical wait time is the time spent by the one or more resources waiting for the given resource, wherein at least one of the resources waiting for the given resource can proceed if access to the given resource is granted. A requested by critical wait time for a resource is determined, the requested by critical wait time being time spent by the resource for waiting solely for the given resource, wherein if the resource were granted access to the given resource, the resource can proceed without further waiting. | 03-24-2011 |
20110258608 | METHOD AND APPARATUS TO LOCATE BOTTLENECK OF JAVA PROGRAM - A method and an apparatus to locate a bottleneck of a Java program. The method to locate a bottleneck of a Java program includes the steps of: creating a helper thread in a Java process corresponding to the Java program, and attaching the helper thread to a Java virtual machine (JVM) created in the Java process; inserting a prober into an operating system kernel; monitoring states in the operating system kernel of Java threads in the Java process and sending a signal to the helper thread in response to detect that a Java thread is blocked; and retrieving call stack information from the JVM in response to receive the signal from the operating system kernel and locating the position in source code of the Java program that causes the block using the retrieved call stack information. | 10-20-2011 |
20120221671 | Controlling Shared Memory - In view of the characteristics of distributed applications, the present invention proposes a technical solution for applying a shared memory on an NIC comprising: a shared memory configured to provide shared storage space for a task of a distributed application, and a microcontroller. Furthermore, the present invention provides a computer device that includes the above-mentioned NIC, a method for controlling a read/write operation on a shared memory of a NIC, and a method for invoking the NIC. The use of the technical solution provided in the present invention bypasses the processing of network protocol stack, avoids the time delay introduced by the network protocol stack. The present invention does not need to perform TCP/IP encapsulation on the data packet, thus greatly saving additional packet header and packet tail overheads generated from the TCP/IP layer data encapsulation. | 08-30-2012 |
20120324038 | Controlling Shared Memory - In view of the characteristics of distributed applications, the present invention proposes a technical solution for applying a shared memory on an NIC comprising: a shared memory configured to provide shared storage space for a task of a distributed application, and a microcontroller. Furthermore, the present invention provides a computer device that includes the above-mentioned NIC, a method for controlling a read/write operation on a shared memory of a NIC, and a method for invoking the NIC. The use of the technical solution provided in the present invention bypasses the processing of network protocol stack, avoids the time delay introduced by the network protocol stack. The present invention does not need to perform TCP/IP encapsulation on the data packet, thus greatly saving additional packet header and packet tail overheads generated from the TCP/IP layer data encapsulation. | 12-20-2012 |
20130145374 | SYNCHRONIZING JAVA RESOURCE ACCESS - A method and an apparatus for synchronizing Java resource access. The method includes configuring for a first access interface of a resource set, a first monitor, and configuring, for a second access interface of the resource set, a second monitor, configuring, for the first monitor, a first waiting queue, and the second monitor, a second waiting queue, in response to the first access interface receiving an access request for a resource from a thread, the first monitor querying whether the resource set has a resource satisfying the access request, in response to a positive querying result, the thread obtains the resource and notifies the second monitor to awake a thread in the second waiting queue, in response to a negative querying result, the first monitor puts the thread in the first waiting queue to queue up. | 06-06-2013 |
20140067842 | INFORMATION PROCESSING METHOD AND APPARATUS - The invention belongs to the field of text information processing, and discloses an information processing method including: acquiring a first text-based chat record; extracting at least two of topics contained in the first chat record; acquiring a second text-based chat record, the second chat record being associated with at least one of the extracted topics; displaying that the first chat record and the second chat record are in an association relationship. The invention also discloses an information processing apparatus. With the information processing method and apparatus disclosed by the invention, text exchange organized by topics can be realized, and efficiency of text-based communication can be improved. | 03-06-2014 |
20140122429 | DATA PROCESSING METHOD AND APPARATUS FOR DISTRIBUTED SYSTEMS - A data processing method for a distributed system, the distributed system comprising a master storage node and multiple slave storage nodes, includes: storing, responsive to a request for writing a data file, multiple replications of the data file on the multiple slave storage nodes, each of the replications being segmented into data blocks of a same size, wherein the sizes of the segmented data blocks of at least two replications are different; and storing distribution information of the multiple replications. | 05-01-2014 |
Patent application number | Description | Published |
20120246163 | HASH TABLE STORAGE AND SEARCH METHODS AND DEVICES - A hash table storage method includes: obtaining attribute information of at least two levels of hash tables; sequentially obtaining Key information from a received packet according to the attribute information of the at least two levels of hash tables; sequentially determining whether the Key information is stored in its corresponding hash table; and storing the Key information in its corresponding hash table if the Key information is not stored in its corresponding hash table. | 09-27-2012 |
20130128722 | STREAMING SERVICE LOAD SHARING METHOD, STREAMING SERVICE PROCESSING METHOD, AND CORRESPONDING DEVICE AND SYSTEM - Embodiments of the present invention disclose a streaming service load sharing method, a streaming service processing method, and a corresponding device and system. According to the embodiments of the present invention, a fixed allocation range is determined for each service node, so that when a service node fails and needs to perform smoothing of stream table items, only a fixed allocation range of the failed service node needs to be shared by other service nodes, thereby better ensuring stability of a processing range of the service node, and reducing the number of the stream table items to be smoothed. | 05-23-2013 |
20140172795 | DATA PROCESSING METHOD AND DATA PROCESSING DEVICE - Embodiments of the present invention provide a data processing method and a data processing device. If to-be-compressed data includes a data fragment that is the same as a first half of a variable block in a duplicate database and is different from a second half of the variable block, a new variable block with granularity smaller than that of the matching variable block can be generated, and the new variable block is added to the duplicate database. The granularity of the new variable block is smaller, which increases the probability of subsequent to-be-compressed data matching the updated duplicate database, thereby improving compression efficiency. | 06-19-2014 |
20150109922 | METHOD AND APPARATUS FOR BANDWIDTH ADJUSTMENT IN NETWORK VIRTUALIZATION SYSTEM - A method and apparatus for bandwidth adjustment in a network virtualization system is described herein. The network virtualization system includes a central module and m remote modules, where the m remote modules are connected to a physical interface of the central module by n PWs. The method includes: acquiring, from the m remote modules, a real-time bandwidth of each PW of the n PWs; when a sum of the acquired real-time bandwidths of the n PWs is greater than a bandwidth of the physical interface, adjusting configured bandwidths of P PWs; and separately sending values of adjusted configured bandwidths of the P PWs to the remote modules separately connected to the P PWs. | 04-23-2015 |
20150207640 | Method for Implementing Point-To-Multipoint Multicast, Network Node, and System - Embodiments of the present invention provide a method for implementing P2MP multicast, a network node, and a system. The method includes: acquiring, by a network-side leaf node, an mLDP label of a downstream user-side leaf node and FEC information from an mLDP mapping message of the downstream user-side leaf node, then sending an mLDP mapping message that includes an mLDP label and the FEC information, to an upstream network-side root node, and generating a forwarding entry; searching for or establishing an RSVP P2MP LSP, allocating a label to the FEC information, and associating a forwarding entry of each network-side leaf node with the label of the FEC information; and sending an mLDP label of the network-side root node and the FEC information to an upstream user-side leaf node, and associating the mLDP label with the RSVP P2MP LSP and the label of the FEC information. | 07-23-2015 |
Patent application number | Description | Published |
20090086837 | Interfering stream identification in wireless communication systems - An exemplary embodiment in accordance with this invention is a method for determining the number of interfering streams. The method includes calculating statistical information based on one or more received OFDM signals. The number of interfering streams is estimated from the statistical information in this method. The OFDM signal(s) are received via a plurality of antennas. Storing the OFDM signal(s) in a square matrix may be included in the method. A covariance matrix of the square matrix can be determined; and a noise subspace and a signal plus interference subspace can be determined based on a SVD of the covariance matrix. The statistical information may be based on the signal plus interference subspace. Apparatus, computer programs and computer-readable media are also disclosed. | 04-02-2009 |
20090303896 | METHOD AND APPARATUS FOR PROVIDING RANDOM ACCESS WINDOW CONFIGURATION - An approach is provided for providing random access window configuration by estimating a processing time margin for processing random access preambles received in one or more random access channels. The estimated processing time margin is then used to offset the respective random access window configuration. | 12-10-2009 |
20100037114 | Discontinuous reception retransmission timer and method - A method includes, in response to a discontinuous reception (DRX) cycle being configured, and in response to a hybrid automatic repeat request round trip time (HARQ RTT) timer for an associated one of n hybrid automatic repeat request processes expiring in a current subframe when data in a corresponding hybrid automatic repeat request buffer is not successfully decoded, determining if a single discontinuous reception retransmission timer has been started. The single discontinuous reception retransmission timer is associated with all n of the hybrid automatic repeat request processes, where n is an integer equal to one or more than one. The method further includes, if the single discontinuous reception retransmission timer has not been started, starting the single discontinuous reception retransmission timer and setting an associated expiry value to a basic value. The method further includes, if the single discontinuous reception retransmission timer has been started, updating the expiry value by adding an increment value. | 02-11-2010 |
20100113051 | Random Access Preamble Transmission Design With Multiple Available Random Access Channel Resources - A method for use of a RA preamble with multiple available RACH resources is described. The method includes allocating resources including a plurality of RACH resources for a UE. Information that indicates a dedicated preamble and the allocated resources is sent to the UE. The UE receives the information. A response including the dedicated preamble is generated at the UE. The method also includes the UE sending the response over at least two of the allocated resources. In response to receiving at least one response, a message is transmitted to the UE. Apparatus and computer readable media are also described | 05-06-2010 |
20100246697 | Apparatus, Method and Computer Program Product Providing Feedback for Closed-Loop Wideband MIMO-OFDM System - In one exemplary aspect thereof the embodiments of this invention provide an apparatus that includes a wireless receiver configurable to receive resource units; a wireless transmitter configurable to transmit feedback information to a source of the received resource units; and a channel estimator and feedback generator coupled to the wireless receiver and to the wireless transmitter. The channel estimator and feedback generator is configurable to determine a weight for each of a first resource unit and a second resource unit that are received by the receiver spaced apart at least in frequency, to determine a weight for at least some of a plurality of resource units that are intermediate at least in frequency to the first and the second resource units, and to send feedback via the transmitter. The feedback includes an indication of the determined weight for the first and the second resource units using X bits for representing each of the indications of the determined weights, and further includes an indication of weights for each of the plurality of resource units using Y bits, where Y09-30-2010 | |
20110134862 | METHOD AND APPARATUS FOR PERFORMING RANDOM ACCESS PROCEDURE USING SOFT DEDICATED PREAMBLES - An approach for performing a random access procedure using soft-dedicated preambles is disclosed. A module designates one of a plurality of preambles, associated with one or more random access channels, as a soft-dedicated preamble. The soft-dedicated preamble is used by a user equipment that is either contention-based or non-contention-based. | 06-09-2011 |
20110267957 | Discontinuous Reception in Carrier Aggregation Wireless Communication Systems - A communication system is presented, which is capable of sending a transmission over an interface having at least two aggregated component carriers including a primary component carrier and at least one secondary component carrier, wherein the primary component carrier has a physical downlink control channel (PDCCH) associated therewith and wherein the PDCCH is capable of signaling allocations for the primary component carrier and the at least one secondary component carrier. A method of operating a network element including sending to a user equipment a transmission indication indicative of the transmission in the PDCCH of the primary component carrier. A method of operating a user equipment includes monitoring downlink control signaling for a transmission indication indicative of a transmission to the user equipment only on the PDCCH of the primary component carrier. | 11-03-2011 |
20120093071 | Network Element for Changing the Timeslot Type According to the received Information - It is described a mobile network, in particular an LTE network, including a relay node and a base station. The relay node is adapted for receiving signals from the base station during timeslots of a first type and for transmitting signals to a connected user equipment during timeslots of a second type differing from the first type of timeslots. The base station is adapted for transmitting signals to the relay node during timeslots of the first type and for sending information to the relay node indicating a change of the timeslot type. The relay node is further adapted for changing the timeslot type according to the received information. | 04-19-2012 |
20120220214 | METHOD AND APPARATUS FOR PROVISION OF PAGING MESSAGES IN RELAY NETWORK - Provided are a method and apparatus for the provision of paging messages in a wireless network which includes relays. The method comprises that a base station receives a paging message and transmits the paging message to at least one relay node with or without processing, and the at least one relay node transmits the paging message to a user equipment with or without modification. | 08-30-2012 |
20130100835 | Carrier Selection and/or Reselection - The invention relates to an apparatus including at least one processor and at least one memory including a computer program code, the at least one memory and the computer program code con-figured to, with the at least one processor, cause the apparatus at least to: search for feasible component carriers by measurements, and if at least one feasible component carrier is found, take it into use; select at least one home node for negotiations for obtaining resources, the selection being based on the measurements, and negotiate for obtaining resources, if no feasible component carriers are found; take into use at least one feasible component carrier obtained based on the negotiations, if at least one feasible component carrier is obtained; and take into use at least one component carrier which is closest feasible, if no feasible component carriers are obtained. | 04-25-2013 |
20130237268 | Allocation of Resources in a Communication System - A method and an apparatus for resource allocation in a local wireless node of a system of a plurality of local wireless nodes is disclosed. An inner circle subgradient resource allocation iteration is performed based on information received from at least one other wireless node of the system and an iteration parameter until a convergent result. An updated iteration parameter is provided by of at least one outer circle subgradient iteration based on the convergent result of the inner circle subgradient resource allocation iteration. The inner circle subgradient resource allocation iteration is then repeated at least once using the updated iteration parameter until a convergent result. Resources are then allocated based on the iterations. | 09-12-2013 |
20130343324 | Carrier Aggregation in a Communication System - The disclosure relates to use of carriers for aggregation in a wireless system. A set of carriers available for use in carrier aggregation is first determined. It is then determined if at least one carrier of the set of carriers can become unavailable for use by a communication device. An indication of a configuration type of the at least one carrier is sent to the communication device, the configuration type being indicative of different behavior during a period. The at least one carrier is maintained in the set of carriers during said period. The communication device receives the indication. If a change in the availability state of the at least one carrier is determined, the communication is operated, device in relation to the at least one carrier, according to the availability state and the received indication during said period. | 12-26-2013 |
20140036714 | NODEB Self-Tuning - It is provided an apparatus, including base station means to provide a base station functionality using component carriers; neighbor detecting means to detect a neighboring base station; informing means to inform a coordinating device about the neighboring base station; willingness setting means to set a willingness to perform self-tuning based on a respective long-term priority for each component carrier, wherein the long-term priorities are received from the coordinating device, and the willingness is only set if the long-term priorities are not in contradiction to an actual requirement, willingness providing means to provide an indication of the willingness to the coordinating device; and self-tuning means to perform self-tuning if an agreement statement is received from the coordinating device, wherein, as a result of the self-tuning, a usage of each component carrier by the base station means is based on the received long-term information and the actual requirement. | 02-06-2014 |
20140204791 | Mechanisms to Facilitate a Telecommunication System to Make Use of Bands which are Not-Licensed to the Telecommunication System - The present invention addresses a method, including configuring a remote device (UE) for measurements of at least one carrier in a first frequency band which is different from a second frequency band which is licensed used for communication by said remote device, receiving a measurement report from said remote device, and deciding on the usability of the at least one measured carrier in said first frequency band for communication by said remote device. Also, a method is proposed, including measuring at least one carrier in a first frequency band which is different from a second frequency band which is licensed used for communication by a remote device, and sending, to a network transceiver device, a measurement report of the measurements. Likewise, corresponding computer program products as well as correspondingly configured devices are addressed | 07-24-2014 |
20140269570 | Random Access Preamble Transmission Design With Multiple Available Random Access Channel Resources - A method for use of a RA preamble with multiple available RACH resources is described. The method includes allocating resources including a plurality of RACH resources for a UE. Information that indicates a dedicated preamble and the allocated resources is sent to the UE. The UE receives the information. A response including the dedicated preamble is generated at the UE. The method also includes the UE sending the response over at least two of the allocated resources. In response to receiving at least one response, a message is transmitted to the UE. Apparatus and computer readable media are also described. | 09-18-2014 |
20140328311 | ASSIGNING FREQUENCY BANDS FROM A GROUP OF FREQUENCY BANDS TO A WIRELESS NETWORK SYSTEM - A method for assigning frequency bands from a group of frequency bands, the method comprising determining a quality of service being required by the wireless network system, comparing the required quality of service with the predefined categories of the plurality of groups of frequency bands, selecting a group of frequency bands based on the comparison, and assigning at least one band from the selected group of frequency bands to the wireless network system, for communication between the at least one base station and the at least one user equipment. | 11-06-2014 |
20140357273 | MOBILITY CONTROL IN A COMMUNICATION SYSTEM - The disclosure relates to generation of mobility information. A mobile device can determine, based on measurements, at least one parameter relating to its movement relative to a cell. A weighting of a counter output for use in estimation of a mobility state of the mobile device is determined. The determining includes comparison of the at least one parameter to at least one threshold. Information about the weighting can be provided by a network element. When the network element obtains the weighted estimation it can take it into account in mobility control of the mobile device. | 12-04-2014 |
20140357274 | CELL HANDOVERS - A technique includes: comparing (a) measurements made at the first access node of transmissions made by a plurality of other access nodes against (b) measurements made at the communication device of transmissions made by said plurality of other access nodes; and deciding whether or not to select said first access node as a handover candidate for said communication device based at least partly on the result of said comparison. | 12-04-2014 |
20150078274 | SPECTRUM ALLOCATION METHOD - A spectrum allocation method for a cellular network is presented. The method includes: abstracting a cellular network into an interference pattern using a graph theory-based spectrum distribution model; a network node establishing a stakeholder list to represent whether a spectrum can be shared with other network nodes; by obtaining stakeholder lists from other network nodes, calculating a fairness coefficient and determining a lower bound value for the number of spectrum resources which are used; meanwhile, each network node sending out a value related to the fairness coefficient, thereby enables calculate an upper bound value for the number of resources which can be obtained according to the obtained information, to effectively compete for free resources. Through the method of the invention, a network node can autonomously select spectrum resources, fully and effectively achieve spectrum resource allocation fairness and global network fairness, and increase the system throughput and the edge user throughput. | 03-19-2015 |
20150257145 | CONFIGURING WIRELESS SERVICE - Methods and apparatus for controlling a wireless service provided for a communication device by a network is disclosed. A communication device served by at least one node of a network determines at least one desired characteristic of the wireless service and thereafter triggers configuration of the wireless service by sending from the communication device to the network a message containing information that is based on the at least one determined desired characteristic. A node of the network receives the message, and in response thereto, causes configuration of the wireless service based on the received information. | 09-10-2015 |