Abstract: Channel estimation for high mobility OFDM channels is achieved by identifying a set of channel path delays from an OFDM symbol stream including carrier data, inter-channel interference noise and channel noise; determining the average channel impulse response for the identified set of channel path delays in each symbol; generating a path delay curvature for each channel path delay in each symbol based on stored average channel impulse responses for the identified channel path delays; estimating the carrier data in the symbols in the OFDM symbol stream in the presence of inter-channel interference noise and channel noise from the OFDM symbol steam and the average impulse responses for the identified channel path delays; reconstructing the inter-channel interference noise in response to the path delay curvature, the identified set of channel path delays and estimated carrier data to produce a symbol stream of carrier data and channel noise with suppressed inter-channel interference noise.

Abstract: Channel estimation for high mobility OFDM channels is achieved by identifying a set of channel path delays from an OFDM symbol stream including carrier data, inter-channel interference noise and channel noise; determining the average channel impulse response for the identified set of channel path delays in each symbol; generating a path delay curvature for each channel path delay in each symbol based on stored average channel impulse responses for the identified channel path delays; estimating the carrier data in the symbols in the OFDM symbol stream in the presence of inter-channel interference noise and channel noise from the OFDM symbol steam and the average impulse responses for the identified channel path delays; reconstructing the inter-channel interference noise in response to the path delay curvature, the identified set of channel path delays and estimated carrier data to produce a symbol stream of carrier data and channel noise with suppressed inter-channel interference noise.

Abstract: Channel estimation for high mobility OFDM channels is achieved by identifying a set of channel path delays from an OFDM symbol stream including carrier data, inter-channel interference noise and channel noise; determining the average channel impulse response for the identified set of channel path delays in each symbol; generating a path delay curvature for each channel path delay in each symbol based on stored average channel impulse responses for the identified channel path delays; estimating the carrier data in the symbols in the OFDM symbol stream in the presence of inter-channel interference noise and channel noise from the OFDM symbol steam and the average impulse responses for the identified channel path delays; reconstructing the inter-channel interference noise in response to the path delay curvature, the identified set of channel path delays and estimated carrier data to produce a symbol stream of carrier data and channel noise with suppressed inter-channel interference noise.

Abstract: Channel estimation for high mobility OFDM channels is achieved by identifying a set of channel path delays from an OFDM symbol stream including carrier data, inter-channel interference noise and channel noise; determining the average channel impulse response for the identified set of channel path delays in each symbol; generating a path delay curvature for each channel path delay in each symbol based on stored average channel impulse responses for the identified channel path delays; estimating the carrier data in the symbols in the OFDM symbol stream in the presence of inter-channel interference noise and channel noise from the OFDM symbol steam and the average impulse responses for the identified channel path delays; reconstructing the inter-channel interference noise in response to the path delay curvature, the identified set of channel path delays and estimated carrier data to produce a symbol stream of carrier data and channel noise with suppressed inter-channel interference noise.

Abstract: Multiprocessor decoding is accomplished in a first mode by generating with a series of n processors, from a set of data macroblocks, the entropy decoding output of each data macroblock and storing the entropy decoding output of each data macroblock in n storage elements, respectively, associated with the processors and in the second mode decoding the macroblock data from its associated storage element in response to the macroblock entropy decoding output from its associated storage element stored in an nth previous period, predetermined data from one or more adjacent macroblocks, and data produced from a previous processor in the series.

Abstract: A Galois field divider engine and method inputs a 1 and a first Galois field element to a Galois field reciprocal generator to obtain an output, multiplies in the Galois field reciprocal generator the first Galois field element by the output of the Galois field reciprocal generator for predicting the modulo remainder of the square of the polynomial product of an irreducible polynomial m?2 times to obtain the reciprocal of the first Galois field element, and multiplies the reciprocal element by a second Galois field element for predicting the quotient of the two Galois field elements in m cycles; in a broader sense the invention includes a compound Galois field engine for performing a succession of Galois field linear transforms on a succession of polynomial inputs to obtain an ultimate output where each input except the first is the output of the previous Galois field linear transform.

Abstract: The problem of inefficient channel impulse-response processing is addressed by processing different parts of a channel impulse response to accurately locate channel taps, and to generate more than one set of equalization coefficients. This allows the most-suited equalization coefficient to be selected based on a selection criterion.

Abstract: A compute unit with an internal bit FIFO circuit includes at least one data register, a lookup table, a configuration register including FIFO base address, length and read/write mode fields for configuring a portion of the lookup table as a bit FIFO circuit and a read/write pointer register responsive to an instruction having a lookup table identification field, length of bits field and register extract/deposit field for selectively transferring in a single cycle between the FIFO circuit and the data register a bit field of specified length.

Abstract: Finite impulse response filtering is achieved by broadcasting to at least one compute unit an instruction having a plurality of data samples, a conditional field associated with each compute unit, and a set of operator values for operating on each data sample; providing a function of each the data sample in accordance with an associated set of operator values identified by the conditional field; and combining the functions to obtain an intermediate finite impulse response of the data samples.

Abstract: Channel estimation for high mobility OFDM channels is achieved by identifying a set of channel path delays from an OFDM symbol stream including carrier data, inter-channel interference noise and channel noise; determining the average channel impulse response for the identified set of channel path delays in each symbol; storing the average channel impulse responses for the identified channel path delays; generating a path delay curvature for each channel path delay in each symbol based on stored average channel impulse responses for the identified channel path delays; estimating the carrier data in the symbols in the OFDM symbol stream in the presence of inter-channel interference noise and channel noise from the OFDM symbol stream and the average impulse responses for the identified channel path delays; reconstructing the inter-channel interference noise in response to the path delay curvature, the identified set of channel path delays and estimated carrier data; and subtracting the reconstructed inter-channe

