Abstract: A circuit for converting frequency domain information to time domain information includes an Inverse Fast Fourier Transform circuit having a length of N coefficients. The Inverse Fast Fourier Transform circuit is adapted to receive input data of length N coefficients and generate output data of length N coefficients that are circularly shifted by m coefficients. The circuit also includes Cyclical Prefix Insertion circuit adapted to insert a cyclical prefix of length m. The Cyclical Prefix Insertion circuit includes a first switch, connected to the Inverse Fast Fourier Transform circuit, a buffer, having an input connected to the first switch and an output, the buffer having a length m, and a second switch, coupled to the first switch and to the buffer. The first and second switches selectively couple the output of the buffer and the Inverse Fast Fourier Transform circuit to an output of the second switch. The buffer is reduced to length m.

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 method, system and computer program product for computationally efficient estimation of the scale factors of one or more frequency bands in an encoder. These scale factors are dependant on a plurality of variables. One of the variables is approximated according to embodiments of the invention. This reduces the complexity of the estimation of scale factors, especially in digital signal processors.

Abstract: A method of prediction is suggested for the characteristics of future values of processes that can be expressed as integrals over future times with different weight functions (kernels), or as anticausal convolution integrals. In particular, all band-limited processes processes are predictable in this sense, as well as high-frequency processes, with zero energy at low frequencies. In addition, process of mixed type can still be predicted using low-pass filter and high-pass filter for this process, to provide separation on low-band and high frequency processes. It is allowed that an outcome of low-pass filter be not a purely band-limited process, but have exponential decay of energy on high frequencies. The algorithm suggested consists of two blocks: separation of a process on band-limited and high-frequency components, and approximation of the transfer function of the anticausal integral that has to be predicted by transfer functions for causal convolution integrals.

Abstract: A system for detecting and classifying a security breach may include at least one sensor configured to detect seismic vibration from a source, and to generate an output signal that represents the detected seismic vibration. The system may further include a controller that is configured to extract a feature vector from the output signal of the sensor and to measure one or more likelihoods of the extracted feature vector relative to set {bi} (i=1, . . . , imax) of breach classes bi. The controller may be further configured to classify the detected seismic vibration as a security breach belonging to one of the breach classes bi, by choosing a breach class within the set {bi} that has a maximum likelihood.

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: The present disclosure relates to systems and methods for identifying advertisement breaks in digital video files. Generally, an advertisement break identification module receives a digital video file and generates an edge response for each of one or more frames extracted from the video file. If one of the generated edge responses for a particular frame is less than a predefined threshold, then the module identifies the particular frame as the start of an advertisement break. The module then generates further edge responses for frames subsequent to the identified particular frame. Once an edge response is generated for a particular subsequent frame that is greater than the threshold, it is identified as the end of the advertisement break. The video file may then be manipulated or transformed, such as by associating metadata with the advertisement break for a variety of uses, removing the advertisement break from the video file, etc.

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 method for synthesizing crossing ADC distributions via reassembly of multiple k-spaces is disclosed. The method includes the steps of scanning a test object having a plurality of anisotropic structures to acquire a first set of DTI data using gradient directions; rotating the gradient directions by an angle ?; repeating the step of scanning the test object to acquire a second set of DTI data; creating a composite data set from the first and second sets of data; and applying an inverse Fourier transform to the composite data set.

Abstract: An analog-to-digital conversion apparatus includes an interleaving section that aligns the digital data respectively output from a plurality of analog-to-digital conversion sections and generates a data sequence, and a correction arithmetic section that corrects a data value error caused by errors of frequency characteristics of the plurality of analog-to-digital conversion sections, in which the correction arithmetic section includes: a data partitioning section that generates a plurality of partition data by partitioning the data sequence, a data inserting section that inserts data with data value zero at the head or end of each of the partition data by a predetermined insertion data number to sequentially output these data, an arithmetic section that sequentially outputs data after correction made by sequentially performing correction arithmetic on the partition data, and a data connecting section that adds sequentially connects the data after correction and the data after correction following the data aft

