Abstract:
This invention relates to methods and systems for determining whether a reference point in a location system has changed using the entropy of channel impulse responses. In one embodiment a method of determining whether the location of a first one of a plurality of reference points used in a location system has changed is provided. The reference points each have a known initial position and the method includes the steps of: estimating a channel impulse response of a wireless channel between the first reference point and a second of said plurality of reference points; determining the difference between the estimated channel impulse response and a previously-estimated channel impulse response of the wireless channel; estimating an entropy of the difference between the channel impulse responses; and determining, from said comparison, whether the location of the first reference point has changed. In another embodiment the method includes the steps of: estimating an entropy of the channel impulse response of a wireless channel between the first reference point and a second of said plurality of reference points; comparing the estimated entropy to a previously-estimated entropy for the channel impulse response of the wireless channel; determining, from said comparison, whether the location of the first reference point has changed.
Abstract:
This invention relates to end-to-end transparent clocks and methods of estimating skew in end-to-end transparent clocks. Embodiments of the invention relate to techniques for estimating clock skew between a free-running clock in a transparent clock and a master clock, in particular by using the timing information embedded in timing messages passing through the transparent clock. Further embodiments of the invention set out uses of these estimates to modify the residence times computed by the transparent clock and a synchronization network including such transparent clocks.
Abstract:
This invention relates to methods and systems for searching. It is particularly applicable to methods of searching which enable efficient identification of compatible portfolios. Embodiments of the invention propose methods of searching which address the huge search space issue associated with identifying compatible portfolios. In particular, embodiments of the invention start their search operations simultaneously from both sides by both trying to form valid portfolios from candidate products until a valid solution is found and trying to find conflicts from the defined compatibility rules until a conflict is found which leads to the conclusion that no valid solution exists. A conclusion from either process will stop the whole searching process which can significantly reduce blind and unnecessary searching in the whole search space. In embodiments of the invention, the two sides of the search process are also connected in a way which permits two-way communications between the processes to share information about invalid search branches during the execution of the search. The shared information is then used to direct the current and later stage of search execution. Such exchange of information can also significantly reduce the search space and create more efficient searching systems and methods, particularly by stopping search agents from carrying out invalid future searches in branches that another agent has already identified as invalid.
Abstract:
This invention relates to methods for storing and searching data. Embodiments of the invention make use of suffix trees to support binary pattern matching. Embodiments of the invention can be shown to have comparable search speeds to searches of known suffix trees, but are advantageous in that they have lower memory usage requirements which is important in large data environments.
Abstract:
This invention relates to methods and systems for workload distribution, particularly in data centers, more particularly data centers which use fresh air cooling. Embodiments of the invention provide methods and systems which calculate a load value for each server which takes account of both the temperature of the server and its current job queue, and determine the server to which an incoming job should be allocated on the basis of the load values of the available servers.
Abstract:
This invention relates to methods and devices for clock synchronization. The invention has particular application in the alignment of slave clocks to a master clock and in dealing with transmission delay asymmetries where the forward and reverse communication paths between the master and slave clocks have asymmetric transmission rates. Such methods and devices have particular application in small cell backhaul solutions for 4G/LTE deployments. In embodiments of the invention, the slave clock uses link rate information to estimate the transmission delay asymmetry and thus estimate the offset and skew of the slave clock. Embodiments provide a simple linear approximation technique and a Kalman filter-based technique for estimating offset and skew of the slave clock.
Abstract:
This invention relates to methods and devices for synchronization using linear programming, especially over packet networks using, for example, the IEEE 1588 Precision Time Protocol (PTP). Timing protocol messages are exposed to artifacts in the network such as packet delay variations (PDV) or packet losses. Embodiments of the invention provide a two-dimensional linear programming technique for estimating clock offset and skew, particularly from two-way exchange of timing messages between a master and a slave device. Some embodiments include a skew and offset adjustable free-running counter for regenerating the master time and frequency at the slave device.
Abstract:
This invention relates to packet selection techniques that can be used in conjunction with a clock recovery mechanism to mitigate the effects of packet delay variation on timing messages exchanged over a packet network, particularly when seeking to synchronize the time of a clock in a slave device to that of a master clock. The packet selection techniques can assist in reducing the noise in the recovered clock signal at the slave device, allowing recovery to a higher quality. Embodiments of the invention provide techniques based on extracting timing packets that create a constant interval between the arrival of selected packets at the slave device and on extracting timing packets which are closest to making the interval between arrival of the selected packets equal to the interval between the departure of the packets.
Abstract:
This invention relates to methods and devices for frequency distribution based on, for example, the IEEE 1588 Precision Time Protocol (PTP). Packet delay variation (PDV) is a direct contributor to the noise in the recovered clock and various techniques have been proposed to mitigate its effects. Embodiments of the invention provide a mechanism to directly measure and remove PDV effects in the clock recovery mechanism at a slave clock. One particular embodiment provides a clock recovery mechanism including a phase-locked loop (PLL) with a PDV compensation feature built-in. An aim of the invention is to enable a slave clock to recover the master clock to a higher quality as if the communication path between master and slave is free of PDV. This technique may allow a packet network to provide clock synchronization services to the same level as time division multiplexing (TDM) networks and Global Positioning System (GPS).
Abstract:
This invention relates to methods for storing and searching data. Embodiments of the invention make use of suffix trees to support binary pattern matching. Embodiments of the invention can be shown to have comparable search speeds to searches of known suffix trees, but are advantageous in that they have lower memory usage requirements which is important in large data environments.