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.