890 results about "Symbol of a differential operator" patented technology

The equalizer of the present invention operates on input multipath signal samples, preferably at chip or sub-chip resolution, to remove or substantially cancel the effects of one or more secondary signals from the main path signal. Using predetermined path information for one or more of the secondary path signals, including magnitude, phase, and time offset relative to the main path signal, the equalizer compensates input multipath signal samples by subtracting estimated secondary signal values from the input samples. For each input sample, the equalizer forms a sliced sample, where the sliced sample represents a nominal phase value defined by the modulation scheme used in the original chip or symbol transmission that is closest in value to the actual phase of the input sample. These sliced samples are held in a running buffer and used, in combination with the predetermined path information and scaling logic, to form the estimated secondary signal values for compensating the input samples.

A precoded orthogonal frequency division multiplexer (OFDM) system that improves the preformance of OFDM systems for spectral null channels, and size K×1 vector OFDM systems that reduce the cyclic prefix length by K times compared to conventional OFDM systems. The precoding scheme comprises inserting one or more zeros between each of the two sets of K consecutive information symbols, although it can be generalized to a general form. This precoding scheme removes the spectral nulls of an ISI channel without knowing the ISI channel. When no zero is inserts between each of the two sets of K consecutive information symbols and only K consecutive symbols are blocked together, vector OFDM systems are obtained. The bit error rate performance of the vector OFDM systems of the present invention is much improved over conventional OFDM systems.

A multiplier capable of performing signed and unsigned scalar and vector multiplication is disclosed. The multiplier is configured to receive signed or unsigned multiplier and multiplicand operands in scalar or packed vector form. An effective sign for the multiplier and multiplicand operands may be calculated and used to create and select a number of partial products according to Booth's algorithm. Once the partial products have been created and selected, they may be summed and the results may be output. The results may be signed or unsigned, and may represent vector or scalar quantities. When a vector multiplication is performed, the multiplier may be configured to generate and select partial products so as to effectively isolate the multiplication process for each pair of vector components. The multiplier may also be configured to sum the products of the vector components to form the vector dot product. The final product may be output in segments so as to require fewer bus lines. The segments may be rounded by adding a rounding constant. Rounding and normalization may be performed in two paths, one assuming an overflow will occur, the other assuming no overflow will occur. The multiplier may also be configured to perform iterative calculations to evaluate constant powers of an operand. Intermediate products that are formed may be rounded and normalized in two paths and then compressed and stored for use in the next iteration. An adjustment constant may also be added to increase the frequency of exactly rounded results.

An algorithmic soft-decision decoding method for Reed-Solomon codes proceeds as follows. Given the reliability matrix Pi showing the probability that a code symbol of a particular value was transmitted at each position, computing a multiplicity matrix M which determines the interpolation points and their multiplicities. Given this multiplicity matrix M, soft interpolation is performed to find the non-trivial polynomial Q<HIL><PDAT>M< / SB><PDAT>(X,Y) of the lowest (weighted) degree whose zeros and their multiplicities are as specified by the matrix M. Given this non-trivial polynomial Q<HIL><PDAT>M< / SB><PDAT>(X,Y), all factors of Q<HIL><PDAT>M< / SB><PDAT>(X,Y) of type Y-f(X) are found, where f(X) is a polynomial in X whose degree is less than the dimension k of the Reed-Solomon code. Given these polynomials f(X), a codeword is reconstructed from each of them, and the most likely of these codewords selected as the output of the algorithm. The algorithmic method is algebraic, operates in polynomial time, and significantly outperforms conventional hard-decision decoding, generalized minimum distance decoding, and Guruswami-Sudan decoding of Reed-Solomon codes. By varying the total number of interpolation points recorded in the multiplicity matrix M, the complexity of decoding can be adjusted in real time to any feasible level of performance. The algorithmic method extends to algebraic soft-decision decoding of Bose-Chaudhuri-Hocquenghem codes and algebraic-geometry codes.< / PTEXT>

