Abstract: The device for detecting a useful signal comprises an autocorrelation unit (AK) for autocorrelating a signal (s(t)) which can contain a periodic signal, and a cross correlation unit (CK) for cross correlating the signal s(t) with a known signal (b(t)). Further, the device comprises a logic unit (VE) for logically combining outputs of the autocorrelation unit (AK) and of the cross correlation unit (CK) which outputs a combinatorial signal (d(t)) which specifies whether the useful signal has been detected.

Abstract: Disclosed is a sequence similarity measuring apparatus and a method of controlling the same. The sequence similarity measuring apparatus using dynamic programming includes: a matrix generating unit for generating a matrix based on the dynamic programming by using two sequences; a normalization unit for calculating a similarity reference value by inputting an element value of a last row/column of the matrix generated by the matrix generating unit into a normalization formula for a given sequence length; and a similarity measuring unit for measuring predefined sequence similarity between the two sequences, based on the similarity reference value calculated by the normalization unit. This makes it possible to easily and correctly achieve similarity comparison between multiple sequences, and thus this technology is expected to be widely utilized in biology/programming application fields.

Abstract: A method for the detection and estimation of periodicities in noisy signals. First the signal is sampled and preprocessed in a discrete succession of equal periods. Then, short term characteristics vectors are generated for each period. The short term characteristics vectors are then grouped into sets, followed by the obtainment of at least one representative vector for each set. Periodic structures are estimated using the representative vectors. In a preferred embodiment, the short term characteristics are the the short term spectra of the signal. Practically, an autocorrelation matrix is constructed to assess autocorrelation along a diagonal.

Abstract: A parallel correlator and method includes temporarily storing in a series of P sequence registers, each of length R1, serial bit-sequences of a code of length N=P*R1. In a first-level of processing, certain unique bit sequences are inverted to reduce the number of unique bit sequences by half. Identical bit-sequences are then combined and temporarily stored in a first-level sub-accumulation register. Alternatively, bit sequences differing by only one bit may be combined in a common first-level sub-accumulation register. Further levels of similar processing may be imposed, where each subsequent level taps and inverts only a portion of the bits in the above level of processing, thereby reducing the number of unique bit sequences. Finally, all negative energy is combined in one register position, inverted, and added to all positive energy in the other register positions.

Abstract: In one embodiment of the invention, a circuit may include and/or involve a correlator, a programmable fabric, and logic to enable selection of one of default processing logic and alternate processing logic to process corresponding data and coefficient values of the correlator.

Abstract: The field of the invention is that of the reception of a radionavigation signal originating from a satellite positioning system such as the GPS system. The present invention concerns a method for calculating correlations between a first sequence and a second sequence, said first sequence and said second sequence having a duration DCode, the first sequence being extracted from a digital signal comprising a code, said code comprising elementary time divisions, called chips, of mean duration Dchip, said chips being synchronized with pulses delivered by an NCO oscillator at the mean frequency 2/Dchip, the second sequence resulting from a sampling at a frequency Fe of an analog signal, the frequency Fe being greater than 2/Dchip. According to the invention, the method comprises a step of aggregating samples of the second sequence, over consecutive integration intervals of duration equal on average to Dchip/2, starting at each pulse of the NCO oscillator, so as to determine results of elementary aggregates.

Abstract: A method for estimating software development effort comprises the steps of: generating a database containing a plurality of source softwares; calculating the Grey relational coefficients between the software to be developed and a source software in the database for each feature they exhibit; calculating the weights for each Grey relational coefficient; multiplying each Grey relational coefficient with the corresponding weight; calculating the Grey relational grade by summing up the products produced in the multiplying step; calculating the Grey relational grades for all remaining source softwares in the database; and comparing the Grey relational grades to estimate the effort for developing the software to be developed.

