Abstract: The present disclosure relates generally to techniques for enhancing adders implemented on an integrated circuit. In particular, arithmetic performed by an adder implemented to receive operands having a first precision is restructured so that a set of sub-adders performs the arithmetic on a respective segment of the operands. More specifically, the adder is restructured, and a decoder determines a generate signal and a propagate signal for each of the sub-adders and routes the generate signal and the propagate signal to a prefix network. The prefix network determines respective carry bit(s), which carries into and/or select a sum at a subsequent sub-adder.

Abstract: A PAM (Pulse Amplitude Modulation) modulator driver is configured to receive a PAM input signal having N input amplitude levels and provide a PAM output signal having N output amplitude levels, where N is an integer. The PAM modulator driver circuit configured to electrically adjust amplitude levels in the PAM output signal.

Abstract: A method, system, and processor-readable storage medium are directed towards calculating approximate order statistics on a collection of real numbers. In one embodiment, the collection of real numbers is processed to create a digest comprising hierarchy of buckets. Each bucket is assigned a real number N having P digits of precision and ordinality O. The hierarchy is defined by grouping buckets into levels, where each level contains all buckets of a given ordinality. Each individual bucket in the hierarchy defines a range of numbers—all numbers that, after being truncated to that bucket's P digits of precision, are equal to that bucket's N. Each bucket additionally maintains a count of how many numbers have fallen within that bucket's range. Approximate order statistics may then be calculated by traversing the hierarchy and performing an operation on some or all of the ranges and counts associated with each bucket.

Abstract: An input tuple including a data time stamp is assigned by a data source; a pending tuple in which a system time stamp at the time the input tuple was received is assigned to the input tuple; and the pending tuple is stored in a queue, one queue for each data source. The queues are sorted in the order of the data time stamps of the pending tuples at the head of each queue; and if, in the queue at the head of which is stored the pending tuple having the smallest data time stamp value, the value of the current system time stamp is greater than the value of a processing pending period added to the system time stamp of the pending tuple at the head of the queue, then the input tuple is acquired from the pending tuple at the head of the queue for an input stream.

Abstract: In some applications, such as randomization and cryptography, remainder computation for a number is required. The remainder computation is also used in modulo arithmetic. The remainder computation can be simplified when the divisor belongs to a certain class of numbers. A method and apparatus are disclosed that enable low complexity implementation of remainder computation of any number when the divisor belongs to a type of numbers that can be represented as 2k+1.

Abstract: A quantum phase estimator may include at least one phase gate, at least one controlled unitary gate, and at least one measurement device. The quantum phase estimator receives at least one ancillary qubit and a calculational state comprised of multiple qubits. The phase gate may apply random phases to the ancillary qubit, which is used as a control to the controlled unitary gate. The controlled unitary gate applies a second random phase to the calculational state. The measurement device may measure a state of the ancillary qubit from which a phase of the calculational state may be determined.

Abstract: Methods and apparatus are provided in which a computed vector index (CVI) can be generated/computed based on an input value being searched for within an index vector of a lookup table. When the CVI is greater than a length of an index vector, the CVI can be re-computed to generate a re-computed vector index (RVI). When the value of the CVI is determined to be correct, or when the RVI is generated, an interpolation routine for a linearly indexed index vector can be executed using a presently computed vector index (e.g., either the CVI or the RVI) to determine an interpolated output value that corresponds to the input value. By contrast, when the value of the CVI is determined to be incorrect, an interpolation routine for a piecewise indexed index vector can be executed to determine the interpolated output value.

Abstract: A method and system distributes shares of a secret among cooperating entities using linear interpolation. In one embodiment, a linear equation is formed using the secret and random elements. The linear equation represents a K-dimensional secret hyperplane, where K is the number of shares to reconstruct the secret. Shares of the secrets are created, with each share containing a point on the secret hyperplane. The shares are then distributed to cooperating entities for secret sharing.

Abstract: A circuit includes a signal processing circuit for accepting an input and for generating a set of outputs. The input is provided in an input range that has a set of representative values, and each output represents a measure of an association of the input with one or more of the representative values. The signal processing circuit includes a group of output sections, each output section being responsive to the input of the signal processing circuit. Each output section includes one or more sigmoid generators. Each sigmoid generator is responsive to an input of the output section to generate an output that represents a sigmoid function of the input of the output section. Each output section also includes a circuitry for combining the outputs of the one or more sigmoid generators to form one of the set of outputs of the signal processing circuit. An input transformation circuit is coupled to the plurality of output sections.

