Abstract: A method of operating a data-processing unit to produce a transform comprises calculating first and second output data values based at least on first and second input data values. The method comprises reading the first and second input data values from locations of a first buffer, the locations being determined by first and second read addresses based on first and second read indices. The method also comprises writing the first and second output data values to adjacent memory locations of a second buffer during a single write cycle. Furthermore, the method comprises reading third and fourth input data values from locations of the second buffer, the locations being determined by third and fourth read addresses determined by swapping at least two of the bits of the first and second read indices respectively. A data-processing unit for producing a transform, a transform-computation unit and an electronic apparatus are also described.

Abstract: A signal processing method for performing hierarchical empirical mode decomposition (H-EMD) and an apparatus therefor are provided. In an embodiment, when empirical mode decomposition is performed on an input signal, an artificial assisting signal and the input signal are combined to assist the search for extrema and frequency reduction is performed in each iteration to eliminate the artificial assisting signal and make mode decomposition convergent so as to avoid mode mixing. In addition, in an embodiment, a hierarchical decomposition method is provided to decompose the input signal into a fewer number of fundamental modes. For needs in application, one of the fundamental modes can be further decomposed to produce a number of supplementary modes. In an embodiment, the H-EMD with appropriate frequency reduction can result in modes substantially independent of the form or the way of envelopes and can be applied to decompose multi-dimensional signals.

Abstract: 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.

Abstract: A method of detecting and isolating at least one rhythmic component from a discrete-time input signal, comprises subjecting the input signal to discrete wavelet packet transform multi-resolution analysis; applying wavelet packet basis selection criteria to the result of the analysis to evaluate rhythmic signal features of the input signal; and isolating at least one rhythmic signal component from the input signal based on the evaluation.

Abstract: A data reordering system for determining addresses associated with a vector of transformed data and corresponding method of reordering transformed data, where the data reordering system includes: a first transform function coupled to a data vector and operable to provide the vector of transformed data; a reordering function, including a plurality of counters, that is operable to determine a plurality of offset addresses, with a, respective, offset address for each element in the vector of transformed data; and an adder operable to add a base address that corresponds to the first address to the each, respective, offset address to provide a sequence of addresses suitable for accessing the vector of transformed data to provide a re-sequenced vector of transformed data.

Abstract: A method and system provide for secure sharing of arbitrary data between users with limited mutual trust. A user can encode its information by using a Slepian-Wolf code at a rate which enables a second user to correctly decode only if the side-information it has satisfies a conditional entropy constraint. The key advantages are as follows. Firstly, it is very flexible, in that it enables secure sharing for general data including multimedia data. Secondly, by appropriate Slepian-Wolf code selection, it enables compression in conjunction with security. Thirdly, it can be used for the case where the data model is imperfectly known and trust is to be built up incrementally.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: Various embodiments include a parallel coordinate rotation digital computer (CORDIC) technique, according to which multiple elements in a vector representing a received multiple input multiple output (MIMO) signal may be processed in parallel. The result is a reduction in the computational complexity of the MIMO detection technique as measured by the required resources and the latency. Other embodiments are described and claimed.

Abstract: An apparatus including a multiplier circuit and a multiplexing circuit. The multiplier circuit may be configured to multiply a first multiplicand and a second multiplicand based on a programmable base value and generate a plurality of intermediate values, each intermediate value representing a result of the multiplication reduced by a respective irreducible polynomial. The multiplexing circuit may be configured to generate an output in response to the plurality of intermediate values received from the multiplier circuit and the programmable base value.

Abstract: A system includes M memories, wherein a first mapping assigns each point of an N-point input sequence to one of the M memories. A pipelined data path receives an input from each of the M memories, stores an output to each of the M memories, and iteratively processes pairs of points of the N-point input sequence. A control module designates the pairs of points from the M memories for processing by the data path, wherein only one point of each of the pairs is designated at one time.

Abstract: 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.

Abstract: 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.