Abstract: An object of the invention is to provide a vector generation apparatus, a vector generation method, and an integrated circuit for generating data (vector) as a basis for authentication processing such as biometric authentication while protecting information that can be authenticated at high speed using the resources of a server and should be handled as secrete information typified by a biometric template against secondary use. A terminal 100 includes a reception section 101 for receiving a feature extraction vector as a first vector from the outside; a storage section 102 for storing a biometric template vector as a second vector; a vector computation section 103 for calculating a correlation efficient between the first vector and the second vector and generating a third vector different from the second vector, with the correlation coefficient matching the correlation efficient; and a transmission section 104 for transmitting the third vector to a server 10.

Abstract: An autonomic computing system is automatically maintained in a steady state. The system has a number of parameters, each of which has one or more threshold. The system may further have a number of influencers, adjustment of which affects values of the parameters. One or more of the parameters are determined as each reaching one of its threshold, and are referred to as to-be-affected parameters. Each to-be-affected parameter is identified and its thresholds identified. A correlation value may be determined between each influencer and each to-be-affected parameter, and/or between each to-be-affected parameter and each other to-be-affected parameter. The to-be-affected parameters are adjusted, based on the correlation values determined, so that the to-be-affected parameters return to more-normal values.

Abstract: A method only has the user input (or select) a data type, a report key, a dependent variable table, and/or filtering restrictions. Using this information, the method automatically locates independent variable data based on the data type and the report key. This independent variable data can be in the form of a table and comprises independent variables. The method automatically joins the dependent variable table and the independent variable data to create a joint table. Then, the method can automatically perform a statistical analysis of the joint table to find correlations between the dependent variables and the independent variables and output the correlations, without requiring the user to input or identify the independent variables.

Abstract: Embodiments of the present invention relate to a method of data analysis, comprising comparing a data point in a data stream and a previous data point in the data stream to identify a change direction of the data point based on a difference between the data point and the previous data point, comparing the change direction with a previous change direction to identify whether a trend change occurred for the data point, and identifying a change point that comprises a discrete data value in the data stream based on the trend change. The method also comprises comparing the change point with other data.

Abstract: A method and a device are proposed for the synchronization of a radio transmitter and a radio receiver, notably for UMTS, while utilizing a Golay correlator, which synchronization should be performed reliably without imposing severe requirements as regards the frequency stability of the local oscillator. To this end, absolute value squaring B1, B2 is performed in the Golay correlator already prior to the last delay stages (D7, D8).

Abstract: Methods, systems, and apparatuses for generating relevance functions for ranking documents obtained in searches are provided. One or more features to be used as predictor variables in the construction of a relevance function are determined. The relevance function is parameterized by one or more coefficients. A query error is defined that measures a difference between a relevance ranking generated by the relevance function and a training set relevance ranking based on a query and a set of scored documents associated with the query. The query error is a continuous function of the coefficients and aims at approximating errors measures commonly used in Information Retrieval. Values for the coefficients of the relevance function are determined that substantially minimize an objective function that depends on the defined query error.

Abstract: Methods and systems relating to Weil-based spreading codes are described herein. In an embodiment, a method includes generating a set of Weil sequences, adapting a plurality of sequences of the set of Weil sequences to form a first plurality of codes, and selecting a second plurality of codes from the first plurality of codes. A code of the first plurality of codes is selected based at least on a correlation associated with the code. Each code of the first plurality of codes has a predetermined length.

Abstract: A device capable of improving the convergence rate and estimation accuracy in estimating a correlation value. According to a signal processing device, since a window length is adjusted in such a manner to reduce an estimated error of a correlation matrix, the convergence rate and estimation accuracy in estimating the correlation matrix and the correlation value as its off-diagonal element can be improved. Then, in such a high-probability condition that the correlation of plural output signals according to a state is estimated with a high degree of precision, signal processing is performed on the plural signals, so that the state can be estimated with a high degree of precision.

Abstract: A method and an apparatus is disclosed for efficient cross correlation of a plurality of signal vectors. Incoming data is partitioned into several segments and processed according to an algorithm where data rotation is a function of post-correlation memory size.

