Abstract: Methods and systems for providing generalized link adaptation in an orthogonal frequency-division multiple access wireless communications network can include determining a number of desired resource blocks (RBs) for each user of a plurality of users; calculating a maximal channel gain Gm for each RB of a plurality of RBs; reordering the plurality of RBs based on the Gm; assigning one of the plurality of RBs to the plurality of users one-by-one according to the reordering of the plurality of RBs; determining a priority list for assigning remaining unassigned RBs; assigning the remaining unassigned RBs to the plurality of users based on the priority list; and mapping a symbol or a packet to each assigned RB.

Abstract: A decoding apparatus and method are described. The decoder includes N successive decoder groups numbered 1 to N arranged in series. Each decoder group includes primary decoding means for decoding the first sequence of codewords in combination with the source sequence of symbols to produce a sequence of primary decoded symbols; intermediate interleaving means for interleaving the sequence of primary decoded symbols using intra-block permutations on the source sequence of symbols and inter-block permutations on each intra-block permuted block across the predetermined number of the intra-block permuted blocks to produce a sequence of intermediate symbols; secondary decoding means for decoding the second sequence of codewords in combination with the sequence of intermediate symbols and a sequence of interleaved source symbols to produce a sequence of secondary decoded symbols; and de-interleaving means for de-interleaving the sequence of secondary decoded symbols to produce a sequence of estimated symbols.

Abstract: Methods and systems for providing generalized link adaptation in an orthogonal frequency-division multiple access wireless communications network can include determining a number of desired resource blocks (RBs) for each user of a plurality of users; calculating a maximal channel gain Gm for each RB of a plurality of RBs; reordering the plurality of RBs based on the Gm; assigning one of the plurality of RBs to the plurality of users one-by-one according to the reordering of the plurality of RBs; determining a priority list for assigning remaining unassigned RBs; assigning the remaining unassigned RBs to the plurality of users based on the priority list; and mapping a symbol or a packet to each assigned RB.

Abstract: An interleaver and method of interleaving operate on data represented in a sequence of symbols to produce an interleaved sequence of symbols. The interleaver performs intra-block and inter-block permutations on the sequence of symbols. An encoder and method of encoding operate on data represented in a source sequence of symbols. The source sequence of symbols is encoded into a first sequence of codewords and interleaved using intra-block and inter-block permutations to produce a sequence of interleaved symbols. The sequence of interleaved symbols is encoded into a second sequence of codewords. A decoder and method of decoding operate on data represented in a sequence of received symbols. The sequence of received symbols comprises a formatted copy of the source sequence of symbols and the first and the second sequence of codewords.

Abstract: A decoding apparatus and method are described. The decoder includes N successive decoder groups numbered 1 to N arranged in series. Each decoder group includes primary decoding means for decoding the first sequence of codewords in combination with the source sequence of symbols to produce a sequence of primary decoded symbols; intermediate interleaving means for interleaving the sequence of primary decoded symbols using intra-block permutations on the source sequence of symbols and inter-block permutations on each intra-block permuted block across the predetermined number of the intra-block permuted blocks to produce a sequence of intermediate symbols; secondary decoding means for decoding the second sequence of codewords in combination with the sequence of intermediate symbols and a sequence of interleaved source symbols to produce a sequence of secondary decoded symbols; and de-interleaving means for de-interleaving the sequence of secondary decoded symbols to produce a sequence of estimated symbols.

Abstract: An interleaver and method of interleaving operate on data represented in a sequence of symbols to produce an interleaved sequence of symbols. The interleaver performs intra-block and inter-block permutations on the sequence of symbols. An encoder and method of encoding operate on data represented in a source sequence of symbols. The source sequence of symbols is encoded into a first sequence of codewords and interleaved using intra-block and inter-block permutations to produce a sequence of interleaved symbols. The sequence of interleaved symbols is encoded into a second sequence of codewords. A decoder and method of decoding operate on data represented in a sequence of received symbols. The sequence of received symbols comprises a formatted copy of the source sequence of symbols and the first and the second sequence of codewords.

Abstract: An interleaver and method of interleaving operate on data represented in a sequence of symbols to produce an interleaved sequence of symbols. The interleaver performs intra-block and inter-block permutations on the sequence of symbols. An encoder and method of encoding operate on data represented in a source sequence of symbols. The source sequence of symbols is encoded into a first sequence of codewords and interleaved using intra-block and inter-block permutations to produce a sequence of interleaved symbols. The sequence of interleaved symbols is encoded into a second sequence of codewords. A decoder and method of decoding operate on data represented in a sequence of received symbols. The sequence of received symbols comprises a formatted copy of the source sequence of symbols and the first and the second sequence of codewords.

Abstract: A method of acquiring a transmitted pseudo noise (PN) code c(t) from a received signal r(t) that is data modulated. The method includes, for a BPSK modulated signal, multiplying the received signal r(t) by cos(&ohgr;0t) and sin(&ohgr;0t), respectively to produce in-phase and quadrature (I-Q) down converted signals. Then multiplying the I-Q down converted signals by the PN code c(t), having a second PN code phase, to produce f(t) and g(t) respectively. Thereafter, summing separate contiguous portions of f(t) and g(t) and multiplying the summed portions of f(t) and g(t) by a matrix. The matrix represents data patterns within an interval MTc that spans the separate contiguous portions of f(t) and g(t). Lastly, the results of the matrix multiplication are compared to a threshold value to determine if the first PN code phase is equal to the second PN code phase.