Abstract: A digital-signal processing apparatus in which the efficiency of processing data can be prevented uniformly. The apparatus includes: an extracting unit that extracts a part of real data input; a selecting unit that selects a data size from similar data sizes falling in a range, in accordance with the size of the extracted data, which is a reference value, and with data-decomposing conditions described in an algorithm that realizes fast Fourier transform; and an operation unit that decomposes the data extracted and having the selected size into data items, in accordance with the data-decomposing conditions, and that performs Fourier transform on each data item, thereby effecting convolution on the data item.

Abstract: In a method for estimating a frequency offset (fe, ?e) of a modulated bandpass signal (s) with an assumed carrier frequency (?0) in a mobile radio receiver, times (?j) of the zero cross-overs of the bandpass signal are determined in a first step. Using the times (?j) of the zero cross-overs and the assumed carrier frequency (?0), the required frequency offset (fe, ?e) is estimated in a further step by calculating the DC component of an instantaneous frequency which is given by the frequency of the bandpass signal less the assumed carrier frequency.

Abstract: Methods and systems are provided which include configurations for the reassigning unit locations of a classification matrix at which two or more classification regions overlap as non-classification regions. In addition, methods and systems are provided which include configurations for mathematically creating classification regions which may be characterized by values which more accurately correspond to measured values of particles. Other embodiments of methods and systems include configurations for acquiring data corresponding to measurable parameters of a particle and identifying a location within a classification matrix to which at least some of the data corresponds.

Abstract: 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.

Abstract: The solution X0 to an initial system of equations with a Toeplitz coefficient matrix T0 can be efficiently determined from an approximate solution X to a system of equations with a coefficient matrix T that is approximately equal to the coefficient matrix T0. Iterative updates can be performed to improve the accuracy of the approximate solution X.

Abstract: 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.

Abstract: 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 [Tapp] that can be efficiently transformed to a banded form. The system of equations with the banded coefficient matrix is then efficiently solved and this solution is used to obtain the solution to the original system of equations with the Toeplitz coefficient matrix [T].

Abstract: 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.

Abstract: Signal weights corresponding to an initial system of equations with a block coefficient matrix T0 can be obtained from the solution to a system of equations with a block coefficient matrix T. The matrix T is approximately equal to the matrix T0. The signal weights can be used to generate a desired signal.

Abstract: A non-linear transformation processing structure having a high implementation efficiency and a high security is realized. Data transformation is performed using a first non-linear transformation part performing non-linear transformation using a plurality of small S-boxes; a linear transformation part receiving all the outputs from the first non-linear transformation part and performing data transformation using a matrix for performing optimal diffusion mappings; and a second non-linear transformation part including a plurality of small non-linear transformation parts that perform non-linear transformation on individual data units into which output data from the linear transformation part is divided. With this structure, appropriate data diffusion can be achieved without excessively increasing a critical path, and a structure with a high implementation efficiency and a high security can be achieved.

Abstract: A power monitoring device is disclosed. In at least one embodiment, the power monitoring device includes a power parameter measurement unit for calculating the measurement results of basic power parameters according to acquired digital signals of a voltage and/or a current; and a power quality analysis unit including a field programmable gate array, for obtaining power quality analysis results by executing a wavelet transform algorithm, a fast Fourier transform algorithm, an artificial neural net algorithm or a fuzzy logic algorithm in a parallel mode according to the acquired digital signals of voltage and/or current to perform analysis of stationary and transient power quality disturbances. Since the power monitoring device of at least one embodiment of the present invention employs a field programmable gate array, it can perform power quality analysis, power parameter measurements and other peripheral functions with relatively good performance.

Abstract: 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.

Abstract: A front-end shared Haar transform is particularly adapted for cascade connection to an appended transform for providing lossless transform of an input data set, the appended transforms selected from the group consisting of an appended discrete cosine type-II (DCT-II) transform for forming a lossless DCT-II transform, an appended discrete cosine type-IV (DCT-IV) transform for forming a lossless DCT-IV transform, and an appended Haar transform for forming a lossless extended Haar transform.