In the present invention, an apparatus for behavior analysis and method thereof is provided. In this apparatus, each behavior is analyzed and has its corresponding posture sequence through a triangulation-based method of triangulating the different triangle meshes. The two important posture features, the skeleton feature and the centroid context, are extracted and complementary to each other. The outstanding ability of posture classification can generate a set of key postures for coding a behavior sequence to a set of symbols. Then, based on the string representation, a novel string matching scheme is proposed to analyze different human behaviors even though they have different scaling changes. The proposed method of the present invention has been proved robust, accurate, and powerful especially in human behavior analysis.

A multiplier capable of performing signed and unsigned scalar and vector multiplication is disclosed. The multiplier is configured to receive signed or unsigned multiplier and multiplicand operands in scalar or packed vector form. An effective sign for the multiplier and multiplicand operands may be calculated based upon each operand's most significant bit and a control signal. The effective signs may then be used to create and select a number of partial products according to Booth's algorithm. Once the partial products have been created and selected, they may be summed and the results may be output. The results may be signed or unsigned, and may represent vector or scalar quantities. When a vector multiplication is performed, the multiplier may be configured to generate and select partial products so as to effectively isolate the multiplication process for each pair of vector components. The multiplier may also be configured to sum the products of the vector components to form the vector dot product. The final product may be output in segments so as to require fewer bus lines. The segments may be rounded by adding a rounding constant. Rounding and normalization may be performed in two paths, one assuming an overflow will occur, the other assuming no overflow will occur.

The present invention provides a scattered pilot (SP) location detector capable of detecting patterns of SP symbols promptly without using a TMCC signal. The SP location detector comprises a multiplier which multiplies received signals generated by demodulating OFDM modulation signals in which pilot symbols are dispersively disposed in accordance with four types of patterns and which are transmitted periodically, by a pseudo-random number bit sequence, four arithmetic circuits which are respectively provided corresponding to the four types of patterns and which respectively extract pilot symbols corresponding to respective patterns from results of multiplication by the multiplier and calculate sums of phase differences between the extracted pilot symbols, followed by outputting absolute values thereof, and a pattern detection circuit which detects the corresponding arithmetic circuit maximum in the calculated absolute value from within the four arithmetic circuits.

Soft symbol decoder algorithms for multiple input, multiple output (MIMO) receivers reduce the search complexity by searching over fewer than all possible combinations of transmitted symbols to compute log metrics for each transmitted bit from each transmit antenna. In one algorithm, a sub-optimal set of transmitted symbols is computed and the transmitted symbols are restricted to neighboring constellation points of the sub-optimal set. In another algorithm, all constellation points are searched for every antenna except one. In yet another algorithm, constellation points are searched excluding more than one antenna. The non-searched antenna(s) can be handled by either a bit stuffing or a soft slicing technique.

A communication system having a transmitter chaotic signal generator and a receiver chaotic signal generator which when uncoupled generate state signals along substantially identical chaotic attractor trajectories in an out of phase relation. A controller controls the transmitter chaotic signal generator to transmit a state signal having segments of the deterministic state trajectory which identify a subsequent length of the deterministic state trajectory matching an input N-bit sequence. A receiver coupler receives the transmitted state signal and, if the signal is above a threshold for a duration of approximately two bit periods, synchronizes the receiver chaotic signal generator to the segment of its deterministic state trajectory indicated by the state signal to generate, with or without coupling, the subsequent length of that state trajectory matching the input N-bit sequence. A receiver symbol detector reconstructs the N-bit sequence based on the receiver chaotic oscillator state signal.

The present invention takes advantage of a quadratic-only ambiguity for x-coordinates in elliptic curve algebra as a means for encrypting plaintext directly onto elliptic curves. The encrypting of plaintext directly onto elliptic curves is referred to herein as "direct embedding". When performing direct embedding, actual plaintext is embedded as a "+" or "-" x-coordinate. The sender specifies using an extra bit whether + or - is used so that the receiver can decrypt appropriately. In operation their are two public initial x-coordinates such that two points P1+ and P1- lie respectively on two curves E+ and E-. A parcel of text xtext is selected that is no more than q bits in length. The curve (E+ or E-) that contains xtext is determined. A random number r is chosen and used to generate a coordinate xq using the public key of a receiving party. An elliptic add operation is used with the coordinate xq and the parcel of text to generated a message coordinate xm. A clue xc is generated using the random number and the point P from the appropriate curve E±. The sign that holds for xtext is determined and called g. The message coordinate xm, the clue xc, and the sign g are sent as a triple to the receiving party. The receiving party uses the clue xc and its private key to generate coordinate xq. Using the sign g and coordinate xq, the text can be recovered.

