Abstract: An absolutely optimal routing or a quasi-optimal routing is computed for a first plurality of resources m to be routed to a second plurality of resource destinations n, depending on a count of m and n. Three different algorithms are used. For the case where the count is m?6 and n?8, a first algorithm is used to arrive at an absolutely optimal routing. An example of the first algorithm is Depth First Branch and Bound Search. For a second count, where the value of the count is more numerous than the first count, m is greater than six, but equal to, or less than or equal to fifty, 6<m?50, and n is greater than 8, but less than or equal to one hundred, 8<n?100, a second algorithm, is used to compute a quasi-optimal routing. An example of this second algorithm is Local Search. For a third count, where the count exceeds those above, a third algorithm is used for computing a quasi-optimal routing. Typically this third algorithm applies where m>50, and n>100.

Abstract: An absolutely optimal routing or a quasi-optimal routing is computed for a first plurality of resources m to be routed to a second plurality of resource destinations n, depending on a count of m and n. Three different algorithms are used. For the case where the count is m?6 and n?8, a first algorithm is used to arrive at an absolutely optimal routing. An example of the first algorithm is Depth First Branch and Bound Search. For a second count, where the value of the count is more numerous than the first count, m is greater than six, but equal to, or less than or equal to fifty, 6<m?50, and n is greater than 8, but less than or equal to one hundred, 8<n?100, a second algorithm, is used to compute a quasi-optimal routing. An example of this second algorithm is Local Search. For a third count, where the count exceeds those above, a third algorithm is used for computing a quasi-optimal routing. Typically this third algorithm applies where m>50, and n>100.

Abstract: The present invention provides methods of managing interference in a wireless communication system. The methods may include receiving information indicative of a portion of an interfering signal received by a first wireless communication device, decoding the portion of the interfering signal, and providing at least one back-off instruction destined for a second wireless communication device based on the decoded portion of the interfering signal.

Abstract: An automated technique for configuring a neighbor set for a base station (32) includes initializing the neighbor set based upon reported measurements from a mobile station (22). In a disclosed example, a newly installed base station (32) transmits a cell information list to a mobile station (22) requesting measurement reports regarding a plurality of candidate base station identifiers. Based upon the reported measurements, a determination is made regarding which of the base stations should be included in the neighbor set for the base station (32). A disclosed example includes the capability of automatically initializing the neighbor set and automatically updating the set. Disclosed examples include utilizing information from a plurality of mobile stations.

Abstract: A wireless communication system (20) allows for using base station router devices (30, 32) for in building communications using a mobile station (22). Automatically configuring a definition code such as primary scrambling codes or pseudo random noise offsets of the base station router devices (30, 32) facilitates minimizing or avoiding false handovers between a macrocell base station (24) and one of the base station router devices (30, 32). In a disclosed example, a controller (26) such as a radio network controller communicates with at least one of the base station router devices (30, 32) for automatically changing a definition code used by such a device to avoid correspondence between definition codes within a selected range.

Abstract: The present invention provides a method and an apparatus for communicating data over a network between a communication node, for example, an access point having a first and a second antenna and a first and a second mobile station. The method comprises weighting a first data at the access point to transmit the first data using the first and second antennas so that the first mobile station only receives the first data and weighting a second data at the access point to transmit the second data using the first and second antennas so that the second mobile station only receives the second data. A space division multiple access (SDMA) module may cause a transmission protocol to transmit the first data to the first mobile station on the downlink and transmit the second data to the second mobile station in parallel to the transmission of the first data on the downlink.

Abstract: A method of decoding is provided comprising processing iterations. In each processing iteration, there is a first Max-Log-MAP decoding operation giving rise to a systematic error due to the Max-Log approximation, and a first weighting operation to weight extrinsic information from the first decoding operation to be applied as a priori information to the second Max-Log-MAP decoding operation. This is followed by a second Max-Log-MAP decoding operation, also giving rise to a systematic error due to the Max-Log approximation, and a second weighting operation to weight extrinsic information from the second decoding to be applied as a priori information to the first Max-Log-MAP decoding of the next iteration. The weights are applied to compensate for the systematic error due to the Max-Log approximation made in the last Max-Log-MAP decoding operation.