Abstract: The present invention provides systems and methods for highly efficient bit error rate (BER) modeling in quasi-linear communication networks. In the present invention, nonlinear noise is treated within a linearization approach along with the amplified spontaneous emission (ASE) noise, and the nonlinear noise is considered as another source of noise in addition to the ASE noise. This enables a quasi-analytical approach to the BER calculation. First, a covariance matrix is analytically computed. An equation is derived for a noise component of a signal and an implicit analytical solution is found depending on the signal and system parameters. Second, probability distribution functions (pdfs) are computed for the signal. An analytical calculation is performed of the characteristic function for the noise statistics. Next, a numerical computation of the Fourier transform of the characteristic function is performed to yield the pdf, and numerical integration is performed on the pdfs to yield the BER.

Abstract: An original image or other data sequence is modified with an internal marker value, and is communicated (stored and/or transmitted) as one component of a transform having multiple complementary components. The image is restored in a closed form, without iteration, and in some cases without any loss of precision from the original image. The original image may have complex element values. Multiple original images may be combined, and separated after restoration. Several types of maps may be embedded in or packaged with the communicated component. Communicated component elements may be stored with variable lengths.

Abstract: The invention relates to a method for transforming physiological data from the time domain to the frequency domain. The method includes the steps of: providing a plurality of digital data in the time domain; providing a microcomputer programmed to run a recursive Fourier transform estimation algorithm; calculating, for each newly received digital data in the time domain, an integer index using modulo(N) arithmetic based on a time the each newly received data was received; selecting a frequency vector from a plurality of N frequency vectors using the integer index; and updating the plurality of frequency coefficients according to a recursive equation including the selected frequency vector as an input variable. The invention also relates to an apparatus that performs a recursive Fourier transform estimation algorithm to convert data in the time domain to data in the frequency domain.

Abstract: Techniques for contingency table release provide an accurate and consistent set of tables while guaranteeing that privacy is preserved. A positive and integral database is constructed that corresponds to these tables. Therefore, a database can be generated that preserves low-order marginals up to a small error. Moreover, a gracefully degrading version of the results is provided as a database can be computed such that the error in the low-order marginals is small, and increases smoothly with the order of the marginal.

Abstract: The present invention provides an Inverse Hadamard Transform (IHT) converter which comprises a first group of registers for receiving coefficients inputted to the IHT converter; a first adder for adding selected the coefficients stored in the first group of registers; a second group of registers for receiving results from the first adder; and a second adder for adding selected the results stored in the second group of registers. The present invention provides an Inverse Hadamard Transform (IHT) converter system.

Abstract: A method for the generation of addresses of successive pairs of input data values of stages of a Fast Fourier Transform calculation stored contiguously in a memory includes initializing at most once per stage a first base address pointer to an address of a first input data value of an initial butterfly calculation of the stage and a second base address pointer to an address of a second input data value of the initial butterfly calculation, and initializing at most once per stage a first constant and a second constant. Pairs of input data values of successive butterfly calculations in the stage are then addressed using the first base address pointer, the second base address pointer, the first constant and the second constant.

Abstract: A method for calculating coefficients of a filter and a method for filtering are provided. The invention directly factorizes a specific function in a cepstrum domain by spectral factorization and cepstrum technique to obtain coefficients of denominator function from the filter. In other words, the invention adopts a non-iterative algorithm to reduce computational complexity and avoid convergence due to calculating coefficients. Besides, the specific function of the invention includes a compensation function, so that a Fourier transform with greatly reduced size can be utilized in the spectral factorization to greatly save the computations and keep good system performance at a receiver.

Abstract: Embodiments include methods, apparatus, and systems for analyzing data in an infrastructure. One embodiment includes a method that senses environmental data at equipment racks in an infrastructure, identifies patterns in the environmental data, and uses the patterns to modify the infrastructure to improve thermal management in the infrastructure.

Abstract: A base station transmitter for maintaining data rate transmission between a set of Fourier Transform matrices, having a digital Fourier Transform Matrix (FTM), and analog FTM, and a plurality of transmit paths therebetween. During the occurrence of a power amplifier failure, the method includes detecting the failure of a power amplifier (PA); and reconfiguring the digital FTM and analog FTM to a pass-thru mode.

