Frame synchronization detection based on adaptive thresholds
By adopting an adaptive threshold frame synchronization detection system in wireless devices, the problems of high frame synchronization detection accuracy and power consumption in BLE networks are solved, and more accurate RTT estimation and distance measurement are achieved, improving positioning and distance measurement are improved. Quality of service.
Patent Information
- Application Number
- CN202410696834.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2023-06-02
- Filing Date
- 2024-05-31
- Publication Date
- 2024-12-03
AI Technical Summary
Existing wireless devices have problems with high power consumption and insufficient accuracy in frame synchronization detection, especially in BLE networks, which are difficult to accurately estimate the arrival time and distance of packets, affecting the quality of positioning and ranging services.
The frame synchronization detection system and method adopting adaptive thresholds, by coupling the frame synchronization detection circuit and correlation circuit in the receiver of the wireless device, calculate the attributes and correlation peaks of the data mode, dynamically adjust the threshold to improve detection accuracy, and Integrate RF circuits, frame synchronization detection circuits and adaptive threshold circuits in the communication interface to achieve more accurate frame synchronization detection.
It improves the accuracy and power efficiency of frame synchronization detection in BLE networks, provides more accurate RTT estimation and distance ranging, enhances the quality of positioning and ranging services, and reduces power consumption.
Smart Images

