Methods, computer programs, and wireless communication devices

Abstract

This disclosure relates to a method and computer program for a wireless communication device, and further relates to a wireless communication device. The method includes: determining a pseudo-random value. The pseudo-random value is determined using a non-recursive function having at least one non-linear component. The method includes: selecting wireless resources based on the pseudo-random value. The method includes: using the wireless resources to perform wireless communication with another wireless communication device.

Description

Technical Field

[0001] This disclosure relates to a method and computer program for a wireless communication device, and this disclosure relates to a wireless communication device. Background Technology

[0002] Wireless communication is a field of research and development. In various wireless communication systems, a shared communication channel is used by a large number of different wireless communication devices. In some cases, the base station does not schedule the communication channel, but the wireless communication devices can use it in a program-determined manner. Pseudo-random access methods are often used to avoid continuous interference between radio transmissions from multiple wireless communication devices on such a shared wireless channel. For example, random channel selection (or random time slot selection) can be used to avoid infinitely frequent collisions (i.e., destructive superposition) between the wireless transmissions of two non-communication-connecting wireless communication devices. A well-known pseudo-random channel access method is the "ALOHA" method. Another well-known method is the "adaptive frequency hopping" method used in the Bluetooth standard.

[0003] In practice, when implementing a true random access procedure, the receiver can anticipate and read all available access channels from the transmitter, which consumes a significant amount of energy. If this cannot be guaranteed, packet loss may occur even without collisions.

[0004] For practical implementations of pseudo-random access procedures, the receiver can follow a true random access procedure. An alternative approach is to publicly disclose the calculation rules and parameters of the pseudo-random number generator used by the transmitter. In this case, the transmitter's channel access can be calculated, allowing the receiver to listen only on the frequency or time resources specified by the calculation rules. Using the "ALOHA" method, the receiver gains advantages in terms of energy consumption. Bluetooth "adaptive frequency hopping" significantly simplifies the receiver's structure.

[0005] In practice, easily implemented random number generators (such as "linear congruential generators") often exhibit statistically undesirable properties for the aforementioned applications. Higher-quality random number generators (such as the Mersennetwisters algorithm) often require more implementation effort and memory, and may require even more effort if synchronization is lost between the two wireless communication devices. Summary of the Invention

[0006] An improved design for determining pseudo-random values ​​for channel access can be expected to overcome the above-mentioned shortcomings.

[0007] The desired outcome is achieved by a method for a wireless communication device according to the present disclosure, a computer program product according to the present disclosure, a wireless communication device according to the present disclosure, and a system according to the present disclosure.

[0008] At least some embodiments of this disclosure are based on the finding that a particularly disadvantageous characteristic for determining pseudo-random values ​​for channel access is the recursiveness of the computational rules used by the Mattsett rotation algorithm. This can become significant if synchronization between the transmitter and receiver is temporarily lost. If synchronization is lost, the receiver can revert to a method that scans all channels feasible for the transmitter (as with true random access methods, which requires a higher workload as described above). After the receiver receives a data packet from the transmitter, one of the following options can be implemented:

[0009] After successfully re-establishing communication with the transmitter, the receiver can execute recursive rules for each individual channel access in the past to restore the synchronization state of the pseudo-random generator between the transmitter and receiver. This can result in a considerable computational workload for the receiver.

[0010] Alternatively, during each channel access, the transmitter can completely transmit the internal state information of the pseudo-random number generator leading to the corresponding channel access. Upon receiving the state information, the receiver can replace the pseudo-random number generator's local state information with the state information provided by the transmitter. The disadvantage is increased communication workload. For the aforementioned pseudo-random number generator, the "Mattset Rotation Algorithm," approximately 2500 bytes of internal state information may be required to resynchronize 32-bit wide pseudo-random numbers. In many cases, transmitting such a long amount of state information contradicts the application objective and may be impractical in certain situations. For example, the Bluetooth standard mentioned above limits transmission to a maximum of 265 bytes per channel access, so this method may not be suitable.

[0011] Therefore, the various embodiments can provide an improved design for determining pseudo-random values ​​suitable for channel access.

[0012] Embodiments of this disclosure provide a method for a wireless communication device. The method includes: determining a pseudo-random value. The pseudo-random value is determined using a non-recursive function having at least one non-linear component. The method includes: selecting wireless resources based on the pseudo-random value. The method includes: using the wireless resources to wirelessly communicate with another wireless communication device. By using a function having at least one non-linear component to determine the pseudo-random value, statistically undesirable characteristics of congruence generators can be avoided. By using a non-recursive function, the workload for recovering lost synchronization can be reduced.

