Abstract: A technique is provided that may be employed in multicarrier communications to improve the efficiency of error correction using symbol-oriented error correction methodologies, by reducing the number of error correction code symbols (102, 104 . . . ) that are received in error that result from a single channel error. More specifically, in this technique, bits from the symbols are allocated among the channels in such a way as to minimize the number of respective channels that are allocated bits belonging to more that one respective symbol during a respective transmission period.

Abstract: A receiver that provides interference cancellation in conjunction with RAKE processing. Signal parameters corresponding to each of a plurality of fingers corresponding to RAKE processing are maintained. Synthesized pilot signals are estimated using the signal parameters by interpolating waveforms for respective ones of the plurality of synthesized pilot signals to a common sampling lattice of the received set of data, and are then cancelled out. According to another aspect, a receiver ensures completion of a time-critical process such as signal demodulation and adaptively applies a non-time-critical process such as interference cancellation to the extent that computational resources become available subject to ensuring the completion of the time-critical process.

Abstract: A technique is provided that may be employed in multicarrier communications to improve the efficiency of error correction using symbol-oriented error correction methodologies, by reducing the number of error correction code symbols (102, 104 . . . ) that are received in error that result from a single channel error. More specifically, in this technique, bits from the symbols are allocated among the channels in such a way as to minimize the number of respective channels that are allocated bits belonging to more that one respective symbol during a respective transmission period.

Abstract: A technique is provided that may be employed in multicarrier communications to improve the efficiency of error correction using symbol-oriented error correction methodologies, by reducing the number of error correction code symbols (102, 104 . . . ) that are received in error that result from a single channel error. More specifically, in this technique, bits from the symbols are allocated among the channels in such a way as to minimize the number of respective channels that are allocated bits belonging to more that one respective symbol during a respective transmission period.

Abstract: A receiver that provides interference cancellation in conjunction with RAKE processing. Signal parameters corresponding to each of a plurality of fingers corresponding to RAKE processing are maintained. Synthesized pilot signals are estimated using the signal parameters by interpolating waveforms for respective ones of the plurality of synthesized pilot signals to a common sampling lattice of the received set of data, and are then cancelled out. According to another aspect, a receiver ensures completion of a time-critical process such as signal demodulation and adaptively applies a non-time-critical process such as interference cancellation to the extent that computational resources become available subject to ensuring the completion of the time-critical process.

Abstract: A receiver that provides interference cancellation in conjunction with RAKE processing. Signal parameters corresponding to each of a plurality of fingers corresponding to RAKE processing are maintained. Synthesized pilot signals are estimated using the signal parameters by interpolating waveforms for respective ones of the plurality of synthesized pilot signals to a common sampling lattice of the received set of data, and are then cancelled out. According to another aspect, a receiver ensures completion of a time-critical process such as signal demodulation and adaptively applies a non-time-critical process such as interference cancellation to the extent that computational resources become available subject to ensuring the completion of the time-critical process.

Abstract: Reduction of multiple access interference, in one example for asynchronous CDMA systems using long codes. In one aspect, parallel interference cancellation (PIC) implements a decoupled estimate, preferably non-linear and applied at chip intervals. According to another aspect, interference is cancelled using a technique that estimates bits for a symbol by interpolating signature waveforms for users to a common sampling lattice of the received data. According to another aspect, multi-stage, hybrid multi-stage, and reconfigurable recursive multi-stage multi-user detection architectures and corresponding processes are provided.

Abstract: Reduction of multiple access interference, in one example for asynchronous CDMA systems using long codes. In one aspect, parallel interference cancellation (PIC) implements a decoupled estimate, preferably non-linear and applied at chip intervals. According to another aspect, interference is cancelled using a technique that estimates bits for a symbol by interpolating signature waveforms for users to a common sampling lattice of the received data. According to another aspect, multi-stage, hybrid multi-stage, and reconfigurable recursive multi-stage multi-user detection architectures and corresponding processes are provided.

Abstract: Reduction of multiple access interference, in one example for asynchronous CDMA systems using long codes. In one aspect, parallel interference cancellation (PIC) implements a decoupled estimate, preferably non-linear and applied at chip intervals. According to another aspect, interference is cancelled using a technique that estimates bits for a symbol by interpolating signature waveforms for users to a common sampling lattice of the received data. According to another aspect, multi-stage, hybrid multi-stage, and reconfigurable recursive multi-stage multi-user detection architectures and corresponding processes are provided.

Abstract: A technique is provided that may be employed in multicarrier communications to improve the efficiency of error correction using symbol-oriented error correction methodologies, by reducing the number of error correction code symbols (102, 104 . . . ) that are received in error that result from a single channel error. More specifically, in this technique, bits from the symbols are allocated among the channels in such a way as to minimize the number of respective channels that are allocated bits belonging to more that one respective symbol during a respective transmission period.

Abstract: A method and apparatus for information embedding modulation and information extraction demodulation are presented which use analysis and/or synthesis filter banks. Spectral control of the form of the composite signals arising from the embedding of digital embedded information signals into digital host signals is provided. Various implementations, including cable head-end and user-end systems using such modulators are presented. One aspect of the modulator allows for reduced noise spillover into adjacent communication channels in a multi-channel communication system. In some implementations the analysis and the synthesis filter banks form perfect reconstruction filter sets. In other implementations, block transforms are used as the filter banks.

Abstract: In certain image analysis applications, it is desirable to compress the image while emphasizing a selected region of the image. The invention is a means for to allocating more bits, and thus better quality in the decoded image, to the selected region at the expense of other regions of the image. This allows efficient compression of the image for storage or transmission with those regions deemed to be important preserved at high quality and other regions stored with minimal quality to preserve the context of the image.

Abstract: An apparatus and method for signal, image, or video compression that achieves high compression efficiency in a computationally efficient manner and corresponding decoder apparatus and methods are disclosed. This technique uses zerotree coding of wavelet coefficients in a much more efficient manner than previous techniques. The key is the dynamic generation of the list of coefficient indices to be scanned, whereby the dynamically generated list only contains coefficient indices for which a symbol must be encoded. This is a dramatic improvement over the prior art in which a static list of coefficient indices is used and each coefficient must be individually checked to see whether a) a symbol must be encoded, or b) it is completely predictable. Additionally, using dynamic list generation, the greater the compression of the signal, the less time it takes to perform the compression.

Abstract: A data processing system augments compression of non-zero values of significant coefficients by coding entries of a significance map independently of coding the values of significant non-zero coefficients. A dedicated symbol represents a zerotree structure encompassing a related association of insignificant coefficients within the tree structure. The zerotree symbol represents that a coefficient is a root of a zerotree if, at a threshold T, the coefficient and all of its descendants that have been found to be insignificant at larger thresholds have magnitudes less than threshold T. The zerotree structure is disclosed in the context of a pyramid-type image subband processor together with successive refinement quantization and entropy coding to facilitate data compression.

Abstract: A data processing system augments compression of non-zero values of significant coefficients by coding entries of a significance map independently of coding the values of significant non-zero coefficients. A dedicated symbol represents a zerotree structure encompassing a related association of insignificant coefficients within the tree structure, thereby compactly representing each tree of insignificant coefficients. The zerotree symbol represents that neither a root coefficient of the zerotree structure nor any descendant of the root coefficient has a magnitude greater than a given reference level. The zerotree structure is disclosed in the context of a pyramid-type image subband processor together with successive refinement quantization and entropy coding to facilitate data compression.