Transform Patents (Class 708/400)
  • Patent number: 8175817
    Abstract: Various methods for visualization of output from a liquid-liquid chromatographic instrument are provided. One or more analytes detected by a liquid-liquid chromatographic instrument are visualized by providing a data set comprising a plurality of data points corresponding to one or more analytes detected by the instrument, wherein the data points comprise at least one parameter related to a K-value or a parameter from which a K-value can be determined. A K-value is calculated for at least a portion of the data set, and at least a portion of those K-values transformed by a reciprocal transformation to generate output data having a transformed K-value, wherein the transformed K-value is a real number for all K undergoing the transformation, thereby ensuring that all analytes detected by the instrument are plotted in a single chromatogram. The output data is provided to a user.
    Type: Grant
    Filed: December 20, 2007
    Date of Patent: May 8, 2012
    Assignee: The Board of Trustees of the University of Illinois
    Inventors: Guido F. Pauli, J. Brent Friesen
  • Patent number: 8160844
    Abstract: In one embodiment, a processing block of a block diagram receives input data including a plurality of data elements organized as a matrix of a first size. At least a portion of the input data is partitioned into a plurality of data blocks in response to user-selected parameters. A data block includes selected ones of the plurality of data elements organized as a matrix of a second size. The data processing block performs a data processing function on the plurality of data blocks in a user-specified order to yield processed data corresponding to each data block. The processed data corresponding to each data block is then reassembled to form output data corresponding to the input data and the output data is output from the processing block to another block of the block diagram.
    Type: Grant
    Filed: August 20, 2007
    Date of Patent: April 17, 2012
    Assignee: The MathWorks, Inc.
    Inventors: Houman Zarrinkoub, Donald Paul Orofino, II, Navan Ruthramoorthy
  • Patent number: 8145695
    Abstract: The present invention discloses a signal processing method and a data processing method and apparatus. A time-domain to frequency-domain signal processing method includes: pre-processing time-domain data; pre-rotating the pre-processed data by using a rotation factor a·WNn+0.5; performing a discrete Fourier transform (DFT) of N/4 points on the pre-rotated data; and post-rotating the data transformed by the DFT by using a rotation factor b·WNk+0.5 to obtain frequency-domain data. A frequency-domain to time-domain signal processing method includes: twiddling frequency-domain data; pre-rotating the twiddled data by using a rotation factor c·WNk+0.5; performing a DFT of N/4 points on the pre-rotated data; and post-rotating the data transformed by the DFT by using a rotation factor d·WNn+0.5; and post-processing the post-rotated data to obtain time-domain data. The present invention increases the efficiency of signal processing.
    Type: Grant
    Filed: April 13, 2011
    Date of Patent: March 27, 2012
    Assignee: Huawei Technologies Co., Ltd.
    Inventors: Deming Zhang, Haiting Li
  • Publication number: 20120047191
    Abstract: 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.
    Type: Application
    Filed: August 17, 2010
    Publication date: February 23, 2012
    Applicant: Fujitsu Limited
    Inventors: Stergios Stergiou, Jawahar Jain
  • Patent number: 8107767
    Abstract: A data transform apparatus transforms four integer data D0-D3 into one DC coefficient Y0 and three AC coefficients Y1-Y3 as lossless-Hadamard transform coefficients. A first calculation unit group adds date D0 to respective data D1 to D3. A first shifter shifts data D0 1 bit to the left. A second calculation unit group subtracts three data calculated by the first calculation unit group from output of the shifter. A second shifter halves a calculation result of the second calculation unit group by shifting the subtraction result 1 bit to the right, and executes round processing for truncating a fractional part of the halved data. A sign inverter inverts the sign of output from the second shifter, and outputs it as DC coefficient. A third calculation unit group subtracts output from the sign inverter from output of the first calculation unit group, and outputs these data as AC coefficients.
    Type: Grant
    Filed: November 6, 2008
    Date of Patent: January 31, 2012
    Assignee: Canon Kabushiki Kaisha
    Inventor: Tadayoshi Nakayama
  • Patent number: 8103711
    Abstract: Methods and systems for novel infinite impulse response filtering system to allow DC using a complex input signal having a real and imaginary part of the complex input signal yr and yi to produce a real part of a dispersion-compensated signal Xr. The system includes a first filtering circuit for filtering the real part of the input signal yr to produce a filtered real signal w1, a second filtering circuit for filtering and time reversing the imaginary part of an input signal yi to produce a filtered imaginary signal, and a first output summing device for summing the real and the imaginary filtered signal to produce the real part of a dispersion-compensated signal Xr. In an embodiment the filtering is accomplished with time reversing devices and real coefficient infinite impulse filters. In another embodiment, the filtering is accomplished with complex-coefficient infinite impulse filters.
    Type: Grant
    Filed: March 26, 2008
    Date of Patent: January 24, 2012
    Assignee: University of Central Florida Research Foundation, Inc.
    Inventors: Guifang Li, Gilad Goldfarb
  • Publication number: 20120011180
    Abstract: Detection of one or more abnormal situations is performed using various statistical measures, such as a mean, a median, a standard deviation, etc. of one or more process parameters or variable measurements made by statistical process monitoring blocks within a plant. This detection is enhanced in various cases by using specialized data filters and data processing techniques, which are designed to be computationally simple and therefore are able to be applied to data collected at a high sampling rate in a field device having limited processing power. The enhanced data or measurements may be used to provided better or more accurate statistical measures of the data, may be used to trim the data to remove outliers from this data, may be used to fit this data to non-linear functions, or may be use to quickly detect the occurrence of various abnormal situations within specific plant equipment, such as distillation columns and fluid catalytic crackers.
    Type: Application
    Filed: September 23, 2011
    Publication date: January 12, 2012
    Applicant: FISHER-ROSEMOUNT SYSTEMS, INC.
    Inventor: Kadir Kavaklioglu
  • Patent number: 8086655
    Abstract: Techniques for perturbing an evolving data stream are provided. The evolving data stream is received. An online linear transformation is applied to received values of the evolving data stream generating a plurality of transform coefficients. A plurality of significant transform coefficients are selected from the plurality of transform coefficients. Noise is embedded into each of the plurality of significant transform coefficients, thereby perturbing the evolving data stream. A total noise variance does not exceed a defined noise variance threshold.
    Type: Grant
    Filed: September 14, 2007
    Date of Patent: December 27, 2011
    Assignee: International Business Machines Corporation
    Inventors: Philip Shi-Lung Yu, Spyridon Papadimitriou
  • Patent number: 8069201
    Abstract: Low complexity (16 bit arithmetic) video compression has 8×8 block with transforms using 8×8 integer matrices and quantization with look up table scalar plus constant right shift for all quantization steps. Inverse quantization also a look up table scalar plus right shift dependent upon the quantization step and inverse transform using the 8×8 integer matrices.
    Type: Grant
    Filed: November 16, 2004
    Date of Patent: November 29, 2011
    Assignee: Texas Instruments Incorporated
    Inventor: Minhua Zhou
  • Publication number: 20110270904
    Abstract: 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.
    Type: Application
    Filed: April 30, 2010
    Publication date: November 3, 2011
    Applicant: Nellcor Puritan Bennett LLC
    Inventor: Braddon M. Van Slyke
  • Publication number: 20110249001
    Abstract: When NN pairs of sample data are inputted, pre-processing and area division processing are performed by a pre-processing means and area division means respectively. Thereafter, when number of classes NP is inputted to projection matrix generation means based on the NN pairs of sample data, clustering in which NN pairs of sample data are classified into NP classes. Then, representative sample data representing each of classes (NP classes) are selected from NN pairs of sample data as the learning data. Then, based on the nature of Formula (2), calculation means generates an inverse first projection matrix (ML)?1 using a plurality of low resolution sample images (pre-transformation sample data) of a plurality of pairs of representative sample data and a second projection matrix MH using a plurality of high resolution sample images (post-transformation sample data). Thereafter, a transformation matrix {MH·(ML)1} is generated by transformation matrix generation means.
    Type: Application
    Filed: April 12, 2011
    Publication date: October 13, 2011
    Inventor: Hirokazu KAMEYAMA
  • Publication number: 20110200269
    Abstract: Multiple filters of a bilateral filter are decoupled to form into multple linear filtering operations, which permits faster processing. The bilateral filter is re-presented as an approximate bilateral filter, and subjected to a logarithm whose resultant components are further subjected to a series of Jensen approximations. The errors resulting from each Jensen approximation are collected into a single cumulative error factor, and it is then shown that the cumulative error may be ignored without adversed affect to the result. Thus, the original bilateral filter may be implemented as log(y0)=log(2??gjKj)+log(?Kjfj)+log(?Kjgj).
    Type: Application
    Filed: February 18, 2010
    Publication date: August 18, 2011
    Inventors: Mithun Das Gupta, Jing Xiao
  • Patent number: 7996452
    Abstract: A hadamard gate includes two strongly cross-coupled limit cycle oscillators. Each limit cycle oscillator includes an amplifier, a summing node, an integrator, a hysteresis quantizer, a self-feedback 1-bit DAC (Digital-to-Analog Converter) and a cross-feedback 1 bit DAC. Each oscillator output drives its own self-feedback DAC and the cross-feedback DAC of the other oscillator.
    Type: Grant
    Filed: November 10, 2006
    Date of Patent: August 9, 2011
    Assignee: HRL Laboratories, LLC
    Inventors: Jose Cruz-Albrecht, Peter Petre
  • Publication number: 20110184934
    Abstract: A method for compressing an initial dataset may be implemented on a data processing system. The method may include generating a group of bootstrap samples of wavelet coefficients from the initial dataset using a wavelet basis function. An average quantile of the group of bootstrap samples of wavelet coefficients may be determined. The group of wavelet coefficients may be compressed by deleting initial wavelet coefficients having magnitudes less than the coefficient cutoff value equal to the average quantile. The compressed group of wavelet coefficients and the wavelet basis function may be used to approximate the initial dataset.
    Type: Application
    Filed: January 28, 2010
    Publication date: July 28, 2011
    Inventors: Choudur LAKSHMINARAYAN, Joe HILL, Ram SWAMINATHAN
  • Patent number: 7986849
    Abstract: A method, system and computer program product that involves receiving and initializing a digital image. Quantization is preformed on the digital image using at least two multiplication operations. Finally, a compressed version of the digital image is presented for viewing and/or storage or transport.
    Type: Grant
    Filed: April 17, 2007
    Date of Patent: July 26, 2011
    Assignee: Oracle America, Inc.
    Inventors: Xian-Feng Kuang, Bo Liu
  • Patent number: 7987221
    Abstract: A transformation engine includes an address generator; a butterfly unit coupled to the address generator; a twiddle LUT coupled to the address generator; and a multiplier having a first input coupled to the butterfly unit and a second input coupled to the twiddle LUT.
    Type: Grant
    Filed: August 10, 2005
    Date of Patent: July 26, 2011
    Assignee: Intellectual Ventures I LLC
    Inventor: Dileep George
  • Patent number: 7962542
    Abstract: A method of implementing a two-dimensional Inverse Discrete Cosine Transform on a block of input data. The method includes 1) generating a performance array for the columns of the input data; 2) performing a column-wise IDCT upon the input data, the IDCT performed in accordance with cases given for each of the columns by the performance array; (3) generating a row performance offset for rows of the input data; and 4) performing a row-wise IDCT upon the result data from the performing of the column-wise IDCT.
    Type: Grant
    Filed: September 3, 2004
    Date of Patent: June 14, 2011
    Assignee: Apple Inc.
    Inventor: Maynard Handley
  • Patent number: 7940927
    Abstract: Resistance against simple power analysis is maintained while a smaller table is used. An IC card 100 decrypts encrypted information using elliptic curve calculation for calculating a point k*C by multiplying a point C on an elliptic curve E with a coefficient k that is a positive integer less that a prime p. The calculation of the point k*C is performed by adding a multiplication result obtained by multiplying a digit position (window) value w of the acquired coefficient k with the point C in a position corresponding to the digit position, and is performed with respect to all digit positions. When a non-negative integer t exists that fulfills a condition that the acquired digit value w_can be divided by 2t and cannot be divided by 2t+1, the multiplication includes adding a point obtained by multiplying a point Q with w/2t.
    Type: Grant
    Filed: April 25, 2006
    Date of Patent: May 10, 2011
    Assignee: Panasonic Corporation
    Inventors: Yuichi Futa, Natsume Matsuzaki
  • Publication number: 20110102769
    Abstract: Differences between a control profile of light scattered by a control sample from a sample of whole blood and a detection profile of light scattered from a detection sample from the sample of whole blood with a detection agent added indicate malaria infection of the whole blood, where the light scattering is Mie scattering by an ensemble of scatterers in samples which are detection optimized to a concentration just low enough so that each scatterer which does scatter light scatters light only once, where the profiles are for light scattered between zero and five degrees.
    Type: Application
    Filed: June 24, 2009
    Publication date: May 5, 2011
    Inventor: Satish Deshpande
  • Patent number: 7930145
    Abstract: A method of processing, by a computer, an input signal including obtaining input signal samples that represents a physical quantity. The method includes transforming the samples from an original domain into a plurality of coefficients in a transform domain, using an over-complete transform, such that the plurality of coefficients is sufficient to redundantly reconstruct the input signal samples. The method also includes modifying the coefficients independently of each other by applying a correction function, obtaining a set of corrected coefficients. The method also includes transforming the set of corrected coefficients back to the original domain. In the method, the correction function is determined by using a set of training pairs, each training pair including an uncorrected signal and a corrected signal, and by reducing a specified aggregate measure of error between the uncorrected signal and the corrected signal in the original domain across the training pairs.
    Type: Grant
    Filed: October 30, 2006
    Date of Patent: April 19, 2011
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Yacov Hel-Or, Doron Shaked
  • Patent number: 7925686
    Abstract: A first device is described. The first device may include a linear transformation circuit to implement multiplication by a matrix D. The linear transformation circuit may have an input to receive a vector having N digital values and an output to output N first output signals, a sign-adjustment circuit to adjust signs of a subset including at least M of the N first output signals in accordance with a set of coefficients H, and a conversion (DAC) circuit coupled to the sign-adjustment circuit. Outputs from the DAC circuit may be summed to produce an output.
    Type: Grant
    Filed: December 19, 2005
    Date of Patent: April 12, 2011
    Assignee: Rambus Inc.
    Inventors: Aliazam Abbasfar, Amir Amirkhany, Vladimir Stojanovic, Mark A. Horowitz
  • Publication number: 20110082894
    Abstract: 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.
    Type: Application
    Filed: September 8, 2010
    Publication date: April 7, 2011
    Inventor: Michael T. Everest
  • Patent number: 7916962
    Abstract: This invention implements a fast lossless transform almost free from a delay with a small calculation amount. The lossless transform can be used to perform lossless coding and lossy coding quickly. A first calculation unit multiplies data D0, D1, D2, and D3 input to the input terminals by respective weighting coefficients {a0, a1, a2, a3} of {½, ?½, ?½, ?½}, and summates the products. A rounding unit in the first calculation unit rounds the sum into an integer and outputs the integer value E. A second calculation unit multiplies the value E by weighting coefficients {b0, b1, b2, b3} of {?1, 1, 1, 1} set for the respective input data, and adds the products to the respective input data. This invention sets, for the relationship between the first and second weighting coefficients, a condition that a0*b0+a1*b1+a2*b2+a3*b3=?2 or 0.
    Type: Grant
    Filed: December 14, 2009
    Date of Patent: March 29, 2011
    Assignee: Canon Kabushiki Kaisha
    Inventor: Tadayoshi Nakayama
  • Patent number: 7917564
    Abstract: When processing a signal having a sequence of discrete values, wherein there is a first frequency range, in which the signal has a high energy, and wherein there is a second frequency range, in which the signal has a low energy, the sequence of discrete values is first manipulated to obtain a sequence of manipulated values, so that at least one of the manipulated values is non-integer. Then the sequence of manipulated values is rounded to obtain a sequence of manipulated values. The rounding is formed to effect a spectral shaping of a generated rounding error so that a spectrally shaped rounding error has a higher energy in the first frequency range than in the second frequency range. By spectrally shaping the rounding error so that the rounding error does not have any energy either in the storage areas where there is no signal energy, an especially efficient coding is obtained particularly in connection with a lossless coding context.
    Type: Grant
    Filed: March 23, 2006
    Date of Patent: March 29, 2011
    Assignee: Fraunhofer-Gesellschaft zur Forderung der Angewandten Forschung E.V.
    Inventors: Ralf Geiger, Gerald Schuller, Thomas Sporer
  • Publication number: 20110055305
    Abstract: 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.
    Type: Application
    Filed: August 18, 2010
    Publication date: March 3, 2011
    Inventor: Kenichi Matsushima
  • Publication number: 20110040816
    Abstract: The present invention provides a solution to the shortcomings of the traditional two's complement system that is commonly utilized in modern computing systems and digital signal processors for calculating harmonic analysis using a discrete time-frequency transform. In the negative two's complement processor a n-bit number, A, has a sign bit, an?1, and n?1 fractional bits, an?2, an?3, . . . , a0. The value of an n-bit fractional negative two's complement number is: A = a n - 1 + ? i = 0 n - 2 ? - a i ? 2 i - n + 1 .
    Type: Application
    Filed: October 20, 2010
    Publication date: February 17, 2011
    Inventor: Earl Eugene Swartzlander, JR.
  • Publication number: 20110029466
    Abstract: A method and system for rank aggregation of entities based on supervised learning is provided. A rank aggregation system provides an order-based aggregation of rankings of entities by learning weights within an optimization framework for combining the rankings of the entities using labeled training data and the ordering of the individual rankings. The rank aggregation system is provided with multiple rankings of entities. The rank aggregation system is also provided with training data that indicates the relative ranking of pairs of entities. The rank aggregation system then learns weights for each of the ranking sources by attempting to optimize the difference between the relative rankings of pairs of entities using the weights and the relative rankings of pairs of entities of the training data.
    Type: Application
    Filed: October 15, 2010
    Publication date: February 3, 2011
    Applicant: Microsoft Corporation
    Inventors: Tie-Yan Liu, Hang Li, Yu-Ting Liu
  • Publication number: 20110013716
    Abstract: A computer-implemented method and system for generating large families of sequences with desirable properties for many applications, including communications and radar applications, applies constraints to a sequence in the Zak space, modulates the constrained sequence in the Zak space, and determines permutations of the modulated sequence in the Zak space. The constraints are associated with predetermined properties, including predetermined autocorrelation and cross-correlation properties. Other embodiments of the computer-implemented method and system transform an input sequence into a transformed sequence using the finite Zak transform and determine at least one other different sequence based on the transformed sequence. The at least one other different sequence can be determined by collecting a plurality of sequences that are finitely supported on an algebraic line in the Zak space and modulating and/or determining permutations of some or all of the sequences.
    Type: Application
    Filed: July 17, 2009
    Publication date: January 20, 2011
    Applicant: MITRE Corporation
    Inventors: Andrzej K. Brodzik, Richard Tolimieri
  • Publication number: 20110010405
    Abstract: Sensor data is received from one or more sensors. The sensor data is organized within a hierarchy. The sensor data is organized within a hierarchy that is non-dyadic. A processor of a computing device generates a discrete wavelet transform, based on the sensor data and based on the hierarchy of the sensor data, to compress the sensor data. The sensor data, as has been compressed via generation of the discrete wavelet transform, is processed.
    Type: Application
    Filed: July 12, 2009
    Publication date: January 13, 2011
    Inventors: Chetan Kumar Gupta, Choudur Lakshminarayan, Song Wang, Abhay Mehta
  • Patent number: 7870176
    Abstract: A reconfigurable architecture for and method of performing a fast orthogonal transform of vectors in multiple stages, the size of a vector being N, wherein N can vary and the number of stages is a function of N, the architecture comprising: a computational unit configured and arranged so as to include one or more butterfly units; a block including one or more multipliers coupled to the output of the computational unit, configured and arranged so as to perform all of the butterfly computations for at least one stage of the transform; a storage unit configured and arranged so as to store the intermediate results of the butterfly computations and predetermined coefficients for use by the computational unit for performing each butterfly computation, the storage unit including memory and multiplexing architecture; the storage unit including memory and multiplexing architecture; a multiplexer unit configured and arranged so as to time multiplex all of the butterfly computations of the transform using said comput
    Type: Grant
    Filed: July 7, 2005
    Date of Patent: January 11, 2011
    Assignee: ASOCS Ltd.
    Inventors: Doron Solomon, Gilad Garon
  • Publication number: 20100322412
    Abstract: A method for dealing with Galois Field computation includes: providing an operating circuit which has at least a multiplicative inverse unit; and using the multiplicative inverse unit to execute at least a plurality of isomorphism maps for deriving a multiplicative inverse at a specific Galois Field corresponding to an input data, wherein the plurality of isomorphism maps include at least a change of basis.
    Type: Application
    Filed: June 22, 2010
    Publication date: December 23, 2010
    Inventors: Chia-Yu Hung, Tsung-Li Yeh
  • Patent number: 7849123
    Abstract: The present invention discloses a fast Fourier transform (FFT) processor based on multiple-path delay commutator architecture. A pipelined architecture is used and is divided into 4 stages with 8 parallel data path. Yet, only three physical computation stages are implemented. The process or uses the block floating point method to maintain the signal-to-noise ratio. Internal storage elements are required in the method to hold and switch intermediate data. With good circuit partition, the storage elements can adjust their capacity for different modes, from 16-point to 4096-point FFTs, by turning on or turning off the storage elements.
    Type: Grant
    Filed: January 8, 2007
    Date of Patent: December 7, 2010
    Assignee: National Chiao Tung University
    Inventors: Chi-Chen Lai, Wei Hwang
  • Publication number: 20100299287
    Abstract: In one embodiment, a statistical model is generated based on observed data, the observed data being associated with a network device, online parameter fitting is performed on parameters of the statistical model, and for each newly observed data value, a forecast value is generated based on the statistical model, the forecast value being a prediction of a next observed data value, a forecasting error is generated based on the forecast value and the newly observed data value, and whether the data of the network stream is abnormal is determined based on a log likelihood ratio test of the forecasting errors and a threshold value.
    Type: Application
    Filed: May 22, 2009
    Publication date: November 25, 2010
    Inventors: Jin Cao, Aiyou Chen, Tian Bu
  • Publication number: 20100299382
    Abstract: 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.
    Type: Application
    Filed: May 19, 2010
    Publication date: November 25, 2010
    Applicant: FUJITSU LIMITED
    Inventor: Kazuhiro ABE
  • Publication number: 20100281089
    Abstract: A circuit includes a signal processing circuit for accepting an input and for generating a set of outputs. The input is provided in an input range that has a set of representative values, and each output represents a measure of an association of the input with one or more of the representative values. The signal processing circuit includes a group of output sections, each output section being responsive to the input of the signal processing circuit. Each output section includes one or more sigmoid generators. Each sigmoid generator is responsive to an input of the output section to generate an output that represents a sigmoid function of the input of the output section. Each output section also includes a circuitry for combining the outputs of the one or more sigmoid generators to form one of the set of outputs of the signal processing circuit. An input transformation circuit is coupled to the plurality of output sections.
    Type: Application
    Filed: March 2, 2010
    Publication date: November 4, 2010
    Applicant: Lyric Semiconductor, Inc.
    Inventors: Benjamin Vigoda, Jeffrey Bernstein, Alexander Alexeyev, Jeffrey Venuti
  • Publication number: 20100265111
    Abstract: An object of the present invention is to achieve high coding efficiency for a companded signal sequence and reduce the amount of codes. A coding method according to the present invention includes an analysis step and a signal sequence transformation step. The analysis step is to check whether or not there is a number that is included in a particular range but does not occur in a second signal sequence (a number sequence that indicates the magnitude (magnitude relationship) of original signals) and output information that indicates the number that does not occur.
    Type: Application
    Filed: December 11, 2008
    Publication date: October 21, 2010
    Applicant: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
    Inventors: Noboru Harada, Takehiro Moriya, Yutaka Kamamoto
  • Publication number: 20100268753
    Abstract: 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.
    Type: Application
    Filed: August 12, 2008
    Publication date: October 21, 2010
    Applicants: KYOTO UNIVERSITY, NATIONAL UNIVERSITY CORPORATION GUNMA UNIVERSITY
    Inventors: Hiroshi Fujiwara, Saburou Saitoh, Tsutomu Matsuura
  • Patent number: 7817733
    Abstract: A system (100) and method (400) for peak limiting suitable for use in a communication system is provided. The method can include modulating (402) a symbol vector to produce a modulated waveform (500), wherein the symbol vector contains at least one symbol in at least one subcarrier (130), computing (404) at least one symbol adjustment that is based on at least one peak overshoot (512) of the modulated waveform, and applying (406) the at least one symbol adjustment to the symbol vector in accordance with an assigned weighting for reducing a peak power of the modulated waveform. The method limits an energy in the at least one subcarrier to a prespecified level of distortion.
    Type: Grant
    Filed: June 30, 2006
    Date of Patent: October 19, 2010
    Assignee: Motorola Mobility, Inc.
    Inventor: Stephen R. Carsello
  • Publication number: 20100262642
    Abstract: 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.
    Type: Application
    Filed: June 24, 2010
    Publication date: October 14, 2010
    Inventor: Venugopal Srinivasan
  • Publication number: 20100257506
    Abstract: A method and system for providing a block for use in a block diagram in a graphical modeling environment which is capable of outputting information regarding the dynamic state of the block.
    Type: Application
    Filed: June 18, 2010
    Publication date: October 7, 2010
    Applicant: THE MATHWORKS, INC.
    Inventor: Martin CLARK
  • Publication number: 20100250638
    Abstract: Provided is a signal processing apparatus for compensating for a non-linear distortion of a digital signal, including: an analysis signal generating section that converts the digital signal into a analysis signal of a complex number, using a digital filter; and a compensation section that compensates for the analysis signal, using a compensation coefficient of a complex number corresponding to the non-linear distortion, where the digital filter divides data of the digital signal into “n” data sequences, assigns (n*L+k)th data of the digital signal to a k-th data sequence, performs filtering on each of the data sequences using a same filter coefficient, and combines each of the data sequences after the filtering, thereby generating an imaginary number portion of the analysis signal, where “n” is an integer equal to or greater than 2, L=0, 1, . . . , and k=1, 2, . . . , n.
    Type: Application
    Filed: March 9, 2010
    Publication date: September 30, 2010
    Applicant: ADVANTEST CORPORATION
    Inventor: Koji ASAMI
  • Patent number: 7805476
    Abstract: A shared lossless Haar transform and an appended Haar transform are combined to form a lossless extended Haar transform in a pipeline architecture for providing fast lossless compressed data that is reversible. The extended Haar transform also provide intrinsic decorrelation for decorrelating corrected randomly generated numbers.
    Type: Grant
    Filed: June 27, 2005
    Date of Patent: September 28, 2010
    Assignee: The Aerospace Corporation
    Inventor: Hsieh S. Hou
  • Publication number: 20100241399
    Abstract: Detection of one or more abnormal situations is performed using various statistical measures, such as a mean, a median, a standard deviation, etc. of one or more process parameters or variable measurements made by statistical process monitoring blocks within a plant. This detection is enhanced in various cases by using specialized data filters and data processing techniques, which are designed to be computationally simple and therefore are able to be applied to data collected at a high sampling rate in a field device having limited processing power. The enhanced data or measurements may be used to provided better or more accurate statistical measures of the data, may be used to trim the data to remove outliers from this data, may be used to fit this data to non-linear functions, or may be use to quickly detect the occurrence of various abnormal situations within specific plant equipment, such as distillation columns and fluid catalytic crackers.
    Type: Application
    Filed: June 3, 2010
    Publication date: September 23, 2010
    Applicant: FISHER-ROSEMOUNT SYSTEMS, INC.
    Inventor: Kadir Kavaklioglu
  • Patent number: 7797362
    Abstract: 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.
    Type: Grant
    Filed: February 23, 2007
    Date of Patent: September 14, 2010
    Assignee: Texas Instruments Incorporated
    Inventors: Nara Won, Ching-Yu Hung
  • Publication number: 20100228809
    Abstract: Techniques are disclosed to provide randomized signal transforms and/or their applications. More particularly, a signal (e.g., an audio signal, an image, or a video signal) is transformed by applying randomly-selected basis functions to the signal. The applications of the randomized signal transforms include, but are not limited to, compression, denoising, hashing, identification, authentication, and data embedding (e.g., watermarking).
    Type: Application
    Filed: May 18, 2010
    Publication date: September 9, 2010
    Applicant: MICROSOFT CORPORATION
    Inventors: Ramarathnam Venkatesan, Michael T. Malkin
  • Publication number: 20100198899
    Abstract: Adaptive processing of an input signal is achieved by offline analysis, with inline processing comprising an adaptive filter. The method comprises passing the input signal through an adaptive time domain filter to produce an output signal. The input signal and/or output signal is used as an offline analysis signal. The analysis signal is transformed into a transform domain (eg frequency domain) to produce a transformed analysis signal. The transformed analysis signal is analyzed, for example by ADRO, to produce a plurality of desired gains each corresponding to a respective transform domain sub-band. A time domain filter characteristic is synthesized to at least approach the desired gains. The adaptive filter is updated with the synthesized filter characteristic. Minimum phase adaptive filter techniques are found to possess particular benefits in this scheme.
    Type: Application
    Filed: March 24, 2010
    Publication date: August 5, 2010
    Applicant: Dynamic Hearing Pty Ltd
    Inventors: Bonar Dickson, Brenton Robert Steele
  • Publication number: 20100191792
    Abstract: The ability to examine the frequency content of a signal is critical in a variety of fields, and many techniques have been proposed to fill this need, including the Fourier and wavelet family of transforms. One of these, the S-transform, is a Fourier based transform that provides simultaneous time and frequency information similar to the wavelet transform but uses sinusoidal basis functions to produce true frequency and globally referenced phase measurements. It has been shown to be useful in several medical imaging applications but its use is limited due to high computational requirements of the original, continuous form. The described embodiments include a general framework for describing linear time-frequency transforms, using the Fourier, wavelet and S-transforms as examples. As an illustration of the utility of this formalism, a fast discrete S-transform algorithm is developed that has the same computational complexity as the fast Fourier transform.
    Type: Application
    Filed: June 10, 2009
    Publication date: July 29, 2010
    Inventors: Robert Brown, M. Louis Lauzon, Richard Frayne
  • Publication number: 20100190198
    Abstract: Among other things, a combination comprises interaction with a system that has a perturbation. In such perturbed system, a non-directional input is applied to a first variable of the system. Based on an asymmetry of the perturbed system, a directional effect is achieved in a second variable of the system, the first and second variables comprising a conjugate pair of variables. At least one of the following pertains: the interaction occurs other than by an apparatus and other than in a way that actually achieves the directional effect, or the conjugate pair is other than position and momentum, or the input or the asymmetry are in a dimension other than spatial coordinates, or the directional effect is other than translational motion and other than rotary motion.
    Type: Application
    Filed: August 18, 2009
    Publication date: July 29, 2010
    Inventors: Osman Kibar, Mirianas Chachisvilis, Eugene Tu
  • Publication number: 20100191789
    Abstract: A method is provided for regulating an actual value of a variable, which characterizes a position of an actuator, to a setpoint value using a regulator, which method makes it possible to optimize regulation in terms of bandwidth, stability, accuracy, and sturdiness. A predefined time characteristic of the setpoint value is transformed into a desired time characteristic of the actual value. A first transfer function is formed in the frequency domain and is approximated using one or more factors, in particular delay elements, to transform the predefined time characteristic of the setpoint value into the desired time characteristic of the actual value. A nonintegral exponent is selected for at least one of the factors.
    Type: Application
    Filed: January 22, 2007
    Publication date: July 29, 2010
    Inventors: Alexandre Poty, Patrick Lanusse, Alain Oustaloup, Pierre Melchior, Olivier Cois, Ralf Buehrle
  • Patent number: RE42186
    Abstract: A data transform processing apparatus comprising a first lossless transform circuit to perform two step ladder operation processings of receiving unweighted normalized data then outputting weighted nonnormalized rotation-transformed data, and a second lossless transform circuit to perform two step ladder operation processings of receiving the weighted nonnormalized rotation-transformed data from the first lossless transform circuit then performing inverse weighting and outputting unweighted normalized rotation-transformed data, wherein the outputs from the first lossless transform circuit are interchanged and supplied to the second lossless transform circuit.
    Type: Grant
    Filed: April 21, 2010
    Date of Patent: March 1, 2011
    Assignee: Canon Kabushiki Kaisha
    Inventor: Tadayoshi Nakayama