Abstract:
Systems and methods are disclosed to perform nonlinear compensation (NLC) in an optical communication system by applying digital backpropagation (DBP) using a frequency-shaped split-step Fourier method (FS-SSFM), and processing a data block using an overlap-and-save method with a block size M and an overlap factor of N samples between adjacent blocks.
Abstract:
A method for an arbitrary optical microwave and mm-wave generation includes generating 2N+1 optical carriers while employing only one continuous wave CW lightwave with a recirculating multi-tone generator; and selecting optical carriers with an arbitrary-frequency optical millimeter-wave generator responsive to the prior generating.
Abstract:
A method includes determining a line rate selection for a flexible optical wavelength-division-multiplexing WDM network, determining a traffic routing in said network, and determining simultaneously a channel routing, wavelength assignment and spectrum allocation in said network based on an auxiliary graph.
Abstract:
A method for joint transmitter and receiver processing for computationally efficient equalization in polarization multiplexed (POLMUX) optical orthogonal frequency division multiplexed (OFDM) transmission with direct detection.
Abstract:
Methods and apparatus are disclosed for applying successive multi-rank beamforming strategies (e.g., successive precoding strategies) for the design of precoders over a set of parallel channels. Successive beamforming is applied to a narrow band channel model and is also applied for finer quantization of a single beamforming vector (e.g., recursive beamforming). A first embodiment provides the optimal approach with high complexity. An alternative embodiment provides successive beamforming for near optimal precoding selection with medium complexity. A low complexity method for precoder selection is also provided wherein a channel representative matrix for the set of parallel channels is determined and successive beamforming on the calculated channel representative is applied.
Abstract:
A computer implemented program analysis method employing a set of new abstract domains applicable to non-convex invarients. The method analyzes programs statically using abstract interpretation while advantageously considering non-convex structures and in particular those situations in which an internal region of an unreachable state exists within a larger region of reachable states. The method employs a new set of non-convex domains (donut domains) based upon the notion of an outer convex region of reachable states (Domain D1) and an inner region of unreachable states (Domain D2) which advantageously permits capture of non-convex properties by using convex regions and operations.
Abstract:
Systems and methods for extracting a radial contour around a given point in an image includes providing an image including a point about which a radial contour is to be extracted around. A plurality of directions around the point and a plurality of radius lengths for each direction are provided. Local costs are determined for all radius lengths for each direction by comparing texture variances at each radius length with the texture variance at a further radius length. A radius length is determined, using a processor, for each direction based on the accumulated value of the local costs to provide a radial contour.
Abstract:
A method is provided for sequential discrete event simulation for a distributed system having a set of nodes. A priority queue is constructed that includes events to be executed by a processor at a given node in the set. A first subset of nodes is identified. Each node in the first subset is associated with a respective subset of events and includes a highest priority event whose priority must be unconditionally re-evaluated during a next time step. A second subset of nodes is identified. Each node in the second subset is associated with a respective other subset of events and includes a highest priority event whose priority must be re-evaluated when a re-evaluation condition depending upon an external state is satisfied. A next one of the plurality of events in the priority queue is selected to be executed by the processor using the first and second subsets of nodes.
Abstract:
Methods and systems for managing data loads on a cluster of processors that implement an iterative procedure through parallel processing of data for the procedure are disclosed. One method includes monitoring, for at least one iteration of the procedure, completion times of a plurality of different processing phases that are undergone by each of the processors in a given iteration. The method further includes determining whether a load imbalance factor threshold is exceeded in the given iteration based on the completion times for the given iteration. In addition, the data is repartitioned by reassigning the data to the processors based on predicted dependencies between assigned data units of the data and completion times of a plurality of the processers for at least two of the phases. Further, the parallel processing is implemented on the cluster of processors in accordance with the reassignment.
Abstract:
Methods and systems for managing resources in femtocells are disclosed. One method includes transmitting at least one frame including a first zone of resources on which a set of base stations including at least one femtocell base station and base stations that are adjacent to the femtocell base station implement transmission of signals to impose interference. The one or more frames further includes a second zone dedicated for measuring throughput of mobile stations served by the femtocell base station without interference. The mobile stations are categorized by determining throughputs of the mobile stations with interference based on the transmission of signals on the first zone. Resources of at least one additional frame are configured based on the categorization. Further, the additional frame(s) are transmitted in a cell of the femtocell base station in accordance with the configuration.