[0013] For example, a seed value and an index value can be used to determine a pseudo-random value. The seed value can be known between the wireless communication device and the other wireless communication device. The index value can change for each wireless transmission between the two wireless communication devices. For example, the seed value can be exchanged between the two wireless communication devices and can be valid throughout the communication session. The index value can be a value that changes for each transmission. The two wireless communication devices can determine the index value using calculation rules, such as based on the number of data packets transmitted between the two wireless communication devices. For example, if synchronization is lost between the two wireless communication devices, multiple different feasible index values ​​can be used to determine multiple wireless resources that can be used for wireless transmissions of the corresponding other wireless communication device in order to synchronize the state of the pseudo-random number / pseudo-random value generator.

[0014] In some embodiments, the formula used to determine the pseudo-random value, in addition to the seed value and the index value, is based on a constant value. In this case, synchronizing the index value at the two wireless communication devices is sufficient.

[0015] For example, the method may include receiving information about a seed value and / or an index value from the other wireless communication device. Alternatively or additionally, the method may include sending information about the seed value and / or the index value to the other wireless communication device. Once the index value is synchronized between the two wireless communication devices, the two wireless communication devices can determine the wireless resources being used by the corresponding other wireless communication device.

[0016] In some embodiments, pseudo-random values ​​are determined based on a nonlinear transformation of a combination of seed and index values. For example, the nonlinear transformation may include exponentiation (e.g., raising the combination of seed and index values ​​to a power). The resulting pseudo-random values ​​can avoid the statistically undesirable characteristics of a basic congruence generator.

[0017] The upper limit of the combination of the seed value and the index value can be based on the bit width of the wireless communication device's architecture. For example, the upper limit of the combination of the seed value and the index value can be limited by modulo operation. The resulting range can be the range supported by the architecture of the wireless communication device. For example, if the wireless communication device has a 32-bit architecture, the combination of the seed value and the index value can be limited to a 32-bit integer, for example, by performing the modulo operation "mod 2". 32 "to limit. If the combination of seed value and index value is now enhanced, for example ((seed+index)mod2 32 ) 2 The result is suitable for 64-bit integers (twice the bit width of the architecture), which is usually the largest integer value supported by the architecture.

[0018] For example, one of the following formulas can be used to calculate pseudo-random values:

[0019] (index+seed) k mod n

[0020] or

[0021] ((index+seed)mod m) k mod n

[0022] Where index is the index value, seed is the seed value, and k, m, and n are natural numbers. These formulas represent non-recursive functions with at least one non-linear component. For example, the above formulas could be congruence generators with at least one non-linear component (i.e., enhancement).

[0023] In some embodiments, m = 2 width_bits And n is a prime number less than m. width_bits can be the bit width of the wireless communication device's architecture. This provides an upper bound for a combination of seed and index values ​​that matches the architecture of the wireless communication device.

[0024] The formulas above are provided below for both 16-bit and 32-bit architectures. For example, pseudo-random values ​​can be calculated using the following formula:

[0025] ((index+seed)mod 65536) 2 mod 65521

[0026] or

[0027] ((index+seed)mod 4294967296) 2 mod 4294967291.

[0028] 16-bit or 32-bit architectures are common in wireless communication devices.

[0029] In some embodiments, modulo operations are used to limit pseudo-random values ​​to a range of values. The modulo operation can be implemented using prime numbers. These prime numbers can be based on the bit width of the wireless communication device's architecture. Modulo operations can be used to provide an upper limit to the range of pseudo-random values. Prime-based modulo operations may result in long periodicity of the obtained pseudo-random values. By using prime numbers based on the bit width of the wireless communication device's architecture, the upper limit of the range can be matched to the architecture of the wireless communication device.

[0030] Generally, the selected wireless resource can be used by one wireless communication device to transmit wireless transmissions and by another wireless communication device to receive wireless transmissions. Therefore, the selected wireless resource can be used to monitor the wireless transmissions of the other wireless communication device. Alternatively, the selected wireless resource can be used to transmit wireless transmissions to the other wireless communication device.

[0031] For example, the wireless resources can be frequency resources, time resources, or frequency-time resources. Listening for wireless resources on multiple frequency bands and / or in multiple time slots can increase power consumption at the receiving wireless communication device, which can be avoided if both wireless communication devices use the (same) pseudo-random value to select wireless resources.

