Abstract: A wireless communication transmitter (200) configured to segment a transport block into C segments, encode each segment into a set of encoded bits, determine, for ? encoded segments, a subset of size M0? of encoded bits for each encoded segment and for C?? encoded segments, a subset of size M1? of encoded bits for each encoded segment, wherein the subset sizes M0? and M1? differ at most by P bits, where P is a product of a modulation order and a number of transmission layers over which the transport block is transmitted. The selected subsets of encoded bits are concatenated and grouped to form modulation symbols of the modulation order.

Abstract: A method and apparatus for turbo coding and decoding is provided herein. During operation, a concatenated transport block (CTB) of length X is received and a forward error correction (FEC) block size KI is determined from a group of available non-contiguous FEC block sizes between Kmin and Kmax, and wherein Kmin?KI<Kmax and wherein KI is additionally based on X. The concatenated transport block of length X is segmented into C segments each of size substantially equal KI. An FEC codeword for each of the C segments is determined using FEC block size KI; and the C FEC codewords are transmitted over the channel.

Abstract: A data interleaving circuit and method for interleaving a data block comprising M windows of W values include an index generator for generating an intra-window index w and an inter-window permutation vector m having M elements and an inter-window permutation circuit operable to receive M data values having intra-window index w from a memory and further operable to reorder the M data values in accordance with the inter-window permutation vector m and output the reordered data values. The index generator includes a recursion circuit that generates the intra-window index w and inter-window permutation vector m in accordance with a permutation polynomial. In one application, the reordered data values are passed to M parallel processors of a turbo decoder.

Abstract: During operation of a transmitter a circular buffer is created where only column tops of the circular buffer are defined as a starting position for a redundancy version. Where the circular buffer is in sequence format, all possible redundancy versions are at positions ?Kstream/32?(12×i+?), i=0, 1, . . . , 7 where ? indicates the column index of the starting position of the first RV (RV0).

Abstract: A method and apparatus for encoding and decoding data is provided herein. During operation, A structured parity-check matrix H is provided to the encoder and decoder, where H is an m by n matrix and an expansion of a model matrix Hbm of size mb by nb, where m=mb×z and n=nb×z. For a given code rate, multiple code sizes are accommodated by allowing both the model matrix size nb and the expansion factor z to vary.

Abstract: A method and apparatus for interleaving within a communication system is provided herein. More particularly parameters for a convolutional turbo code interleaver are provided, and interleaving takes place utilizing the new parameters. The new parameters generate interleavers that have the correct turbo code behaviors of improving performance with increasing block size and an error floor well below a block error rate of 10?4. Furthermore, the parameters have no implementation impact. Interleaving in accordance with the preferred embodiment of the present invention can achieve a block error rate of 10?4 at a signal-to-noise ratio that is at least 0.5 dB, and in some cases up to 1.3 dB, smaller than that which can be achieved with the code using the existing parameters.

Abstract: A wireless communication transmitter (200) configured to segment a transport block into C segments, encode each segment into a set of encoded bits, determine, for ? encoded segments, a subset of size M0? of encoded bits for each encoded segment and for C?? encoded segments, a subset of size M1? of encoded bits for each encoded segment, wherein the subset sizes M0? and M1? differ at most by P bits, where P is a product of a modulation order and a number of transmission layers over which the transport block is transmitted. The selected subsets of encoded bits are concatenated and grouped to form modulation symbols of the modulation order.

Abstract: A data interleaving circuit and method for interleaving a data block comprising M windows of W values include an index generator for generating an intra-window index w and an inter-window permutation vector m having M elements and an inter-window permutation circuit operable to receive M data values having intra-window index w from a memory and further operable to reorder the M data values in accordance with the inter-window permutation vector m and output the reordered data values. The index generator includes a recursion circuit that generates the intra-window index w and inter-window permutation vector m in accordance with a permutation polynomial. In one application, the reordered data values are passed to M parallel processors of a turbo decoder.

Abstract: During operation of a transmitter a circular buffer is created where only column tops of the circular buffer are defined as a starting position for a redundancy version. Where the circular buffer is in sequence format, all possible redundancy versions are at positions ?Kstream/32?(12×i+?), i=0, 1, . . . , 7 where ? indicates the column index of the starting position of the first RV (RV0).

