Abstract: The present invention is a receiver which includes a blind code detection device for determining the identity of a plurality of channels over which information is to be transmitted when the identity of all channels is not known by the receiver. The blind code detection device generates a candidate channel list filled with the identify of selected channels out of the plurality of channels. A multi-user detection device, responsive to the blind code detection device, processes those channels in the candidate code list.

Abstract: Method and apparatus employed by a UE for interference signal code power noise variance estimation employing a reduced number of samples utilizing the equation ? ^ n 2 = T · ? i = 1 N sample ? ? h n ? ( i ) ? 2 , where T = G · ? ? ( r ) N sample , where Nsample=Lchest?Np1·Kmax, and where ? ? ( r ) = [ 1 + ( 1 r - 1 ) · ln ? ( 1 - r ) ] - 1 and where r = N sample L chest . As an alternative, a recursive technique may be employed wherein the noise variance is estimated from the ignored coefficients of the estimated channel output and upgraded recursively as per the following: ? ^ n 2 = 1 KW ? ? j = 1 K ? ? i = 1 W ? ? h i ( j ) - h ^ i ( j ) ? 2 , where ?i(j) are the channel estimates after the post processing and the noise variance estimates {circumflex over (?)}n-12, and the initial values of ?i(j) are all zeros.

Abstract: A receiver includes a blind code detection device for determining the identity of a plurality of channels over which information is to be transmitted when the identity of all channels is not known by the receiver. The blind code detection device generates a candidate channel list filled with the identity of selected channels out of the plurality of channels. A multi-user detection device, responsive to the blind code detection device, processes those channels in the candidate code list.

Abstract: A method for the simultaneous reception of data from multiple sources having different spreading factors. A plurality of transmission response matrices are generated and grouped together for equal spreading factors. A plurality of spreading factor group matrices are assembled. A base matrix is formed based upon the spreading factor group matrix having a lowest spreading factor. An additional spreading factor group matrix is selected for consideration. Column placement reference index for the base matrix is derived. A reference location for the base matrix is derived. A column set from the selected spreading factor group matrix is derived. The column set is inserted into the base matrix. A total transmission response matrix is assembled.

Abstract: Method and apparatus employed by a UE for interference signal code power noise variance estimation employing a reduced number of samples utilizing the equation ? ^ n 2 = T · ? i = 1 N sample ? ? h n ? ( i ) ? 2 , where T = G · ? ? ( r ) N sample , where Nsample=Lchest?Npl·Kmax, where ? ? ( r ) = [ 1 + ( 1 r - 1 ) · ln ? ( 1 - r ) ] - 1 and where r = N sample L chest . As an alternative, a recursive technique may be employed wherein the noise variance is estimated from the ignored coefficients of the estimated channel output and upgraded recursively as per the following: ? ^ n 2 = 1 KW ? ? j = 1 K ? ? i = 1 W ? ? h i ( j ) - h ^ i ( j ) ? 2 , where ?i(j) are the channel estimates after the post processing and the noise variance estimates {circumflex over (?)}n?12, and the initial values of ?i(j) are all zeros.

Abstract: The present invention is a method and system for receiving data transmitted using block space time transmit diversity (BSTTD) in a code division multiple access (CDMA) communication system. The system comprises a transmitter, for transmitting a first data field using a first antenna and a second data field using a second antenna, and a receiver. The receiver includes an antenna for receiving the first and second transmitted data fields, and a BSTTD joint detector which determines symbols of the first and second transmitted data fields using a minimum mean square error block linear equalizer model and an approximated Cholesky decomposition of the model.

Abstract: A criterion for biasing a binary decision requiring an unequal protection which utilizes a measured signal to interference ratio (SIR). The SIR may be derived from a determination of channel estimation. The SIR is compared against a threshold, the threshold being selected to bias the decision toward a not acknowledge (NACK) as opposed to an acknowledge (ACK) determination. The technique is advantageous for providing biased binary decisions for high speed downlink packets (HSDP) but may be utilized for both uplink and downlink applications.

Abstract: A plurality of communication signals have differing spreading codes. Each communication has an associated code comprising chips. For each chip of each communication, a vector of that chip convolved with an impulse response is produced. For each communication, support blocks comprising the chip vectors are produced. A number of the chip vectors in a support block is based on that communication's spreading factor. A system response matrix is assembled. The system response matrix has symbol sub-matrices. Each symbol sub-matrix comprises a support block from each communication. Data of the communications is detected using the symbol response matrix.

Abstract: A criterion for biasing a binary decision requiring an unequal protection which utilizes a measured signal to interference ratio (SIR). The SIR may be derived from a determination of channel estimation. The SIR is compared against a threshold, the threshold being selected to bias the decision toward a NACK as opposed to an ACK determination. The technique is advantageous for providing biased binary decisions for high speed downlink packets (HSDP) but may be utilized for both uplink and downlink applications.