Abstract: An M-point Fractional Fourier is described using several 2M-points traditional Fourier transforms. The signal path is fed through a series of blocks including a first multiplier, a zero pad, an FFT, a second multiplier, an IFFT, a first half element, and a third multiplier. The first and third multipliers have as their other inputs a value exp(?j?n2?) for n=0:M?1, derived from the clock offset signal represented by ?.

Abstract: A method for storage for complex numbers that employs a shared exponent field is disclosed. Rather than each floating point component of an complex number having its own distinct signed mantissa and exponent fields, each component includes a distinct signed mantissa field and shares an exponent field, thereby increasing the possible size of each distinct signed mantissa field by as much as one half the number of bits formerly employed to store a single distinct exponent field.

Abstract: A method for displaying changes in spectral content of data signals over periods of time using a computer system. The method includes the steps of transforming time segments of digitized data signals into a frequency based spectral representation of the digitized data. The resulting spectral data are then grouped into appropriate frequency bins. Each frequency bin is normalized by the frequency range of the bin. The energy or power in each frequency bin is then multiplied by fn, where f represents an estimate of the frequency of the bin, and n is an exponent which is used to normalize the frequency content of the data. A logarithmic value is then calculated for each frequency bin. The logarithmic value of each frequency bin for each time period is then mapped to a color or gray-scale value.

Abstract: A system, method, and computer program for determining a descriptor, comprising calculating a maximum distance for a plurality of points in a sector between each of said plurality of points and an origin; calculating a minimal distance from one of said plurality of points and a target line, wherein said maximum distance is an initial value; computing a plurality of Fourier coefficients from said minimal distances; and defining an invariant descriptor from said Fourier coefficients, and appropriate means and computer-readable instructions.

Abstract: Methods, systems, and articles of manufacture consistent with the present invention compute a multidimensional fast Fourier transform of an original matrix having rows and columns of data. The original matrix is divided into a number of blocks of data, each block including at least one datum, the number of rows of data in each block being less than a total number of rows of data in the original matrix. A one-dimensional partial fast Fourier transform of each block in a row of blocks is computed. A result of the computations is stored in a resultant matrix having rows and columns. The resultant matrix is transposed to a transposed matrix having rows and columns. While transposing the resultant matrix, one-dimensional partial fast Fourier transforms of each block of subsequent rows of blocks are simultaneously computed, one row of blocks at a time, until one-dimensional partial fast Fourier transforms are computed for each block.

Abstract: The present invention provides a technology which can perform a precise restoration to a distribution of original information by carrying out an iterative calculation using only a distribution of degraded information. The method according to the present invention performs the restoration to original information based only on degraded information. The method according to the present invention considers the distribution of the degraded information and the distribution of the original information as distributions of probability density functions, and considers a transfer function of a transfer system as a probability density function of a conditional probability.

Abstract: A Fourier transformation algorithm implementation in which accommodation is provided for the output attenuation occurring when an input signal falls intermediate two terms of the transformation output series in its frequency. Corrected Fourier transformation terms, achieved by combining the magnitudes of attenuated Fourier transformation terms generated by the input signal at Fourier transformation frequencies distant to the input signal frequency, in either a vectorial or a scalar combination, are substituted for an attenuated Fourier transformation term according to the invention. Noise correction of the substitute Fourier transformation terms is also provided. The invention is disclosed through use of a global position system signal example that is subjected to a double Fourier transformation filtering process to enhance the incoming signal to noise ratio. Normally occurring 3.9 decibel attenuations in each Fourier transformation step are reduced to about 0.9 decibel each through use of the invention.

Abstract: A network system and a method of determining a location of a transmitter are described. The method includes reading a signal strength of a signal transmitted by the transmitter by each of a plurality of receivers, at each frequency in a plurality of frequencies, extracting phase information using an amplitude of the signal at each of the plurality of frequencies, and applying a transform (such as a Fourier Transform) to the signal in the frequency domain to obtain a representation of the signal in the time-domain. The method further includes applying a time window to the signal in the time-domain to eliminate reflected multipath signals that arrive to the respective receivers later than a line-of-sight signal to obtain a windowed signal in the time domain, and calculating a location of the transceiver using the windowed time domain signal.

