Abstract: A method and apparatus for performing low latency Turbo Code encoding of a frame of data is described. The disclosure includes a method for performing Turbo Code encoding on frame of data using by encoding via subsections using multiple constituent encoders in parallel. The information gains during a first encoding pass of the subsections is used to determine the start state for a second pass during which parity bits are generated. Both the interleaved and natural order encoding may be performed in parallel.

Abstract: Methods and apparatus for generating and performing digital communications using a randomized generatable interleaver. In accordance with one exemplary embodiment of the invention, a pseudo random interleaver of size n*m with excellent randomness and spread properties may be generated from a set of seed values. The interleaver of size N=n*m is defined by dividing the N possible address in the interleaver (0?N?1) into n subsets. The subsets are preferably generatable from a single value within the subset either using an algorithm or a memory based lookup table. The set of n seeds comprises one value selected from each subset. An improved communication system incorporating the aforementioned interleaver and using turbo codes or other concatenated coding systems is also disclosed.

Abstract: A method and apparatus for performing low latency Turbo Code encoding of a frame of data is described. The disclosure includes a method for performing Turbo Code encoding on frame of data using by encoding via subsections using multiple constituent encoders in parallel. The information gains during a first encoding pass of the subsections is used to determine the start state for a second pass during which parity bits are generated. Both the interleaved and natural order encoding may be performed in parallel.

Abstract: Methods and apparatus for generating and performing digital communications using a randomized generatable interleaver. In accordance with one exemplary embodiment of the invention, a pseudo random interleaver of size n*m with excellent randomness and spread properties may be generated from a set of seed values. The interleaver of size N=n*m is defined by dividing the N possible address in the interleaver (0-N?1) into n subsets. The subsets are preferably generatable from a single value within the subset either using an algorithm or a memory based lookup table. The set of n seeds comprises one value selected from each subset. An improved communication system incorporating the aforementioned interleaver and using turbo codes or other concatenated coding systems is also disclosed.

Abstract: Methods and apparatus for generating and performing digital communications using a randomized generatable interleaver. In accordance with one exemplary embodiment of the invention, a pseudo random interleaver of size n*m with excellent randomness and spread properties may be generated from a set of seed values. The interleaver of size N=n*m is defined by dividing the N possible address in the interleaver (0−N−1) into n subsets. The subsets are preferably generatable from a single value with in the subset either using an algorithm or a memory based lookup table. The set of n seeds comprises one value selected from each subset. An improved communication system incorporating the aforementioned interleaver and using turbo codes or other concatenated coding systems is also disclosed.

Abstract: A system and method for high efficiency, high performance processing of turbo codes is described. In accordance with one embodiment of the invention, an interleaver for interleaving code symbols is providing, the interleaver having a plurality of subsections, each subsection having a set of addresses and each address having an index, wherein a substantially constant relationship exists from any one subsection to any other subsection between the index of each address at a particular location.

Abstract: A system and method for high efficiency high performance processing of turbo codes is described. In accordance with one embodiment of the invention, an interleaver for interleaving code symbols is providing, the interleaver having a plurality of subsections, each subsection having a set of addresses and each address having an index, wherein a substantially constant relationship exists from any one subsection to any other subsection between the index of each address at a particular location.

Abstract: A method and apparatus for improving the performance of decoder that uses a sliding window decoder is described. In accordance with one embodiment of the invention, receive samples are decoded by first processing continuously in a first direction and using overlapping windows in a second direction, and then by decoded continuously in the second direction and using overlapping windows in the first direction. Typically, the decoding steps correspond to subiterations in a decoding iteration of a turbo code or other iterative code. The entire decoding process typically involves multiple decoding iterations and therefore has particular application to turbo codes and as well as other codes designed for iterative decoding.

Abstract: The present invention is a novel and improved method and apparatus for performing position location in wireless communications system. In one embodiment the invention comprises a method for performing position location in a subscriber unit in a CDMA wireless communications system having a base station, including the step of receiving a position location request during a communication, entering a position location mode, transmitting frames to the base station while performing a position location procedure, and returning to communications mode when said position location procedure has been completed.

Abstract: A method and system for processing multiple instances of data using noise energy based gain control is described. A signal is transmitted from a base station and is received along with associated noise energy by a subscriber unit. The non-orthogonal noise energy associated with a signal transmitted to a subscriber unit is measured, and the gain of that signal is adjusted such that the non-orthogonal noise energy is set to a predetermined level. If multiple instances of the signal are received by the subscriber unit, the signals are isolated and the non-orthogonal noise associated with each signal is measured separately. In the preferred embodiment the non-orthogonal noise measurement is performed by demodulation of a low energy channel within a forward link signal processed in accordance with code division multiple access signal processing techniques.