A multilevel optical receiver can comprise a plurality of comparators that generally correspond with the number of levels in a multilevel data stream. Each comparator can be individually controlled and fed a decision threshold in order to decode a multilevel signal. The multilevel optical receiver can generate a statistical characterization of the received symbols in the form of a marginal cumulative distribution function (CDF) or probability density function (pdf). This characterization can be used to produce a set of ε-support estimates from which conditional pdfs are derived for each of the transmission symbols. These conditional pdfs may then be used to determine decision thresholds for decoding the received signal. The conditional pdfs may further be used to continuously estimate the fidelity or error rate of the received signal without the transmission of a testing sequence. The ε-supports may further be used to automatically control the gain on the receiver.

Techniques for measuring signal quality in a communications link supporting OFDM symbol transfer across plural sub-carriers are disclosed. These techniques employ a link interface receiving OFDM symbol(s) from the link, and a signal-to-noise ratio (SNR) estimation unit generating an estimate of a geometric SNR (SNRgeo) for the received symbols based on an average of the logrithmic difference between soft decision and hard decisions for the received symbol. SNRgeo here defines a scalar measure of the link signal quality, which results in a computationally efficient yet accurate link signal quality assessment, and thereby permit selective link characteristic alteration. Only sub-carrier subsets need be used to derive a relatively an accurate SNRgeo estimate. Sharing calculation resources between SNR estimation and soft decision units further reduce implementation complexity. Hard decision generation may use a relatively quick slicer or more accurate viterbi decoder / OFDM re-coder combination, as design goals dictate.

An apparatus, method and system are provided for correlated noise reduction, in a trellis decoding environment, such as second generation HDSL, in which crosstalk impairments may be significant. The preferred embodiments provide equalization and correlated noise reduction, utilizing a training period to generate corresponding coefficients, and utilizing two different training error signals. In addition, the apparatus method and system also provide continued and adaptive correlated noise reduction during data transmission, utilizing two additional error signals, a trellis error signal and a tentative error signal. The trellis error signal is a decision error of a selected previous state of a selected trellis path, in which the selected trellis path has a smallest cumulative error of a plurality of trellis paths, and the selected previous state is preferably the immediately previous state. The tentative error signal is formed as a difference between a delayed, tentative symbol decision and a delayed received data signal subsequent to equalization, in which the delay is preferably one symbol time. The various embodiments may be utilized with trellis encoding, with or without data precoding.

A method is provided of transmitting signals from two or more antennas in a wireless telecommunications network, in which at least one data sequence is space-time block encoded. Before transmitting the data sequence, a linear transformation is applied to the data sequence, the linear transformation being adapted to use knowledge of correlation among the antennas to at least partially compensate the transmitted signals for said correlation. The linear transformation depends on the eigenvalues of an antenna correlation matrix. The linear transformation further depends on a ratio of symbol energy (Es) to noise variance (σ2). The method includes transmitting the encoded and transformed data sequence.

The invention relates to the relay protection field of a distribution network, in particular to a single-phase earth fault self-adapting selection method of a double-phase TA distribution network based on transient state zero sequence current frequency distribution. The invention is characterized in that: firstly zero sequence currents before and after failure are decomposed into wavelets and character frequency ranges of each line are reconstructed by single branches; then zero sequence current instantaneous values in reconstructed signals of each line are compared with corresponding instantaneous values of other lines through symbols; if the symbols of the zero sequence current instantaneous values are different from that of other lines, 1 is added to a counter; after all the sampling points are compared, a line with largest counter value is obtained; symbol comparison of respective reconstructed data is performed again to lines with the character frequency range of (4,0), and if points with uniform symbols account for over 60 percent and the values of the points are larger than counter values of other lines by five, then the line is estimated as a fault line; otherwise the line with largest counter value verified is estimated as a fault line. The invention can effectively utilize information included in the fault transient state process and greatly improve the reliability of fault selection.