Abstract: A receiver architecture for processing spread spectrum signals. The receiver has an RF front end to receive and down convert a broadcast signal to an intermediate frequency carrier. The IF signal is digitized and provided to a processor (which may be a software-driven DSP, an ASIC or other embodiment) for processing. A given IF carrier is removed and the signal is low pass filtered. The signal is provided to a number of channels, each, for example, correspond to a unique transmitter. On each channel the sample rate is reduced to a predetermined fixed rate with timing mismatch compensated. The Doppler frequency shift, as estimated for the channel, is removed succeedingly. A locally generated copy of the spreading code used by the transmitter is applied to the carrier and Doppler removed signal at the predetermined fixed sample rate. The de-spread signal is used to provide estimates of the Doppler shift and for subsequent sample selection.

Abstract: Simultaneously decoding one or more variable length code symbols including storing in a bit FIFO at least a portion of a variable length coded bit stream; storing a succession of extracted bit fields of predetermined bit length from the variable length coded bit stream in the bit FIFO; defining at least one inspection field in the extracted bit field, each inspection field identifying at least one variable length code symbol; and storing in look-up table a decode value uniquely addressable by each bit combination of the inspection field for reading out the one or more decode values corresponding to the unique address defined by the inspection field.

Abstract: Accelerating processing of a non-sequential instruction stream on a processor with multiple compute units by broadcasting to a plurality of compute units a generic instruction stream derived from a sequence of instructions; the generic instruction stream including an index section and a compute section; applying the index section to localized data stored in each compute unit to select one of a plurality of stored local parameter sets; and applying in each compute unit the selected set of parameters to the local data according to the compute section to produce each compute unit's localized solution to the generic instruction.

Abstract: A Galois field linear transformer trellis system includes a Galois field linear transformer matrix; an input selection circuit for providing to the matrix a number of input bits in one or more trellis bit streams and a trellis state output of the matrix and a programmable storage device for configuring the matrix to perform a multi-cycle Galois field transform of the one or more trellis bit steams and trellis state output to provide a plurality of trellis output channel symbols and a new trellis state output in a single cycle.

Abstract: A channel adaptive iterative turbo decoder for computing with MAP decoders a set of branch metrics for a window of received data, computing the forward and reverse recursive path state metrics and computing from the forward and reverse recursive path state metrics the log likelihood ratio for 1 and 0 and interleaving the decision bits; and identifying those MAP decoder decision bits which are non-convergent, computing a set of branch metrics for the received data, computing from the forward and reverse recursive path state metrics the log likelihood ratio (LLR) for 1 and 0 for each non-converged decision bit and interleaving the non-convergent decision bits.

Abstract: A method and apparatus for direct mapping in a compute unit having an internal random access memory the primary operational sequences of an algorithm to related function including storing in an internal random access memory at least one predetermined direct mapped function value for each primary operational sequence of an algorithm; holding in an input data register the address in the random access memory of at least one mapped function value for a selected primary operational sequence of the algorithm and holding in an output register the at least one mapped function value for the selected primary operational sequence of the algorithm read out of the random access memory.

Abstract: An instruction-based parallel median filtering processor and method sorts in parallel each combination of pairs of inputs into greater and lesser values; determines from that sorting the minimum, maximum and median filter values of the inputs; processes one of those values and provides the processed value as an input; and applies an instruction for providing one of the values to the processing step, and at least one other instruction for enabling indication of at least one of the maximum, minimum, median filter values.

Abstract: Video decoding with video enhancement using direct contrast enhancement in the spatial domain including transforming the decoded intramacroblock output to a matrix of spatial domain coefficients; multiplying the spatial domain coefficients with the corresponding intramacroblock enhancement matrix elements of an intramacroblock enhancement matrix to provide enhanced spatial coefficients; transforming said enhanced spatial coefficients to the temporal domain to generate an enhanced decoded intramacroblock; multiplying the spatial domain intermacroblock coefficients from the entropy decoder of the video decoder with the corresponding intermacroblock enhancement matrix elements of an intermacroblock enhancement matrix to provide enhanced spatial coefficients, and transforming the enhanced spatial coefficients to generate enhanced decoded residual coefficients.

Abstract: A method of spatial domain video enhancement/up-scaling including transforming the video input from the temporal domain to a K×K matrix of spatial domain coefficients; multiplying each spatial domain coefficient by corresponding elements of a K×K enhancement matrix to obtain enhanced spatial domain coefficients; depositing the enhanced spatial domain coefficients in the upper left K×K corner of a zero padded 2K×2K inverse transform matrix and inversely transforming them to scale the enhanced spatial domain coefficients and convert them back to video output temporal domain elements and a method of spatial domain video enhancement/down-scaling including transforming the video input from the temporal domain to a 2K×2K matrix of spatial domain coefficients; multiplying the upper left K×K corner of the 2K×2K matrix of spatial domain coefficients by the corresponding elements of a K×K enhancement matrix to obtain enhanced spatial domain coefficients; inversely transforming the K×K enhanced spatial domain coefficien

Abstract: An improved programmable compute system and method for executing an H.264 binary decode symbol using only a single instruction and two compute units is achieved by providing not just one rLPS value but all four next possible rLPS values of the current context next state so that there is no delay initially while calculating the correct rLPS because all four are present and any one can be chosen; further all the parameters e.g. value, range, context, and rLPS can be served by only two available 32 bit registers by generating, locally, the MSP ninth bit, of range based on the fact that the range is normalized to a known value in the MSB.