| Entries |
| Document | Title | Date |
|---|
| 20080208942 | Parallel Architecture for Matrix Transposition - An extension to current multiple memory bank video processing architecture is presented. A more powerful memory controller is incorporated, allowing computation of multiple memory addresses at both the input and the output data paths making possible new combinations of reads and writes at the input and output ports. Matrix transposition computations required by the algorithms used in image and video processing are implemented in MAC modules and memory banks. The technique described here can be applied to other parallel processors including future VLIW DSP processors. | 08-28-2008 |
| 20080208943 | Data transform method and apparatus, data processing method and apparatus, and program - When sample data is played back, audio guide data G | 08-28-2008 |
| 20080215652 | Constellation-Multiplexed Transmitter and Receiver - A device of dynamic communication of information allows, on the average, non-integer bits per symbol transmission, using a compact code set or a partial response decoding receiver. A stream of selectable predetermined integer bits, e.g., k or k+1 data bits, is grouped into a selectable integer number of bit vectors which then are mapped onto corresponding signal constellations forming transmission symbols. Two or more symbols can be grouped and further encoded, so that a symbol is spread across the two or more symbols being communicated. Sequence estimation using, for example, maximum likelihood techniques, as informed by noise estimates relative to the received signal. Each branch metric in computing the path metric of a considered sequence at the receiver is weighted by the inverse of the noise power. It is desirable that the constellation selection, sequence estimation and noise estimation be performed continuously and dynamically. | 09-04-2008 |
| 20080215653 | Data Processing Device with Multi-Endian Support - A data processing device includes at least one first and one second component which are coupled to one another. The first component is operable in a first endian mode, while the second component is operable in a second endian mode, which is different from the first endian mode. | 09-04-2008 |
| 20080235312 | Method and Arrangement For Suppressing Noise in Digital Signal Sequences and a Corresponding Computer Program and a Corresponding Computer-Readable Storage Medium - The present invention relates to a method and an arrangement for suppressing noise in digital signal sequences, and to a corresponding computer program and a corresponding computer-readable storage medium, which can be used in particular to smooth and/or improve the signal-to-noise ratio in digital signal processing and in digital image processing. To this end, there is proposed a method for suppressing noise in digital signal sequences, wherein data values W | 09-25-2008 |
| 20080235313 | SIGNAL PROCESSING METHOD AND SIGNAL PROCESSING CIRCUIT - A signal processing method includes a first step of calculating a value indicating a value obtained by multiplying a ratio of the number of times of inputting the input signal having any one of values from p to m, where m is a maximum value of values of input signal which are subject to said signal processing and p is a value smaller than m and not a minimum value of the input signal, within a predetermined period to the number of times of inputting the input signal within the predetermined period, by the variable range of the converted value; and a second step of subtracting the calculated value from a maximum value within the variable range of the converted value or a value near the maximum value, wherein the input signal is converted according to the conversion characteristic specified based on a value obtained by subtraction. | 09-25-2008 |
| 20080270504 | Method and System for Filtering of Networked, Synchronized Measurements - A system processes discrete digital data according to a function, the discrete digital data including data values and time stamps, the time stamps being at non-uniform time intervals according to a time scale. The system comprises a processor having program instructions for implementing the function in terms of state space equations, using system design and data flow language software; inputting the discrete data into the implementation of the function; and outputting the result as an output discrete data stream of new data values and time stamps. | 10-30-2008 |
| 20080301212 | REAL TIME UNIVERSAL DATE AND TIME CONVERSION - A method and system makes date-time conversions and complex date-time calculations between dates of different calendaring systems. The conversion method herein allows embedded, real-time conversion in computer applications and systems between multiple calendaring systems. A date of a first date-time format is converted to any date of a second date-time format after a transformation to a temporal reference or epoch date. The conversion method can be embedded into any code space to enable full date-time conversion abilities. The real-time conversion of the conversion method requires no conversion tables and no post-processing manipulation thus eliminating the need for individual programmers to re-create the same date cross reference tables, or post processing algorithms. The conversion method supports conversion between any two date-time formats including the various existing Gregorian conventions. | 12-04-2008 |
| 20090055458 | Substitution Boxes - A multiple-input multiple-output s-box receives a contiguously numbered input bits ( | 02-26-2009 |
| 20090063603 | APPARATUS AND METHOD FOR TIME-SERIES STORAGE WITH COMPRESSION ACCURACY AS A FUNCTION OF TIME - The present invention provides a system and method for time-series with compression accuracy as a function of time. Briefly described, in architecture, one embodiment of the system, among others, can be implemented as follows. The system includes a computer with a processor. The system performs a method receiving a data set on the computer, utilizing a plurality of filter banks to transform the data set into a plurality coefficients, wherein each coefficient is associated with a basis function, and quantizing the plurality of coefficients, wherein the quantization maps the plurality of coefficients into certain value ranges. Then, system further performs determining a threshold based upon each coefficient effect on a time domain, disregarding the coefficient that fall below the threshold, and storing any remaining coefficients as compressed data for the data set. | 03-05-2009 |
| 20090112958 | Processes and apparatus for deriving order-16 integer transforms - Apparatus, systems and techniques based on an integer transform for encoding and decoding video or image signals, including apparatus, systems and techniques for deriving an order-16 integer transform from an order-8 integer transform in image and video coding. In some implementations, eight additions and eight subtractions are used to assign the data elements to be transformed to an intermediate matrix; and then two fast algorithms for the computation of the order-8 transform may be applied to the first 8 vectors of the intermediate matrix, and the last 8 vectors of the intermediate matrix, respectively. The derived order-16 integer transform tends to produce small magnitude and high frequency transformed coefficients, and thus achieve high compressibility. | 04-30-2009 |
| 20090157784 | DETERMINING A MESSAGE RESIDUE - A description of techniques of determining a modular remainder with respect to a polynomial of a message comprised of a series of segments. An implementation can include repeatedly accessing a strict subset of the segments and transforming the strict subset of segments to into a smaller set of segments that are equivalent to the strict subset of the segments with respect to the modular remainder. The implementation can also include determining the modular remainder based on a set of segments output by the repeatedly accessing and transforming and storing the determined modular remainder. | 06-18-2009 |
| 20090198756 | REPRESENTATION OF DATA TRANSFORMATION PROCESSES FOR PARALLELIZATION - One or more operations are defined to be used against a repository of one or more items. One or more associations between each of the one or more items are also defined. A classification is associated with the one or more operations for an execution environment within a transformation graph, wherein the classification defines whether the operation can be executed in parallel or not in parallel with other operations. The operations are processed based on the classification. | 08-06-2009 |
| 20090210470 | APPARATUS AND METHODS FOR LOSSLESS COMPRESSION OF NUMERICAL ATTRIBUTES IN RULE BASED SYSTEMS - Disclosed are apparatus and methods for compressing a set of numerical values for a set of feature values, which can be utilized by a rule based or decision tree system. In certain embodiments, the numerical values are transformed into a subset of integer values based on how they are to be analyzed by conditional processes of the rule based or decision tree system that compare such numerical values to one or more threshold values. This transformation is accomplished such that if the rule based or decision tree system is applied after transformation, identical results are produced as compared to the original numerical values being used by the rule based or decision tree system. Other compression techniques may also be applied to the transformed values. An altered rule based or decision tree system, in which threshold values are also transformed to integer values, may be applied to the transformed values. Alternatively, the rule based or decision tree system may be applied to a set of decoded numerical values. | 08-20-2009 |
| 20090210471 | METHOD FOR TRANSFORMING DATA STREAM AND COMMUNICATION SYSTEM THEREOF - A method for transforming a data stream and a communication system thereof are provided. In a second communication terminal, a padding data of the data stream of a first communication terminal is checked whether it corresponds to a default value so as to determine whether a first bit order used for the data stream of the first communication terminal is consistent with a second bit order used for a data stream of the second communication terminal. When the padding data does not correspond to the default value, the data stream transmitted from the first communication terminal is transformed from the first bit order to the second bit order by the second communication terminal. | 08-20-2009 |
| 20090248773 | METHOD AND APPARATUS FOR SIGNAL TRANSFORMATION FOR POSITIONING SYSTEMS - A method and apparatus for signal transformation for positioning control in positioning systems is provided. The positioning involves performing a signal transformation by determining a transform and an inverse transform between a triangular reference signal and a model reference signal with less frequency content, for transforming the triangular reference signal into a ramp signal; and providing a controller including a double integral module, configured for tracking the model reference signal with zero steady state error, for controlling a positioning system. | 10-01-2009 |
| 20090327386 | COMBINED DEBLOCKING AND DENOISING FILTER - An apparatus, a computer readable medium to instruct a process to implement a method, and a method of reducing blocking artifacts and/or noise in an image that has been compressed by a block-based encoding process. The method includes deblocking the image using overlapped forward directional transforms, the overlapped forward directional transforms including directional selecting to filter across horizontal and vertical boundaries, denoising the image, in one version edge detecting to classify individual pixels as to whether or not they belong to edge features, and generating output pixels by locally adapting to whether the pixels are in block boundaries, and/or include edge features. | 12-31-2009 |
| 20100011039 | Device and method for solving a system of equations - A system of equations with a Toeplitz coefficient matrix [T] can be efficiently solved by approximating the coefficient matrix [T] with an approximately Toeplitz coefficient matrix [T | 01-14-2010 |
| 20100011040 | Device and method for solving a system of equations characterized by a coefficient matrix comprising a Toeplitz structure - A device comprising digital circuits for calculating an unknown solution vector X in a system of equations with a known coefficient matrix T and a known vector Y, has a first vector transformer for calculating a transformed known vector Yt from said known vector Y, and a second vector transformer for calculating said unknown solution vector X from a transformed unknown solution vector Xt; a system solver comprising means for calculating said transformed unknown solution vector Xt from elements contained in a matrix Ttapp, and from elements contained in said transformed known vector Yt; a matrix separator for calculating a plurality of matrices C from said coefficient matrix T, and for calculating a plurality of transformed matrices Ct by calculating matrix products that comprise a transform matrix F and each of said plurality of matrices C; and a coefficient matrix transformer comprising means for calculating said matrix Ttapp from said plurality of transformed matrices Ct. | 01-14-2010 |
| 20100011041 | Device and method for determining signals - Many signal processing devices require the solution to a system of equations with a Toeplitz, or block Toeplitz, coefficient matrix. This solution can be obtained with increased efficiency by separating the initial system of equations into a number of systems of equations with reduced dimensions. The solution to the initial system of equations is then calculated from the solutions to the systems of equations with reduced dimensions. | 01-14-2010 |
| 20100011042 | Method and Apparatus for Efficient Integer Transform - A method and apparatus for including in a processor instructions for performing integer transforms including multiply-add operations and horizontal-add operations on packed data. In one embodiment, a processor is coupled to a memory that stores a first packed byte data and a second packed byte data. The processor performs operations on said first packed byte data and said second packed byte data to generate a third packed data in response to receiving a multiply-add instruction. A plurality of the 16-bit data elements in this third packed data storing the result of performing multiply-add operations on data elements in the first and second packed byte data. The processor adds together at least a first and a second 16-bit data element of the third packed data in response to receiving an horizontal-add instruction to generate a 16-bit result as one of a plurality of data elements of a fourth packed data. | 01-14-2010 |
| 20100049778 | METHOD AND APPARATUS FOR SELECTIVELY REDUCING NOISE IN A DIGITAL SIGNAL - Wavelet thresholding using discrete wavelet transforms is a sophisticated and effective approach for noise reduction. However, usage of integer arithmetic implies that not the full range of input values can be used. A method for selectively reducing noise in a digital signal having a first range of values comprises steps of decomposing the digital signal to a plurality of frequency sub-bands, wherein before, during or after the decomposing the digital signal or at least one sub-band is expanded by one or more bits to a second range of integer values, removing in at least one of the frequency sub-bands values that are below a threshold, re-combining the frequency sub-bands, after removing said values that are below a threshold, into an expanded output signal, and de-expanding the expanded output signal, wherein a signal having the first range of values is obtained. | 02-25-2010 |
| 20100057822 | INVERSE TRANSFORMATION LOADING - An inverse transformation and/or identification thereof is transmitted to a receiver to enable interpretation of transformed data. Rather than requiring installation of a transform on a sender and an inverse transform on a receiver prior to communication, an appropriate inverse transformation can be provided to and executed by a receiving component as needed. In accordance with one aspect, a transformation and associated inverse are selected dynamically as a function of context to minimize or maximize some parameter, for instance. | 03-04-2010 |
| 20100077015 | Generating a Hash Value from a Vector Representing a Data Object - To generate at least one hash value for a feature vector that represents a data object, a discrete orthogonal transform is applied on a second vector produced from the feature vector. Applying the discrete orthogonal transform on the second vector produces a third vector. At least one value is selected from the third vector to produce the hash value. The at least one hash value is used to perform an action. | 03-25-2010 |
| 20100077016 | Estimating a Signal Based on Samples Derived from Random Projections - A system and method for estimating a signal based on a stream of randomly generated samples. The method includes: (a) receiving a sample; (b) generating a sampling vector; (c) multiplying the sample and the sampling vector to obtain a current back projection; (d) computing a first intermediate vector that represents an average of the current back projection and previous back projections; (e) transforming the first intermediate vector to determine a second intermediate vector; (f) identifying locations where the second intermediate vector attains its k largest values; (g) computing an estimate for the transformation of the signal by solving a system of equations based on the identified locations, the received sample value, previously received sample values, the sampling vector and previously generated sampling vectors; (h) inverse transforming the transformation estimate to determine an estimate of the signal; and (i) storing the signal estimate. | 03-25-2010 |
| 20100082721 | IMAGE AND AUDIO TRANSFORM METHODS - Inverse discrete cosine transform (type-III DCT), used in video/image and audio coding, is implemented in the form of FFT to lower computational complexity. | 04-01-2010 |
| 20100161698 | METHOD AND SYSTEM FOR ORTHOGONALIZING INPUT SIGNALS - A method for the orthogonalization of initially overlapping vectors, the uses for which include the re-encoding and decoding of representations triggered by sensory arrays. | 06-24-2010 |
| 20100262642 | METHODS AND APPARATUS FOR GENERATING SIGNATURES - Methods, apparatus, and articles of manufacture for media monitoring are disclosed. In particular, the example methods, apparatus, and articles of manufacture generate signatures. Initially, a first plurality of filtered values are identified by performing a wavelet transform on a first frame of media samples. A first energy value is determined based on a first portion of the first plurality of filtered values, and a second energy value is determined based on a second portion of the first plurality of filtered values. A first descriptor of the first frame of media samples is determined based on a comparison of the first energy value and the second energy value. A first signature is generated based on the first descriptor. | 10-14-2010 |
| 20100268753 | INVERSE LAPLACE TRANSFORM PROGRAM, PROGRAM FOR FORMING TABLE FOR INVERSE LAPLACE TRANSFORM, PROGRAM FOR CALCULATING NUMERICAL SOLUTION OF INVERSE LAPLACE TRANSFORM, AND INVERSE LAPLACE TRANSFORM DEVICE - A table forming unit calculates, in a weighted reproducing kernel Hilbert space formed of an absolutely continuous function that is zero at an origin, solutions of simultaneous equations obtained by discretization of an integral equation of the second kind derived from Tikhonov regularization method with a weighted square integrable space used as an observation space, and forms an H table describing information including numerical solution of the integral equation of the second kind based on the solutions of the simultaneous equations. An inverse transform unit obtains, by numerical calculation, an inner product, in the weighted square integrable space, of the numerical solution of the integral equation of the second kind and a Laplace transform image multiplied by a mollifier function with reference to the H table. | 10-21-2010 |
| 20100299382 | ARITHMETIC CIRCUIT AND POWER SAVING METHOD - An arithmetic circuit includes a rearranging unit that rearranges input signals sequentially inputted to the rearranging unit, so that current input signals do not change from immediately previous input signals, and an arithmetic processing unit that performs an arithmetic process on the rearranged input signals rearranged by the rearranging unit. | 11-25-2010 |
| 20110055305 | Proximity detection device and proximity detection method - The device includes plural transmitting electrodes and receiving electrodes, a multiline driving unit that simultaneously applies periodic alternating voltages to at least two electrodes of the transmitting electrodes, a current measurement unit, a computing unit, and a control unit. The computing unit includes a linear computing unit that performs linear computation to convert the current values or amounts of accumulated charge measured in the current measurement unit into values in response to the electrostatic capacitances of the respective intersections between the transmitting electrodes and the receiving electrodes, and a proximity computing unit that obtains the approach determination or the approach position of the object toward the detection area from an output of the linear computing unit. The linear computing unit includes a memory unit that stores an interim result of the computation to be read out at plural times. | 03-03-2011 |
| 20110082894 | EXPLOITATION OF TOPOLOGICAL CATEGORIZATION OF CHAOTIC AND FRACTAL FUNCTIONS, INCLUDING FIELD LINE CALCULATIONS - A topological categorization method, based on inclusive intervals, provides a general method of analyzing escape topologies for discrete dynamic systems, in complex and higher dimensions, including the calculation of both potential for complex and hypercomplex and field lines for complex iterations. | 04-07-2011 |
| 20110270904 | Systems And Methods For Estimating A Wavelet Transform With A Goertzel Technique - Systems and methods for processing a signal by estimating a wavelet transform of the signal using at least one scale that is associated with at least one data sample are provided. The systems and methods employ a Goertzel technique to estimate the wavelet transform without using any convolution operations. | 11-03-2011 |
| 20120047191 | COMPARING BOOLEAN FUNCTIONS REPRESENTING SENSOR DATA - According to certain embodiments, a first Boolean function and a second Boolean function are received. The first Boolean function represents a first data set, and the second Boolean function represents a second data set. The first Boolean function and the second Boolean function are transformed to a first arithmetic function and a second arithmetic function, respectively. A first hash code and a second hash code are calculated from the first arithmetic function and the second arithmetic function, respectively. If the first hash code equals the second hash code, the first Boolean function and the second Boolean function are designated as equivalent; otherwise, the first Boolean function and the second Boolean function are designated as not equivalent. | 02-23-2012 |
| 20120136910 | Hardware And Method Of Numerical Integration - A system, method and chip for transforming data through a Rung-Kutta integration of a single point on a plane defined by X, Y, and Z values along X, Y and Z axes from a travel time data volume. The system includes at least one memory bank and at least one alternate memory bank and at least one single cycle Runge-Kutta travel time generator in communication with the memory banks. The single cycle Runge-Kutta travel time generator reads data from the at least one memory bank, and transforms the data by performing a Runge-Kutta integration on points of a plane defined by X, Y, and Z values along X, Y and Z axes in a travel time data volume and slowness data to generate another plane of values with the integration carried forward by a half step; and writes the data back to the at least one alternate memory bank. | 05-31-2012 |
| 20120158811 | Method For Transforming Input Data And Medical Device - A method is disclosed for transmitting measurement data from a transmitter system to a receiver system by way of a transmission link of a medical device. In an embodiment, the measurement data, as input data of a transformation method, is transformed to output values and, after transmission, back transformed again, the values of the input data lying between a maximum value and a minimum value and an assignment function being used for compression purposes, to allocate an output value to every value of the input data, a root function being used as the assignment function for at least some of the values. | 06-21-2012 |
| 20120173602 | CHAOTIC AND FRACTAL FIELD LINE CALCULATIONS USING DECOMPOSITION AND SELF WINDING - Faster methods for topological categorization and field line calculations are developed by using decomposition regions together with the self-winding techniques first developed in a prior patent application. A point iteration technique provides direct calculation of low order digits of winding counts without use of complex intervals. Easy to calculate derivatives define decomposition interval boundaries which substitute for methods using the slower complex interval processing of the prior patent. Methods common to this and the prior patent are developed for visualizing conformal mappings of iterated functions. | 07-05-2012 |
| 20130007083 | SYSTEMS AND METHODS FOR COMPUTING CONTINUOUS WAVELET TRANSFORM ON A DEDICATED INTEGRATED CIRCUIT - Methods and systems are disclosed for computing one or more continuous wavelet transforms on a dedicated integrated circuit. The systems comprise an integrated circuit having a receiver, memory, and processing circuitry. The receiver receives input data corresponding to an input signal. The memory stores information corresponding to one or more wavelet functions scaled over a set of scales. The processing circuitry is configured to compute, in-parallel, various portions of a single continuous wavelet transform of the input signal based on the received input data and the stored information corresponding to a single wavelet function computed over a set of scales. | 01-03-2013 |
| 20130117343 | Unified Forward and Inverse Transform Architecture - Multiple transform sizes improve video coding efficiency, but also increase the implementation complexity. Furthermore, both forward and inverse transforms need to be supported in various consumer devices. Embodiments provide a unified forward and inverse transform architecture that supports computation of both forward and inverse transforms for multiple transforms sizes using shared hardware circuits. The unified architecture exploits the symmetry properties of forward and inverse transform matrices to achieve hardware sharing across different the transform sizes and also between forward and inverse transform computations. | 05-09-2013 |
| 20130144922 | Device and Method for Evaluating and Optimizing Signals on the Basis of Algebraic Invariants - Signals (for example audio signals) which seem to be completely random, yet for which universally valid statements should be made, for example in the form of parameterizations which, on average, are accurate and can be determined only on the basis of short signal sections. Instead of simulating for example a Gaussian process, projections of algebraic operations—on the plane of real or complex numbers—of said signal sections for example are observed and proven for said astonishingly simple algebraic invariants. Said invariants are subsequently used as tags in order to perform, for example, a selection according to their frequency. On average, the present system proves to be more efficient than known methods to date. The practical-commercial application of said system covers nearly the entire signal processing field. The present document addresses in particular the stochastic observation of audio signals, as known for example from the field of digital audio broadcasting. | 06-06-2013 |
| 20130191430 | Method for Fast Wavelet Transform of a Signal - Method for determining at least one wavelet coefficient W | 07-25-2013 |
| 20130246492 | SIGNAL PROCESSOR, WINDOW PROVIDER, ENCODED MEDIA SIGNAL, METHOD FOR PROCESSING A SIGNAL AND METHOD FOR PROVIDING A WINDOW - A signal processor for providing a processed version of an input signal in dependence on the input signal has a windower configured to window a portion of the input signal, or of a pre-processed version thereof, in dependence on a signal processing window described by signal processing window values for a plurality of window value index values, in order to obtain the processed version of the input signal. The signal processor also has a window provider for providing the signal processing window values for a plurality of window value index values in dependence on one or more window shape parameters. | 09-19-2013 |
| 20140052765 | SIGNAL PROCESSING CIRCUIT AND ULTRASONIC DIAGNOSTIC APPARATUS - A signal processing circuit respectively transforms complex covariance matrices, which are consecutively inputted at a predetermined period, into upper triangular matrices. The signal processing circuit includes: a storage unit that stores at least N-number of complex covariance matrices; a reading unit that reads matrix elements of the stored complex covariance matrices; a CORDIC calculation circuit that implements a CORDIC algorithm by a pipelined circuit system; and a QR decomposition unit that controls the reading unit and the CORDIC calculation circuit unit to calculate an upper triangular matrix by iteratively using the CORDIC calculation circuit unit on a single complex covariance matrix and that calculates in parallel a transformation of N-number of complex covariance matrices into upper triangular matrices in an interleaved format. | 02-20-2014 |
| 20140136586 | METHOD OF SEEKING SEMIANALYTICAL SOLUTIONS TO MULTISPECIES TRANSPORT EQUATIONS COUPLED WITH SEQUENTIAL FIRST-ORDER REACTIONS - Disclosed is a method of seeking semianalytical solutions to multispecies transport equations coupled with sequential first-order network reactions under conditions wherein a groundwater flow velocity and a dispersion coefficient vary spatially and temporally and boundary conditions vary temporally. This invention provides a method of seeking semianalytical solutions to dechlorination equations coupled with sequential first-order reactions, wherein analytical solutions to complex problems such as inhomogeneous media and unsteady flow are derived by combining a similarity transformation method of Clement and a generalized integral-transform technique (GITT), and are verified through comparison with 2DFATMIC which is a commercial numerical program, and thereby can be utilized in nuclear waste sites contaminated with radioactive materials and decayed daughter nuclides and industrial complexes contaminated with chlorinated organic solvents such as PCE (tetrachloroethene), TCE (trichloroethene) and biodegradable byproducts thereof, and can also be widely used in verification of developed numerical programs. | 05-15-2014 |
| 20140237014 | METHOD AND APPARATUS FOR DETERMINING WAVE CHARACTERISTICS USING INTERACTION WITH A KNOWN WAVE - The described system and method uses data from interaction between a known wave and an unknown wave to analyze or characterize the unknown wave using cross correlation frequency resolved optical gating (X-FROG). The system may obtain X-FROG trace data from the interaction between the two waves. The system analyzes the X-FROG trace data using a modified principal component generalized projection method strategy to invert the X-FROG trace data, analyzing or characterizing the unknown wave. Results of the analysis can be provided in real time and displayed. | 08-21-2014 |
| 20140280418 | Numerical Method: Making the Infinite, Finite. A Universal Transform and System of Force Vector - This innovation involves a proof of a necessary change in the universal transform describing natural laws. Instead of the prohibitively refining force velocity squared, this system is created by transforms which use force vectors: TWO distinct, separate force vectors that can work in different directions and create a perfect resultant force which will prevent so many of the anomalous problems across scientific design. As well as pave the way for great advancements and new levels of exactness. | 09-18-2014 |
| 20140280419 | COMPUTING POLYCHORIC AND POLYSERIAL CORRELATIONS BETWEEN RANDOM VARIABLES USING NORTA - Polychoric correlations between two discrete random variables and polyserial correlations between a discrete random variable and a continuous random variable may be determined by using a normal-to-anything (NORTA) method and a stochastic root finding algorithm. | 09-18-2014 |
| 20140289298 | MODULO PARTIAL MAPPING OF FRACTAL POTENTIAL AND FIELD LINES - Faster methods for topological categorization and field line calculations are developed by using decomposition regions together with the self-winding techniques first developed in a prior patent application. A point iteration technique provides direct calculation of low order digits of winding counts without use of complex intervals. Easy to calculate derivatives define decomposition interval boundaries which substitute for methods using the slower complex interval processing of the prior patent. Methods common to this and the prior patent are developed for visualizing conformal mappings of iterated functions. | 09-25-2014 |
| 20140324935 | MATRIX COMPUTATION FRAMEWORK - Described herein are technologies pertaining to matrix computation. A computer-executable algorithm that is configured to execute perform a sequence of computations over a matrix tile is received and translated into a global directed acyclic graph that includes vertices that perform a sequence of matrix computations and edges that represent data dependencies amongst vertices. A vertex in the global directed acyclic graph is represented by a local directed acyclic graph that includes vertices that perform a sequence of matrix computations at the block level, thereby facilitating pipelined, data-driven matrix computation. | 10-30-2014 |
| 20140372495 | SINGULAR VALUE DECOMPOSITION OF COMPLEX MATRIX - Computerized singular value decomposition of an input complex matrix. A real-value matrix representation of the input complex matrix is provided to a singular value decomposition module, which correctly obtains a singular value representation of the real-value matrix representation. However, the result is not provided in a form for convenient conversion back into a valid singular value decomposition solution for the original input complex matrix, as the upper left half and lower right half of the diagonal of the diagonal matrix are not identical. A correction module corrects by formulating a corrected diagonal matrix that represents the value of the diagonal of the first diagonal matrix, but shuffled so that the upper left half of the diagonal of the second diagonal matrix is the same as the lower right half of the diagonal of the second diagonal matrix. Corrected unitary matrices may also be formed. | 12-18-2014 |
| 20150120798 | DATA ENCODING WITH SIGN DATA HIDING - A method of encoding data includes selecting a line to define an adjustment target coefficient group in each of a plurality of coefficient groups included in a transform unit that has been transformed and quantized. Each of the coefficient groups comprises a plurality of coefficients. For each of the coefficient groups, a sum of the coefficients for the respective coefficient group is calculated. For each of the coefficient groups, a value of one adjustment target coefficient included in the adjustment target coefficient group is adjusted according to a result of the calculation of the sum of the coefficients for the respective coefficient group. | 04-30-2015 |
| 20150331834 | Method and Apparatus for Fast Signal Processing - A method and apparatus for fast signal processing is presented. Increase of traffic over data communication networks requires increase of data processing speed. The proposed method is faster than the conventional technique, because it uses less operations of multiplications and additions. The method implements a flexible algorithm architecture based on an elementary cell which is used for both direct and inverse transforms. The method can be implemented for fast analysis and synthesis of different signal types; for fast multiplexing and demultiplexing; and for channel estimation and modeling. The flexible architecture allows: 1) conducting signal analysis according to a certain criterion, and operating on the whole signal or it's part; 2) modifying multiplexed datastream number “on the fly”, splitting and merging groups of datastreams from different sources; 3) splitting a communication channel into a set of sub-channels of different bandwidth, organizing data communication in particular subchannels that satisfy certain requirement. | 11-19-2015 |
| 20160098377 | MATRIX GENERATION TECHNIQUE AND PLANT CONTROL TECHNIQUE - In this disclosure, equations to be solved in the model predictive control are transformed by using an off-line algebraic simplification method into a matrix operational expression representing a product of a coefficient matrix and a vector regarding solution inputs within a control horizon is equal to a function vector regarding target values of output states and the output states. The size of the coefficient matrix is reduced compared with the conventional matrix. Then, the matrix operational expression is solved in an online plant control apparatus with present output states and present target values of the output stats of a plant to be controlled, by the direct method, to output the solution to the plant. | 04-07-2016 |
| 20160179749 | METHOD AND APPARATUS FOR PROVIDING CURVATURE TRANSFORMATION FOR COMPARISON, COMPUTATION AND AGGREGATION | 06-23-2016 |
| 20220137930 | TIME SERIES ALIGNMENT USING MULTISCALE MANIFOLD LEARNING - Systems and methods are described for performing dynamic time warping using diffusion wavelets. Embodiments of the inventive concept integrate dynamic time warping with multi-scale manifold learning methods. Certain embodiments also include warping on mixed manifolds (WAMM) and curve wrapping. The described techniques enable an improved data analytics application to align high dimensional ordered sequences such as time-series data. In one example, a first embedding of a first ordered sequence of data and a second embedding of a second ordered sequence of data may be computed based on generated diffusion wavelet basis vectors. Alignment data may then be generated for the first ordered sequence of data and the second ordered sequence of data by performing dynamic time warping. | 05-05-2022 |