Figure CN119071893A_ABST
Abstract
Description
Technical Field
[0001] The present disclosure relates to wireless networks, and more particularly to wireless networks, such as via Bluetooth (BT) or Frame synchronization detection for various electronic devices that perform wireless communication using Bluetooth Low Energy (BLE) connections. Background Art
[0002] Such as Bluetooth (BT), Low power consumption (BLE), Personal Area Networks (PANs) such as infrared use the 2.4 GHz radio frequency band to provide wireless connectivity for a variety of personal industrial, scientific, and medical applications. PANs typically use a packet-based protocol and have an architecture that includes a central device (CD) and a peripheral device (PD). A CD can communicate with multiple PDs.
[0003] Typically, data is transmitted between a CD and a specific PD during the time allocated for a specific PD-CD communication link. At the specified time, the PD can tune to receive messages and data from the CD, and then transmit the data to the CD. In addition, the CD can sometimes use a broadcast mode in which the same data is transmitted to multiple PDs at the same time. The BLE network has a communication range similar to that of the BT network, but with significantly smaller power consumption and cost. In addition, BLE devices are typically kept in sleep mode and switch to run mode when data communication is about to occur. The BLE protocol also supports mesh networking, in which data can flow through multiple paths, and mesh networking does not rely on a rigid hierarchical structure of devices, typically allowing the same device to be used as a CD or PD, depending on specific network conditions and topology. BRIEF DESCRIPTION OF THE DRAWINGS
[0004] Figure 1A is a block diagram of an example system for frame synchronization detection between a wireless device acting as a CD and a wireless device acting as a PD in accordance with some implementations.
[0005] Figure 1B According to some embodiments Figure 1A A simplified block diagram of the communication interface of a CD-based wireless device.
[0006] Figure 1C is a simplified block diagram illustrating a packet received from a wireless device in accordance with some embodiments.
[0007] Figure 2 is a flow chart of an example method for performing frame synchronization detection using an adaptive threshold according to some implementations.
[0008] Figure 3 is a flow chart of another example method for performing frame sync detection using adaptive thresholds in accordance with some implementations. DETAILED DESCRIPTION
[0009] The following description sets forth numerous specific details, such as examples of specific systems, devices, components, methods, etc., in order to provide a good understanding of various embodiments of frame synchronization detection between wireless devices associated with a PAN. The disclosed principles may generally be applied to (Gaussian) frequency shift keying ((G)FSK) modulation or to modulation utilizing offset quadrature phase shift keying (OQPSK) with sine wave shaping. Frame synchronization (or synchronization of frames) detection may refer to detecting a frame delimiter in a network packet, also known as a start frame delimiter (SFD), which identifies or signals that data will appear within a frame of a packet.
[0010] In some PAN devices, frame synchronization detection can be used to assist communication between wireless devices by identifying or signaling that data (i.e., payload data) will appear in a packet. Optionally, frame synchronization detection can also identify the sender of the packet. In some PAN devices, frame synchronization can be used as part of distance estimation. For example, for BLE, distance estimation is achieved by a phase-based distance ranging method or by packet exchange in a round trip timing (RTT) estimate, or a combination thereof, to provide positioning between wireless devices. In one example, a data pattern (e.g., digital "0" and "1") is used in the RTT estimate to estimate the time of arrival (ToA) of the packet. In another example, the BLE distance estimation can use the frequency estimated during the RTT estimation to synchronize the BLE distance estimation device with other BLE distance estimation devices by correcting the clock error, and estimate the frequency offset between devices. In addition, the BLE distance estimation can use the data pattern to estimate the frequency used in security features (such as intrusion detection models).
[0011] Frame synchronization detection can be performed at a sampling rate that is a simple multiple (e.g., 4, 6, 8, 12 megahertz (MHz)) of the data symbol rate (e.g., 1 or 2 megabits per second (Mbps)). The sampling rate and the data symbol rate are typically divided (e.g., sampling) rates of a crystal oscillator (XO) frequency (e.g., 24, 32, or 48 MHz). Subsequent processing of the data symbols can be performed directly at the known XO integer-divided sampling rate, and data patterns can be more easily correlated using bit decisions based on Boolean logic. Alternatively, signed soft symbols can be used to obtain more accurate results, in which case the correlation can be described as multiple multiplications, sums, and / or subtractions.
[0012] In practice, frame synchronization detection may require finding a peak value of the amplitude of the correlation with known input data that satisfies (e.g., is greater than) a threshold. In some wireless devices, the threshold may be a fixed value that is set as high as possible to avoid false noise detection but is lower than the expected amplitude peak of the correlation. By calculating the correlation amplitude peak and determining that the correlation amplitude peak is greater than the threshold, an algorithm can be used to detect frame synchronization. In order to save power, the amplitude peak of the correlation is usually calculated without considering the data mode used in frame synchronization. However, the amplitude peak of the correlation usually depends on the data mode. For example, due to changes in the data mode, there may be changes in the correlation peak amplitude and / or phase value. Therefore, each correlation amplitude peak in the correlation amplitude peak range will need to be greater than the threshold. In some cases, the threshold can be set to a value that is not lower than each correlation amplitude peak in the correlation amplitude peak range. In some cases, the threshold can be set to a value that is not high enough to avoid false noise detection. Therefore, it may be necessary to use a threshold that is adapted to all data modes and is therefore as accurate as possible to detect frame synchronization.
[0013] Various aspects and embodiments of the present disclosure address these and other limitations of the prior art by implementing a frame synchronization detection system and method using an adaptive threshold. In one example embodiment, a receiver of a wireless device receives a packet wirelessly (e.g., via one or more antennas) over a communication channel. A frame synchronization detection circuit coupled to the receiver identifies a data pattern (e.g., a frame synchronization pattern) within a portion of the packet. A correlation circuit coupled to the frame synchronization detection circuit calculates one or more attributes of the data pattern in response to identifying the data pattern at the portion of the packet. The correlation circuit also calculates one or more values near a correlation peak using a correlation method. An adaptive threshold circuit coupled to the correlation circuit uses one or more attributes of the data pattern and one or more values of the correlation peak to determine a correlation threshold. Many other embodiments and variations of these embodiments are discussed below.
[0014] Advantages of the present disclosure may include the use of frame synchronization detection (with adaptive thresholds) to determine correlation amplitude peaks that take into account various data patterns, thereby providing a much more accurate RTT estimate while still being power efficient. Having a more accurate RTT estimate can in turn be used to estimate the time of arrival (ToA) of a packet. Thus, distance estimation devices for positioning and ranging services and security applications may be improved, allowing more accurate positioning and ranging services to be provided in devices such as BLE distance estimation devices.
[0015] Figure 1A 1 is a block diagram of an example system for frame synchronization detection with adaptive thresholds between a wireless device 101 acting as a CD and a wireless device 150 acting as a PD according to some embodiments. The system 100 may include a secured resource 50, for example, secured using a locking mechanism 60, wherein the wireless device 150 is adapted to obtain access to the secured resource 50 via the locking mechanism 60. The secured resource 50 may be, for example, a vehicle, a building, a residence, a garage, a shed, a safe, etc. The secured resource 50 may also be a computer system, an industrial device, or other item that requires secure access via the locking mechanism 60 (which may be, for example, a digital locking mechanism). In some embodiments, the locking mechanism is integrated with the wireless device 101.
[0016] In some embodiments, the wireless device 150 is any one of a plurality of peripheral wireless devices PD1 150A, PD2 150B, PD3 150C, ..., PDN 150N, etc., and the wireless device 101 may be adapted to communicate with any or all of the peripheral wireless devices PD1 150A, PD2 150B, PD3 150C, ..., PDN 150N, etc. In some embodiments, the wireless device 101 is a mobile device such as a mobile phone, a smart phone, a pager, an electronic transceiver, a tablet computer, etc. In some embodiments, the wireless device 150 may be adapted to obtain access to the protected resource 50 by transmitting data encapsulated in a packet 111. The packet 111 may be transmitted from the wireless device 150 to the wireless device 101, as will be discussed in more detail. Although the wireless device 101 is shown in detail, the wireless device 150 may also include the same or similar components as the wireless device 101, but for simplicity, this is not repeated.
[0017] In some embodiments, wireless device 101 includes, but is not limited to, a transmitter 102 or TX (e.g., a PAN transmitter), a receiver 104 or RX (e.g., a PAN receiver), a communication interface 106, an antenna 110, a memory 114, one or more input / output (I / O) devices 118 (such as a display screen, a touch screen, a keyboard, etc.), and a processor 120. These components may all be coupled to a communication bus 130. In some embodiments, as described herein, a frequency offset is an offset (e.g., a difference) between a frequency at TX 102 and a frequency at RX 104.
[0018] In some embodiments, each of transmitter 102 and receiver 104 employs a separate antenna, and therefore antenna 110 is shown for simplicity. In some embodiments, memory 114 includes a storage device for storing instructions executable by processor 120 and / or data generated by communication interface 106. In some embodiments, one or more antennas (such as antenna 110) within various devices described herein are used for PAN-based frequency bands, such as (BT), BLE, Z-Wave TM wait.
[0019] In some embodiments, communication interface 106 is integrated with transmitter 102 and receiver 104, for example, as a front end of wireless device 101. Communication interface 106 may coordinate as directed by processor 120 to request / receive packets (e.g., packet 111) from peripheral wireless device 150. Communication interface 106 may also process data symbols received by receiver 104 in a manner that enables processor 120 to perform further processing, including detecting frame synchronization using an adaptive threshold by identifying a data pattern within a sample of data values obtained from a frame of packet 111, identifying one or more attributes of the data pattern, calculating one or more values around a correlation peak using a correlation method, and determining a correlation threshold using one or more attributes of the data pattern and one or more values of the correlation peak, as discussed herein.
[0020] Figure 1B According to some embodiments Figure 1A 1 is a simplified block diagram of the communication interface 106 of the CD-based wireless device 101.
[0021] In some embodiments, the communication interface 106 includes the RF circuit 140, although the RF circuit 140 discussed herein may also be coupled to the communication interface 106 and thus located elsewhere within the front end of the wireless device 101. In some embodiments, the RF circuit 140 includes (or is coupled to) a crystal oscillator (XO) 142, and includes a frame sync detection circuit 144, a correlation circuit 148, and an adaptive threshold circuit 151.
[0022] XO 142 may provide a clock to manage sampling and processing in the XO-based frequency domain. In some embodiments, RF circuit 140 is implemented as a programmable processor, such as an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), a processing unit (such as a CPU or GPU), or other microprocessor devices that may include a combination of circuit-based hardware, logic units, firmware, and / or software.
[0023] In some embodiments, frame synchronization detection circuit 144 is configured to identify a data pattern within a portion of a packet received via receiver 104. The data pattern may be a set of bits that include a predicted data pattern that indicates or identifies when data will appear within a frame of the packet. Correlation circuit 148 may be configured to identify one or more attributes of the data pattern. Correlation circuit 148 may also be configured to calculate one or more values around a correlation peak using data samples from the received packet. The correlation circuit 148 may be configured to use the data samples described herein to determine the peak of the correlation. Figure 2 The adaptive threshold circuit 151 may be configured to use one or more attributes of the data pattern and one or more values of the correlation peak to determine the correlation threshold. Figure 3 Further details are described.
[0024] Figure 1C FIG. 2 is a diagram illustrating a slave wireless device (eg, Figure 1A 150) received by the PD 150). Figure 1C As shown, packet 111 may include, but is not limited to, a preamble 111a, a start frame delimiter 111b, and data 111c. Preamble 111a is typically a fixed number of bytes (e.g., seven bytes) that indicate or identify that the data will be received by a receiver (e.g., Figure 1A The preamble 111a allows a wireless device (e.g., Figure 1A The wireless devices 101 of FIG. 100 ) align their receiver clocks with the wireless devices (e.g., Figure 1AThe start frame delimiter 111b is typically another fixed number of bytes (eg, one byte) indicating the end of the preamble 111a and the beginning of a frame with payload data (eg, data 111c).
[0025] Figure 2 2 is a flow chart of an example method 200 for performing frame synchronization detection using an adaptive threshold according to some embodiments. The method 200 may be performed by a processing logic unit, which may include hardware (e.g., a processing device, a circuit, a dedicated logic unit, a programmable logic unit, a microcode, hardware of a device, an integrated circuit, etc.), software (e.g., instructions running or executed on a processing device), or a combination thereof. In some embodiments, the method 200 is performed by the communication interface 106 and / or the processor 120 of the wireless device 101 (e.g., as Figure 1A-1B shown).
[0026] At operation 201, via a receiver (eg, Figure 1A Receiver 104) from a wireless device (e.g., Figure 1A PD150) receives a packet (for example, Figure 1C The data may be sampled at an integer rate (k) of a local oscillator (LO) bit rate. For example, the data may be sampled at a rate (e.g., 4 MHz, 6 MHz, 8 MHz, 12 MHz) that is a simple multiple of the data symbol rate (e.g., 1 or 2 Mbps), where the rate is a divided rate of a crystal oscillator (XO) frequency (e.g., 24 MHz, 32 MHz, or 48 MHz).
[0027] The data samples may be used to obtain a frequency estimation sample dS(n), i.e., the differential of the nth data sample, where the differential is for one symbol S. For example, in some embodiments, at operation 203, the grouped data samples are converted to an in-phase domain (e.g., ). For example, the data samples may be converted into the in-phase domain using a mathematical equation, which may be:
[0028]
[0029] Where I is the in-phase domain value, and Q is the quadrature domain value.
[0030] At operation 205, the difference between adjacent data samples may be calculated. In some embodiments, calculating the difference between adjacent samples is performed by calculating the differential of adjacent phase domain data sample values. For example, the difference may be calculated using a mathematical equation, which may be:
[0031]
[0032] At operation 207, for each difference between adjacent samples calculated at operation 205, a subtraction operation may be performed on the difference. For example, the subtraction operation may be performed on the difference using a mathematical equation, which may be:
[0033]
[0034] where k is the data oversampling ratio used in the receiver.
[0035] At operation 209, the differences of each data sample may be accumulated (e.g., summed) to obtain a frequency estimate sample dS(n). In some embodiments, the differences are further scaled using a value such as π (i.e., pi) and a modulation index h (e.g., a fixed value such as 0.5). For example, the differences may be accumulated and scaled using a mathematical equation to obtain dS(n), which may be:
[0036]
[0037] dS(n) is converted to the IQ domain:
[0038] dIQ(n)=e jdS(n) .
[0039] At operation 211, a reference data pattern may be calculated. In some embodiments, the reference data pattern is a data pattern to be used in a correlation operation. When the reference data pattern matches a portion of the received data, the correlation operation generates a peak (in amplitude). For example, the reference data pattern may be calculated using a mathematical equation, which may be:
[0040]
[0041] In the above mathematical equation, It may be a predetermined synchronization symbol found in the BLE distance estimation device.
[0042] At operation 213, a correlation operation may be performed to obtain a peak value of the correlation magnitude and one or more values before and after the peak value of the correlation magnitude (e.g., to generate a fractional timing correctional value for the peak value). In some embodiments, a correlation operation is performed using a mathematical equation using the calculated reference data pattern and the calculated frequency estimate samples dS(n) to calculate the peak value. For example, the mathematical equation may be:
[0043]
[0044] where k is the data oversampling ratio used in the receiver.
[0045] as well as:
[0046]
[0047] where ρ(n) is the magnitude of the correlation, and is the phase of the correlation.
[0048] In some embodiments, the calculated peak amplitude value may be a value that satisfies (e.g., is greater than) a fixed correlation threshold. However, as described herein, the peak value may depend on properties of the data pattern. Thus, the correlation threshold should be less than the calculated minimum peak amplitude value, but high enough to avoid any false noise detection as described above. The correlation threshold may be adapted to take into account one or more properties of the data pattern, as described herein with respect to Figure 3 as described.
[0049] To calculate one or more values before and after the peak of the correlation amplitude, the processing logic may calculate a fractional timing correction value (e.g., + / - 0.25, + / - 0.5, etc.) of the calculated amplitude peak. At operation 215, the amplitude peak is used in addition to the one or more values before and after the peak of the correlation amplitude so that a fractional timing estimation may be calculated. At operation 217, the amplitude peak is used in addition to the one or more values before and after the peak of the correlation amplitude so that a frequency offset estimation may be calculated.
[0050] It should be understood that the above mathematical equations are intended as examples and that various other schemes are possible, e.g., using different specific equations, considering different (or additional) corrections and / or peaks, etc., while still within the scope of the present disclosure.
[0051] Figure 3 is a flow chart of an example method 300 for performing frame synchronization detection using an adaptive threshold according to some embodiments. The method 300 may be performed by a processing logic unit, which may include firmware, hardware (e.g., a processing device, a circuit, a dedicated logic unit, a programmable logic unit, a microcode, hardware of a device, an integrated circuit, etc.), software (e.g., instructions running or executed on a processing device), or a combination thereof. In some embodiments, the method 300 is performed by the communication interface 106 and / or the processor 120 of the wireless device 101 (e.g., as Figure 1A-1B shown).
[0052] At operation 310, the processing logic unit receives a packet. The packet may be received via a receiver (e.g., Figure 1A In some embodiments, the packet is Figure 1A and / or Figure 1C Packet 111. The packet may include a preamble, a start frame delimiter, and payload data, as described herein.
[0053] At operation 320, the processing logic unit identifies a data pattern (e.g., a frame synchronization pattern). The data pattern may be identified within a portion of the packet 111. In some embodiments, the data pattern is a bit sequence from the preamble 111a and / or the start frame delimiter 111b portion of the packet. Identifying the data pattern may include identifying a predicted data pattern within the portion of the packet. The predicted data pattern may be a set of bits in the bit sequence from the preamble 111a, the start frame delimiter 111b portion of the packet, and / or a known set of symbols in the payload portion of the packet.
[0054] At operation 330, the processing logic unit identifies one or more attributes of the data pattern. In some embodiments, identifying one or more attributes of the data pattern may include identifying one or more repeated symbols within the data pattern. The one or more repeated symbols may include, for example, one or more repeated "0"s and / or one or more repeated "1". The processing logic unit may maintain a count of each repeated "0" and each repeated "1" within the data pattern. Maintaining the count may include maintaining a counter for each symbol, such as a counter for repeated "0"s and a counter for repeated "1". Each counter may be set to an initial value (e.g., 0). For example, the data pattern may be "0010101100". Within this example data pattern, the processing logic unit may identify the first bold "00" as a repeated symbol. In response to identifying the first bold "00" as a repeated symbol, the processing logic unit may increment the counter for repeated "0"s by a value (e.g., an integer or non-integer value, such as 1). The processing logic unit may identify bold "11" as a repeated symbol. In response to identifying the bold "11" as a repeating symbol, the processing logic unit may increment a counter for repeated "1"s by a value (e.g., an integer or non-integer value, such as 1). The processing logic unit may identify another bold "00" at the end of the data pattern as a repeating symbol. In response to identifying another bold "00" as a repeating symbol, the processing logic unit may increment a counter for repeated "0"s by a value (e.g., an integer or non-integer value, such as 1). In some embodiments, the processing logic unit may calculate a sum of the number of repeated symbols. Calculating the sum of the number of repeated symbols may include additively calculating the value of each counter. For example, using the previous example, the processing logic unit may identify that the counter for repeated "0"s has a current value (e.g., count) 2, where 2 is the number of repeated "0"s found within the data pattern. The processing logic unit may also identify that the counter for repeated "1"s has a current value (e.g., count) 1, where 1 is the number of repeated "1"s found within the data pattern. In some embodiments, the processing logic unit may store the calculated sum in a data structure such as a lookup table. In some embodiments, the sum of each different repeated symbol may be calculated separately. In some embodiments, the calculated sum of each different repeated symbol may be stored separately, for example in a separate data structure.
[0055] In some embodiments, one or more attributes of identifying a data pattern may include identifying one or more non-repeating symbols within the data pattern. The one or more non-repeating symbols may include, for example, one or more non-repeating "0"s and / or one or more non-repeating "1". The processing logic unit may maintain a count of each non-repeating "0" and each non-repeating "1" within the data pattern. Maintaining the count may include maintaining a counter for each symbol, such as a counter for non-repeating "0"s and a counter for non-repeating "1". Each counter may be set to an initial value (e.g., 0). For example, the data pattern may be "0010101100". Within this example data pattern, the processing logic unit may identify the first bold "1" as a non-repeating symbol. In response to identifying the first bold "1" as a non-repeating symbol, the processing logic unit may increment the counter for non-repeating "1"s by a value (e.g., an integer or non-integer value, such as 1). The processing logic unit may identify a bold "0" as a non-repeating symbol. In response to identifying a bold "0" as a non-repeating symbol, the processing logic unit may increment a counter for non-repeating "0" by a value (e.g., an integer or non-integer value, such as 1). The processing logic unit may identify another bold "1" as a non-repeating symbol. In response to identifying another bold "1" as a non-repeating symbol, the processing logic unit may increment a counter for non-repeating "1" by a value (e.g., an integer or non-integer value, such as 1). The processing logic unit may also identify another bold "0" as a non-repeating symbol. In response to identifying another bold "0" as a non-repeating symbol, the processing logic unit may increment a counter for non-repeating "0" by a value (e.g., an integer or non-integer value, such as 1). In some embodiments, the processing logic unit may calculate the sum of the number of non-repeating symbols. Calculating the sum of the number of non-repeating symbols may include additively calculating the value of each counter. For example, using the previous example, the processing logic unit may identify that the counter for non-repeating "0" has a current value (e.g., count) 2, where 2 is the number of non-repeating "0" found within the data pattern. The processing logic unit may also identify that the counter for non-repeating "1's" has a current value (e.g., count) of 2, where 2 is the number of non-repeating "1's" found within the data pattern. In some embodiments, the processing logic unit may store the calculated sum in a data structure such as a lookup table. In some embodiments, the sum may be calculated separately for each different non-repeating symbol. In some embodiments, the calculated sum for each different non-repeating symbol may be stored separately, for example, in a separate data structure.
[0056] In some embodiments, identifying one or more attributes of a data pattern may include identifying one or more singleton 0s and / or singleton 1s within the data pattern (e.g., any isolated 0 or 1 in a bit sequence, such as the following bold 0s and 1s: "01001000"). In some embodiments, the processing logic unit may calculate a sum of the number of singletons (e.g., the number of singleton 0s and / or the number of singleton 1s). Calculating the sum of the number of singletons may include additively calculating the values of each counter. For example, using the previous example, the processing logic unit may identify that the counter for singleton 0 has a current value (e.g., count) 1, where 1 is the number of singleton 0s found within the data pattern. The processing logic unit may also identify that the counter for singleton 1 has a current value (e.g., count) 2, where 2 is the number of singleton 1s found within the data pattern. In some embodiments, the processing logic unit may store the calculated sum in a data structure such as a lookup table. In some embodiments, the sum of one or more singleton 0s may be referred to herein as S(1,1). In some embodiments, the sum of one or more singleton 1s may be referred to herein as S(1,2).
[0057] In some embodiments, identifying one or more attributes of a data pattern may include identifying one or more transition 0s and / or transition 1s within the data pattern (e.g., any transition 0s and 1s in a bit sequence, such as the following bold 0s and 1s: "0100100000"). In some embodiments, the processing logic unit may calculate the sum of the number of transition 0s and / or the number of transition 1s. Calculating the sum of the number of transition 0s and / or the number of transition 1s may include additively calculating the values of each counter. For example, using the previous example, the processing logic unit may identify that the counter for transition 0 has a current value (e.g., count) 2, where 2 is the number of transition 0s found within the data pattern. The processing logic unit may also identify that the counter for transition 1 has a current value (e.g., count) 1, where 1 is the number of transition 1s found within the data pattern. In some embodiments, the processing logic unit may store the calculated sums in a data structure such as a lookup table. In some embodiments, the sum of one or more transition 0s may be referred to herein as S(2,1). In some embodiments, the sum of one or more transition 1s may be referred to herein as S(2,2).
[0058] In some embodiments, identifying one or more attributes of the data pattern may include identifying one or more non-transition 0s and / or non-transition 1s within the data pattern (e.g., any non-transition 0s and 1s in a bit sequence, such as the following bold 0s and 1s: “0100100000”). In some embodiments, the processing logic unit may calculate a sum of the number of any non-transition 0s and 1s in the bit sequence, such as the following bold 0s and 1s: “0100100000”. Calculating the sum of the number of non-transition 0s and 1s may include additively calculating the value of each counter. For example, using the previous example, the processing logic unit may identify that the counter for non-transition 0s has a current value (e.g., count) 2, where 2 is the number of non-transition 0s found within the data pattern. The processing logic unit may also identify that the counter for non-transition 1s has a current value (e.g., count) 1, where 1 is the number of non-transition 1s found within the data pattern. In some embodiments, the processing logic unit may store the calculated sums in a data structure such as a lookup table. In some embodiments, the sum of one or more non-transition 0s may be referred to herein as S(3,1). In some embodiments, the sum of one or more non-transition 1s may be referred to herein as S(3,2).
[0059] In some embodiments, as described herein, identifying one or more attributes of a data pattern may include identifying one or more singletons 0, one or more singletons 1, one or more transitions 0, one or more transitions 1, one or more non-transitions 0, and / or one or more non-transitions 1 within the data pattern. As described herein, the processing logic may calculate a sum of each identified combination of one or more of singletons 0, singletons 1, transitions 0, transitions 1, non-transitions 0, non-transitions 1, etc. In some embodiments, as described herein, the processing logic may store the calculated sums in a data structure such as a lookup table.
[0060] At operation 340, the processing logic unit calculates one or more values near the correlation peak. For example, the one or more values near the correlation peak may include the peak, the value before the peak, and the value after the peak. In some embodiments, the processing logic unit calculates the one or more values near the correlation peak using a correlation method. For example, the processing logic unit may use Figure 2 In some examples, the processing logic may use other correlation methods not specifically described herein or currently known to calculate one or more values near the correlation peak.
[0061] At operation 350, the processing logic unit determines a correlation threshold. In some embodiments, the processing logic unit may determine the correlation threshold using one or more attributes of the data pattern identified at operation 330 and one or more values of the correlation peak value calculated at operation 340. In some embodiments, determining the correlation threshold may include calculating an estimated correlation peak value using one or more attributes of the data pattern identified at operation 330 and one or more values of the correlation peak value calculated at operation 340. For example, in some embodiments, the processing logic unit estimates the correlation peak value using the following mathematical equation, such as:
[0062]
[0063] In the above mathematical equation, the value S(1,2) is the sum of the determined singleton 1s; the value S(1,1) is the sum of the determined singleton 0s; the value S(2,2) is the sum of the determined transition 1s; the value S(2,1) is the sum of the determined transition 0s; the value S(3,2) is the sum of the determined non-transition 1s; and the value S(3,1) is the sum of the determined non-transition 0s. In some embodiments, the processing logic unit assigns (e.g., multiplies) a weight value k (e.g., a fixed integer or non-integer value) to each determined sum of a particular data pattern, i.e., assigns a weight value k1 to the sum of the determined singleton patterns, assigns a weight value k2 to the sum of the determined transition patterns, and assigns a weight value k3 to the sum of the determined non-transition patterns. In some embodiments, there are other values not reflected in the above mathematical equations, which may reflect the sums of other determined data patterns not described herein. For example, there may be a weighting value k4 assigned to a bias value, a weighting value k5 assigned to another bias value, etc. The weighting values k may be calculated using calibration and / or by simulation during offline testing.
[0064] In some embodiments, in response to calculating the estimated correlation peak value using the above mathematical equation, the processing logic unit may calculate the peak magnitude value of the estimated correlation peak value using the following operation:
[0065] |CorrPeak|
[0066] In response to calculating the peak amplitude value of the estimated correlation peak, the processing logic unit may calculate a correlation threshold. Calculating the correlation threshold may be performed using the following mathematical equation, such as:
[0067] Thresh = K|CorrPeak|,
[0068] Where K is a constant (e.g., fixed) value. In some embodiments, K may be a value between 0 and 1. In some embodiments, K may be a value such as 0.75.
[0069] Figure 2-3 The methods described herein are not intended to limit certain combinations, permutations, or allocations of actions, i.e., whether a PD or CD actually performs a particular operation. Rather, they are intended to indicate some embodiments of the present disclosure, and those skilled in the art will recognize that some operations may be rearranged for a particular application, some operations need not always be performed, some operations may be omitted, etc.
[0070] It should be understood that the above description is intended to be illustrative rather than restrictive. After reading and understanding the above description, many other implementation examples will be apparent to those skilled in the art. Although the present disclosure describes specific examples, it will be appreciated that the systems and methods of the present disclosure are not limited to the examples described herein, but can be practiced with modifications within the scope of the appended claims. Therefore, the description and the drawings are considered to be illustrative rather than restrictive. Therefore, the scope of the present disclosure should be determined with reference to the appended claims and the full scope of equivalents to which these claims are entitled.
[0071] The methods, hardware, software, firmware or code embodiments described above may be implemented via instructions or code stored on a machine-accessible, machine-readable, computer-accessible or computer-readable medium, which may be executed by a processing element. "Memory" includes any mechanism that provides (i.e., stores and / or transmits) information in a form readable by a machine (such as a computer or electronic system). For example, "memory" includes random access memory (RAM), such as static RAM (SRAM) or dynamic RAM (DRAM); ROM; magnetic or optical storage media; flash memory devices; electrical storage devices; optical storage devices; acoustic storage devices; and any type of tangible machine-readable medium suitable for storing or transmitting electronic instructions or information in a form readable by a machine (e.g., a computer).
[0072] References throughout this specification to "one embodiment" or "an embodiment" mean that a particular feature, structure, or characteristic described in conjunction with that embodiment is included in at least one embodiment of the present disclosure. Thus, the phrases "in one embodiment" or "in an embodiment" appearing in various portions throughout this specification do not necessarily all refer to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
[0073] In the foregoing description, detailed descriptions have been given with reference to specific example embodiments. However, it will be apparent that various modifications and changes may be made thereto without departing from the broader spirit and scope of the present disclosure as set forth in the appended claims. Therefore, the description and drawings are to be considered in an illustrative rather than a restrictive sense. Furthermore, the foregoing use of embodiments and / or other example language does not necessarily refer to the same embodiment or the same example, but may refer to different and distinct embodiments, as well as potentially the same embodiments.
[0074] The words "example" or "exemplary" are used herein to mean used as an example, instance or illustration. Any aspect or design described herein as "example" or "exemplary" is not necessarily to be interpreted as being preferred or advantageous over other aspects or designs. On the contrary, the use of the words "example" or "exemplary" is intended to present the concept in a particular way. As used in this application, the term "or" is intended to represent an inclusive "or" rather than an exclusive "or". That is, unless otherwise specified or clear from the context, "X includes A or B" is intended to represent any natural inclusive arrangement. That is, if X includes A; X includes B; or X includes both A and B, then "X includes A or B" is satisfied in any of the foregoing cases. In addition, the articles "one" and "an" used in this application and the appended claims should generally be interpreted as meaning "one or more", unless otherwise specified or clearly pointed to the singular form from the context. In addition, the terms "embodiment" or "one embodiment" used throughout the text are not intended to represent the same embodiment unless so described. Furthermore, the terms “first,” “second,” “third,” “fourth,” etc. used herein refer to markings to distinguish between different elements and may not necessarily have ordinal meanings according to their numerical indices.
Claims
1. A system comprising: Wireless devices; as well as One or more antennas, the wireless device comprising: a receiver for receiving packets via the one or more antennas; a frame sync detection circuit coupled to the receiver, the frame sync detection circuit being operable to identify a data pattern within a portion of the packet; and a correlation circuit coupled to the frame sync detection circuit, the correlation circuit for identifying one or more attributes of the data pattern and calculating one or more values of a correlation peak using a correlation method; and An adaptive threshold circuit is coupled to the correlation circuit, the adaptive threshold circuit being operable to determine a correlation threshold using the one or more attributes of the data pattern and the one or more values of the correlation peak.
2. The system according to claim 1, wherein: To identify the data pattern, the frame sync detection circuit further identifies a predicted data pattern within the portion of the packet, the predicted data pattern indicating a start of a frame in the packet, wherein the predicted data pattern includes a plurality of bits.
3. The system according to claim 1, wherein: In order to identify the one or more attributes of the data pattern, the correlation circuit is further used to: identify one or more repeated symbols within the data pattern; calculate the sum of the one or more repeated symbols within the data pattern; and store the sum of the one or more repeated symbols in a lookup table.
4. The system according to claim 1, wherein: In order to identify one or more attributes of the data pattern, the correlation circuit is further used to: identify one or more non-repeating symbols within the data pattern; calculate the sum of the one or more non-repeating symbols within the data pattern; and store the sum of the one or more non-repeating symbols in a lookup table.
5. The system according to claim 1, wherein: To identify the one or more attributes of the data pattern, the correlation circuit is further configured to determine at least one of: a sum of one or more single-element 0 patterns within the data pattern; and a sum of one or more single-element 1 patterns within the data pattern.
6. The system according to claim 1, wherein: To identify the one or more attributes of the data pattern, the correlation circuit is further configured to: determine a sum of one or more transition 0 patterns; determine a sum of one or more transition 1 patterns; and determining at least one of: a sum of one or more single-element 0 patterns within the data pattern; and a sum of one or more single-element 1 patterns within the data pattern.
7. The system according to claim 1, wherein: To identify the one or more attributes of the data pattern, the correlation circuit is further configured to: determine a sum of one or more non-transition 0 patterns; determine a sum of one or more non-transition 1 patterns; and determining at least one of: a sum of one or more single-element 0 patterns within the data pattern; and a sum of one or more single-element 1 patterns within the data pattern.
8. A method of operating a wireless device, the method comprising: receiving a packet via a communication channel; identifying a data pattern within a portion of the packet; identifying one or more attributes of the data pattern; calculating one or more values of a correlation peak using a correlation method; as well as A correlation threshold is determined using the one or more attributes of the data pattern and the one or more values of the correlation peak.
9. The method according to claim 8, wherein: Identifying the data pattern includes identifying a predicted data pattern within the portion of the packet, the predicted data pattern indicating a start of a frame in the packet, wherein the predicted data pattern includes a plurality of bits.
10. The method according to claim 8, wherein: Identifying the one or more attributes of the data pattern comprises: identifying one or more repeating symbols within the data pattern; calculating a sum of the one or more repeated symbols within the data pattern; and The sum of the one or more repeated symbols is stored in a lookup table.
11. The method according to claim 8, wherein: Identifying the one or more attributes of the data pattern comprises: identifying one or more non-repeating symbols within the data pattern; calculating a sum of the one or more non-repeating symbols within the data pattern; and The sum of the one or more non-repeating symbols is stored in a lookup table.
12. The method according to claim 8, wherein: Identifying the one or more attributes of the data pattern comprises: At least one of: a sum of one or more single-element 0 patterns within the data pattern; and a sum of one or more single-element 1 patterns within the data pattern is determined.
13. The method according to claim 8, wherein: Identifying the one or more attributes of the data pattern comprises: determining a sum of one or more transition 0 patterns; determining a sum of one or more transition 1 patterns; and At least one of: a sum of one or more single-element 0 patterns within the data pattern; and a sum of one or more single-element 1 patterns within the data pattern is determined.
14. The method according to claim 8, wherein: Identifying the one or more attributes of the data pattern comprises: determining a sum of one or more non-transition 0 patterns; determining a sum of one or more non-transition 1 modes; and At least one of: a sum of one or more single-element 0 patterns within the data pattern; and a sum of one or more single-element 1 patterns within the data pattern is determined.
15. A wireless device comprising: a receiver configured to receive packets via a communication channel; a frame sync detection circuit coupled to the receiver, the frame sync detection circuit being operable to identify a data pattern within a portion of the packet; a correlation circuit coupled to the frame sync detection circuit, the correlation circuit for identifying one or more attributes of the data pattern and calculating one or more values of a correlation peak using a correlation method; as well as An adaptive threshold circuit is coupled to the correlation circuit, the adaptive threshold circuit being operable to determine a correlation threshold using the one or more attributes of the data pattern and the one or more values of the correlation peak.
16. The wireless device of claim 15, wherein: To identify the data pattern, the frame synchronization detection circuit further identifies a predicted data pattern within the portion of the packet, the predicted data pattern indicating the start of a frame in the packet, Wherein, the predicted data pattern includes multiple bits.
17. The wireless device of claim 15, wherein: In order to identify one or more attributes of the data pattern, the correlation circuit is further used to: identify one or more repeated symbols within the data pattern; calculate the sum of the one or more repeated symbols within the data pattern; and store the sum of the one or more repeated symbols in a lookup table.
18. The wireless device of claim 15, wherein: In order to identify the one or more attributes of the data pattern, the correlation circuit is further used to: identify one or more non-repeating symbols within the data pattern; calculate the sum of the one or more non-repeating symbols within the data pattern; and store the sum of the one or more non-repeating symbols in a lookup table.
19. The wireless device of claim 15, wherein: To identify the one or more attributes of the data pattern, the correlation circuit is further configured to determine at least one of: a sum of one or more single-element 0 patterns within the data pattern; and a sum of one or more single-element 1 patterns within the data pattern.
20. The wireless device of claim 15, wherein: To identify the one or more attributes of the data pattern, the correlation circuit is further configured to: determine a sum of one or more transition 0 patterns; determine a sum of one or more transition 1 patterns; and determining at least one of: a sum of one or more single-element 0 patterns within the data pattern; and a sum of one or more single-element 1 patterns within the data pattern.
