Abstract: Apparatus and methods for estimating a direct current offset in an upconverter are disclosed. Samples of a first signal are received. Values of a compensation signal are retrieved. For example, the compensation signal can be a component in a modified baseband signal, wherein the modified baseband signal is upconverted, downconverted, and filtered to generate the first signal. An estimate of a first DC offset induced by an upconverter is generated based at least partly on at least two selected samples of the first signal and corresponding values of the compensation signal.

Abstract: A wide/narrow-band RF transceiver receives a signal in wide-band RF spectrum; a processor analyzes the signal and narrows the bandwidth of the RF transceiver in accordance with a carrier frequency, bandwidth, and RF modulation type of the signal.

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: 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: Reducing pipeline stall between a compute unit and address unit in a processor can be accomplished by computing results in a compute unit in response to instructions of an algorithm; storing in a local random access memory array in a compute unit predetermined sets of functions, related to the computed results for predetermined sets of instructions of the algorithm; and providing within the compute unit direct mapping of computed results to related function.

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 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: 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: A programmable compute unit with an internal register with a bit FIFO for executing Viterbi code is configured to accumulate in the forward path the best-path to each state in an internal register and store the survivor trace back information bit for each state in each stage in a bit FIFO; and in the trace back, selecting the optimal best-path through the Viterbi trellis by tracing through the bit trace back information survivor bits beginning with the survivor bit of the last stage path; and generating in response to the Viterbi constrain length and a current bit FIFO address, the next bit FIFO address and decoded output bit for the next previous stage.

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: Lookup table addressing of a set of lookup tables in an external memory is achieved by: transferring a data word from a compute unit to an input register in a data address generator; providing in at least one deposit-increment index register in the data address generator including a table base field for identifying the location of the set of tables in memory, and a displacement field; and depositing a section of the data word into a displacement field in the index register for identifying the location of a specific entry in the tables.

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: A received signal is filtered by filtering a group of estimated components of the received signal from the received signal such that the noise and/or distortion in the received signal is minimized.

Abstract: Reducing pipeline stall between a compute unit and address unit in a processor can be accomplished by computing results in a compute unit in response to instructions of an algorithm; storing in a local random access memory array in a compute unit predetermined sets of functions, related to the computed results for predetermined sets of instructions of the algorithm; and providing within the compute unit direct mapping of computed results to related function.

Abstract: Reducing pipeline stall between a compute unit and address unit in a processor can be accomplished by computing results in a compute unit in response to instructions of an algorithm; storing in a local random access memory array in a compute unit predetermined sets of functions, related to the computed results for predetermined sets of instructions of the algorithm; and providing within the compute unit direct mapping of computed results to related function.

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.