Abstract: An exemplary method for computing correlation anomaly scores, including, defining a first similarity matrix for a target run of data, the target run of data includes an N number of sensors, defining a second similarity matrix for a reference run of data, the target run of data includes the N number of sensors, developing a k-neighborhood graph Ni of the i-th node for the target run of data, wherein the k-neighborhood graph of the i-th node is defined as a graph comprising the i-th node and its k-nearest neighbors (NN), developing a k-neighborhood graph Ni of the i-th node for the reference run of data, defining a probability distribution p(j|i), wherein p(j|i) is the probability that the j-th node becomes one of the k-NN of the i-th node, coupling the probability between the i-th node and the neighbors of the i-th node, determining an anomaly score of the i-th node, and determining whether the target run of data has changed from the reference run of data responsive to determining the anomaly score of the i-th

Abstract: A re-configurable correlation unit for correlating a sequence of chip samples comprising: 1) a memory for storing the chip samples; 2) a plurality of add-subtract cells, each add-subtract cell receiving a plurality of real bits, a, and a plurality of imaginary bits, b, from a first chip sample; and 3) a plurality of sign select units. Each sign select units receives from one add-subtract cells a first input equal to a sum (a+b) of the real bits, a, and the imaginary bits, b, and a second input equal to a difference (a?b) of the real bits, a, and the imaginary bits, b. Each sign select unit generates a real output and an imaginary output, wherein each of the real and imaginary outputs is equal to one of: 1) the sum (a+b) multiplied by one of +1 and ?1 and 2) the difference (a?b) multiplied by one of +1 and ?1.

Abstract: A dynamic weight processing system. The inventive system includes a first circuit for receiving an input signal and a second circuit for filtering the input signal with dynamic weights to provide a weighted signal. In an illustrative embodiment, the dynamic weights are finite impulse response filter correlation coefficients that are dynamically generated based on a pseudo-noise code. The system may also include a dynamic weight generator that generates the dynamic weights by combining weight values stored in a lookup table in a manner dependent on the pseudo-noise code. The weighted signal may be further processed to generate nulling and beamsteering weights for the input signal. In a more specific implementation for a GPS (Global Positioning System) application, the received signal is partitioned into space frequency adaptive processing (SFAP) bands and space time adaptive processing (STAP) is performed within the SFAP bands.

Abstract: The n-to-m bit down-scaling correlates a plurality of n-bit correlation integral values into a plurality of m-bit data (n>m). The n-bit correlation integral values are obtained by correlating global positioning system (GPS) signals with a plurality of expected codes. Upper (n?m+1) bits are selected from the n-bit correlation integral values, and (n?m+1)-bit estimated absolute values are obtained. A significant bit of a maximum value of the upper (n?m+1) bits of the estimated absolute values is selected. A scale level is obtained based on the significant bit of the maximum value. The n-bit correlation integral values are down-scaled into the m-bit data based on the scale level. The amount of n-bit correlation integral values is reduced into m-bit correlation integral values by the down-scaling method, and thereby reducing a size of the memory for storing the correlation integral values.

Abstract: Aspects of a method and system for efficient full resolution correlation may include correlating a first signal with a second signal at a rate corresponding to a first discrete signal, wherein each sample of the first signal may be generated by summing a plurality of consecutive samples from the first discrete signal, and the second signal may be generated by summing the plurality of consecutive samples from a second discrete signal. The correlating may be performed by a matched filter and/or a correlator. The first signal comprising N samples may be generated by summing L consecutive samples for each of the N samples from the first discrete signal comprising N*L samples. The second signal comprising N samples may be generated by summing L consecutive samples for each of the N samples from the second discrete signal comprising N*L samples.

Abstract: A method for measuring time series relevance using state transition points, including inputting time series data and relevance threshold data. Then convert all time series values to ranks within [0,1] interval. Calculate the valid range of the transition point in [0,1]. Afterwards, a verification occurs that a time series Z exists for each pair of time series Z and Y, such that the relevances between X and Z, and between Y and Z are known. Then deduce the relevance of X and Y. The relevance of X and Y must be at least one of, (i) higher, and (ii) lower than, the given threshold. Provided Z is found terminate all remaining calculations for X and Y. Otherwise, segment the time series if no Z time series exists, use the segmented time series to estimate the relevance. Apply a hill climbing algorithm in the valid range to find the true relevance.