[0032] Embodiments of this disclosure also provide a computer program having program code for implementing the method when the computer program is executed on a computer, processor, or programmable hardware component.

[0033] Embodiments of this disclosure also provide a wireless communication device, comprising: a transceiver module for communicating with another wireless communication device; and a processing module. The processing module is configured to determine a pseudo-random value. The pseudo-random value is determined using a non-recursive function having at least one non-linear component. The processing module is configured to select wireless resources based on the pseudo-random value. The processing module is configured to use the wireless resources to perform wireless communication with the other wireless communication device.

[0034] Embodiments of this disclosure also provide a system comprising a wireless communication device and another wired communication device. A processing module of the wireless communication device is configured to listen to wireless transmissions of the other wireless communication device using selected wireless resources. A processing module of the other wireless communication device is configured to send wireless transmissions to the wireless communication device using selected wireless resources. Attached Figure Description

[0035] The following are some examples of devices and / or methods described by way of example and with reference to the accompanying drawings, in which:

[0036] Figure 1a and Figure 1b A flowchart illustrating an embodiment of a method for a wireless communication device;

[0037] Figure 1c A block diagram illustrating an embodiment of a wireless communication device; and

[0038] Figure 2A schematic diagram of a system including two wireless communication devices is shown. Detailed Implementation

[0039] Several examples will now be described more fully with reference to the accompanying drawings, some of which are shown in the drawings. In the drawings, the thickness of lines, layers, and / or regions may be exaggerated for clarity.

[0040] Therefore, while other examples can have various modifications and alternatives, some specific examples are shown in the accompanying drawings and will be described in detail thereafter. However, this detailed description does not limit the other examples to the specific forms described. The other examples may cover all modifications, equivalents, and alternatives falling within the scope of this disclosure. Identical or similar figures throughout the description of the drawings refer to similar or related elements that, when compared with each other, can be implemented identically or in modified form while providing the same or similar function.

[0041] Unless otherwise defined, all terms (including technical and scientific terms) are used here in the usual sense of the field to which the examples belong.

[0042] Figure 1a and Figure 1b A flowchart illustrating an embodiment of a method for a wireless communication device is shown. The method includes: determining 120 pseudo-random values. The pseudo-random values ​​are determined using a non-recursive function having at least one non-linear component. The method includes: selecting 130 wireless resources based on the pseudo-random values. The method includes: using 140 of the wireless resources to wirelessly communicate with another wireless communication device. For example, the method can be performed by the wireless communication device.

[0043] Figure 1c A block diagram illustrating an embodiment of a corresponding wireless communication device 10 is shown. The wireless communication device includes a transceiver module 12 for communicating with another wireless communication device. The wireless communication device includes a processing module 14 coupled to the transceiver module 12. Typically, the processing module 14 may be configured to perform... Figure 1a and / or Figure 1b The method is as follows. For example, processing module 14 is configured to determine a pseudo-random value. The pseudo-random value is determined using a non-recursive function having at least one non-linear component. Processing module 14 is configured to select wireless resources based on the pseudo-random value. Processing module 14 is configured to use the wireless resources to perform wireless communication with another wireless communication device. Figure 1c Devices including wireless communication device 10, such as vehicles or mobile devices, are also shown.

[0044] The following description involves Figure 1a and / or Figure 1bMethods and Figure 1c Wireless communication devices.

[0045] Embodiments of this disclosure relate to a method and computer program for a wireless communication device, and to a corresponding wireless communication device. The wireless communication device may be a wireless communication device that implements (or is configured to implement) wireless communication with another wireless communication device. For wireless communication, the two wireless communication devices use a channel shared by at least two wireless communication devices (e.g., the wireless communication device, the other wireless communication device, and / or other wireless communication devices). In other words, the wireless communication device and the other wireless communication device can communicate via a shared wireless channel. In embodiments, the shared channel may not be controlled by a base station; that is, the wireless resources may not be scheduled by the base station. Instead, the wireless communication devices can decide for themselves which wireless resources they use on the shared wireless channel. This can lead to collisions on the shared wireless channel—if two wireless transmissions are simultaneously implemented on the same frequency band on the shared wireless channel, these two wireless transmissions may (destructively) overlap, making it difficult or impossible to decode either of the two wireless transmissions. In the context of this disclosure, the wireless resources (selected based on pseudo-random values) may be frequency resources, time resources, or frequency-time resources.

