Class / Patent application number | Description | Number of patent applications / Date published |
708440000 | Evaluation of trigonometric function | 25 |
20090070398 | Method and Apparatus for an Area Efficient Transcendental Estimate Algorithm - A method, computer-readable medium, and an apparatus for generating a transcendental value. The method includes receiving an input containing an input value and an opcode and determining whether the opcode corresponds to a trigonometric operation or a power-of-two operation. The method also includes calculating a fractional value and an integer value from the input value, generating the transcendental value based on the fractional value by adding at least a portion of the fractional value with at least one of a shifted fractional value produced by shifting the portion of the fractional value and a constant value, and providing the transcendental value in response to the request. In this fashion, the same circuit area may be used to carry out both trigonometric and power-of-two calculations, leading to greater circuit area savings and performance advantages while not sacrificing significant accuracy. | 03-12-2009 |
20090089349 | Angle Computation Method and Related Circuit - Computing an angle between a real part and an imaginary part of a complex number includes receiving complex number data; generating a first value, a second value and a determination result according to the complex number data; choosing a dividend and a divisor of a division operation from the first value and the second value for generating a division result according to magnitudes of the first value and the second value; performing table look-up for the division result to generate a table look-up result according to a preserved table; and adjusting the table look-up result for generating an angle corresponding to the complex number data according to the determination result. | 04-02-2009 |
20090094306 | CORDIC ROTATION ANGLE CALCULATION - A computer-implemented method for performing a calculation using a coordinate rotation digital computer (CORDIC) algorithm. A step of the coordinate rotation digital computer algorithm is performed. As a result of performing the step, a value of the coordinate rotation digital computer algorithm is reduced. The value is shifted using a physical adder. A set of bits of the physical adder is disabled, wherein the set of bits corresponds to at least one high order zero of the value. | 04-09-2009 |
20100023570 | Method of detection of signal homeostasis - A method for detecting steady-state convergence of noisy or noise free signal comprising the steps of calculating derivative of signal input, calculating the tan inverse of the ratio of positive and negative derivatives and validation of establishment of steady state from the arctan value thereof. | 01-28-2010 |
20100241682 | DEAD RECKONING FOR COORDINATE CONVERSION - Novel methods for converting coordinates for a position from a first coordinate system into coordinates in a second coordinate system are provided. Linear approximations of trigonometric functions are used to calculate values for the trigonometric functions when a position to be converted is within an acceptable bound of a previous position and more precise values of the trigonometric functions are used to perform the conversion when the position to be converted is not within an acceptable bound of a previous position. The present invention can be advantageously utilized to reduce the computation load in a distributed simulation environment, such as a federation of distributed interactive simulations. | 09-23-2010 |
20100293215 | DETERMINATION OF SINE WAVE PERIOD - An object ranging system operates by transmitting pulses derived from a frequency-swept signal and determining the beat frequency of a combination of the frequency-swept signal and its reflection from an object. To determine the range of close objects the beat frequency is determined in the time domain by integrating samples of the beat frequency signal to obtain a value representing the integral of a half cycle of the sine wave, establishing integration thresholds representing when, according to the integration value, the sine wave would have reached predetermined stages in its cycle, and measuring the time taken for the integral of the sine wave to change from one threshold to another, this time thereby indicating the period of the beat frequency. | 11-18-2010 |
20110320513 | CALCULATION OF TRIGONOMETRIC FUNCTIONS IN AN INTEGRATED CIRCUIT DEVICE - Circuitry for computing a trigonometric function of an input includes circuitry for relating the input to another value to generate an intermediate value, circuitry for selecting one of the input and the intermediate value as a trigonometric input value, circuitry for determining respective initial values of a plurality of trigonometric functions for the trigonometric input value, and circuitry for deriving, based at least in part on a trigonometric identity, a final value of the first trigonometric function from the respective initial values of the plurality of trigonometric functions. The trigonometric function may be any of sine, cosine and tangent and their inverse functions. The trigonometric identities used allow a computation of a trigonometric function to be broken into pieces that either are easier to perform or can be performed more accurately. | 12-29-2011 |
20120265796 | Double-Step CORDIC Processing for Conventional Signed Arithmetic With Decision Postponing - A double-step CORDIC algorithm is implemented for conventional signed arithmetic using multiple iteration stages in which at least one stage implements decision postponing, in which the decision for each stage is delayed until the next stage. In one implementation, the decision for the previous stage is implemented in parallel with the execution of CORDIC equation functions for the current stage. Implementing the double-step CORDIC with decision postponing algorithm can increase the speed of the CORDIC function compared to prior-art CORDIC implementations. | 10-18-2012 |
20130060829 | METHOD AND APPARATUS FOR ADDITIVE RANGE REDUCTION - A method and apparatus for additive range reduction are disclosed. A constant may be pre-stored in a look-up table (LUT), and at least one section of the constant may be retrieved from the LUT for generating a product of an input argument and the constant such that a precision of the product may be controlled in any granularity. For a trigonometric function, 2/π is stored in the LUT, and at least one section of 2/π may be retrieved from the LUT. The argument is multiplied with the retrieved sections of 2/π. The retrieved sections are determined to correctly generate the two least significant bits (LSBs) of an integer portion and a scalable number of most significant bits of the multiplication result. An output of the trigonometric function is generated for the argument with a fractional portion of the multiplication result based on two LSBs of the integer portion of the multiplication result. | 03-07-2013 |
20130097214 | PROCESSOR AND OPERATING METHOD - Disclosed is a processor that is able to efficiently execute DFT operations without having part of a basic operational circuit idle even during non-DFT-operation processing. The processor ( | 04-18-2013 |
20140019505 | TRANSFER FUNCTION ESTIMATION APPARATUS, METHOD AND PROGRAM - An apparatus for estimating a transfer function of at target object having divided systems is disclosed. The apparatus acquires an estimation equation to estimate the transfer function of the target object, and determines, for each arithmetic operation in the estimation equation, whether the arithmetic operation is an addition or a multiplication. For the multiplication, the apparatus performs the multiplication of frequency response characteristics in the frequency domain. For addition, the apparatus converts the frequency response characteristics into time response characteristics, performs the addition of the time response characteristics in the time domain, and reconverts a result of the addition into the frequency domain. | 01-16-2014 |
20140195579 | Efficient Angle Rotator Configured for Dynamic Adjustment - An apparatus and method for angle rotation is disclosed to rotate a complex input by the angle θ to produce a rotated complex output signal. A memory storage device generates control information based on a coarse angle θ | 07-10-2014 |
20150355882 | COORDINATE TRANSFORMATION DEVICE, NON-TRANSITORY COMPUTER READABLE MEDIUM STORING COORDINATE TRANSFORMATION PROGRAM, AND COORDINATE TRANSFORMATION METHOD - Provided are a coordinate transformation device, a coordinate transformation program, and a coordinate transformation method which are capable of calculating coordinates on a spheroid at a high speed and with a minimum error. A geographical information management device includes a storage device and a operation unit. The storage device stores a basic shape database, an airspace information database, and a parameter information database. The operation unit generates a formula for performing coordinate transformation processing by substituting a transformation parameter included in the parameter information database into a predetermined formula, transforms information indicating coordinates on a spheroid into coordinates on a true sphere by substituting, into the generated formula, information specifying the shape of the spheroid included in the basic shape database and information indicating coordinates on the spheroid included in the airspace information database, and outputs the transformed information indicating coordinates on the true sphere. | 12-10-2015 |
708441000 | Vector resolver | 12 |
20080215657 | Messaging Method - This invention relates to a short message format that captures useful information embedded in a data vector of a sequence of symbols or numbers. The data vector may represent many different forms of information generated by various electronic and information systems. This short message format is particularly useful when bandwidth limited communication links are used to transmit a data set that can be represented as a set of data vectors that is true for essentially all types of data. Described herein is an algorithm formulated to be useful for data communications problems associated with bandwidth limited communications links. | 09-04-2008 |
20080313252 | Sphere Decoder and Decoding Method Thereof - A sphere decoder sets a Euclidean distance between a lattice vector obtained by using an MMSE or ZF estimate and a received signal as an initial radius, further reduces the initial radius, and searches lattices points included inside a hypersphere with the further reduced initial radius. In addition, one lattice vector having a minimum Euclidean distance is output. One dimension is selected to reduce an initial radius, and estimates in other dimensions are kept fixed, excluding the selected dimension. Then candidate lattice points are searched in the selected dimension, excluding a current estimate, such that a minimum Euclidean distance and a lattice point estimate corresponding to the minimum Euclidean distance are obtained. The initial radius is updated by the minimum Euclidean distance, and a final lattice vector is constructed by combining a lattice point estimate corresponding to the initial radius and the lattice point estimates in other dimensions. | 12-18-2008 |
20090037507 | Acceleration of multidimensional scaling by vector extrapolation techniques - A method for multidimensional scaling (MDS) of a data set comprising a plurality of data elements is provided, wherein each data element is identified by its coordinates, the method comprising the steps of: (i) applying an iterative optimization technique, such as SMACOF, a predetermined amount of times on a coordinates vector, said coordinates vector representing the coordinates of a plurality of said data elements, and obtaining a modified coordinates vector; (ii) applying a vector extrapolation technique, such as Minimal Polynomial Extrapolation (MPE) or reduced Rank Extrapolation (RRE) on said modified coordinates vector obtaining a further modified coordinates vector; and (iii) repeating steps (i) and (ii) until one or more predefined conditions are met. | 02-05-2009 |
20090094307 | ACCURACY IMPROVEMENT IN CORDIC THROUGH PRECOMPUTATION OF THE ERROR BIAS - Performing a calculation using a coordinate rotation digital computer (CORDIC) algorithm. Execution of the CORDIC algorithm is begun. An error introduced by a truncated vector as a result of executing the CORDIC algorithm is pre-computed. The error is incorporated into a subsequent iteration of the CORDIC algorithm. Execution of the CORDIC algorithm is completed. The result of the CORDIC algorithm is stored. | 04-09-2009 |
20090172063 | Multi-Threaded Codeless User-Defined Functions - A multi-threaded codeless user-defined function (UDF) may be provided. First, at least one input value may be received from a calculation thread corresponding to a spreadsheet calling the codeless UDF. Then, the at least one input value may be saved in a thread storage area outside of a UDF storage area containing the codeless UDF. Next, the codeless UDF may be performed comprising performing at least one calculation using at least one formula in the codeless UDF and the at least one input value from the thread storage area. At least one output value produced in response to performing the codeless UDF may then be returned to the calculation thread corresponding to the spreadsheet calling the codeless UDF. | 07-02-2009 |
20110010408 | CORDIC COMPUTATION CIRCUIT AND METHOD - Disclosed is a CORDIC circuit in which scale correction process is divided into two stages: rough correction and fine correction, and a second-process of a pseudo-rotation process is performed in parallel with the fine scale correction. A range of the fine scale correction is set so that it is not necessary to perform a scale correction with regard to a remaining rotation angle of the first half of the pseudo-rotation process. | 01-13-2011 |
20110040820 | Secure Multi-Party Computation of Normalized Sum-Type Functions - Embodiments of present invention disclose a system and a method for determining a result of a function applied to a first vector and a second vector, wherein the function is a normalized sum-type function. The first vector is stored at a first processor, and the second vector is stored at a second processor. The system and the method determine a joint empirical probability distribution (JEPD) of the first vector and the second vector using a secure multi-party computation. The function is determined as a normalized summation of products of values of the JEPD with corresponding values of the function. | 02-17-2011 |
20130246493 | SYSTEMS AND METHODS FOR WAVEFRONT ANALYSIS OVER CIRCULAR AND NONCIRCULAR PUPILS - Systems, methods, and software for determining a set of analytical or numerical polynomials that is orthonormal over circular or noncircular pupils are described. Closed-form orthonormal polynomials for circular, annular, hexagonal, elliptical, rectangular, and square pupils are derived. Such techniques can be applied to ray tracing as in the optical design and wavefront fitting from measurement as in the optical testing. These approaches can also be applied to wavefront reconstruction in adaptive optics. | 09-19-2013 |
20130311530 | APPARATUS AND METHOD FOR SELECTING ELEMENTS OF A VECTOR COMPUTATION - An apparatus and method are described for performing a vector reduction. For example, an apparatus according to one embodiment comprises: a reduction logic tree comprised of a set of N-1 reduction logic blocks used to perform reduction in a single operation cycle for N vector elements; a first input vector register storing a first input vector communicatively coupled to the set of reduction logic blocks; a second input vector register storing a second input vector communicatively coupled to the set of reduction logic blocks; a mask register storing a mask value controlling a set of one or more multiplexers, each of the set of multiplexers selecting a value directly from the first input vector register or an output containing a processed value from one of the reduction logic blocks; and an output vector register coupled to outputs of the one or more multiplexers to receive values output passed through by each of the multiplexers responsive to the control signals. | 11-21-2013 |
20140164461 | Method and Apparatus for Iteratively Calculating a Value - A method and an apparatus are described which determine at least one output value based on at least one input value. The input value is provided to a processing unit, wherein a combination of intermediate values is iteratively calculated. Each intermediate value is calculated during an iteration such that the intermediate value for each iteration is buffered, using a buffer storage. Based on the combination of the buffered intermediate values a storage is accessed, the storage storing a plurality of first output values, each first output value associated with a respective combination of the buffered intermediate values, so that the first output value is output. | 06-12-2014 |
20150095390 | Determining a Product Vector for Performing Dynamic Time Warping - A method and a system for determining a product vector for computation of a Euclidean distance for performing dynamic time warping of a test signal and a template signal are provided. Low-rank factorized vectors for the test signal are determined. The low-rank factorized vectors are processed along with the template signal for determining the product vector. The product vector is thereafter usable for the determination of a Euclidean distance between the test signal and the template signal, and for performing dynamic time warping of the test signal and the template signal. | 04-02-2015 |
20150095391 | Determining a Product Vector for Performing Dynamic Time Warping - A method and a system for determining a product vector for computation of a Euclidean distance for performing Dynamic Time Warping of a test signal and a template signal are provided. Low-rank factorized vectors are determined for the template signal. The low-rank factorized vectors are processed along with the test signal for determining the product vector. The product vector is thereafter usable for the determination of a Euclidean distance between the test signal and the template signal, and for performing dynamic time warping of the test signal and the template signal. | 04-02-2015 |