Abstract: A method and device are provided for filtering digital audio signals using at least one ARMA filter, particularly during a filter change. The method includes the following steps: a step of receiving a first request to change filtering to or from filtering by a first ARMA filter; and, in response to the first request, a step of gradually switching, at each of a plurality of cascaded first filtering blocks, between digital-signal filtering by a first basic filtering cell and digital-signal filtering by another associated basic filtering cell, the first basic filtering cells of the plurality of first filtering blocks factorizing the first filter.
Type:
Grant
Filed:
March 14, 2012
Date of Patent:
May 2, 2017
Assignee:
ORANGE
Inventors:
Alexandre Guerin, Julien Faure, Claude Marro
Abstract: According to one embodiment, an arithmetic circuit includes follows. The arithmetic unit performs an arithmetic operation including addition and multiplication to generate a first value of (n+m) bits. The rounding preprocessor performs an OR operation on lower (m?k) bits of the first value to generate a second value of 1 bit. The register stores a third value of (n+k+1) bits obtained by concatenating upper (n+k) bits of the first value and the second value. The rounding postprocessor calculates a carry bit value of 1 bit from a most significant bit of the third value and lower (k+1) bits of the third value, and adds the carry bit value to upper n bits of the third value.
Abstract: The current application is directed to methods and quantum circuits that prepare qubits in specified non-stabilizer quantum states that can, in turn, be used for a variety of different purposes, including in a quantum-circuit implementation of an arbitrary single-qubit unitary quantum gate that imparts a specified, arbitrary rotation to the state-vector representation of the state of an input qubit. In certain implementations, the methods and systems consume multiple magic-state qubits in order to carry out probabilistic rotation operators to prepare qubits with state vectors having specified rotation angles with respect to a rotation axis. These qubits are used as resources input to various quantum circuits, including the quantum-circuit implementation of an arbitrary single-qubit unitary quantum gate, including a V gate.
Abstract: According to one embodiment of the present invention, a system for compressing data determines a common divisor for a set of values comprising integers. The system divides each value within the set of values by the common divisor to produce reduced values, and represents the set of values in the form of data indicating the common divisor and the reduced values. Embodiments of the present invention further include a method and computer program product for compressing data in substantially the same manners described above.
Type:
Grant
Filed:
June 9, 2014
Date of Patent:
April 4, 2017
Assignee:
INTERNATIONAL BUSINESS MACHINES CORPORATION
Abstract: A true random number generator, a method of generating a true random number and a system incorporating the generator or the method. In one embodiment, the generator includes: (1) a ring oscillator including inverting gates having power inputs and (2) a time-varying power supply coupled to the power inputs to provide power thereto and including power perturbation circuitry operable to perturb the power provided to at least one of the power inputs.
Abstract: A listing of data is displayed in a tablet swiping calculator function display with the listing of data including two or more numerical data entries. A capability to select at least one mathematical operation is provided through the tablet swiping calculator function display along with the capability to select at least two of the two or more numerical data entries through the tablet swiping calculator function display. When the at least two of the two or more numerical data entries are selected, the selected mathematical operation is automatically performed on the selected numerical data entries and the results are displayed on the tablet swiping calculator function display.
Type:
Grant
Filed:
August 26, 2013
Date of Patent:
March 28, 2017
Assignee:
Intuit Inc.
Inventors:
Katy Lee O'Kelley, Jason Wayne Cole, Matthew Patrick Bozeman, Lauren Ashly Felten
Abstract: A semiconductor device includes a plurality of spin units individually including a memory cell configured to store values of spins in an Ising model, a memory cell configured to store an interaction coefficient from an adjacent spin that exerts an interaction on the spin, a memory cell configured to store an external magnetic field coefficient of the spin, and an interaction circuit configured to determine a subsequent state of the spin. The spin units individually include a random number generator configured to supply the random number to the plurality of the spin units and generate two-valued simulated coefficients of two values or simulated coefficients of three values in performing an interaction to determine a subsequent state of a spin of the spin units from a value of a spin from an adjacent spin unit, an interaction coefficient, and an external magnetic field coefficient.
Abstract: According to one embodiment of the present invention, a system for compressing data determines a common divisor for a set of values comprising integers. The system divides each value within the set of values by the common divisor to produce reduced values, and represents the set of values in the form of data indicating the common divisor and the reduced values. Embodiments of the present invention further include a method and computer program product for compressing data in substantially the same manners described above.
Type:
Grant
Filed:
December 30, 2013
Date of Patent:
March 28, 2017
Assignee:
INTERNATIONAL BUSINESS MACHINES CORPORATION
Abstract: Various embodiments are provided for fully digital chaotic differential equation-based systems and methods. In one embodiment, among others, a digital circuit includes digital state registers and one or more digital logic modules configured to obtain a first value from two or more of the digital state registers; determine a second value based upon the obtained first values and a chaotic differential equation; and provide the second value to set a state of one of the plurality of digital state registers. In another embodiment, a digital circuit includes digital state registers, digital logic modules configured to obtain outputs from a subset of the digital shift registers and to provide the input based upon a chaotic differential equation for setting a state of at least one of the subset of digital shift registers, and a digital clock configured to provide a clock signal for operating the digital shift registers.
Type:
Grant
Filed:
February 29, 2012
Date of Patent:
March 21, 2017
Assignee:
King Abdullah University of Science and Technology (KAUST)
Inventors:
Ahmed Gomaa Ahmed Radwan, Mohammed Affan Zidan, Khaled Nabil Salama
Abstract: A method provides support for packed sum of absolute difference operations in a floating point execution unit, e.g., a scalar or vector floating point execution unit. Existing adders in a floating point execution unit may be utilized along with minimal additional logic in the floating point execution unit to support efficient execution of a fixed point packed sum of absolute differences instruction within the floating point execution unit, often eliminating the need for a separate vector fixed point execution unit in a processor architecture, and thereby leading to less logic and circuit area, lower power consumption and lower cost.
Type:
Grant
Filed:
March 18, 2016
Date of Patent:
March 14, 2017
Assignee:
International Business Machines Corporation
Inventors:
Adam J. Muff, Paul E. Schardt, Robert A. Shearer, Matthew R. Tubbs
Abstract: A circuit arrangement and program product provide support for packed sum of absolute difference operations in a floating point execution unit, e.g., a scalar or vector floating point execution unit. Existing adders in a floating point execution unit may be utilized along with minimal additional logic in the floating point execution unit to support efficient execution of a fixed point packed sum of absolute differences instruction within the floating point execution unit, often eliminating the need for a separate vector fixed point execution unit in a processor architecture, and thereby leading to less logic and circuit area, lower power consumption and lower cost.
Type:
Grant
Filed:
March 18, 2016
Date of Patent:
March 14, 2017
Assignee:
International Business Machines Corporation
Inventors:
Adam J. Muff, Paul E. Schardt, Robert A. Shearer, Matthew R. Tubbs
Abstract: The invention discloses a method and controller for processing data multiplication in a RAID system. Map tables are generated for all values in a field, respectively. The length of an XOR operation unit is chosen to be appropriate w bits (e.g., 32 bits or 64 bits). One or several XOR operation units form a multiplication unit of a data sector. When computing on-line, data in a disk drive of a disk array are performed with XOR operations in accordance with one of the map tables using an XOR operation unit as one unit while computing on the multiplication unit to obtain a product of multiplication. Making use of the RAID system established according to the disclosed method, only XOR operations are required to compute parity data or recover damaged user data. Moreover, several calculations can be performed simultaneously. Therefore, the efficiency of the RAID system can be effectively improved.
Abstract: Solving computational problems may include generating a logic circuit representation of the computational problem, encoding the logic circuit representation as a discrete optimization problem, and solving the discrete optimization problem using a quantum processor. Output(s) of the logic circuit representation may be clamped such that the solving involves effectively executing the logic circuit representation in reverse to determine input(s) that corresponds to the clamped output(s). The representation may be of a Boolean logic circuit. The discrete optimization problem may be composed of a set of miniature optimization problems, where each miniature optimization problem encodes a respective logic gate from the logic circuit representation. A quantum processor may include multiple sets of qubits, each set coupled to respective annealing signal lines such that dynamic evolution of each set of qubits is controlled independently from the dynamic evolutions of the other sets of qubits.
Type:
Grant
Filed:
June 23, 2016
Date of Patent:
March 14, 2017
Assignee:
D-Wave Systems Inc.
Inventors:
William G. Macready, Geordie Rose, Thomas F. W. Mahon, Peter Love, Marshall Drew-Brook
Abstract: An apparatus for PLL bandwidth expansion including a compensation filter and a phase locked loop, where the compensation filter is programmed with a compensation function derived based on programmable coefficients and parameters of a transmitting device, a frequency response of the phase locked loop, and a wanted frequency response.
Abstract: This invention is a digital signal processor form plural sums of absolute values (SAD) in a single operation. An operational unit performing a sum of absolute value operation comprising two sets of a plurality of rows, each row producing a SAD output. Plural absolute value difference units receive corresponding packed candidate pixel data and packed reference pixel data. A row summer sums the output of the absolute value difference units in the row. The candidate pixels are offset relative to the reference pixels by one pixel for each succeeding row in a set of rows. The two sets of rows operate on opposite halves of the candidate pixels packed within an instruction specified operand. The SAD operations can be performed on differing data widths employing carry chain control in the absolute difference unit and the row summers.
Type:
Grant
Filed:
July 9, 2014
Date of Patent:
February 28, 2017
Assignee:
TEXAS INSTRMENTS INCORPORATED
Inventors:
Mujibur Rahman, Djordje Senicic, Timothy D. Anderson
Abstract: An FMA unit, for carrying out an arithmetic operation in a model computation unit of a control unit, is configured to process input of two factors and one summand in the form of floating point values, and provide a computation result of such processing as an output variable in the form of a floating point value. The FMA unit is designed to carry out a multiplication and a subsequent addition, the bit resolutions of the inputs for the factors being lower than the bit resolution of the input for the summand and the bit resolution of the output variable.
Abstract: A random number generator and a method for generating random number thereof are provided. The random number generator is used for generating a random sequence and includes a linear-feedback shift register (LFSR) circuit, an oscillating circuit, a delay circuit and a logic operation circuit. The LFSR circuit receives the random sequence to generate a plurality of first control signals and a plurality of second control signals. The oscillating circuit receives the first control signals to generate a random clock signal. The delay circuit receives an alternating current signal and the second control signals to generate a random delay sampling signal. The logic operation circuit receives the random clock signal and the random delay signal to generate the random sequence.
Abstract: Disclosed herein is a shared memory systems that use a combination of SBR and MRRR techniques to calculate eigenpairs for dense matrices having very large numbers of rows and columns. The disclosed system allows for the use of a highly scalable tridiagonal eigensolver. The disclosed system likewise allows for allocating a different number of threads to each of the different computational stages of the eigensolver.
Abstract: A computer system is operable to identify subfields that differ in two data elements using a bit matrix compare function between a first matrix filled with pattern elements and a reference pattern.
Abstract: Where G and H are cyclic groups, M is an integer of two or more, i=1, . . . , M, f is a homomorphic function of mapping a member xi of group H to group G, Ri and R0 are random variables with a value in group G, ri is a realized value of the random variable Ri,, r0 is a realized value of the random variable R0, and ai is a random number of an integer of 0 or more, a random number generation unit 11 generates random numbers a1, a2, . . . , aM. A sampler 21 is capable of calculating f(x1)r1, f(x2)r2, . . . , f(xM)rM to obtain a calculation result thereof as z1, z2, . . . , zM, respectively. A power calculation unit 12 calculates (z1)a1, (z2)a2, . . . , (zM)aM. An extended randomizable sampler 22 is capable of calculating f(x1a1×x2a2× . . . ×xMaM)r0 to obtain a calculation result z0 thereof. A determination unit 16 determines whether or not (z1)a1×(z2)a2× . . . ×(zM)aM=z0.
Type:
Grant
Filed:
March 2, 2012
Date of Patent:
January 10, 2017
Assignee:
NIPPON TELEGRAPH AND TELEPHONE CORPORATION