Agere Systems Inc.

Lucent Technologies Inc.

Gongyu Zhou

Tomasz Prokop

Rami Banna

Adriel P Kind

Dominic W Yip

A multi-stage receiver including, in one embodiment, a sequence of processing stages. At least one of the processing stages includes a first processing block, a delay block, and a second processing block. The first processing block is adapted to receive an input signal and generate from the input signal one or more processing parameters. The delay block is adapted to generate a delayed signal. The second processing block is adapted to apply the one or more processing parameters to the delayed signal to generate an output signal. The delay block compensates for one or more processing delays associated with the generation of the one or more processing parameters by the first processing block.

Delay compensation in equalizer-based receiver

In one embodiment, a buffer-based method for generating codes (such as Orthogonal Variable Spreading Factor (OVSF) codes) for spreading and despreading data, without using a chip-rate counter. First, a buffer is populated with initial values based on a received spreading factor and desired code index. Next, a timing strobe is received, and the values in the buffer are changed upon receipt of the timing strobe based on an algorithm that is independent of any count value associated with the timing strobe. Finally, a code sequence value is generated based on the values in the buffer.

Buffer-based generation of OVSF code sequences

A method of generating a code sequence comprises populating at least one buffer with initial values based on a received spreading factor and desired code index; receiving a timing strobe; changing the values in the at least one buffer upon receipt of the timing strobe based on an algorithm that is independent of any count value associated with the timing strobe; and outputting at least one code sequence value based on the values in the at least one buffer. An apparatus for generating a code sequence comprises means for populating at least one buffer with initial values based on a received spreading factor and desired code index; means for receiving a timing strobe; means for changing the values in the at least one buffer upon receipt of the timing strobe based on an algorithm that is independent of any count value associated with the timing strobe; and means for outputting at least one code sequence value based on the values in the at least one buffer.

A rake receiver for processing a multi-path input signal received from a communications channel, wherein each multi-path component of the multi-path input signal comprises one or more symbols, comprises a plurality of fingers and a demodulator. Each of the plurality of fingers is adapted to receive the multi-path input signal and provide a sequence of input samples corresponding to a multi-path component of the multi-path input signal. The demodulator is adapted (i) during a single clock period, to receive and process one or more input samples corresponding to only one of the fingers, (ii) for each of the fingers, to accumulate multiple processed input samples to form a symbol, and (iii) to provide the formed symbols for all fingers.

Rake receiver with time-shared fingers

A despreader for generating one or more despread values corresponding to application of one or more despreading codes to a sequence of spread values comprises a data buffer, an adder, a subtractor, and a controller. The adder is adapted to generate a sum of a pair of values read from the data buffer. The subtractor is adapted to generate a difference of the pair of values read from the data buffer. The controller is adapted to control (1) reading of the pair of values from the data buffer and (2) writing of the sum and difference values into the data buffer. After each pair of spread values is stored in the data buffer, the despreader generates and stores one or more pairs of sum and difference values in the data buffer.

Method and apparatus for compact OVSF despreading

An interleaver circuit architectures, which utilizes the relationship between intra-row elements in a matrix, in order to simplify the MOD computations necessary in an interleaver. The interleaver calculates a subset of results, stores those results, performs operations on the stored results in order to obtain new results, then updates at least some of the old results with the new results for the next column operation. The interleaver address is then calculated row by row. By storing only a subset of the results and replacing old results with new results, the interleaver can calculate the interleaver address 'on the fly' in one clock cycle with very little delay. The interleaver may also require less power and smaller substrate surface area.

Growing community of inventors

North Epping, Australia

Gongyu Zhou