Abstract: A cyclic equation setting unit transforms and sets a Taylor series equation for calculating a sine function into a single cyclic equation common to terms of the Taylor series equation, the single cyclic equation having a new known number Q that is defined by multiplying a known number Q and the square of a variable X, shifting the result by a shift number S and then adding a constant K thereto. An adjustment unit adjusts and prepares the shift number S such that within a variation range of the variable X the variable X has a maximum value 1 with the constant K being not greater than 1. A cyclic equation executing unit inputs and converts angle information i to the variable X, and executing the cyclic equation in sequence from higher order term to lower order term for the number of terms of the Taylor series equation to derive a sine function of the angle information i.

Abstract: A shared lossless Haar transform and an appended type-IV discrete cosine transform are combined to form a lossless discrete cosine type-IV transform having a fast pipeline architecture for providing fast reversible lossless DCT-IV transform data.

Abstract: Techniques for reducing a number of computations in a data storage process are provided. One or more computational elements are identified in the data storage process. An ordered structure of one or more nodes is generated using the one or more computational elements. Each of the one or more nodes represents one or more computational elements. Further, a weight is assigned to each of the one or more nodes. An ordered structure of one or more reusable nodes is generated by deleting one or more nodes in accordance with the assigned weights. The ordered structure of one or more reusable nodes is utilized to reduce the number of computations in the data storage process. The data storage process converts data from a first format into a second format, and stores the data in the second format on a computer readable medium for data analysis purposes.

Abstract: A cortex-like learning machine, called a probabilistic associative memory (PAM), is disclosed for recognizing spatial and temporal patterns. A PAM is usually a multilayer or recurrent network of processing units (PUs). Each PU expands subvectors of a feature subvector input to the PU into orthogonal vectors, and generates a probability distribution of the label of said feature subvector, using expansion correlation matrices, which are adjusted in supervised or unsupervised learning by a Hebb rule. The PU also converts the probability distribution into a ternary vector to be included in feature subvectors that are input to PUs in the same or other layers. A masking matrix in each PU eliminates effect of corrupted components in query feature subvectors and enables maximal generalization by said PU and thereby that by the PAM. PAMs with proper learning can recognize rotated, translated and scaled patterns and are functional models of the cortex.

Abstract: The invention comprises transformation of a section of a data block independently of the transformation of separate or overlapping data blocks to determine a property related to the original matrix, where each of the separate or overlapping data blocks are derived from an original data matrix. The transformation enhances parameters of a first data block over a given region of an axis of the data matrix, such as signal-to-noise, without affecting analysis of a second data block derived from the data matrix. This allows for enhancement of analysis of an analyte property, such as concentration, represented within the original data matrix. A separate decomposition and factor selection for each selected data matrix is performed with subsequent score matrix concatenization. The combined score matrix is used to generate a model that is subsequently used to estimate a property, such as concentration represented in the original data matrix.

Abstract: 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.

Abstract: A privacy-preserving scalar product calculation system is provided. A first unit linearly transforms an n-dimensional vector Va into an n-dimensional vector based on a scalar value based on a random number Wi and a random number Rj to calculate a remainder by dividing each element of the linearly transformed n-dimensional vector by a random number Mi, and transmits an n-dimensional converted vector X including each of the remainders as its element to the second unit, the second unit calculates an inner product value Z based on the received n-dimensional converted vector X and an n-dimensional vector Vb, and transmits the inner product value Z to the first unit, and the first unit further calculates, based on a reciprocal of the scalar value and the receive inner product value, a scalar value and which calculates a remainder by dividing the scalar value by the random number Mi.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A Fast Fourier Transform (FFT) processor is provided. It comprises a multiplexer, a first angle rotator, a second angle rotation and multiplexing unit, an adder, a twiddle factor storage, a multiplier, and a data storage. The FFT processor analyzes the input/output order of the Fast Fourier Transformation, separates the portions requiring complex computations, simplifies the hardware thereof, and adjusts the output order. It not only effectively saves the hardware area, but also reduces the computations and memory access count. Thereby, the power consumption is reduced.

Abstract: An adaptive lifting transform provides lossless image data compression on an improved edge prediction process. The adaptive predictor works on pixel-by-pixel basis that does not need bookkeeping overhead, especially for integer-to-integer wavelet transform for reducing the number of lifting steps for use in JPEG2000 image compression.