Abstract: A pattern matching unit includes a selection unit to divide an input datum and one or more reference templates into input bit-fields corresponding reference bit-fields, respectively. The number of bits in the input and reference bit-fields is programmable. A distance unit is also included to determine one or more distance measures between the input bit-fields and the corresponding reference bit-fields. The distance measures associated with reference bit-fields are combined into one or more net distance measures corresponding to the one or more reference templates.

Abstract: Certain exemplary embodiments provide a method comprising: automatically: receiving a plurality of elements for each of a plurality of continuous data streams; treating the plurality of elements as a first data stream matrix that defines a first dimensionality; reducing the first dimensionality of the first data stream matrix to obtain a second data stream matrix; computing a singular value decomposition of the second data stream matrix; and based on the singular value decomposition of the second data stream matrix, quantifying approximate linear correlations between the plurality of elements.

Abstract: A fast correlator transform (FCT) algorithm and methods and systems for implementing same, correlate an encoded data word (X0-XM?1) with encoding coefficients (C0-CM?1), wherein each of (X0-XM?1) is represented by one or more bits and each said coefficient is represented by one or more bits, wherein each coefficient has k possible states, and wherein M is greater than 1. In accordance with the invention, X0 is multiplied by each state (C0(0)through C0(k?1)) of the coefficient C0, thereby generating results X0C0(0) through X0C0(k?1). This is repeating for data bits (X1-XM?1) and corresponding coefficients (C1-CM?1), respectively. The results are grouped into N groups. Members of each of the N groups are added to one another, thereby generating a first layer of correlation results. The first layer of results is grouped and the members of each group are summed with one another to generate a second layer of results. This process is repeated as necessary until a final layer of results is generated.

Abstract: A feedback control law steers a reference phase that tracks the phase of a received code sequence. The reference phase clocks a track-reference signal consisting of a series of correlation kernels, over which data is extracted and then summed in various combinations. The correlation kernels are designed in such a manner that errors caused by multipath are eliminated or substantially reduced. Furthermore, the areas of the correlation kernels are balanced across level-transitions of a code and non-transitions to eliminate phase biases when tracking specific satellites. Extra care must be taken to balance the correlation kernels in this manner due to a little known aspect of GPS C/A codes. Specifically, not all C/A codes have the same ratio of level-transitions to non-transitions as has been assumed in prior art.

Abstract: A multicarrier receiver sequentially correlates two training symbols to determine a length of a cyclic prefix associated with each of the training symbols.

Abstract: Embodiments herein select performance indicators from raw data and measure the indicators over at least one time period to extract a time series of data for each of the indicators. The methods filter out redundant indicators to produce a reduced indicator set of time series of data. The embodiments detect correlations among the time series of data within the reduced indicator set by considering time-shifts between the time series of data so as to identify correlated indicators. The method determines a time order among the correlated indicators and determines a causal direction among the correlated indicators based on which of the correlated indicators occurs first in time so as to identify relative leading indicators among the correlated indicators. However, if the correlated indicators occur at approximately a same time, the determining of the causal direction is based on a relative ability of each of the indicators to predict behavior of another of the correlated indicators.

Abstract: A method for processing sensor data which are transmitted by at least one asynchronous sensor at a transfer rate, the sensor data being read at a predefined sampling rate, a mean value being computed from a predefined number of read sensor data, wherein the sampling ratio between the sampling rate and transfer rate is estimated for averaging, the number of transmitted data values and the number of sampling pulses within a predefined time span being ascertained and correlated to each other for estimating the sampling ratio.

Abstract: A method for measuring time series relevance using state transition points, including inputting time series data and relevance threshold data. Then convert all time series values to ranks within [0,1] interval. Calculate the valid range of the transition point in [0,1]. Afterwards, a verification occurs that a time series Z exists for each pair of time series Z and Y, such that the relevances between X and Z, and between Y and Z are known. Then deduce the relevance of X and Y. The relevance of X and Y must be at least one of, (i) higher, and (ii) lower than, the given threshold. Provided Z is found terminate all remaining calculations for X and Y. Otherwise, segment the time series if no Z time series exists, use the segmented time series to estimate the relevance. Apply a hill climbing algorithm in the valid range to find the true relevance.