Abstract: Data is estimated from a received vector comprising a plurality of communications. A received wireless signal is converted to a baseband signal, which is sampled to produce a received vector. Channel responses are estimated for the received communications. The noise variance is estimated. The noise variance is scaled by a scaling factor. Samples are processed using the estimated channel responses and the scaled noise variance to produce a spread data vector. The spread data vector is despread to recover the data of the received wireless signal.

Abstract: A plurality of communication signals is received. Each communication signal has an associated code. At least two of the communication signals has a different spreading factor. The associated codes have a scrambling code period. A total system response matrix has blocks. Each block has one dimension of a length M and another dimension of a length based on in part M and the spreading factor of each communication. M is based on the scrambling code period. Data of the received plurality of communication signals is received using the constructed system response matrix.

Abstract: Data is estimated from a received vector comprising a plurality of communications. A received wireless signal is converted to a baseband signal, which is sampled to produce a received vector. Channel responses are estimated for the received communications. The noise variance is estimated. The noise variance is scaled by a scaling factor. Samples are processed using the estimated channel responses and the scaled noise variance to produce a spread data vector. The spread data vector is despread to recover the data of the received wireless signal.

Abstract: A plurality of communication signals is received. Each communication signal has an associated code. At least two of the communication signals has a different spreading factor. The associated codes have a scrambling code period. A total system response matrix has blocks. Each block has one dimension of a length M and another dimension of a length based on in part M and the spreading factor of each communication. M is based on the scrambling code period. Data of the received plurality of communication signals is received using the constructed system response matrix.

Abstract: A plurality of communication bursts are transmitted substantially simultaneously in a time slot of a time division duplex/code division multiple access communication system. The communication system has a maximum number of K midamble shifts. Each burst has an assigned midamble. Each midamble is a shifted version of a basic midamble code having a period of P. A combined signal is received. The combined signal includes a received version of each of the communication burst's midambles. A P by P square circulant matrix is constructed including the K midamble shifts. A channel response is determined for each of the K midamble shifts using a prime factor algorithm (PFA) discrete Fourier transform (DFT) algorithm, the received combined signal and the P by P square circulant matrix. The PFA DFT algorithm has a plurality of stages. Each stage has P inputs.

Abstract: A plurality of communication bursts are transmitted substantially simultaneously in a time slot of a time division duplex/code division multiple access communication system. The communication system has a maximum number of K midamble shifts. Each burst has an assigned midamble. Each midamble is a shifted version of a basic midamble code having a period of P. A combined signal is received. The combined signal includes a received version of each of the communication burst's midambles. A P by P square circulant matrix is constructed including the K midamble shifts. A channel response is determined for each of the K midamble shifts using a prime factor algorithm (PFA) discrete Fourier transform (DFT) algorithm, the received combined signal and the P by P square circulant matrix. The PFA DFT algorithm has a plurality of stages. Each stage has P inputs.

Abstract: A code indexing system for a CDMA communication station that uses orthogonal variable spreading factor (OVSF) codes having a single number mapped to each code. The new code number itself not only provides the code signature, but it is also used for the OVSF code generation. In addition, the system provides easy and fast generation of the available code list without the help of look-up table. This capability improves the dynamic code assignment.

Abstract: A code indexing system for a CDMA communication station that uses orthogonal variable spreading factor (OVSF) codes has a single number mapped to each code. The new code number itself not only provides the code signature, but it is also used for the OVSF code generation. In addition, the system provides easy and fast generation of the available code list without the help of look-up table. This capability improves the dynamic code assignment.

Abstract: An insertion sorter circuit and method are provided which are particularly useful for sorting channel response values of a communication signal. The sorter circuit includes a series of sorter elements which each have a register. The circuit is configured to cascade values downwardly when one register receives a greater value than it has stored, which value is not greater than the value stored in any upstream register. At the end of processing the values, the most significant values are stored in the registers, the sum of which are the channel power estimate. The channel noise variance is obtainable by applying a system dependent scaling factor to the sum of the least significant values processed.

Abstract: An ACK/NACK method and system for use in time division duplex (TDD) and frequency division duplex (FDD) systems. In high speed downlink packet access (HSDPA), based on the assignment of timeslots for the high speed shared information channel (HS-SICH), each user equipment (UE) can be assigned two (2) different channelization codes. It is then possible to adopt the signaling convention that one code represents acknowledge error-free (Ack) and the other code shall represent acknowledge error condition (Nack). The Node B is able to distinguish the presence of the transmitted channelization code as opposed to the channelization code which is not transmitted. The probability of error, using this invention is an order of a magnitude smaller than if the Ack/Nack were signaled using typical modulation techniques.

Abstract: Data is estimated from a received vector comprising a plurality of communications. A received wireless signal is converted to a baseband signal, which is sampled to produce a received vector. Channel responses are estimated for the received communications. The noise variance is estimated. The noise variance is scaled by a scaling factor. Samples are processed using the estimated channel responses and the scaled noise variance to produce a spread data vector. The spread data vector is despread to recover the data of the received wireless signal.