[0046] Once two wireless communication devices detect a collision in their wireless transmissions, they can attempt to retransmit the transmission. To avoid further collisions, wireless communication devices typically rely on pseudo-random values ​​(such as the pseudo-random value mentioned above) to randomly select another wireless resource. It is assumed that another wireless communication device that has already transmitted another colliding data packet will use a different pseudo-random value, which can lead to the selection of a different wireless resource. This approach exists in many different methods, such as the previously described "ALOHA" method or Bluetooth's adaptive frequency hopping.

[0047] Embodiments of this disclosure relate to the generation of pseudo-random values, which are used by a wireless communication device to select sufficiently random wireless resources for communication. Generally, the selected wireless resources can be used by a transmitting wireless communication device to send wireless transmissions. Furthermore, the selected wireless resources can also be used by a receiving wireless communication device, for example, to predict the time, frequency, or frequency-time resources for transmission by the transmitting wireless communication device. Such information can be valuable in achieving energy efficiency for the receiving wireless communication device, because the wireless communication device can listen for wireless transmissions only on the "correct" time, frequency, or frequency-time resources, rather than listening on all times or multiple frequency resources.

[0048] Generally, this can be accomplished by sharing details of the function used to compute pseudorandom values ​​between two communicating wireless communication devices. In congruence generators, this typically requires knowledge of previous pseudorandom values, information about the increment, information about the factors, and information about the modulo operations used to constrain the pseudorandom values. This information, which can represent the "state" of the pseudorandom number generator, usually requires several bytes in the case of congruence generators, and this information can be easily shared between wireless communication devices. Unfortunately, congruence generators may exhibit undesirable statistical properties, which can lead to a greater number of collisions between the same two wireless communication devices. Other more complex pseudorandom generators (such as the Mattset rotation algorithm) may require much larger "states," which may not be easily shared between wireless communication devices. If the parameters are known, these states can be reconstructed, which alleviates the need to transfer states between wireless communication devices, but the computation usually relies on recursion, so the reconstruction of states requires (relatively) significant computational resources.

[0049] These characteristics of the corresponding approach come into play when synchronization is lost between two wireless communication devices, for example, when multiple transmissions from one wireless communication device cannot be successfully received by the other, and the other device therefore does not know which wireless resource will be used for the next transmission. In this case, the wireless communication device can revert to a mode in which it continuously scans all (suitable) frequency resources to find a consistent transmission from the other wireless communication device. Once the wireless communication device has received another transmission from the other wireless communication device, the state of the pseudo-random number generator can be reconstructed if: the wireless transmission contains sufficient information for reconstructing the state (preferably without having to perform recursive computation, which could overwhelm the wireless communication device); or the function for calculating the pseudo-random value is simple enough that the wireless communication device can calculate multiple possible states and corresponding wireless resources, and the wireless communication device can select the state of the resource used by the other wireless communication device. Therefore, embodiments of this disclosure aim to provide a design for selecting wireless resources based on pseudo-random values, which enables or facilitates the resynchronization of the state of a pseudo-random number generator between two wireless communication devices in the event of synchronization loss. Various embodiments may provide a deterministic pseudo-random number generator with explicit, non-recursive computation rules (i.e., functions) for selecting channel access (i.e., radio resources) in a multi-channel wireless communication system.

[0050] Generally, the wireless communication device and / or the other wireless communication device can be wireless communication devices used by other devices (e.g., communication chipsets used by mobile devices, vehicle keys, or vehicles) for communication via wireless communication protocols, such as ultra-wideband (UWB) communication protocols, such as IEEE 802.15.4z (the communication protocol specified by the Institute of Electrical and Electronics Engineers). Therefore, the first and second wireless communication devices can communicate using ultra-wideband communication. For example, the first and second wireless communication devices can be UWB chipsets, such as part of a wireless communication chipset, such as a combined WiFi / UWB chipset. Generally, wireless communication devices can be used by any device, such as mobile devices, fixed devices, beacons, telecommunications equipment, etc. More specifically, embodiments can be used in the automotive field, for example for communication between a vehicle key and a vehicle. Therefore, one of the wireless communication devices and the other wireless communication device can be the wireless communication device of a vehicle key. The other of the wireless communication devices and the other wireless communication device can be the wireless communication device of a vehicle. Embodiments also provide a vehicle including the wireless communication device. Embodiments also provide a vehicle key including the wireless communication device. In some embodiments, the vehicle key can be a (single-purpose) handheld transmitter. Alternatively, the vehicle key can be implemented using a mobile device, such as a smartphone or wearable device.