Abstract: Provided is a designing system for designing a DC superconducting cable comprising a conductor layer and an outer-conductor layer arranged outside the conductor layer through an electrical insulation layer, the designing system comprising: First correlation-calculation means for calculating the relationship between a ratio Xf and a contraction amount Cf, the ratio Xf being a ratio between the winding diameter and the winding pitch of a superconducting wire constituting the conductor layer, and the contraction amount Cf being capable of absorbing the thermal contraction of the superconducting wire due to cooling; Second correlation-calculation means for calculating the relationship between the ratio Xf and a use quantity ratio Ufx of the superconducting wire in the conductor layer per unit length of the cable; and First selection means for extracting, from the calculation results of First correlation-calculation means and Second correlation-calculation means, data of the winding diameter and the winding pitch

Abstract: A method of identifying spherical objects in a digital image is provided, wherein the image includes a plurality of intensities corresponding to a domain of points in a D-dimensional space. The method includes calculating a local cross-correlation between a point in the domain of the image and a Gaussian kernel about a neighborhood of the point; calculating a local standard deviation of the point in the image; calculating a local standard deviation of the Gaussian kernel; calculating a cross-correlation ratio by dividing the local cross-correlation by the product of the local standard deviation of the image and the local standard deviation of the Gaussian kernel; and analyzing the cross-correlation ratio to determine whether an object about said point is spherical. The cross-correlation ratio can take continuous values from ?1 to 1, where a spherically symmetric Gaussian shaped object has a value of 1.

Abstract: Computer-implemented systems and methods for estimating confidence intervals for output generated from a computer simulation program that simulates a physical stochastic process. A plurality of statistical tests is performed upon the physical stochastic simulated output so that a confidence interval can be determined.

Abstract: Provided is an apparatus and method for comparing structures of proteins by extracting main axes of the proteins using principal components analysis (PCA), dividing regions using grids into voxels for precise structure alignment, and placing the proteins respectively in the regions to calculate a similarity between the proteins by autocorrelation. The apparatus for comparing protein structures using principal components analysis (PCA) and autocorrelation includes: a PCA calculator for receiving a query protein for extracting a main axis of the query protein; a voxel generator for receiving information about the main axis from the PCA calculator and dividing a predetermined region using a grid to determine whether the divided region is occupied by the query protein for generating voxels of the query protein; and a comparison processor for performing an autocorrelation calculation between voxels of one protein and voxels of the other protein that are generated by the voxel generator.

Abstract: A method of receiving a first set of target data points from a first data feed and receiving a second set of target data points from a second data feed arrangement. Comparing a time variable included in the target data points from the first set to the time variable included in the target data points from the second set to determine time matched target data points and further comparing a second variable included in the time matched target data points from the first set to the second variable included in the corresponding time matched target data points from the second set to determine fully matched target data points. Combining the first set of target data points with the second set of target data points when the fully matched target data points satisfies a predetermined threshold.

Abstract: An apparatus of sequentially decoding CCK codes includes a series of received signal registers used to respectively temporarily save the received signals, a phase selector used to select one numeral from 1, ?1, j or ?j respectively for CCK code of each chip to multiple with the signal register, a series of adders used to sequentially complete adding operation, a series of sequential operation registers used to save values obtained from the sequential selecting operation of the phase selectors and the sequential adding operation of the adders, and a comparing device used to select a maximal value from those saved in the operation registers. The comparing device includes a comparator and a maximum register. According to the invention, the data processing speeds up while the hardware complexity is reduced.

Abstract: In an optimum design method comprising a first solution determining step of solving an optimization problem of a first evaluation function for a state variable vector with a design variable vector being as a parameter, and a second solution determining step of solving an optimization problem of a second evaluation function for the design variable vector and the state variable vector thus obtained, the second solution determining step includes the steps of computing a gradient vector of the second evaluation function for the design variable vector, computing a first coefficient based on a value of a norm of the gradient vector, computing a search vector based on the first coefficient, computing a second coefficient, and updating the design variable vector based on the second coefficient.

