Abstract:
Methods and systems for verifying the precision of a program that utilizes floating point operations are disclosed. Interval and affine arithmetic can be employed to build a model of the program including floating point operations and variables that are expressed as reals and integers, thereby permitting accurate determination of precision loss using a model checker. Abstract interpretation can be also employed to simplify the model. In addition, counterexample-guided abstraction refinement can be used to refine the values of parametric error constants introduced in the model.
Abstract:
Methods and systems for transmitting multicast data in a wireless relay network are described. A tradeoff between the benefits of relay cooperation and session multiplexing can be addressed through careful association of relay stations for resource allocation purposes to maximize the total system throughput. In addition, various complex and greedy scheduling procedures that are based on the distributed pet mutation model and the contiguous permutation model are also described.
Abstract:
Systems and methods are for generating a codebook by: generating a multi-resolution codebook by selecting a common precoder index from a low resolution codebook for a group of adjacent resource blocks (RB)s and for each RB within the group, selecting a high-resolution codebook to fine-tune each RB precoder; and generating feedback for the multi-resolution codebook by quantizing channel state variations.
Abstract:
A system and method for discovering a set of possible iteration sequences for a given loop in a software program is described, to transform the loop representation. In a program containing a loop, the loop is partitioned into a plurality of portions based on splitting criteria. Labels are associated with the portions, and an initial loop automaton is constructed that represents the loop iterations as a regular language over the labels corresponding to the portions in the program. Subsequences of the labels are analyzed to determine infeasibility of the subsequences permitted in the automaton. The automaton is refined by removing all infeasible subsequences to discover a set of possible iteration sequences in the loop. The resulting loop automaton is used in a subsequent program verification or analysis technique to find violations of correctness properties in programs.
Abstract:
Methods and systems for optimizing the utilities of receiver devices in a wireless communication network are disclosed. Precoder design formulations that maximize a minimum worst-case rate or a worst-case sum rate are described for both full base station cooperation and limited base station cooperation scenarios. In addition, optimal equalizers are also selected to optimize the worst-case sum rate.
Abstract:
Systems and methods are provided for network communication using wireless base stations and an optical orthogonal frequency division multiple access (OFDMA) signal generated on an optical wavelength, with the optical OFDMA signal being composed of a plurality of OFDMA subcarriers. A multi-level modulator modulates each of the plurality of OFDMA subcarriers. A single optical wavelength propagates each of the plurality of OFDMA subcarriers to different base stations; a passive optical splitter delivers the optical OFDMA signal to different base stations; and an OFDMA subcarrier de-multiplexer delivers and extracts traffic for each of the base stations in an electronic-domain, wherein the extracted traffic is remodulated in a wireless signal format. Antennas at each of the base stations transmit wireless signals, and the wireless signals are recovered and processed from the base stations.
Abstract:
Systems and methods are disclosed for enhancing optical communication by performing dispersion compensation in an optical fiber using a fiber Bragg grating (FBG); and providing increased degrees of freedoms (DOFs) to distinguish forward and backward propagating fields with a passive component.
Abstract:
Each of a plurality of data flows is classified as having a respective data flow type, and each data flow is assigned to one of a plurality of subcarrier groups, based on the data flow's type, wherein each subcarrier group comprises a respective plurality of subcarriers. First data flows assigned to a first subcarrier group are transmitted exclusively on respective subcarriers in the first subcarrier group, and second data flows assigned to a second subcarrier group are transmitted together on all of the subcarriers in the second subcarrier group.
Abstract:
A method for determining the state of an entire network, including state of applications and infrastructure includes receiving network control messages in an OpenFlow network, passing normal network control messages through OFSense, a control plane middleware, and constructing from the network control messages an application level connectivity graph to infer network delay between any two communicating server in the network and estimating an application response time of a given server in the network; and providing state of the network for enabling intelligent detection and diagnosis of infrastructure and application performance.