[0051] The method includes determining (i.e., calculating or computer-computed) 120 pseudo-random values. Generally, the pseudo-random values ​​can be pseudo-random numbers. Therefore, the method, computer program, and wireless communication device can implement a pseudo-random value / pseudo-random number generator. Generally, a pseudo-random value is a value that "appears" random, but is calculated using a function. In the context of this disclosure, a pseudo-random value can be a natural number, such as an integer greater than or equal to zero. Alternatively, the pseudo-random value can be an (arbitrary) bit vector. Generally, the pseudo-random value can be limited by the number of bits used to represent it. For example, if the pseudo-random value is represented by (at most) width_bits bits, then at most 2... width_bits There are at most 2^n different pseudo-random values ​​(in a binary system), therefore the (unsigned) integer value of the pseudo-random value can be at most 2^n. width_bits -1.

[0052] In an embodiment, the pseudo-random value is determined using a non-recursive function with at least one non-linear component. For example, the non-linear element can be inserted into the structure of a linear congruent generator in the pseudo-random number generator. Generally, a function can be considered non-recursive if calculating the nth (pseudo-random) value does not require calculating the (n-1)th (pseudo-random) value; that is, if calculating the nth (pseudo-random) value does not require calculating (all) pseudo-random values ​​1...(n-1). For example, a function can be considered non-recursive if the formula used to determine the pseudo-random value, apart from the seed value and the index value, is based on constant values. For example, a pseudo-random value of 120 can be determined using a seed value and an index value.

[0053] In the computation, the seed (i.e., a random seed) value is a number used to initialize the pseudo-random number generator. The seed determines the operation of the pseudo-random number generator—if the pseudo-random number generator is initialized twice with the same seed, it will produce the same sequence of numbers (e.g., thus, the receiving wireless communication device can determine the pseudo-random value generated by the transmitting wireless communication device). The seed value can be known between the wireless communication device and the other wireless communication device. For example, the seed value can be a natural number that can be used as the initialization value for the pseudo-random value generator. The seed value can be statically defined between the transmitter and receiver, for example, between the two wireless communication devices. For example, the seed value can be exchanged (or determined independently) between the wireless communication device and the other wireless communication device, for example, when a communication session is established between the two wireless communication devices. Therefore, the method can include: receiving 110 information about the seed value from the other wireless communication device. Alternatively, the method can include: sending 115 information about the seed value to the other wireless communication device. In some embodiments, the method may include generating a seed value, for example, based on another pseudo-random number generator or obtained from an encrypted secret shared between the wireless communication device and the other wireless communication device.

[0054] While the seed value can remain static between wireless transmissions, the index value can change with each wireless transmission between the wireless communication device and the other wireless communication device. For example, the index value can be a counter describing the dynamic state of a pseudo-random value generator. For example, the index value can be a component of a function that changes to generate different pseudo-random values. In some embodiments, the index value is simply incremented (by 1). In this case, the index value represents the current position in the sequence of pseudo-random values ​​generated by the function. In embodiments, the index value can be associated with the number of wireless transmissions (i.e., data packets sent) between the wireless communication device and the other wireless communication device. For example, the index value n can be used for the nth wireless transmission from the other wireless communication device to the other wireless communication device. Therefore, in the event of a loss of synchronization between the wireless communication devices, the number of the wireless transmission (e.g., the data packet number) can be used to recover the index value. More generally, the method can include: receiving information about the index value (e.g., as a wireless transmission number / data packet number) from the other wireless communication device 110, or sending information about the index value (e.g., as a wireless transmission number / data packet number) to the other wireless communication device 115. Hereinafter, the index value can be assumed to be a natural number.