Abstract: Method and apparatus for correlating data records acquired in a signal acquisition device includes the steps of extracting an area of interest from the data record displayed on said signal acquisition device, normalizing the area of interest, creating a filter based upon normalized values of the area of interest and passing the data record through said filter to obtain a correlation curve. Normalization of the area of interest includes obtaining a plurality of points defining the area of interest, calculating the mean of the said plurality of points and subtracting said mean from each of the said plurality of points. Creating the filter includes using the normalized values of the area of interest as coefficients for the filter.

Abstract: A method for detecting a positioning signal includes (a) correlating a segment of a received positioning signal with a reference signal of a selected code phase and frequency to obtain a correlation value, (b) if the correlation value is less than a predetermined minimum, assigning the correlation value to the predetermined minimum, and (c) accumulating the correlation value in a sum of correlation values obtained using other segments of the received positioning signal. In addition, the correlation value may be reduced by a predetermined value, which is preferably an expected mean value for a noise component in the segment of the received positioning signal.

Abstract: Systems, apparatuses, and methods for searching for a match to a sequence of bits. The systems apparatuses, and methods include selecting a sequence of bits from a data stream, taking a function of the sequence of bits having a result that is a pattern that is represented by shorter string of bits, and comparing the resulting pattern to a predefined pattern to determine whether the resulting pattern matches the predefined pattern.

Abstract: The invention relates to a method of comparing two or more series of signal analysis data samples, to produce a measure of their similarity. Corresponding data samples of each series are compared, and measures of the magnitude of the signal and the variation between corresponding data samples are calculated. The magnitude measure may simply be the average power of corresponding data samples. The produced measure of the similarity of the series is a test statistic having Snedecor's F distribution. When compared to typical cross correlation methods, a test statistic of the present invention provides a greater distinction between series displaying a high degree of similarity and series with a low degree of similarity. Accordingly, the present invention has applicability to the detection, classification and angular localisation of signals from acoustic or electromagnetic sources.

Abstract: A fast correlator transform (FCT) algorithm and methods and systems for implementing same, correlate an encoded data word (X0–XM?) with encoding coefficients (C0–CM?1), wherein each of (X0–XM?1) is represented by one or more bits and each said coefficient is represented by one or more bits, wherein each coefficient has k possible states, and wherein M is greater than 1. In accordance with the invention, X0 is multiplied by each state (C0(0) through C0(k?1)) of the coefficient C0, thereby generating results X0C0(0) through X0C0(k?1). This is repeating for data bits (X1–XM?1) and corresponding coefficients (C1–CM?1), respectively. The results are grouped into N groups. Members of each of the N groups are added to one another, thereby generating a first layer of correlation results. The first layer of results is grouped and the members of each group are summed with one another to generate a second layer of results. This process is repeated as necessary until a final layer of results is generated.

Abstract: An apparatus and method allow receivers to quickly acquire a pseudorandom noise signal. A receiver advantageously detects frequency shifts using a compact parallel process hardware implementation of a Discrete Fourier Transform (DFT). The simultaneous detection of multiple frequencies allows the receiver to search the frequency range of the transmitted signal in larger increments of frequency, thereby increasing the speed of acquisition. One receiver does not use coherent integration before computation of the transform and advantageously maintains a flat frequency response. The flat frequency response of the DFT circuit enables searching of multiple frequency offsets without CPU intensive processing to compensate for frequency response variations. A receiver can include a Doppler correction circuit, which permits correlation data with frequency shift in the code to be non-coherently integrated among relatively fewer addresses or tap positions in memory.