Abstract: A data processing apparatus having data cache performs an N-point radix-R Fast Fourier Transform. If the data set is smaller than the data cache, the data processing apparatus performs the Fast Fourier Transform in logRN stages on all the data set in one pass. If the data set is larger than the data cache but smaller than R times the data cache, the data processing apparatus performs a first stage radix-R butterfly computation on all the input data producing R independent intermediate data sets. The data processing apparatus then successively performs second and all subsequent stage butterfly computations on each independent intermediate data set in turn producing corresponding output data. During the first stage radix-R butterfly computations, each of R continuous sets are separated in memory by memory locations equal to the size of a cache line.

Abstract: A Fourier transformation arrangement usable in an electronic warfare radio receiver for analyzing spectral content of multiple transmitter-sourced brief duration incoming signals for their signal characteristics. The disclosed Fourier transformation arrangement includes approximated Kernel function values disposed in a significant plurality of locations about a real-imaginary coordinate axis origin according to disclosed locating principles. The points are displaced from the origin by magnitudes having real and imaginary component lengths of powers of two commencing with zero. Multiplication involving a power of two component length during a Kernel function utilization are preferably achieved by way of an expanded binary shift multiplication algorithm in lieu of a full fledged digital multiplication algorithm. A group of guiding principles for selecting desirable approximation Kernel function locations is included.

Abstract: A one-dimensional Fourier transform program for quickly performing a one-dimensional Fourier transform intended for a scalar computer comprises a step of resolving a data length N of one-dimensional data into the product of factors N1×N2×. . . ×Nm, a step of setting the data length N as P×Q, calculating twiddle factors that are required for a multiplication with results of a one-dimensional Fourier transform of a length Q, which is performed by P times, for an initial one of Q-1 twiddle factors for multiplication intended for each of P Fourier transform results, while changing P and Q, and storing calculation results in a table, and a step of performing a Fourier transform of data as m separated phases with the table for storing the calculated twiddle factors.

Abstract: A method of enhancing spectral data such as a frequency, wavelength or mass spectrum comprises applying an inverse Fourier Transform to the data in the frequency, wavelength or mass spectrum, zero-filling and, optionally, apodizing that inverse transform data, and then applying a Fourier Transform to convert the inverse data back into the frequency, wavelength or mass domain. The resultant processed spectrum provides a more accurate indication of peak location, shape and height.

Abstract: The invention proposes a data transmission process, from a first unit (1) situated at a predetermined depth of an oil well to a second unit (2) situated at the surface of this well, the process comprising a digital-analog conversion stage (8) of the data to obtain an analog signal forming support of the data, and an amplification stage (9) of this signal prior to its emission in a cable (11) connecting the two units, characterised in that at least two distinct scramblings (20, 21) of the data are completed, such that there is a first and a second set of scrambled data. After passage in a single complex inverse Fourier transform, that intended for emission is selected (26), whereof the dynamic in amplitude is the lowest. If the probability of saturating with a single set is 10?q, then due to this process the probability will be 10?2q.

Abstract: A micrometer-scale ion trap, fabricated on a monolithic chip using semiconductor micro-electromechanical systems (MEMS) technology. A single 111Cd+ ion is confined, laser cooled, and the heating measured in an integrated radiofrequency trap etched from a doped gallium arsenide (GaAs) heterostructure. Single 111Cd+ qubit ions are confined in a radiofrequency linear ion trap on a semiconductor chip by applying a combination of static and oscillating electric potentials to integrated electrodes. The electrodes are lithographically patterned from a monolithic semiconductor substrate, eliminating the need for manual assembly and alignment of individual electrodes. The scaling of this structure to hundreds or thousands of electrodes is possible with existing semiconductor fabrication technology.

Abstract: A method determines a transient response of a sample. The method includes providing a measured magnitude of the Fourier transform of a complex electric field temporal profile of a pulse sequence comprising a first pulse indicative of the transient response of the sample and a second pulse. The method further includes providing an estimated phase term of the Fourier transform of the complex electric field temporal profile of the pulse sequence. The method further includes multiplying the measured magnitude and the estimated phase term to generate an estimated Fourier transform of the complex electric field temporal profile of the pulse sequence. The method further includes calculating an inverse Fourier transform of the estimated Fourier transform, wherein the inverse Fourier transform is a function of time. The method further includes calculating an estimated complex electric field temporal profile of the pulse sequence by applying at least one constraint to the inverse Fourier transform.

