Abstract: Methods and systems for detecting a preamble of a data packet in wireless communication systems is provided. To determine a preamble from a received signal, which may include a noise-altered preamble bit sequence, linear feedback shift registers (LFSRs) can be used to generate a count of the received preamble, and the count is compared to pre-generated scores to identify a match. Example methods include for each of a number of different preamble orientations of a preamble, generating a count value based on a comparison of bits of the preamble with a random bit sequence to produce a sequence of count values, and comparing the sequence of count values with m sequences of count values. A sequence of count values is identified that includes a maximum number of matching elements, and the received preamble is determined to be one of the m preambles corresponding to the identified sequence.

Abstract: Methods and systems for detecting a preamble of a data packet in wireless communication systems is provided. To determine a preamble from a received signal, which may include a noise-altered preamble bit sequence, linear feedback shift registers (LFSRs) can be used to generate a count of the received preamble, and the count is compared to pre-generated scores to identify a match. Example methods include for each of a number of different preamble orientations of a preamble, generating a count value based on a comparison of bits of the preamble with a random bit sequence to produce a sequence of count values, and comparing the sequence of count values with m sequences of count values. A sequence of count values is identified that includes a maximum number of matching elements, and the received preamble is determined to be one of the m preambles corresponding to the identified sequence.

Abstract: Methods and systems for detecting a preamble of a data packet in wireless communication systems is provided. To determine a preamble from a received signal, which may include a noise-altered preamble bit sequence, linear feedback shift registers (LFSRs) can be used to generate a count of the received preamble, and the count is compared to pre-generated scores to identify a match. Example methods include for each of a number of different preamble orientations of a preamble, generating a count value based on a comparison of bits of the preamble with a random bit sequence to produce a sequence of count values, and comparing the sequence of count values with m sequences of count values. A sequence of count values is identified that includes a maximum number of matching elements, and the received preamble is determined to be one of the m preambles corresponding to the identified sequence.

Abstract: Sub-channels in cells of an Orthogonal Frequency Division Multiple Access (OFDMA) network are formed based on random permutations of a set of subcarrier indices. The random permutations are performed for each cell of the network using a pseudo-random number generator (PRNG) and a shuffle technique. Different initial states of the PRNG are used to generate the random permutation of the subcarrier indices for each cell. In an embodiment, sub-carriers represented by a contiguous group of indices in the random permutation obtained for a cell are assigned to form a sub-channel. Interference diversity for the OFDMA network is thereby improved.

Abstract: Data communication, with improved error detection, of a signal having a plurality of data blocks, by: error checking a received data block in a first sequence using a first polynomial, beginning with a first predetermined initial error checking state, producing a first checksum; error checking the received data block in a second sequence using a second polynomial, using the first checksum as a second predetermined initial error checking state, producing a second checksum; comparing the second checksum to the first predetermined initial error checking state to detect errors in the data communication; and repeating the above steps for sequential data blocks of the data communication, wherein the first polynomial is an inverse of the second polynomial.

Abstract: Data communication, with improved error detection, of a signal having a plurality of data blocks, by: error checking a received data block in a first sequence using a first polynomial, beginning with a first predetermined initial error checking state, producing a first CSUM; error checking the received data block in a second sequence using a second polynomial, using the first CSUM as a second predetermined initial error checking state, producing a second CSUM; comparing the second CSUM to the first predetermined initial error checking state to detect errors in the data communication; and repeating the above steps for sequential data blocks of the data communication, wherein the first polynomial is an inverse of the second polynomial.

Abstract: Data communication, with improved error detection, of a signal having a plurality of data blocks, by: error checking a received data block in a first sequence using a first polynomial, beginning with a first predetermined initial error checking state, producing a first CSUM; error checking the received data block in a second sequence using a second polynomial, using the first CSUM as a second predetermined initial error checking state, producing a second CSUM; comparing the second CSUM to the first predetermined initial error checking state to detect errors in the data communication; and repeating the above steps for sequential data blocks of the data communication, wherein the first polynomial is an inverse of the second polynomial.