Abstract: Systems and methods are disclosed for processing data. In one exemplary implementation, there is provided a method of generating H output data streams from W data input streams produced from input data. Moreover, the method may include generating the H discrete output data streams via application of the W data inputs to one or more transforming components or processes having specified mathematic operations and/or a generator matrix functionality, wherein the W data inputs are recoverable via a recovery process capable of reproducing the W data inputs from a subset (any W members) of the H output data streams. Further exemplary implementations may comprise a transformation process that includes producing an H-sized intermediary for each of the W inputs, combining the H-sized intermediaries into an H-sized result, and processing the H-sized result into the H output data streams.

Abstract: The lifting transform reduces the number of lifting steps in lossless data compression while improving the overall rounding errors incurred in the real-to-integer conversion process at each of the lifting steps. The compression ratio increases when used for lossless image data compression. The lifting transform further saves memory space and decreases signal delay.

Abstract: 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.

Abstract: A method and a processing device may be provided for performing efficient weighted consistent sampling. A group of sets having multiple elements with associated weights may be provided. A single hash function may be applied to each of the elements of the group of sets to produce consistent uniformly distributed non-negative random numbers. Transformed values corresponding to each of the elements may be produced by determining a wth root of a value based on applying the hash function to a respective element, where w may be based on a weight associated with the respective element. A minimum transformed value or a maximum transformed value may be determined for each of the sets. Sets having matching ones of the minimum transformed value or the maximum transformed value may be determined. The determined sets may be considered to be similar.

Abstract: An elliptic curve cryptographic system where point coordinates are transformed from a first coordinate system to a second coordinate system. The transformed coordinates are processed by field operations, which have been modified for operating on the transformed point coordinates. In some implementations, the point coordinates are transformed from an affine coordinate system to a projective coordinate system using a non-random value for the projective coordinate. In some implementations, the transformed projective representation of the point can be changed from a first representation of the point in projective coordinates to a second representation of the point in projective coordinates, where the projective coordinate used in the representation change is a random value.

Abstract: The present invention provides an input data control method and system for a data processing system. The system comprises at least one basic operation unit (BOU) and is used for transforming one input matrix X into data in a plurality of specified columns in an output matrix Y via an inverse discrete cosine transform procedure. The method generates and outputs a transform control signal together with the input matrix to at least one of the BOUs. A new transform control signal is generated according to the received transform control signal, and outputted together with the input matrix X, to other following BOUs. The step of generating the new transform control signals is repeated until each specific column of the output matrix Y is decoded by a corresponding BOU. A basic operation procedure is then performed, and the received input matrix is decoded to obtain the data in the specified columns corresponding to the transform control signal.

Abstract: The present invention relates to a discrete transform calculation device (FFTP). The device has control means (CNTRL) which configure first and second memories (RAM1 and RAM2) according to the number of transforms used during a first processing. The device applies in particular to a demodulator which allows management of several Fourier transforms in parallel.

Abstract: The integrated lifting transform provides both the lossy and lossless lifting wavelet transforms while sharing the same lifting chain for either lossy data compression or lossless data compression. The lifting steps can provide a lossless compression and a lossy compression directly from lossless compression while the integer-to-integer adaptive four-stage lifting wavelet transform provides the lossless compression with improved performance.

Abstract: In one aspect, circuitry to determine a modular remainder with respect to a polynomial of a message comprised of a series of segment. In another aspect, circuitry to access at least a portion of a first number having a first endian format, determine a second number based on a bit reflection and shift of a third number having an endian format opposite to that of the first endian format, and perform a polynomial multiplication of the first number and the at least a portion of the first number.

Abstract: 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.

Abstract: In an apparatus for carrying out a linear transform calculation on a product signal produced by multiplying a predetermined transform window function and an apparatus input signal, an FFT part (23) carries out fast Fourier transform on a processed signal produced by processing the product signal in a first processing part (21). As a result, the FFT part produces an internal signal which is representative of a result of the fast Fourier transform. A second processing part (22) processes the internal signal into a transformed signal which represents a result of the linear transform calculation. The apparatus is applicable to either of forward and inverse transform units (11, 12).