Abstract: A performance management system and method for generating a plurality of forecasts for one or more electronic devices is presented. The forecasts are generated from stored performance data and analyzed to determine which devices are likely to experience performance degradation within a predetermined period of time. A single forecast is extracted for further analysis such that computer modeling may be performed upon the performance data to enable the user to predict when device performance will begin to degrade. In one embodiment, graphical displays are created for those devices forecasted to perform at an undesirable level such that suspect devices may be subjected to further analysis.

Abstract: We describe a method for using a classical computer to generate a sequence of elementary operation (SEO) that can be used to operate a quantum computer, thereby inducing the quantum computer to sample an arbitrary probability distribution. The probability distribution being sampled is specified in the form of a Bayesian network.

Abstract: Aggregates are calculated from a data stream in which data is sent in a sequence of tuples, in which each tuple comprises an item identifier and a timestamp indicating when the tuple was transmitted. The tuples may arrive at a data receiver out-of-order, that is, the sequence in which the tuples arrive are not necessarily in the same sequence as their corresponding timestamps. In calculating aggregates, more recent data may be given more weight by a decay function which is a function of the timestamp associated with the tuple and the current time. The statistical characteristics of the tuples are summarized by a set of linear data summaries. The set of linear data summaries are generated such that only a single linear data summary falls between a set of boundaries calculated from the decay function and a set of timestamps. Aggregates are calculated from the set of linear data summaries.

Abstract: Methods for modeling a random variable with spatially inhomogenous statistical correlation versus distance, standard deviation, and mean by spatial interpolation with statistical corrections. The method includes assigning statistically independent random variable to a set of seed points in a coordinate frame and defining a plurality of test points at respective spatial locations in the coordinate frame. A equation for a random variable is determined for each of the test points by spatial interpolation from one or more of the random variable assigned to the seed points. The method further includes adjusting the equation of the random variable at each of the test point with respective correction factor equations.

Abstract: The use of the ordinary Poisson iterative reconstruction algorithm in PET requires the estimation of expected random coincidences. In a clinical environment, random coincidences are often acquired with a delayed coincidence technique, and expected randoms are estimated through variance reduction (VR) of measured delayed coincidences. In this paper we present iterative VR algorithms for random compressed sonograms, when previously known methods are not applicable. Iterative methods have the advantage of easy adaptation to any acquisition geometry and of allowing the estimation of singles rates at the crystal level when the number of crystals is relatively small. Two types of sonogram compression are considered: axial (span) rebinning and transaxial mashing. A monotonic sequential coordinate descent algorithm, which optimizes the Least Squares objective function, is investigated.

Abstract: An authentication method of a first module by a second module includes the steps of generating a first random datum by the second module to be sent to the first module, generating a first number by the first module starting from the first datum and by way of a private key, and generating a second number by the second module to be compared with the first number, so as to authenticate the first module. The step of generating the second number is performed starting from public parameters and is independent of the step of generating the first number.

Abstract: The invention relates to a computer system for assisting prediction of the future of a chronological set (J) of numerical values which are stored in the memory (H) of a computer (O), such as to enable the generation of a topological structure, which can be displayed (V), using an algorithm-based analyzer (A). The topological structure comprises a dense network of regression-based curves in which characteristic figures, which can be used for prediction (P) purposes, can manifest.

Abstract: A performance management system and method for generating a plurality of forecasts for one or more electronic devices is presented. The forecasts are generated from stored performance data and analyzed to determine which devices are likely to experience performance degradation within a predetermined period of time. A single forecast is extracted for further analysis such that computer modeling may be performed upon the performance data to enable the user to predict when device performance will begin to degrade. In one embodiment, graphical displays are created for those devices forecasted to perform at an undesirable level such that suspect devices may be subjected to further analysis.

Abstract: Methods for modeling a random variable with spatially inhomogenous statistical correlation versus distance, standard deviation, and mean by spatial interpolation with statistical corrections. The method includes assigning statistically independent random variable to a set of seed points in a coordinate frame and defining a plurality of test points at respective spatial locations in the coordinate frame. A equation for a random variable is determined for each of the test points by spatial interpolation from one or more of the random variable assigned to the seed points. The method further includes adjusting the equation of the random variable at each of the test point with respective correction factor equations.

Abstract: In general, the present invention provides a method, system and program product for approximating/estimating computer resource consumption of a computer system. Specifically, under the present invention, a more efficient or reduced computer work gradient matrix (hereinafter “matrix”) is first built. This occurs by creating load measurements for a set of computer resource metrics of the computer system to analyze dependencies between different computer resource metrics. Then, a correlation matrix between the set of computer resource metrics is created based on the dependencies. The set of computer system resource metrics in the correlation matrix is thereafter clustered into a set of clusters, and a reduced matrix is built based thereon. Once the reduced matrix is built, it can be restored to a “full” matrix using linear transformation or the like.