Abstract: A complementary code decoder technique is provided where the encoded input data is first parallelized. From the parallelized data, correlation values are generated by a correlator circuit that is capable of changing its correlation characteristics depending on at least one control signal. Different control signals are sequentially provided to the correlator circuit thereby driving the correlator circuit to sequentially generate multiple correlation values from the parallelized data, based on different correlation characteristics. From the multiple correlation values, the correlation value that represents the optimum correlation is identified. This technique significantly reduces the gate count of the decoder structure, thus saving chip area and manufacturing costs.

Abstract: An algorithmic approaches that can be implemented in software/firmware/hardware that filters out stable PRI patterns detected within a system that is prosecuting against radar based transmissions are disclosed. The algorithms allow downstream computing assets to concentrate their limited resources on the more complex emitter PRI pattern types. Thus, a portion (e.g., stable signals) of the pulse deinterleave and PRI identification problem is solved without requiring the more computationally expensive processing. The disclosed algorithms can be employed, for example, in electronic support measures (ESM) systems, electronic intelligence (ELINT) systems, and/or a electronic countermeasures (ECM) systems. The algorithms employ linear detection, linear regression, or a combination of linear detection and linear regression, thereby providing a “dual voting” scheme that decreases the occurrence of false positives.

Abstract: A multi-pass frequency hop timing acquisition correlator that produces a more accurate time estimate from the fast acquisition frequency hop signal is disclosed. The time estimate produced by the multi-pass acquisition correlator is more accurate than the ¼ hop estimate produced by single-pass fast acquisition correlators. The multi-pass frequency hop timing acquisition correlator uses a time estimate generated by a previous pass through the multi-pass frequency hop timing acquisition correlator as a starting point for computing a new, more accurate, time estimate. Thus, the second pass through the multi-pass frequency hop timing acquisition correlator produces a time estimate that is relatively more accurate than the time estimate produced by the first pass. The more accurate time estimate produced by the multi-pass acquisition correlator reduces the hardware and time needed by the direct acquisition process to acquire the M-code.

Abstract: An apparatus and method for efficient filtering and convolution of content data are described. The method includes organizing, in response to executing a data shuffle instruction, a selected portion of data within a destination data storage device. The portion of data is organized according to an arrangement of coefficients within a coefficient data storage device. Once organized, a plurality of summed-product pairs are generated in response to executing a multiply-accumulate instruction. The plurality of product pairs are formed by multiplying data within the destination data storage device and coefficients within the coefficient data storage device. Once generated, adjacent summed-product pairs are added in response to executing an adjacent-add instruction. The adjacent summed-product pairs are added within the destination data storage device to form one or more data processing operation results.

Abstract: Large amounts of multimedia data are transmitted over information networks in the form of a digital stream, analog video, or text captioning. Often, repetitions such as paid advertisements, theme music at the commencement of a TV broadcast, and common jingles and slogans occur in these streams. Detection of repetitions in a transmitted signal such as streaming audio or video is described, and includes extracting a plurality of samples from the information stream and accumulating the samples into segments comprising an interval of the transmitted signal. A vector indicative of the samples in each of the segments is generated, and each of the vectors in the segments is correlated to generate a covariance matrix, or signature, corresponding to the segment. Each of the covariance matrices are aggregated into a sequence of covariance matrices and compared to other covariance matrices to generate a distance matrix.

Abstract: In accordance with the invention, in a nonrecursive digital filter, the number of times each bit of input data passes through a shift register is reduced to save power. Despreading data is sent to a first shift register and a second shift register, each having a number of stages obtained by dividing the usual number of stages by two, and both shift registers alternately perform a shift operation at both edges of a shift clock. Multiplexers are provided for selecting the odd-numbered codes of reference codes stored in a reference-code register when the shift clock is in an OFF state and for selecting the even-numbered codes when the shift clock is in an ON state, and multiplexers are provided that perform the selections analogous to the above.

Abstract: A method for managing a code sequence according to a first embodiment of the present invention is disclosed. Sets of n contiguous sample values that include sample values in a plurality of sample sequences are accessed. Sets of n contiguous coefficients are accessed. The sample values in each of the plurality of sets of sample values that are accessed are processed in parallel with corresponding coefficients that are accessed. Each of the plurality of sets of sample values are processed during a different time step.