A reduced state maximum likelihood sequence estimator allows the use of improved equalization techniques that provides greatly improved performance for channels with severe attenuation and spectral nulls. The reduced state maximum likelihood sequence estimator retains kn states of a total number of K states, kn<K, with each retained state having an associated state metric. (J)(kn) new states are determined based on kn previous states and a most recently received sample, using J transitions, J being a less than L, where L is a size of a symbol alphabet. (J)(kn) new state metrics are determined which are respectively associated with each new state. The new state metrics are compared to a threshold and those states whose metric does not exceed the threshold are retained. The reduced complexity of the MLSE allows for the use of partial response equalizers, e.g., a partial response class V (PRV) equalizer. The number of retained states kn varies according to an adaptive threshold which limits the number of retained states between a lower bound and an upper bound. The threshold may be determined according to the metric of the most likely state of the retained states and a selected one of a plurality of transition metrics associated with the most likely state metric.

Methods, apparatus and systems for error correction of n-valued symbols in codewords of p n-valued symbols with n>2 and for n=2 and k information symbols have been disclosed. Coders and decoders using a Linear Feedback Shift Registers (LFSR) are applied to generate codewords and detect the presence of errors. An LFSR can be in Fibonacci or Galois configuration. Errors can be corrected by execution of an n-valued expression in a deterministic non-iterative way. Deterministic error correction methods based on known symbols in error are provided. Corrected codewords can be identified by comparison with received codewords in error. N-valued LFSR based pseudo-noise generators and methods to determine if an LFSR is appropriate for generating error correcting codes are also disclosed. Methods and apparatus applying error free assumed windows and error assumed windows are disclosed. Systems using the error correcting methods, including communication systems and data storage systems are also provided.

Symbol timing recovery employs a blind cost criterion from the Bussgang class of functions, and its stochastic gradient, to generate a timing phase error used to adjust sampling of received symbols. For one implementation, the estimate is derived in accordance with the Constant Modulus (CM) criterion and its gradient via the CM algorithm (CMA), and the estimate is calculated from a sequence of samples. This estimate is then used to adjust the period and phase of the sample sequence toward the period and phase of the transmitted symbols, driving the timing phase error to zero. The values used may be either i) samples themselves, ii) processed (e.g., interpolated) samples, or iii) equalized and processed samples. In addition, timing phase error estimates for other cost criteria, including the least mean squares algorithm, may be generated. These timing phase error estimates are selected either alone or in combination for deriving the timing phase error used to adjust the period and phase of the sample sequence.

A method for processing a signal modulated with information symbols to account for an additive offset and slope is disclosed. First, an initial estimate of offset and slope is made and hypotheses of all possible values of a sequence of one or more information symbols are then made. For each of said hypotheses, the associated data symbol sequence is used to make an improved estimate of offset and slope and the improved estimate of offset and slope are stored against each of the hypotheses. For each hypothesis, the improved estimate of offset and slope is used in calculating an expected signal value and a mismatch between a sample of the modulated signal and the expected value is computed. The hypotheses are then sequentially extended by one symbol, the slope and offset estimates are updated and the mismatches are accumulated to form a path metric value for each extended hypothesis, and resolving between said hypotheses based on said path metric values using a Viterbi Sequential Maximum Likelihood Sequence Estimation process to produce a most likely hypothesis of said modulated information symbols substantially unimpaired by said additive slope and offset.

Techniques for deriving eigenvectors based on steered reference and used for spatial processing. A steered reference is a pilot transmission on one eigenmode of a MIMO channel per symbol period using a steering vector for that eigenmode. The steered reference is used to estimate both a matrix Σ of singular values and a matrix U of left eigenvectors of a channel response matrix H. A matrix Ũ with orthogonalized columns may be derived based on the estimates of Σ and U, e.g., using QR factorization, minimum square error computation, or polar decomposition. The estimates of Σ and U (or the estimate of Σ and the matrix Ũ) may be used for matched filtering of data transmission received via a first link. The estimate of U or the matrix Ũ may also be used for spatial processing of data transmission on a second link (for reciprocal first and second links).

