Abstract:
An apparatus and method for high throughput unified turbo decoding comprising loading data from a first data window; computing a first forward state metric using the data from the first data window; storing the first forward state metric in a memory; computing a first reverse state metric using the data from the first data window; storing the first reverse state metric in the memory; and computing the log likelihood ratio (LLR) of the first forward state metric and the first reverse state metric. In one aspect, the above-mentioned steps are repeated with data from a second data window. In another aspect, extrinsic information for the first data window associated with the unified turbo decoding is computed.
Abstract:
Method and apparatus for decoding code words received over a communication channel are disclosed. A radius-adaptive sphere decoding methodology reduces the number of operations in sphere-constrained search. Imposing probabilistic noise constraint on top of sphere constraint, particularly at an early stage, provides a more stringent necessary condition. Hence, many branches that are unlikely to be selected are removed in the early stage of sphere search. The trade-off between computational complexity and performance can be controlled by adjusting the pruning probability.
Abstract:
An apparatus and method for symbol decoding comprising selecting a degree of freedom (DOF) parameter for a noise vector; selecting a delta probability value; computing a cost function for a lattice point that is one of a discrete set of nominal codeword positions in a hypersphere; selecting a sphere decoding radius based on the DOF parameter, the delta probability value and the cost function; and decoding a symbol using the sphere decoding radius. And, the apparatus and method comprising setting pre-defined threshold probabilities; computing threshold radii based on the pre-defined threshold probabilities; setting an initial sphere radius square to the value of a first threshold radii; finding the Lattice point based on the initial sphere radius square; computing an updated sphere radius square as the minimum of either a cost function or a second threshold radii; and finding a next lattice point based on the updated sphere radius square.
Abstract:
TDD devices may transmit using multiple antennas. First and second antennas having first and second receive conditions may receive a communication. In an aspect, first and second transmit conditions for the first and second antennas may be determined based on the first and second receive conditions. In an aspect, the first and second transmit conditions may be compared to select the first or second antenna for transmissions. In an aspect, the first and second receive conditions may be compared to select the first or second antenna for transmissions. In an aspect, first and second transmission conditioning values, which may determine transmission powers, may be determined based on the first and second receive conditions. A first transmission chain, associated with an active radio access technology (RAT) or carrier, and a second transmission chain, associated with an inactive RAT or carrier, may be activated to send transmissions from the first and second antennas.
Abstract:
A user equipment (UE) may reducing the interference and improve the random access of the multiple users in the network. In some instances, the UE adjusts a timing advance and/or guard period values to reduce the interference experienced in a particular guard period. The adjustment is based on selecting a timing advance parameter for uplink synchronization based at least in part on an interference distribution in a guard period of a frame in a TD-SCDMA network.