Abstract: A circuit includes a signal processing circuit for accepting an input and for generating a set of outputs. The input is provided in an input range that has a set of representative values, and each output represents a measure of an association of the input with one or more of the representative values. The signal processing circuit includes a group of output sections, each output section being responsive to the input of the signal processing circuit. Each output section includes one or more sigmoid generators. Each sigmoid generator is responsive to an input of the output section to generate an output that represents a sigmoid function of the input of the output section. Each output section also includes a circuitry for combining the outputs of the one or more sigmoid generators to form one of the set of outputs of the signal processing circuit. An input transformation circuit is coupled to the plurality of output sections.

Abstract: A system and method for solving a decision problem having Boolean combinations of linear and non-linear operations includes translating the non-linear real operations using a COordinate Rotation DIgital Computer (CORDIC) method programmed on a computer device into linear operations maintaining a given accuracy. Linear and translated linear operations are combined into a formula. Satisfiablity of the formula is solved using a decision procedure for Boolean combinations of linear operations over integers and reals.

Abstract: There is provided a model that can evaluate properties of viscoelasticity and also rubber elasticity of an elastic material. A correlation equation between stress and strain that is calculated from: a correlation equation between stress, strain, elastic modulus and relaxation time, calculated based on a Maxwell model in which an elastic element and a viscous element are placed in series; and a correlation equation between strain and elastic modulus, including different moduli depending on properties, the correlation equation between stress and strain including different moduli depending on said properties as parameters is output as a stress-strain curve formula. There is one feature in finding a correlation between the strain and the elastic modulus, and this allows a large deformation behavior of an elastic material having properties of both rubber elasticity and viscoelasticity to be expressed with high quantitative characteristics on simulation.

Abstract: A novel and useful apparatus for and method of local oscillator (LO) generation with non-integer multiplication ratio between the local oscillator and RF frequencies. The LO generation schemes presented are operative to generate I and Q square waves at a designated frequency while avoiding the well known issue of harmonic pulling. The use of analog mixers of the prior art is avoided and replaced with an XOR gate configured to generate the correct average frequency. The edges are dynamically adjusted by ±T/12 or zero based on the state of the controlled oscillator down-divided clock.

Abstract: Systems, methods and computer readable storage media are provided for identifying, in a signal of interest, signal segments matching a reference signal segment. A processor coupled to memory is adapted to perform operations including: converting the reference signal segment to a first vector characterized by n pairs of data points, wherein n is an integer greater than zero and each pair of data points comprises a data point having a value along the first axis and a value along a second axis normal to the first axis. Segment of the signal of interest are converted to additional vectors, wherein each of the segments of the signal of interest has a first length in a direction along the first axis and has n pairs of data points. A correlation value is calculated between the reference signal segment and each of the segments of the signal of interest, using the first vector and the additional vectors, respectively.

Abstract: An apparatus for evaluating deposit formation characteristics of lubricant samples. The apparatus includes a reactor chamber having a closed first end and a second end, said closed first end of said reactor chamber forming a lubricant sump and said second end open to the atmosphere, an electric heater for heating a test coupon positioned thereon, said electric heater positioned within said reactor chamber, above said lubricant sump, an air supply tube, said air supply tube having a first end in fluid communication with a source of air and a second end, said second end positioned adjacent the test coupon, said air supply tube having a sample orifice located between said first end and said second end of said air supply tube and a lubricant supply tube, said lubricant supply tube having a first end positioned within said lubricant sump and in fluid communication with a source of lubricant and a second end, said second end positioned within said sample orifice of said air supply tube.

Abstract: The invention relates to a computer system for assisting prediction of the future of a chronological set (J) of numerical values which are stored in the memory (H) of a computer (O), such as to enable the generation of a topological structure, which can be displayed (V), using an algorithm-based analyzer (A). The topological structure comprises a dense network of regression-based curves in which characteristic figures, which can be used for prediction (P) purposes, can manifest.

Abstract: Aggregates are calculated from a data stream in which data is sent in a sequence of tuples, in which each tuple comprises an item identifier and a timestamp indicating when the tuple was transmitted. The tuples may arrive at a data receiver out-of-order, that is, the sequence in which the tuples arrive are not necessarily in the same sequence as their corresponding timestamps. In calculating aggregates, more recent data may be given more weight by a decay function which is a function of the timestamp associated with the tuple and the current time. The statistical characteristics of the tuples are summarized by a set of linear data summaries. The set of linear data summaries are generated such that only a single linear data summary falls between a set of boundaries calculated from the decay function and a set of timestamps.

