Abstract: A receiver receives a wireless signal comprising a plurality of fields including a legacy short training field (L-STF), legacy long training field (L-LTF), and legacy signal (L-SIG) field transmitted to a plurality of antenna of the receiver. For each sub-band in a receiver bandwidth and when samples of the L-STF is received, a first angle based autocorrelation is performed to determine a group of sub-bands which maximize a magnitude based on the first autocorrelations for one or more sub-bands. For each sub-band in the receiver bandwidth and when samples of the L-LTF is received, a second angle based autocorrelation is then performed to refine the crude bandwidth pattern estimate. One or more signal fields and one or more data fields of the received signal are decoded based on the refined bandwidth pattern estimate.

Abstract: The problem of providing an efficient physical implementation of a (first) classifier defined by a first rule set, at least a part of which first classifier having a sparse distribution in Boolean space, is solved by (1) converting the first classifier, having a corresponding Boolean space, into a second classifier, wherein the second classifier has a corresponding Boolean space which is not semantically equivalent to the Boolean space corresponding to the first classifier, and wherein the second classifier is defined by a second set of rules which is smaller than the first set of rules defining the first classifier; and (2) defining a bit string transformation which transforms a first bit string into a second bit string, wherein applying the first bit string to the first classifier is equivalent to applying the second bit string to the second classifier. In at least some example embodiments, the first bit string includes packet header information.

Abstract: The problem of providing an efficient physical implementation of a (first) classifier defined by a first rule set, at least a part of which first classifier having a sparse distribution in Boolean space, is solved by (1) converting the first classifier, having a corresponding Boolean space, into a second classifier, wherein the second classifier has a corresponding Boolean space which is not semantically equivalent to the Boolean space corresponding to the first classifier, and wherein the second classifier is defined by a second set of rules which is smaller than the first set of rules defining the first classifier; and (2) defining a bit string transformation which transforms a first bit string into a second bit string, wherein applying the first bit string to the first classifier is equivalent to applying the second bit string to the second classifier. In at least some example embodiments, the first bit string includes packet header information.