A method to increase diversity in MIMO fading channels interleaves coordinates of complex symbol(s) in a transmission frame after encoding and modulating. Specifically, an input signal is encoded and modulated into a codeword, jointly across at least two pipes, said pipes having space, time, frequency, or other nature, wherein the codeword spans a frame and is defined as at least one complex symbol whose complex values are all those to be transmitted during all channel uses covered by the frame. Each of the complex symbols have a first and second coordinate. After modulating, which may be combined with encoding in a signal space encoder, the coordinates are interleaved. In modulation, the complex symbols (typically two dimensional) may arise as elements of a multidimensional (typically greater than two dimensions) signal constellation, in which case those multidimensional constellation coordinates are the ones that are interleaved in the frame. The frame carrying the interleaved coordinates is transmitted by the first and at least second antennas, possible opposed sub-frames of the overall frame being transmitted separately by opposed antennas. A coset selector is used in some embodiments to maximize a minimum Hamming distance, and / or a minimum Euclidean distance, between coordinates within a coset to control diversity and / or coding gain. In some embodiments, the operation of the encoder and modulator is such as to maximize a minimum coordinate-wise Hamming distance, and / or a minimum Euclidean distance, between allowable codewords, and / or to provide additional structure for the allowable codewords. A method, transmitter, system, and mobile station are described.

A reduced state maximum likelihood sequence estimator allows the use of improved equalization techniques that provides greatly improved performance for channels with severe attenuation and spectral nulls. The reduced state maximum likelihood sequence estimator retains kn states of a total number of K states, kn<K, with each retained state having an associated state metric. (J)(kn) new states are determined based on kn previous states and a most recently received sample, using J transitions, J being a less than L, where L is a size of a symbol alphabet. (J)(kn) new state metrics are determined which are respectively associated with each new state. The new state metrics are compared to a threshold and those states whose metric does not exceed the threshold are retained. The reduced complexity of the MLSE allows for the use of partial response equalizers, e.g., a partial response class V (PRV) equalizer. The number of retained states kn varies according to an adaptive threshold which limits the number of retained states between a lower bound and an upper bound. The threshold may be determined according to the metric of the most likely state of the retained states and a selected one of a plurality of transition metrics associated with the most likely state metric.

A system for finding and presenting content items in response to keystrokes entered by a user on an input device having a known layout of overloaded keys selected from a set of key layouts. The system includes (1) a database containing content items and terms characterizing the content items; (2) input logic for receiving keystrokes from the user and building a string corresponding to incremental entries by the user, each item in the string having the set of alphanumeric symbols associated with a corresponding keystroke; (3) mapping logic to map the string to the database to find the most likely content items corresponding to the incremental entries, the mapping logic operating in accordance with a defined error model corresponding to the known layout of overloaded keys; and (4) presentation logic for ordering the most likely content items identified by the mapping logic and for presenting the most likely content items.

An apparatus for and a method of iterative equalization for communication over noisy channels suitable for use with a wide range of different types of communications systems and channels that is particularly applicable to power line based communication systems. Equalization of received symbols is achieved by iteratively removing the influence of previous symbols dispersed due to channel ISI. Equalization is performed using iterative subtraction in combination with calculations based on the inverse of the transfer matrix. The impulse response of previous symbols is subtracted out to yield the impulse response of the received symbol. The estimate of the current symbol {tilde over (B)}n is then calculated by passing the modified received symbol through a matched filer which functions to remove the effect of channel ISI from the symbol. Multiple iterations are performed to improve the accuracy of the resultant symbol decision.