Abstract: Methods, systems, and computer program products for performing real-time quadrature projection based FDOCT are disclosed. According to one method, a plurality of interferogram signals is phase shifted. A Fourier transform is applied to each of the plurality of interferogram signals. Depth dependence of the plurality of transformed interferogram signals is then removed. A real quadrature component and an imaginary quadrature component for each of the plurality of transformed interferogram signals are subsequently calculated. The real quadrature components of the transformed interferogram signals are combined to obtain a derived real component and the imaginary quadrature components of the transformed interferogram signals are combined to obtain a derived imaginary component. A full-range depth profile of the object is constructed by adding the derived real component to the product of the derived imaginary component and a scaling factor.

Abstract: A method for displaying changes in spectral content of data signals over periods of time using a computer system. The method includes the steps of transforming time segments of digitized data signals into a frequency based spectral representation of the digitized data. The resulting spectral data are then grouped into appropriate frequency bins. Each frequency bin is normalized by the frequency range of the bin. The energy or power in each frequency bin is then multiplied by fn, where f represents an estimate of the frequency of the bin, and n is an exponent which is used to normalize the frequency content of the data. A logarithmic value is then calculated for each frequency bin. The logarithmic value of each frequency bin for each time period is then mapped to a color or gray-scale value.

Abstract: Provided is an apparatus and method for comparing a protein structure, which can search a protein similar to an inquiry protein in a 3D protein database in real time by describing a feature of a protein structure by using a three-dimensional (3D) relative directional angle (RDA) and a Fourier descriptor. The apparatus includes: a 3D RDA coder configured to code a 3D RDA of a target protein data or an inquiry protein data inputted from the outside; a Fourier transformer configured to obtain Fourier coefficients by Fourier transforming 3D RDA coding values coded by the 3D RDA coder; a comparator configured to compare the obtained Fourier coefficient of the target protein data with the obtained Fourier coefficient of the inquiry protein data; and a data generator configured to output protein data in order from high similarity to low similarity according to the comparison result of the comparator.

Abstract: A system and method efficiently prepare the initial state of q quantum computer required by the eigenvalue approximation method of Abrams and Lloyd. The system and method can be applied when solving continuous Hermitian eigenproblems, e.g. the Schrodinger equation, on a discrete gird, and allows for efficient calculation of their eigenvalues with quantum computers. A system and method efficiently prepare an approximate initial state (not limited to eigenvectors) of a quantum computer required by a quantum algorithm as input.

Abstract: The present invention relates to a method for processing a digital input signal by a Finite Impulse Response, FIR, filtering means, comprising partitioning the digital input signal at least partly in the time domain to obtain at least two partitions of the digital input signal; partitioning the FIR filtering means in the time domain to obtain at least two partitions of the FIR filtering means; Fourier transforming each of the at least two partitions of the digital input signal to obtain Fourier transformed signal partitions; Fourier transforming each of the at least two partitions of the FIR filtering means to obtain Fourier transformed filter partitions; performing a convolution of the Fourier transformed signal partitions and the corresponding Fourier transformed filter partitions to obtain spectral partitions; combining the spectral partitions to obtain a total spectrum; and inverse Fourier transforming the total spectrum to obtain a digital output signal.

Abstract: A method encodes a sequence of blocks of input bits to be transmitted over a wireless channel. Each block of input bits is converted to a codeword, and each codeword is mapped to multiple sub-blocks of complex numbers. Each sub-block is multiplied by a disambiguating spreading transform to obtain a sub-block of transformed symbols, which can be modulated and transmitted to a receiver, where each received block is demodulated to a block of complex numbers, which are partitioned into sub-blocks. The sub-block of complex numbers are converted to a set of likelihood ratios that correspond to decoded codewords. The input bits can be decoded unambiguously even if only one of the blocks of symbols corresponding to the block of input bits is received correctly.

Abstract: A method embodiment of the present method and apparatus may comprise: transforming raw data into flattened data; taking a first derivative of the flattened data to produce derivate data; and applying a Fourier transform to the derivate data to produce transformed data.