Abstract: Aggregates are calculated from a data stream in which data is sent in a sequence of tuples, in which each tuple comprises an item identifier and a timestamp indicating when the tuple was transmitted. The tuples may arrive out-of-order, that is, the sequence in which the tuples arrive are not necessarily in the sequence of their corresponding timestamps. In calculating aggregates, more recent data may be given more weight by multiplying each tuple by a decay function which is a function of the timestamp associated with the tuple and the current time. The tuples are recorded in a quantile-digest data structure. Aggregates are calculated from the data stored in the quantile-digest data structure.

Abstract: A schedule is generated by which physical items to be manufactured are assigned into production slots. The physical items have constraints governing manufacture of the physical items. The method generates coefficient matrix clusters from a mathematical programming problem based on an actual scheduling problem. Each coefficient matrix cluster defines a variable cluster-constraint cluster pair. A variable cluster of each coefficient matrix cluster defines production slot-physical item pairs. A constraint cluster of each coefficient matrix cluster defines a group of constraints. Each coefficient matrix cluster includes coefficient-binary variable pairs, each pair having a binary variable multiplied by a coefficient. For each coefficient matrix cluster, the method reduces non-zero factors within the cluster. Each non-zero factor within the coefficient matrix cluster is defined as a coefficient-binary variable pair such that the binary variable of the pair multiplied by the coefficient of the pair is non-zero.

Abstract: An inband signaling modem communicates digital data over a voice channel of a wireless telecommunications network. An input receives digital data. An encoder converts the digital data into audio tones that synthesize frequency characteristics of human speech. The digital data is also encoded to prevent voice encoding circuitry in the telecommunications network from corrupting the synthesized audio tones representing the digital data. An output then outputs the synthesized audio tones to a voice channel of a digital wireless telecommunications network.

Abstract: An apparatus for characterising an analog to digital converter, comprising a signal generator for supplying an input signal having a first sinusoidal component to an analog to digital converter and an acquisition device for receiving and storing a plurality of output values from the analog to digital converter, and a data processor arranged to examine the output values in order to determine discrepancies due to bit weight errors and to calculate estimates of the bit weights or bit weight errors.

Abstract: A system for updating a control coefficient to a target value during a prescribed number of periodic incremental update increments. The system divides the desired change in the value of the coefficient by the number of update increments. Specifically, the number of increments by the number of increments is limited to powers of two, so that the division can be accomplished simply by demarking the change in value according to the portion of number of increments, thereby separating the change into a quotient and a remainder. The value of each update increment is nominally equal to the quotient, with the remainder being distributed relatively evenly by adding one to selected updates.

Abstract: A phase-to-sinusoid-amplitude conversion system and method for use in, for example, direct digital frequency synthesizer applications. The system and method convert phase data to signal amplitude data using an approximation of the first quadrant of a sine function using a plurality of linear line segments of preferably equal length. Each segment is defined with a lower horizontal-axis bound; a lower vertical-axis bound; and a slope represented as a sum of a plurality of slope elements. Based on the approximation and for a given phase angle a set of values are evaluated, for each linear line segment, representing a product of (i) a horizontal displacement representing a difference between the prescribed phase angle and the lower horizontal-axis bound xi of a selected linear line segment where, for example, xi<X<xi+1 and (ii) each one of the slope elements of the selected linear line segment.

Abstract: A method of waveform generation using a VLSI digital tester unit without an arbitrary waveform generator. A software application produces a series of vectors to drive a digital tester unit from a set of datapoints which defines a waveform needed in the test program. The set of datapoints can be generated in a test simulator such as SPICE or can be generated by digitizing the arbitrary waveform needed in a test program. The vectors describe the number of resistors of a pseudo arbitrary waveform generator (PAWG) circuit to be driven high in order to reproduce the desired waveform for input into the device under test. The software also determines the resolution, e.g., 5 ns, of the waveform.

Abstract: A method for using linear functions with counter modules for efficient implementation in PALs (Programmable Array Logic), or FPGAs (Field Programmable Gate Arrays) which generate digital control signals to a targeted digital device.An input setting pulsed digital signal A is upcounted and then is reduced by a downcounted feedback pulsed digital signal to produce a difference digital signal which involves adding an intercept value. The difference signal is multiplied by a slope-sensitivity parameter, each time expanding the numeric range and scope of the output digital control signal to the target digital device.

Abstract: A system and method in a digital network for developing a digital output control signal Y which is of greater range and sensitivity than an input digital difference signal X wherein Y has a linear functional relationship to X according to a slope parameter "b". A method is developed for implementing the network with Field Programmable Gate Arrays (FPGAs) to develop the output control signal Y equal to a+bX on an expanded digital bus, where "a" is the intercept value of Y when X=0.