[0055] In at least some embodiments, the 120 pseudo-random values ​​are determined based on a nonlinear transformation of a combination of seed and index values. For example, the combination of seed and index values ​​may include the sum of the seed and index values. Other mathematical operations are also possible. The combination may be limited in size, for example, to avoid overflow of the variable type (e.g., unsigned integer) used to represent the combination of seed and index values. In other words, the upper limit of the combination of seed and index values ​​may be based on the bit width of the architecture of the wireless communication device. To this end, the seed and index values ​​may be chosen to be sufficiently small, or other operations may be employed to prevent the combination from exceeding the upper limit. For example, a modulo operation may be performed on the combination of seed and index values. For example, the combination of seed and index values ​​may be defined as (seed + index) mod m, where seed is the seed value, index is the index value, and m = 2. width_bits Where width_bits is the bit width of the wireless communication device architecture (the bit width may be known between the wireless communication device and the other wireless communication device), and the operation mod m is used to limit the combination to at most 2. width_bits-1. Furthermore, a nonlinear transformation can be applied to the combination of the seed value and the index value. For example, the nonlinear transformation may include exponentiation (e.g., exponentiation of the combination of the index value and the seed value). For instance, the combination of the index value and the seed value can be raised to the power of k, where k is a positive integer, such as a positive integer greater than 1 (e.g., 2, 3, 4, 5, 8, 10, etc.). The enhancement of the combination of the index value and the seed value can produce nonlinear components of the function.

[0056] Therefore, one of the following formulas can be used to calculate the 120 pseudo-random value:

[0057] (index+seed) k mod n

[0058] or

[0059] ((index+seed)mod m) k mod n

[0060] Where `index` is the index value, `seed` is the seed value, and `k`, `m`, and `n` are natural numbers. Furthermore, apart from the seed value and the index value, the formula used to determine the pseudo-random value can be based on constant values. In this case, `m`, `k`, and `n` can be constants or natural numbers.

[0061] For example, the operand n can be used to restrict pseudo-random values ​​to a range of values. In other words, modulo operation (with operand n) can be used to restrict pseudo-random values ​​to a range of values. Generally, to obtain high periodicity of pseudo-random values / pseudo-random number generators, n can be a prime number. In other words, prime numbers can be used to implement modulo operation. Furthermore, to cover the entire range allowed by the type of data structure used to store pseudo-random values ​​(e.g., integer), n can be chosen to be close to the maximum value allowed by the type of data structure used to store pseudo-random values. For example, the prime number can be based on the bit width of the architecture of the wireless communication device. For example, the prime number can be the largest (or second largest, third largest, etc.) prime number that can be represented by the type of data structure used by the architecture of the wireless communication device. In other words, n can be less than 2. width_bits The prime number. Here, width_bits is the bit width of the wireless communication device architecture. Therefore, m can be 2^n. width_bits For example, if the wireless communication device uses a 16-bit architecture, or if the pseudo-random value is stored as a 16-bit (unsigned) integer, then n can be 65521. If the wireless communication device uses a 32-bit architecture, or if the pseudo-random value is stored as a 32-bit (unsigned) integer, then n can be 4294967291.

[0062] For example, the function can be calculated using the following rules:

[0063] S(index,seed,width_bits,prime)=((index+seed)mod 2 width_bits ) k mod prime

[0064] The output value of the pseudo-random number generator, i.e., the pseudo-random value, can be set to the state S(index, seed, width_bits, prime). width_bits can be the number of bits required for the binary representation of prime, which can be statically defined between the transmitter and receiver. prime can be a prime number, for example, less than 2. width_bits The largest prime number. S can be the output value of a random number generator, i.e., a pseudo-random value, and S can be limited to the range [0, (prime-1)]. k can be a natural number greater than 0.

[0065] Therefore, if width_bits is 16 (e.g., in a 16-bit architecture, or when pseudo-random values ​​are stored in 16-bit unsigned integers), then ((index+seed)mod 65536) can be used. 2 The pseudo-random value is calculated using mod 65521. This formula can be used to design pseudo-random-based channel access on 16-bit architectures (the representable multiplication result is 32 bits).

[0066] If width_bits is 32 (e.g., in a 32-bit architecture, or when pseudo-random values ​​are stored in 32-bit unsigned integers), then you can use ((index+seed)mod 4294967296). 2 mod 4294967291. Calculates pseudo-random values. This formula can be used to design pseudo-random-based channel access on 32-bit architectures (representable multiplication result = 64 bits).

[0067] The method includes selecting 130 wireless resources based on the pseudo-random value. Generally, the wireless resources can be selected from a plurality of wireless resources, for example, a plurality of wireless resources suitable for the task at hand. For example, a plurality of wireless resources can be enumerated, and the pseudo-random value can be used to select one of the plurality of wireless resources based on the enumeration of the plurality of wireless resources. For example, the number of the plurality of wireless resources can be N. slotsThe range of pseudorandom values ​​can be converted to the range of the plurality of radio resources. In some embodiments, this can be done by selecting a prime number so small that it falls within the enumeration of the plurality of radio resources. Alternatively, the output of the function, such as the pseudorandom value, can be scaled to the range of the enumeration. For design purposes, scaling and translating the range of the pseudorandom number generator's output values ​​to the number of radio resources (e.g., channels) available in the radio system can be implemented using the following formula:

[0068]

[0069] in, is a scaled pseudo-random value, and S is a pseudo-random value. The above values ​​can be integerized, for example, by using one of the following formulas:

[0070]

[0071] or

[0072]

[0073] The method includes: using the wireless resources described in 140 to wirelessly communicate with another wireless communication device. For example, the selected wireless resources in 140 can be used to listen to (i.e., scan) the wireless transmissions of the other wireless communication device in 142. For example, if the selected wireless resources are used to listen to wireless transmissions, the wireless communication device may not need to listen on other wireless resources among the plurality of wireless resources; that is, the wireless communication device may avoid listening to wireless transmissions on other wireless resources among the plurality of wireless resources. Alternatively (or additionally), the selected wireless resources can be used to send a wireless transmission in 144 to the other wireless communication device.

[0074] Compared to the Mattsett rotation algorithm random number generator, the dynamic part of the state information index can be represented using only width_bits. This facilitates channel access implementation, where the state information for resynchronization is distributed simultaneously with the transmitter's channel access. Specifically, the index value can be used as a counter for the channel access operation of the transmitting wireless communication device. Compared to the Mattsett rotation algorithm, non-recursively calculating the value S from the state information index results in lower computational workload when the pseudo-random number generator is in a regenerator state. If the index is used as a packet counter, the complexity of receiver resynchronization is therefore independent of the number of packets transmitted by the transmitter during temporary connection termination.

[0075] Compared to linear congruent generators, the proposed random number generator produces a better statistical distribution of the initial values. In particular, the output values ​​of the proposed random number generator exhibit better correlation characteristics with respect to two successive input values ​​(index, index+1). Therefore, wireless communication systems using such pseudo-random values ​​can be expected to reduce the number of successive packet collisions.

[0076] The transceiver module 12 can be implemented as a device for transmitting and receiving (i.e., receiving and / or transmitting, etc.), one or more transceiver units, one or more transceiver devices, and the transceiver module may include typical receiver and / or transmitter components, such as one or more elements from the group consisting of: one or more low-noise amplifiers (LNAs), one or more power amplifiers (PAs), one or more filters or filter circuits, one or more diplexers, one or more duplexers, one or more analog-to-digital converters (A / D), one or more digital-to-analog converters (D / A), one or more modulators or demodulators, one or more mixers, one or more antennas, etc. For example, the transceiver module may be configured for communication via ultra-wideband communication.

[0077] In this embodiment, the processing module 14 can be implemented as one or more processing units, one or more processing devices, any device for processing, such as a processor, a computer, or a programmable hardware component that can run with correspondingly adapted software. In other words, the functions described for the processing module 14 can also be implemented in software, which then executes on one or more programmable hardware components. Such hardware components may include general-purpose processors, digital signal processors (DSPs), microcontrollers, etc.

[0078] Figure 2 A schematic diagram of a system including two wireless communication devices is shown. The system includes wireless communication device 210 and another wireless communication device 220. These two wireless devices can communicate with... Figures 1a to 1c The wireless communication device 10 is implemented similarly. The processing module of the wireless communication device 210 is configured to use selected wireless resources to listen to the wireless transmissions of the other wireless communication device 220. The processing module of the other wireless communication device 220 is configured to use selected wireless resources to send wireless transmissions to the wireless communication device 210.

[0079] At reference numeral 230, wireless communication devices 210 and 220 may optionally exchange seed values, for example, by sending information about the seed value from wireless communication device 210 to another wireless communication device 220, or by sending information about the seed value from wireless communication device 220 to another wireless communication device 210. Alternatively, the seed value may be known from previous communications or may be derived from a shared encrypted secret.

[0080] Additionally, the index value can be synchronized between the two wireless communication devices by starting together from 0, by using a packet / wireless transmission counter, or by sending information about the index value from wireless communication device 210 to another wireless communication device 220 (or vice versa).

[0081] At reference numeral 240, the two wireless communication devices can determine a pseudo-random value, which can be the same for both devices. At reference numeral 250, the two wireless communication devices can select a wireless resource, such as the same wireless resource. At reference numeral 260, the wireless communication device 210 can use the selected wireless resource to listen for wireless resources from the other wireless communication device. The other wireless communication device 220 can use the wireless resource that the wireless communication device 210 used to listen for wireless transmissions to send its own wireless resource.