Abstract: A method and apparatus for turbo coding and decoding is provided herein. During operation, a concatenated transport block (CTB) of length X is received and a forward error correction (FEC) block size KI is determined from a group of available non-contiguous FEC block sizes between Kmin and Kmax, and wherein Kmin?KI<Kmax and wherein KI is additionally based on X. The concatenated transport block of length X is segmented into C segments each of size substantially equal KI. An FEC codeword for each of the C segments is determined using FEC block size KI; and the C FEC codewords are transmitted over the channel.

Abstract: A method and apparatus for encoding and decoding data is provided herein. During operation, A structured parity-check matrix H is provided to the encoder and decoder, where H is an m by n matrix and an expansion of a model matrix Hbm of size mb by nb, where m=mb×z and n=nb×z. For a given code rate, multiple code sizes are accommodated by allowing both the model matrix size nb and the expansion factor z to vary.

Abstract: A structured parity-check matrix H is proposed, wherein H is an expansion of a base matrix Hb. Base matrix Hb comprises a section Hb1 and a section Hb2. Section Hb2 comprises column hb having weight wh>=3 and H?b2 having a dual-diagonal structure with matrix elements at row i, column j equal to 1 for i=j, 1 for i=j+1, and 0 elsewhere. The 1's of hb and Hb1 are arranged such that one or more groups of the rows of Hb can be formed so that the rows of Hb within each group do not intersect. Further more, the rows of base matrix Hb can be permuted such that every two consecutive rows do not intersect.

Abstract: A base model matrix is defined for the largest code length of each code rate. The set of shifts {p(i,j)} in the base model matrix are used to determine the shift sizes for all other code lengths of the same code rate. Shift sizes {p(f; i, j)} for a code size corresponding to expansion factor zf are derived from {p(i,j)} by scaling p(i,j) proportionally, and a model matrix defined by {p(f,i,j)} is used to determine the parity-check bits for the f-th code.

Abstract: A base model matrix is defined for the largest code length of each code rate. The set of shifts {p(i,j)} in the base model matrix are used to determine the shift sizes for all other code lengths of the same code rate. Shift sizes {p(f,i,j)} for a code size corresponding to expansion factor zf are derived from {p(i,j)} by scaling p(i,j) proportionally, and a model matrix defined by {p(f,i,j)} is used to determine the parity-check bits for the f-th code.

Abstract: A structured parity-check matrix H is proposed, wherein H is an expansion of a base matrix Hb and wherein Hb comprises a section Hb1 and a section Hb2, and wherein Hb2 comprises a first part comprising a column hb having an odd weight greater than 2, and a second part comprising matrix elements for row i, column j equal to 1 for i=j, 1 for i=j+1, and 0 elsewhere. The expansion of the base matrix Hb uses identical submatrices for 1s in each column of the second part H?b2, and the expansion uses paired submatrices for an even number of 1s in hb.

Abstract: A method of channel estimation in a Code Division Multiple Access (CDMA) transmission system that incorporates Pilot Symbol Assisted Modulation (PSAM) using an iterative coherent detection method to estimate the phase and frequency of the received pilot symbols. Arctangent calculations are used to estimate phase and frequency. An iterative least squares linearization identifies and corrects values of the arctangent associated with an incorrect 2? alias, which arise due to the multiple-valued nature of the arctangent function. An alternative non-iterative least squares linearization also corrects the arctangent values, based on a calculation involving stored values of the pilot symbols.

Abstract: A method for linearizing an amplifier to produce an amplified output signal from a set of carrier frequencies is disclosed in which a set of digital baseband signals corresponding to the set of carrier frequencies are combined to produce an extended digital baseband signal. Look-up values are then derived from the power values of the extended digital baseband signal and applied to a look-up table to obtain predistortion values. One or more predistorted signals are then produced by complex mixing the predistortion values with one of the set of extended digital baseband signals. The predistorted signal(s) are then amplified to produced an output signal which is linearly related to the set of digital baseband signals.