Abstract: There is provided a computer implemented method of allocating processing resources for processing by processing nodes, comprising: training predictive models, each predictive model for a respective processing node, each predictive model trained on a training dataset comprising records, each record including a historical amount of processing resources allocated to the respective processing node and a ground truth label indicating historical processing outcomes, wherein each processing node exhibits diminishing returns of processing outcomes with increasing allocated processing resources, wherein each predictive model is implemented as a monotonically increasing function that reaches a saturation level, solving an optimization allocation problem using the predictive models to identify a respective amount of processing resources for allocation to each processing node that maximizes a total of processing outcomes for a predetermined total amount of processing resources, and generating instructions for allocation

Abstract: There is provided a computer implemented method of allocating processing resources for processing by processing nodes, comprising: training predictive models, each predictive model for a respective processing node, each predictive model trained on a training dataset comprising records, each record including a historical amount of processing resources allocated to the respective processing node and a ground truth label indicating historical processing outcomes, wherein each processing node exhibits diminishing returns of processing outcomes with increasing allocated processing resources, wherein each predictive model is implemented as a monotonically increasing function that reaches a saturation level, solving an optimization allocation problem using the predictive models to identify a respective amount of processing resources for allocation to each processing node that maximizes a total of processing outcomes for a predetermined total amount of processing resources, and generating instructions for allocation

Abstract: Systems, devices, methods, and computer-readable mediums for generating a radio map of an area are disclosed. In one aspect, the device, method, and computer-readable medium perform processes that may include receiving in at least one processor first information associated with at least one wireless device at a first location in the area. The processes may include receiving in the at least one processor second information associated with at least one wireless device at a second location in the area and different from the first location. The first location within said area and the second location within the area are unknown to the at least one processor. The processes may also include generating a radio map of the area using the first information and the second information.

Abstract: Systems, devices, methods, and computer-readable mediums for generating a radio map of an area are disclosed. In one aspect, the device, method, and computer-readable medium perform processes that may include receiving in at least one processor first information associated with at least one wireless device at a first location in the area. The processes may include receiving in the at least one processor second information associated with at least one wireless device at a second location in the area and different from the first location. The first location within said area and the second location within the area are unknown to the at least one processor. The processes may also include generating a radio map of the area using the first information and the second information.

Abstract: A method and system for performing Multiple-Input Multiple-Output (“MIMO”) detection that reduces complexity by decomposing MIMO detection problem into two less complex problems, Candidate List generation and Interference Cancellation (“CLIC”). Embodiments of the CLIC framework parse an N element channel output into a first set containing S elements and a second set containing N?S elements. A first list of candidate vectors is generated from the first set of elements. A set of interference cancelled elements is generated by using the first list of candidate vectors to cancel interference from the second set of elements. A second list of candidate vectors is generated from the set of interference cancelled elements. A minimum cost is computed for each bit of the candidate vectors and from the costs a log-likelihood ratio is computed.

Abstract: A method and system for generating a set of candidate symbols. A system includes a Multiple Input Multiple Output (“MIMO”) receiver. The receiver includes a candidate generation look-up table (“LUT”) that provides a list of candidate values for a transmitted symbol selected from a constellation of symbols. The candidate generation LUT stores candidate lists for a portion of the constellation of symbols. The portion of the constellation for which candidate lists are stored is selected according to a symmetry of the constellation. The LUT preferably provides a secondary constellation superimposed on a decision region of a primary constellation. The LUT also preferably includes an inner point of the primary constellation and outer points of the primary constellation. The primary and secondary constellations are preferably compressed by application of quadrant, mirror, and inner-point symmetries.

Abstract: A novel mechanism for sharing filter taps across a plurality of interference cancellers. Each interference canceller may be directed to impairment, such as Ethernet impairments, including Ethernet 1000Base-T impairments. Various interference impairments include echo cancellation, NEXT cancellation and/or other interference detection or cancellation, etc. The hardware requirements of the interference impairment cancellers are reduced by sharing filter taps among the cancellers. In a first embodiment, the taps from a unified filter tap bank are shared across all the interference impairment cancellers for all four channels and over all ports. In a second embodiment, a portion of the taps of each filter are shared wherein each canceller comprises a fixed filter tap portion and a shared filter tap portion. A tap allocation algorithm assigns taps to those cancellers that need them the most. A canceller configuration is selected that yields maximal interference mitigation and the taps are allocated accordingly.

Abstract: A method and system for performing Multiple-input Multiple-Output (“MIMO”) detection that reduces complexity by decomposing MIMO detection problem into two less complex problems, Candidate List generation and Interference Cancellation (“CLIC”). Embodiments of the CLIC framework parse an N element channel output into a first set containing S elements and a second set containing N-S elements. A first list of candidate vectors is generated from the first set of elements. A set of interference cancelled elements is generated by using the first list of candidate vectors to cancel interference from the second set of elements. A second list of candidate vectors is generated from the set of interference cancelled elements. A minimum cost is computed for each bit of the candidate vectors and from the costs a log-likelihood ratio is computed.

Abstract: A method and system for generating a set of candidate symbols. A system includes a Multiple Input Multiple Output (“MIMO”) receiver. The receiver includes a candidate generation look-up table (“LUT”) that provides a list of candidate values for a transmitted symbol selected from a constellation of symbols. The candidate generation LUT stores candidate lists for a portion of the constellation of symbols. The portion of the constellation for which candidate lists are stored is selected according to a symmetry of the constellation. The LUT preferably provides a secondary constellation superimposed on a decision region of a primary constellation. The LUT also preferably includes an inner point of the primary constellation and outer points of the primary constellation. The primary and secondary constellations are preferably compressed by application of quadrant, mirror, and inner-point symmetries.

Abstract: A novel and useful mechanism for shutting down very small canceller taps that have little influence on the output of the canceller. Disabling or completely disabling these taps results in a significant reduction in power consumption of the circuit incorporating the canceller. Shutting down very low valued canceller taps also results in reduced least mean square (LMS) noise caused by the jittering of the smaller taps of the canceller. Several methods are provided that determine the number and location of the taps to be shutdown. The mechanism of the invention is operative to shut down canceller taps that are lower than a predetermined threshold. Methods include comparing each individual tap to a threshold, comparing an average of each tap to a threshold, comparing groups of taps to a threshold and comparing an average of groups of taps to a threshold. Taps or groups of taps are smaller than the threshold are shutdown thus reducing the power consumption of the canceller.