Abstract: An action efficiency support apparatus includes a detection unit, a storage unit, a calculation unit and a judgment unit. The detection unit detects an activity to acquire activity information. The storage unit stores the activity information. The calculation unit calculates a probability pattern as to presence or absence of the activity in a predetermined period or a probability pattern a frequency of the activity in the predetermined period, based on the activity information. The judgment unit judges an effect of personal action based on the calculated probability pattern.

Abstract: A two-dimensional transmission cross coefficient is obtained based on a function representing a light intensity distribution formed by an illumination apparatus on a pupil plane of the projection optical system and a pupil function of the projection optical system. Based on the two-dimensional transmission cross coefficient and data of a pattern on an object plane of the projection optical system, an approximate aerial image is calculated by using at least one of plural components of an aerial image on an image plane of the projection optical system. Data of a pattern of an original is produced based on the approximate aerial image.

Abstract: A method for improving precision in FFT calculations. For each iteration in an FFT implementation, a constant normalization multiplier is inserted such that the dynamic ranges of the input and output are the same. The final FFT output is multiplied by a constant normalization factor given by the number of iterations and the constant normalization multiplier.

Abstract: A method and system are presented for fast generation of one or more 2D DRRs of an object. 3D scan data of the object (such as CT scan data) are generated. A 3D fast Fourier transform F(u,v,w) is computed for a 3D scan volume f(x,y,z) within the 3D scan data, the scan volume f(x,y,z) having an orientation (?, ?, ?). The 3D Fourier transform data are resampled along a surface S(?, ?, ?, u?, v?) at angles ?, ?, ? corresponding to the orientation of the scan volume. The surface S is a plane for parallel beam geometry. For cone-beam geometry, it is the surface of a sphere whose center is coincident with the imaginary origin of the X-rays for the projection. The 2D inverse Fourier transform F?1 [S(?, ?, ?, u?, v?)] of the surface is computed, thereby generating a 2D DRR reconstructed along a projection direction perpendicular to the sample surface.

Abstract: The present invention is a digital watermarking technique Phasemark™ for image authentication. Using a signature extracted from the original image, the present invention hides an encoded version of the signature back into the original image, forming the watermarked image. The hiding is done in the frequency domain. Specifically, the present invention is a new transform domain digital watermarking technique that hides a signature obtained from the Fourier phases into the magnitude spectrum of the same host image. The detection process computes the discrete Fourier transform of the watermarked image, extracts and decodes the embedded signature, and then correlates it with calculated phase information. Correlation metrics determine the degree of authenticity of the image.

Abstract: A segmented radial spatial light modulator has an active optic area comprising a plurality of radially extending active optic modulators disposed at various angular orientations with respect to a central axis. The segmented radial spatial light modulator is used in separating and isolating portions of Fourier transform optic patterns from images for characterization of images by shape for recording, storing, retrieving, searching, and comparison to other images for matches and near matches. The images can be ghosted to increase optical power in the Fourier transform optic pattern without adding new shape content and for grading comparisons to other image shape characteristics for identifying near matches in addition to matches.

Abstract: There is provided an analog-to-digital conversion apparatus that corrects digital data output from a plurality of analog-to-digital conversion units.

Abstract: K data signals, or bursts, are transmitted over a shared spectrum in a code division multiple access communication format. A combined signal is received and sampled over the shared spectrum, as a plurality of received vector versions. The combined signal includes the K transmitted data signals. A plurality of system matrices and an associated covariance matrix using codes and estimated impulse responses of the K data signals is produced. Each system matrix corresponds to a received vector version. The system and covariance matrices are extended and approximated as block circulant matrices. A diagonal matrix of each of the extended and approximated system and covariance matrices are determined by prime factor algorithm-fast Fourier transform (PFA-FFT) without division of the matrix. The received vector versions are extended. A product of the diagonal matrices and the extended received vector versions is taken.

Abstract: One embodiment of the present invention provides a system that reconstructs a high-resolution signal from a set of low-resolution quantized samples. During operation, the system receives a time series containing low-resolution quantized signal values which are sampled from the high-resolution signal. Next, the system performs a spectral analysis on the time series to obtain a frequency series for the low-resolution quantized signal values. The system next selects a subset of frequency terms from the frequency series which have the largest amplitudes. The system then reconstructs the high-resolution signal by performing an inverse spectral analysis on the subset of the frequency terms.