[0082] The aspects and features mentioned and described together with one or more of the examples and figures detailed above may also be combined with one or more of the other examples in order to replace similar features in other examples, or to introduce features into other examples.

[0083] The examples may further be or relate to a computer program having program code for implementing one or more of the methods described above when the computer program is executed on a computer or processor. The steps, operations, or processes of the various methods described above can be performed by a programmed computer or processor. The examples may also cover a program storage device, such as a digital data storage medium, which is machine-, processor-, or computer-readable and encoded with a program of machine-executable, processor-executable, or computer-executable instructions. These instructions execute or cause some or all of the actions of the methods described above to be performed. The program storage device may include or may be, for example, a digital memory, a magnetic storage medium (e.g., disks and magnetic tapes), a hard disk drive, or an optically readable digital data storage medium. Further examples may also cover a computer, processor, or control unit programmed to perform the actions of the methods described above, or a field-programmable logic array ((F)PLA) or field-programmable gate array ((F)PGA) programmed to perform the actions of the methods described above.

Claims

1. A method for a wireless communication device, the method comprising: A pseudo-random value (120) is determined using a non-recursive function having at least one non-linear component, wherein the pseudo-random value (120) is determined based on a non-linear transformation of a combination of a seed value and an index value, the seed value being known between the wireless communication device and another wireless communication device, and the index value changing for each wireless transmission between the wireless communication device and the other wireless communication device; (130) radio resources are selected based on the pseudo-random value; and Use the wireless resources described in (140) to communicate wirelessly with the other wireless communication device.

2. The method according to claim 1, wherein, Apart from the seed value and the index value, the formula used to determine the pseudo-random value is based on constant values.

3. The method according to claim 1 or 2, wherein, The method includes: receiving information about a seed value and / or information about an index value from the other wireless communication device. Alternatively, the method may include sending information about the seed value and / or information about the index value to the other wireless communication device.

4. The method according to claim 1 or 2, wherein, The nonlinear transformation includes exponentiation.

5. The method according to claim 1 or 2, wherein, The upper limit of the combination of the seed value and the index value is based on the bit width of the wireless communication device architecture.

6. The method according to claim 1 or 2, wherein, Use one of the following formulas to calculate the pseudo-random value: (index+seed) k mod n or ((index+seed)mod m) k mod n Where index is the index value, seed is the seed value, and k, m, and n are natural numbers.

7. The method according to claim 6, wherein, m=2 width_bits Furthermore, n is a prime number less than m, and width_bits is the bit width of the wireless communication device architecture.

8. The method according to claim 6, wherein, Use the following formula to calculate pseudo-random values: ((index+seed)mod65536 ) 2mod65521 or ((index+seed)mod4294967296 ) 2mod4294967291。 9. The method according to claim 1 or 2, wherein, Modular operations are used to limit pseudo-random values ​​to a range of values, and the modulo operation is performed using prime numbers based on the bit width of the wireless communication device architecture.

10. The method according to claim 1 or 2, wherein, Use the selected wireless resources (140) to listen to (142) the wireless transmission of the other wireless communication device, or use the selected wireless resources to send (144) the wireless transmission to the other wireless communication device; And / or the wireless resources are frequency resources, time resources, or frequency-time resources.

11. A computer program product having program code for implementing the method according to any one of claims 1 to 10 when the computer program product is executed on a computer, processor or programmable hardware component.

12. A wireless communication device, the wireless communication device comprising: A transceiver module (12) for communicating with another wireless communication device; and Processing module (14), the processing module is configured to: A pseudo-random value is determined using a non-recursive function having at least one non-linear component, wherein the pseudo-random value is determined based on a non-linear transformation of a combination of a seed value and an index value, the seed value being known between the wireless communication device and the other wireless communication device, and the index value changing for each wireless transmission between the wireless communication device and the other wireless communication device; Wireless resources are selected based on the pseudo-random value; and Use the wireless resources to communicate wirelessly with the other wireless communication device.

13. A communication system (200), the communication system comprising a wireless communication device (210) according to claim 12 and another wireless communication device (220) according to claim 12, wherein, The processing module (14) of the wireless communication device (210) is configured to use selected wireless resources to listen to the wireless transmission of the other wireless communication device (220), and the processing module (14) of the other wireless communication device (220) is configured to use selected wireless resources to send wireless transmissions to the wireless communication device (210).

Images