In a wideband Personal Communication Services system, a method and system are proposed for suppressing co-channel interference and reducing inter-symbol interference generated during the transfer of a data packet through a selected radio frequency channel. The system includes a weight controller utilizing recursive least squares algorithm to generate a plurality of appropriate weights to be integrated into received signals in order to maximize signal-to-noise ratio. A detected signal or a training sequence is intelligently switched in as a reference sequence in order to generate a plurality of appropriate weights. To further enhance the adaptive array system and take advantage of the multi-path radio frequency communication environment, two multi-path diversity schemes are included. One embodiment includes an adaptive array system with parallel array processors and another embodiment includes a system with tapped delay line processors.

Detection for a MIMO (multiple-input, multiple-output) wireless communications system with symbols iteratively detected in subsets with maximum likelihood hard decisions within subsets. Previously detected subsets of symbols are used to regenerate corresronding input signals for interference cancellation. With a 4-transmitter antenna, 4-receiver antenna system, two subsets of two symbols are possible with the first two symbols detected with zero-forcing or MMSE soft estimates which feed maximum likelihood hard decisions; and the hard decision for the first two symbols are used for interference cancellation followed by zero-forcing or MMSE soft estimates for the second two symbols which then feed further maximum likelihood hard decisions.

A method to increase diversity in MIMO fading channels interleaves coordinates of complex symbol(s) in a transmission frame after encoding and modulating. Specifically, an input signal is encoded and modulated into a codeword, jointly across at least two pipes, said pipes having space, time, frequency, or other nature, wherein the codeword spans a frame and is defined as at least one complex symbol whose complex values are all those to be transmitted during all channel uses covered by the frame. Each of the complex symbols have a first and second coordinate. After modulating, which may be combined with encoding in a signal space encoder, the coordinates are interleaved. In modulation, the complex symbols (typically two dimensional) may arise as elements of a multidimensional (typically greater than two dimensions) signal constellation, in which case those multidimensional constellation coordinates are the ones that are interleaved in the frame. The frame carrying the interleaved coordinates is transmitted by the first and at least second antennas, possible opposed sub-frames of the overall frame being transmitted separately by opposed antennas. A coset selector is used in some embodiments to maximize a minimum Hamming distance, and / or a minimum Euclidean distance, between coordinates within a coset to control diversity and / or coding gain. In some embodiments, the operation of the encoder and modulator is such as to maximize a minimum coordinate-wise Hamming distance, and / or a minimum Euclidean distance, between allowable codewords, and / or to provide additional structure for the allowable codewords. A method, transmitter, system, and mobile station are described.

The invention relates to a multidimensional constellation mapping based coding and modulating method, demodulating and decoding method and system. The coding and modulating method comprises the following steps of: carrying out channel coding and bit interleaving on input information bits to obtain coded interleaved bits; carrying out K-dimensional pulse amplitude modulated constellation mapping on the coded and interleaved bits to obtain a constellation mapping symbol of a K-dimensional real-number vector, wherein K is a positive integer; carrying out constellation rotation on the constellation mapping symbol to obtain a multidimensional rotated constellation mapping symbol of the K-dimensional real-number vector; and carrying out dimension conversion and general real-number interleaving on the multidimensional rotated constellation mapping symbol to obtain a coded and modulated symbol, and outputting the coded and modulated symbol. The method and system in the invention can ensure that the performances of a coding and modulating system and a corresponding demodulating and decoding system approach the channel capacity at medium and low frequency spectrum efficiency under the AWGN (Added White Gaussian Noise) and fading channel conditions and meanwhile, the throughput of the system is taken into consideration.

A transmitter generates a constellation pattern comprising replications of a first constellation. Each replication has a replication offset relative to a neighbouring replication and alternates between corresponding to the first constellation and an axis mirrored constellation (mirrored around the real and / or imaginary axis). The transmitter selects from the pattern such that a symbol for a data value corresponding to a first constellation point of the first constellation is selected from all replications of this constellation point. The constellation point resulting in the lowest transmit power for a combination of a plurality of antennas may be selected. A receiver receives the selected symbol and provides a folding operation to compensate for replications and mirroring. The replication offset may be lower than the minimum distance between symbols in the first constellation thereby resulting in an improved trade off between transmit power and error probability, e.g. in a Multiple Input Multiple Output system.