Generation of channel access patterns for mutually uncoordinated networks
11700032 · 2023-07-11
Assignee
Inventors
- Frank Obernosterer (Nuremberg, DE)
- Raimund Meyer (Fürth, DE)
- Gerd Kilian (Erlangen, DE)
- Josef Bernhard (Erlangen, DE)
- Johannes Wechsler (Erlangen, DE)
- Jakob Kneißl (Erlangen, DE)
- Stefan Ereth (Erlangen, DE)
- Jörg Robert (Uttenreuth, DE)
Cpc classification
H04W72/0453
ELECTRICITY
International classification
H04L9/06
ELECTRICITY
H04W72/0453
ELECTRICITY
Abstract
Proposed is a controller for a participant of a communication system, wherein the communication system wirelessly communicates in a frequency band that is used for communication by a plurality of communication systems, wherein the controller is configured to identify a channel access pattern, wherein the channel access pattern indicates a frequency hop-based and/or time hop-based occupancy of the frequency band that is usable for the communication of the communication system, wherein the controller is configured to identify the channel access pattern as a function of individual information of the communication system and as a function of a state of a numerical sequence generator for generating a numerical sequence or a number of a numerical sequence.
Claims
1. A base station of a communication system, wherein the communication system wirelessly communicates in a frequency band that is used for communication by a plurality of communication systems, wherein the base station is configured to transmit a signal, wherein the signal comprises information about a channel access pattern, wherein the channel access pattern indicates a frequency hop-based and/or time hop-based occupancy of the frequency band that is usable for the communication of the communication system, wherein the information describes a state of a numerical sequence generator for generating a numerical sequence, wherein the numerical sequence determines the channel access pattern, wherein the base station is configured to communicate with a participant of the communication system by using a real subset of resources determined by the channel access pattern.
2. The base station according to claim 1, wherein the channel access pattern differs from another channel access pattern on a basis of which at least one other communication system of a plurality of other communication systems accesses the frequency band.
3. The base station according to claim 1, wherein the base station is configured to operate uncoordinatedly with respect to other communication systems.
4. The base station according to claim 1, wherein the base station is configured to emit the signal with the information about the channel access pattern multiple times, wherein the information about the channel access pattern transferred with consecutive emissions of the signal describes different states of the numerical sequence generator or different numbers of the numerical sequence.
5. The base station according to claim 4, wherein the information transferred with the emissions of the signal describes only a subset of the states of the numerical sequence generator or of the numbers of the numerical sequence.
6. The base station according to claim 1, wherein the information about the channel access pattern is the state of the numerical sequence generator or information derived therefrom, or wherein the information about the channel access pattern is the number of the numerical sequence or information derived therefrom.
7. The base station according to claim 1, wherein the base station is configured to identify the channel access pattern as a function of the state of the numerical sequence generator or of a number of the numerical sequence derived from the state of the numerical sequence generator.
8. The base station according to claim 7, wherein states of the numerical sequence generator following the state of the numerical sequence generator are identifiable on a basis of the state of the numerical sequence generator, wherein the base station is configured to identify the channel access pattern as a function of the following states of the numerical sequence generator or following numbers of the numerical sequence derived therefrom.
9. The base station according to claim 1, wherein the base station is configured to identify the channel access pattern as a function of individual information of the communication system.
10. The base station according to claim 9, wherein the individual information of the communication system is intrinsic information of the communication system.
11. The base station according to claim 10, wherein the intrinsic information of the communication system is a network-specific identifier.
12. The base station according to claim 11, wherein the network-specific identifier is an identification of the communication system.
13. The base station according to claim 1, wherein the base station is configured to map, by using a mapping function, the state of the numerical sequence generator or a number of the numerical sequence derived from the state of the numerical sequence generator, or the number of the numerical sequence, and individual information of the communication system onto time information and frequency information, wherein the time information and the frequency information describe a resource of the channel access pattern.
14. The base station according to claim 13, wherein the time information describes a time slot or a time slot index.
15. The base station according to claim 13, wherein, when mapping the time information, the mapping function considers an activity rate of the communication system, wherein the activity rate is specified before execution, or wherein the signal or a further signal transmitted by the base station comprises information about the activity rate.
16. The base station according to claim 15, wherein, when mapping onto the time information, the mapping function considers different activity rates of the communication system so that the channel access pattern comprises regions of the different activity rates, wherein the signal or the further signal comprises information about the different activity rates.
17. The base station according to claim 15, wherein the base station is configured to dynamically adapt the activity rate as a function of a current or predicted utilization situation of the communication system.
18. The base station according to claim 14, wherein, when mapping onto the time information, the mapping function adheres to a specified minimum distance between consecutive time slots or time slot indices of the channel access pattern.
19. The base station according to claim 13, wherein the frequency information describes a frequency channel or a frequency channel index.
20. The base station according to claim 13, wherein the frequency information describes a distance between consecutive frequency channels or frequency channel indices of the channel access pattern.
21. The base station according to claim 19, wherein, when mapping onto the frequency information, the mapping function adheres to a specified minimum distance between consecutive frequency channels or frequency channel indices of the channel access pattern.
22. The base station according to claim 13, wherein, when mapping onto the frequency information, the mapping function considers an interference-prone frequency channel or a range of interference-prone frequency channels of the frequency band so that the interference-prone frequency channel or the range of interference-prone frequency channels is not or less occupied by the channel access pattern.
23. The base station according to claim 13, wherein the frequency information describes a bundling of frequency resources of the frequency band comprising at least two directly adjacent or spaced apart frequency channels or frequency channel indices.
24. The base station according to claim 1, wherein the base station is configured to identify a pseudo random number R as a function of: the state of the numerical sequence generator, or a number of the numerical sequence derived from the state of the numerical sequence generator, or the number of the numerical sequence, and individual information of the communication system, wherein the pseudo random number R determines the channel access pattern.
25. The base station according to claim 24, wherein the base station is configured to identify a resource of the channel access pattern on a basis of the pseudo random number R.
26. The base station according to claim 1, wherein the signal is a beacon signal.
27. The base station according to claim 1, wherein the numerical sequence generator is a periodic numerical sequence generator for generating a periodic numerical sequence.
28. The base station according to claim 1, wherein the numerical sequence generator is a deterministic random number generator for generating a pseudo-random numerical sequence.
29. The base station according to claim 1, wherein the state of the numerical sequence generator is a periodic beacon index and/or a periodic time slot index, or wherein a number derived from the state of the numerical sequence generator is a periodic beacon index and/or a periodic time slot index.
30. The base station according to claim 1, wherein the number of the numerical sequence is a periodic beacon index and/or a periodic time slot index.
31. The base station according to claim 1, wherein an occupancy of the frequency band that is defined by the channel access pattern at least partially overlaps an occupancy of the frequency band by another communication system.
32. A terminal point of a communication system, wherein the communication system wirelessly communicates in a frequency band that is used for communication by a plurality of communication systems, wherein the terminal point is configured to receive a signal, wherein the signal comprises information about a channel access pattern, wherein the channel access pattern indicates a frequency hop-based and/or time hop-based occupancy of the frequency band that is usable for the communication of the communication system, wherein the terminal point is configured to identify the channel access pattern on a basis of the information about the channel access pattern, wherein the information describes a state of a numerical sequence generator for generating a numerical sequence, wherein the numerical sequence determines the channel access pattern, wherein the terminal point is configured to communicate with a participant of the communication system by using a real subset of resources determined by the channel access pattern.
33. The terminal point according to claim 32, wherein the channel access pattern differs from another channel access pattern on a basis of which at least one other communication system of a plurality of other communication systems accesses the frequency band.
34. The terminal point according to claim 32, wherein the terminal point is configured to operate uncoordinatedly with respect to other communication systems.
35. The terminal point according to claim 32, wherein the terminal point is configured to receive the signal with the information about the channel access pattern multiple times, wherein the information about the channel access pattern transferred with consecutive emissions of the signal describes different states of the numerical sequence generator or different numbers of the numerical sequence, wherein the terminal point is configured to identify the channel access pattern on a basis of the information about the channel access pattern.
36. The terminal point according to claim 35, wherein the information transferred with the emissions of the signal describes only a subset of the states of the numerical sequence generator or of the numbers of the numerical sequence.
37. The terminal point according to claim 32, wherein the information about the channel access pattern is the state of the numerical sequence generator or information derived therefrom, or wherein the information about the channel access pattern is the number of the numerical sequence or information derived therefrom.
38. The terminal point according to claim 32, wherein the terminal point is configured to identify the channel access pattern as a function of the state of the numerical sequence generator or of a number of the numerical sequence derived from the state of the numerical sequence generator.
39. The terminal point according to claim 32, wherein states of the numerical sequence generator following the state of the numerical sequence generator are identifiable on a basis of the state of the numerical sequence generator, wherein the terminal point is configured to identify the channel access pattern as a function of the following states of the numerical sequence generator or following numbers of the numerical sequence derived therefrom.
40. The terminal point according to claim 32, wherein the terminal point is configured to identify the channel access pattern as a function of individual information of the communication system.
41. The terminal point according to claim 40, wherein the individual information of the communication system is intrinsic information of the communication system.
42. The terminal point according to claim 41, wherein the intrinsic information of the communication system is a network-specific identifier.
43. The terminal point according to claim 42, wherein the network-specific identifier is an identification of the communication system.
44. The terminal point according to claim 32, wherein the terminal point is configured to map, by using a mapping function, the state of the numerical sequence generator or a number of the numerical sequence derived from the state of the numerical sequence generator, or the number of the numerical sequence, and individual information of the communication system onto time information and frequency information, wherein the time information and the frequency information describe a resource of the channel access pattern.
45. The terminal point according to claim 44, wherein the time information describes a time slot or a time slot index.
46. The terminal point according to claim 44, wherein, when mapping the time information, the mapping function considers an activity rate of the communication system, wherein the activity rate is specified before execution, or wherein the signal or a further received signal comprises information about the activity rate.
47. The terminal point according to claim 46, wherein, when mapping onto the time information, the mapping function considers different activity rates of the communication system so that the channel access pattern comprises regions of the different activity rates, wherein the signal or the further signal comprises information about the different activity rates.
48. The terminal point according to claim 46, wherein the signal comprises information about activity rates of the communication system, or wherein the terminal point is configured to receive a further signal, wherein the further signal comprises information about the activity rates of the communication system.
49. The terminal point according to claim 45, wherein, when mapping onto the time information, the mapping function adheres to a specified minimum distance between consecutive time slots or time slot indices of the channel access pattern.
50. The terminal point according to claim 44, wherein the frequency information describes a frequency channel or a frequency channel index.
51. The terminal point according to claim 44, wherein the frequency information describes a distance between consecutive frequency channels or frequency channel indices of the channel access pattern.
52. The terminal point according to claim 50, wherein, when mapping onto the frequency information, the mapping function adheres to a specified minimum distance between consecutive frequency channels or frequency channel indices of the channel access pattern.
53. The terminal point according to claim 44, wherein, when mapping onto the frequency information, the mapping function considers an interference-prone frequency channel or a range of interference-prone frequency channels of the frequency band so that the interference-prone frequency channel or the range of interference-prone frequency channels is not or less occupied by the channel access pattern.
54. The terminal point according to claim 39, wherein the frequency information describes at least two directly adjacent or spaced apart frequency channels or frequency channel indices.
55. The terminal point according to claim 32, wherein the terminal point is configured to identify a pseudo random number R as a function of: the state of the numerical sequence generator, or a number of the numerical sequence derived from the state of the numerical sequence generator, or the number of the numerical sequence, and individual information of the communication system, wherein the pseudo random number R determines the channel access pattern.
56. The terminal point according to claim 55, wherein the terminal point is configured to identify a resource of the channel access pattern on a basis of the pseudo random number R.
57. The terminal point according to claim 32, wherein the signal is a beacon signal.
58. The terminal point according to claim 32, wherein the numerical sequence generator is a periodic numerical sequence generator for generating a periodic numerical sequence.
59. The terminal point according to claim 32, wherein the numerical sequence generator is a deterministic random number generator for generating a pseudo-random numerical sequence.
60. The terminal point according to claim 32, wherein the state of the numerical sequence generator is a periodic beacon index and/or a periodic time slot index, or wherein a number derived from the state of the numerical sequence generator is a periodic beacon index and/or a periodic time slot index.
61. The terminal point according to claim 32, wherein the number of the numerical sequence is a periodic beacon index and/or a periodic time slot index.
62. The terminal point according to claim 32, wherein an occupancy of the frequency band defined by the channel access pattern at least partially overlaps an occupancy of the frequency band by another communication system.
63. A communication system, comprising: a base station of the communication system, wherein the communication system wirelessly communicates in a frequency band that is used for communication by a plurality of communication systems, wherein the base station is configured to transmit a signal, wherein the signal comprises information about a channel access pattern, wherein the channel access pattern indicates a frequency hop-based and/or time hop-based occupancy of the frequency band that is usable for the communication of the communication system, wherein the information describes a state of a numerical sequence generator for generating a numerical sequence, wherein the numerical sequence determines the channel access pattern, wherein the base station is configured to communicate with a participant of the communication system by using a real subset of resources determined by the channel access pattern; and at least one terminal point of the communication system, wherein the communication system wirelessly communicates in a frequency band that is used for communication by a plurality of communication systems, wherein the terminal point is configured to receive a signal, wherein the signal comprises information about a channel access pattern, wherein the channel access pattern indicates a frequency hop-based and/or time hop-based occupancy of the frequency band that is usable for the communication of the communication system, wherein the terminal point is configured to identify the channel access pattern on a basis of the information about the channel access pattern, wherein the information describes a state of a numerical sequence generator for generating a numerical sequence, wherein the numerical sequence determines the channel access pattern, wherein the terminal point is configured to communicate with a participant of the communication system by using a real subset of resources determined by the channel access pattern.
64. A method for operating a base station of a communication system, wherein the communication system wirelessly communicates in a frequency band that is used for communication by a plurality of communication systems, the method comprising: transmitting a signal, wherein the signal comprises information about a channel access pattern, wherein the channel access pattern indicates a frequency hop-based and/or time hop-based occupancy of the frequency band that is usable for the communication of the communication system, wherein the information describes a state of a numerical sequence generator for generating a numerical sequence, wherein the numerical sequence determines the channel access pattern; and communicating with a participant of the communication system by using a real subset of resources determined by the channel access pattern.
65. A method for operating a terminal point of a communication system, wherein the communication system wirelessly communicates in a frequency band that is used for communication by a plurality of communication systems, the method comprising: receiving a signal, wherein the signal comprises information about a channel access pattern, wherein the channel access pattern indicates a frequency hop-based and/or time hop-based occupancy of the frequency band that is usable for the communication of the communication system; identifying the channel access pattern on a basis of the information about the channel access pattern, wherein the information describes a state of a numerical sequence generator for generating a numerical sequence, wherein the numerical sequence determines the channel access pattern; and communicating with a participant of the communication system by using a real subset of resources determined by the channel access pattern.
66. A non-transitory digital storage medium having a computer program stored thereon to perform a method for operating a base station of a communication system, wherein the communication system wirelessly communicates in a frequency band that is used for communication by a plurality of communication systems, the method comprising: transmitting a signal, wherein the signal comprises information about a channel access pattern, wherein the channel access pattern indicates a frequency hop-based and/or time hop-based occupancy of the frequency band that is usable for the communication of the communication system, wherein the information describes a state of a numerical sequence generator for generating a numerical sequence, wherein the numerical sequence determines the channel access pattern; and communicating with a participant of the communication system by using a real subset of resources determined by the channel access pattern, when said computer program is run by a computer.
67. A non-transitory digital storage medium having a computer program stored thereon to perform a method for operating a terminal point of a communication system, wherein the communication system wirelessly communicates in a frequency band that is used for communication by a plurality of communication systems, the method comprising: receiving a signal, wherein the signal comprises information about a channel access pattern, wherein the channel access pattern indicates a frequency hop-based and/or time hop-based occupancy of the frequency band that is usable for the communication of the communication system; identifying the channel access pattern on a basis of the information about the channel access pattern, wherein the information describes a state of a numerical sequence generator for generating a numerical sequence, wherein the numerical sequence determines the channel access pattern; and communicating with a participant of the communication system by using a real subset of resources determined by the channel access pattern, when said computer program is run by a computer.
Description
BRIEF DESCRIPTION OF THE DRAWINGS
(1) Embodiments of the present invention will be detailed subsequently referring to the appended drawings, in which:
(2)
(3)
(4)
(5)
(6)
(7)
(8)
(9)
(10)
(11)
(12)
(13)
(14)
(15)
(16)
(17)
(18)
(19)
(20)
(21)
(22)
DETAILED DESCRIPTION OF THE INVENTION
(23) In the subsequent description of the embodiments of the present invention, the same elements or elements having the same effect are provided with the same reference numerals in the drawings so that their description is mutually interchangeable.
(24)
(25) The first communication system 102_1 may comprise a base station 104_1 and one or several terminal points 106_1-106_n, wherein n is a natural number larger than or equal to one. In the embodiment shown in
(26) The first communication system 102_1 may be configured to wirelessly communicate in a frequency band (e.g. a license-free and/or permission-free frequency band such as the ISM bands) used for communication by a plurality of communication systems. In this case, the frequency band may comprise a significantly larger (e.g. at least larger by a factor of two) bandwidth than reception filters of the participants of the first communication system 102_1.
(27) As is indicated in
(28) In embodiments, the first communication system 102_1 may be configured to use for the communication different frequencies or frequency channels of the frequency band (e.g. into which the frequency band is divided) in portions (e.g. in time slots) on the basis of a channel access pattern, regardless of whether these are used by another communication system (e.g. the second communication system 102_2 and/or the third communication system 102_3), wherein the channel access pattern differs from another channel access pattern based on which at least one other communication system of the plurality of other communication systems (e.g. the second communication system 102_2) accesses the frequency band.
(29) In such a communication arrangement 100 shown in
(30) For example, participants of the first communication system 102_1, e.g. a base station 104_1 and several terminal points 106_1-106_4, may wirelessly communicate among themselves on the basis of a first channel access pattern (e.g. which indicates a frequency hop-based occupancy (e.g. of resources) of the frequency band, usable for the communication of the first communication system 102_1), whereas participants of the second communication system 102_2, e.g. a base station 104_2 and several terminal points 106_5-106_8, may wirelessly communicate among themselves on the basis of a second channel access pattern (e.g. which indicates a frequency hop-based occupancy (e.g. of resources) of the frequency band, usable for the communication of the second communication system 102_2), wherein the first channel access pattern and the second channel access pattern are different (e.g. comprise an overlap of less than 20% in the resources used, in the ideal case there is no overlap).
(31) As mentioned above, the communication systems (e.g. the first communication system 102_1 and the second communication system 102_2) are mutually uncoordinated.
(32) The communication systems 102_1, 102_2, 102_3 being mutually uncoordinated refers to the fact that the communication systems mutually (=among the communication systems) do not exchange any information about the respectively used channel access pattern, or, in other words, a communication system does not have any knowledge about the channel access pattern used by another communication system. Thus, the first communication system 102_1 does not know which channel access pattern is used by another communication system (e.g. the second communication system 102_2).
(33) Thus, embodiments refer to a communication arrangement 100 of mutually uncoordinated and, possibly, mutually unsynchronized radio networks (or communication systems) 102_1, 102_2 for the transfer of data which access a mutually used frequency band. In other words, there are at least two radio networks 102_1, 102_2 that operate independently of one another. Both networks 102_1, 102_2 use the same frequency band.
(34) In embodiments, it is assumed that in each individual data transfer only a (small) part of the frequency band is used, e.g. a frequency channel or a partial frequency channel. For example, the frequency band may be split into (partial) frequency channels, wherein a frequency channel is a real subset of the total frequency band. The totality of all available frequency channels constitutes the frequency band used. For example, in the telegram-splitting method, the transfer of a message (data packet) may be carried out consecutively via a sequence of different frequency channels. In this case, embodiments are particularly useful.
(35) Oftentimes, networks (or communication systems) 102_1, 102_2 are arranged such that transmission signals of participants of a network (e.g. the communication system 102_2) can also be received by participants of other nearby networks (e.g. the communication system 102_1). There, they act as disturbance signals (interferences) that, in principal, may significantly decrease the performance of a radio transfer system, as is shown in
(36) In detail,
(37) If (as mentioned above) the frequency band as a commonly used resource is divided into individual non-overlapping frequency channels, the effect of the disturbance signals may be significantly reduced. In mutually coordinated networks, a part of the frequency band (a set of frequency channels) may be exclusively allocated to each network so that the reciprocal disturbance (interference) may be minimized. In fully uncoordinated networks, this is not possible.
(38) Thus, in embodiments, accessing the physical transform medium (i.e. the physical radio channel) is implemented in each network such that at least one of the following is fulfilled: a) the channel access, i.e. the frequency occupancy and time occupancy of the radio channel, in a network has as little overlap as possible in time and frequency with the channel access in another network of the same standard (high degree of “orthogonality”), b) the channel access has a (pseudo) random character within desired specifications (e.g. mean access frequency per time) (“randomness”), c) as far as this is avoidable according to the specifications, there are not any longer sequences of an identical (in time and frequency) channel access between networks (“avoidance of systematic overlaps”), d) all frequency channels within the frequency band are used as regularly as possible in order to achieve as high a frequency diversity as possible and, possibly, the adherence to official regulatory specifications (“uniform distribution of the frequency channel used”), e) the information about the frequency occupancy and time occupancy of the radio channels, e.g. for new participants joining a network, may be transmitted with as little signaling effort as possible (“reduction of signaling information”).
(39) Simply put, in embodiments, a mutual disturbance between several networks (intern-network interference) is reduced by carrying out the channel access to the mutually used frequency band differently in frequency and time, advantageously as “orthogonal” as possible and with a (pseudo) random character.
(40) In the following, for illustrative purposes, beside the division of the frequency band into discrete frequency channels (indices c0, c1, c2, . . . ), what is assumed to be also carried out is a temporal discretization of the accesses within a respective network. The associated temporal resources are referred to as time slots and are provided in
(41) In detail,
(42) For example, the participants of the first communication system 102_1 may wirelessly communicate among themselves on the basis of the first channel access pattern 110_1, which indicates a frequency hop-based occupancy of resources of the frequency band to be used for the communication of the first communication system 102_1, whereas participants of the second communication system 102_2 wirelessly communicate among themselves on the basis of the second channel access pattern 110_2, which indicates a frequency hop-based occupancy of resources of the frequency band, usable for the communication of the second communication system 102_2, wherein the first channel access pattern and the second channel access pattern are different (e.g. comprise an overlap of less than 20%, not comprising any overlap in the ideal case).
(43) In other words,
(44) It is important to differentiate between all fundamentally (maximum) available resource elements, i.e. the total quantity of all resource elements from which the channel access pattern selects an appropriate subset (e.g. all elements of the grid in
(45) The design of the channel access pattern therefore also means a determination of the actively usable resource supply for this communication network (or communication system).
(46) Embodiments of base stations, terminal points, and/or communication systems using channel access patterns that fulfil at least one of the above-mentioned criteria a) to e) for communication are described in the following. In addition, embodiments of the generation of such channel access patterns are described in the following.
1. Base Station, Terminal Point and Communication System
(47)
(48) As shown in
(49) The participants (=the base station 104 and terminal points 106_1-106_4) of the communication system shown in
(50) In embodiments, the base station 104 may be configured to transmit a signal 120, wherein the signal 120 comprises information about a channel access pattern 110, wherein the channel access pattern indicates a frequency hop-based and/or time hop-based occupancy (e.g. of resources) of the frequency band, usable for the communication of the communication system 102 (e.g. a temporal sequence of frequency resources (e.g. distributed across the frequency band) usable for the communication of the communication system), wherein the information describes a state of a numerical sequence generator for generating a numerical sequence, wherein the numerical sequence determines the channel access pattern.
(51) For example, the state of the numerical sequence generator may be an internal state of the numerical sequence generator, wherein a number of the numerical sequence may be derived from the internal state of the numerical sequence generator. On the basis of the internal state of the numerical sequence generator, internal states of the numerical sequence generator following the internal state of the numerical sequence generator may be identified, from which following numbers of the numerical sequence may also be derived. For example, the number of the numerical sequence may be directly derived from the internal state of the numerical sequence generator (e.g. state=number), e.g. in the implementation of the numerical sequence generator as a counter, or via a mapping function, e.g. in the implementation of the numerical sequence generator as a shift register, possibly with feedback.
(52) In embodiments, at least one of the terminal points 106_1, 106_4 may be configured to receive the signal 120 with the information about the channel access pattern 110, and to identify the channel access pattern 110 on the basis of the information about the channel access pattern, wherein the information describes a state of a numerical sequence generator for generating a numerical sequence, wherein the numerical sequence determines the channel access pattern.
(53) For example, the base station 104 and/or at least one of the terminal points 106_1-106_4 may be configured to pseudo-randomly identify the channel access pattern as a function of the state of the numerical sequence generator, e.g. by using a pseudo-random mapping function.
(54) In addition, the base station 104 and/or at least one of the terminal points 106_1-106_4 may be configured to pseudo-randomly identify the channel access pattern as a function of individual information of the communication system (e.g. intrinsic information of the communication system such as a network-specific identifier).
(55) Embodiments of the generation of channel access patterns are described in the following. In this case, the channel access patterns are generated by the base station 104 and may be identified by one (or all) of the terminal points 106_1-106_4 shown in
(56) The following description assumes a radio transfer system (or a communication arrangement) with several independent, mutually uncoordinated communication networks whose participants are in a mutual reception range so the transmission signals from participants of one network may potentially be considered as disturbance signals for participants of other networks. For the application of embodiments, it is not required to exchange information (data or signalization information) between different networks. Likewise, it is irrelevant whether the networks are synchronized in time and/or frequency with respect to each other.
(57) In addition, what is assumed is that, within each network, there is a coordinating instance (in the following referred to as “base station”) which may transmit to the non-coordinating participants of the network (in the following referred to as “terminal devices” or “terminal points”) information about the channel access pattern applied within the network. For example, this information may be transmitted via regularly emitted beacon signals, however, it may also be transferred in irregular intervals or, possibly, in a dedicated manner to individual terminal devices or groups of terminal devises.
(58) In addition, what is assumed is that the entire frequency band available for the transfer is divided into a multitude of individual frequency channels that may each be accessed individually or in subsets (groups of frequency channels).
(59) Without limiting the generality and for a better illustration, the following assumes that there is a fixed, discrete time pattern within each network with which channel accesses may be carried out (cf.
(60)
(61) As can be seen in
(62) The memory (e.g. a register) 132 may be configured to store a network-specific identifier ID 140, e.g. a (individual) bit sequence that does not change. The periodic numerical sequence generator 134 may be configured to provide its state 142 or a number 142′ of the periodic numerical sequence derived from its state. The randomizing mapper 136 may be configured to identify a pseudo random number R144 as a function of the state 142 of the numerical sequence generator 134 or the number 142′ of the periodic numerical sequence derived therefrom and the network-specific identifier ID 140. The frequency/time mapper 138 may be configured to identify frequency information f 146 and time information t 148 on the basis of the pseudo random number R 144. For example, the frequency information f 146 and the time information t 148 may describe, or define, a frequency channel and a time slot (or a frequency channel index and a time slot index) and therefore a resource of the channel access pattern.
(63) For example—as is indicated in
(64) In other words,
(65) The generation of the channel access patterns is done iteratively, i.e. the blocks illustrated in
(66) The function of the partial blocks is described in detail in the following. The term “number” is used. This is generally discrete information that may be present in different forms (e.g. in decimal form, as a binary sequence, or the like).
(67) Network-Specific Identifier “ID”
(68) The network-specific identifier is a fixed number that is determined by an external instance (e.g. when configuring the network, or the coordinating base station). Ideally, it differs from network to network. For example, it may be an unambiguous, sufficiently long base station ID, unambiguous network ID, or a sufficiently long hash about them, respectively. This variable is fixed and is the only one that does not vary from call-up to call-up in the arrangement shown.
(69) Periodic Number Generator “Z”
(70) The periodic number generator 134 generates a sequence of numbers Z that periodically repeats with the periodicity P. It has an internal state S.sub.n from which the next generated number and the next internal state S.sub.n+1 can be unambiguously determined. The significant feature is that the entire periodic sequence for each time step may be derived from a single internal state (which is present in an arbitrary time step) already. For example, a simple embodiment is a modulo P counter that periodically delivers the numerical sequence 0,1,2 . . . (P−1). A further embodiment is a deterministic random number generator (pseudo random number generator), e.g. implemented in the form of a feedback shift register (LFSR). A third embodiment is a finite body (Galois field) with P elements.
(71) Randomizing Mapper
(72) The randomizing mapper 136 generates from the two input numbers ID and Z an output number R, i.e. R=map_rand(ID, Z) wherein map_rand represents the mapping function. In this case, the mapping has as random a character as possible, i.e. a mathematically correlated input sequence (consisting of ID, Z) generates an output sequence R that is as uncorrelated in itself as possible.
(73) Embodiments for a randomizing mapping are: linking the two input numbers applying a cyclic redundancy check (CRC) on the input qualities ID, Z, which leads to the number R and has a randomizing character, applying a hash function applying an encryption, e.g. AES encryption, wherein the associated key is known to all authorized participants, and which therefore also represents a method for embedding a “transport layer security” (TLS).
(74) According to the above, the sequence of the elements of the number R is of a pseudo-random nature. It should be different from network to network so as to avoid overlaps of the channel access patterns.
(75) Frequency/Time Mapper
(76) The frequency/time mapper 138 maps, by means of a mapping, to each input number R a 2-tupal of frequency information (radio frequency f) and time information (access time t), i.e. (f,t)=map_ft(R), wherein “map_ft” represents the mapping function. While, in principle, the sequence of the frequencies may be arbitrary within the specified frequency band, the points in time may be present in a monotonously increasing form from call-up to call-up, since “returns” in time are not admissible.
(77) As an embodiment, what is a of particular importance is the case in which the channel access is discretized in time/frequency direction (as described above), i.e. is done in the form of discrete frequency channels and discrete time slots. In this case, the frequency/time mapper allocates to each input number R a 2-tuple of frequency channel index fi and time slot index ti, i.e. (fi,ti)=map_ft(R). The time slots are indexed in a temporally ascending order, since “returns” in time are not admissible. Further discussions as to the occupancy of the time slots can be found in section 3.
(78) The sequence of the 2-tuple (f,t), or (fi, ti), is based on the sequence of the elements of R and defines the channel access pattern.
(79) The exact implementation of the frequency/time mapper, together with the probability function of the number R, determines the access statistic with respect to the channel.
(80) State Signaling and Predictability
(81) The arrangement shown in
(82) In order to identify the channel access pattern used in the network, a terminal device needs the network-specific identifier and the respective state of the periodic number generator.
(83) The network-specific identifier is obtained by the terminal device already at the initial log-on at the network. Advantageously, the same is transferred by means of beacon signals regularly emitted by the base station, and is made available to all authorized terminal devices. Alternatively, the network-specific identifier may also be made known to the terminal device in the course of the initial configuration (with delivery), i.e. before the first operation in the network.
(84) The state of the periodic number generator may either be transferred in a regular beacon signal and/or in distinct dedicated state-signaling resources. A number generator with a periodicity P has P internal states so that ┌log.sub.2┐ bits are transferred for the transmission of the respective state.
(85) The amount of information (number of bits) transferred per state signaling may therefore be controlled by the selected periodicity of the number generator according to the requirements.
(86) The information transferred for the state signaling may be transferred in the form of several pieces of partial information, wherein the transfer may be carried out with different frequencies. Thus, as an embodiment for the case that the periodic number generator (Z) is a counter, the higher-valued bits (most significant bits (MSBs)) of the counter could be transferred separated from the lower-valued bits (least significant bits (LSBs)), and also with different frequencies (e.g. more infrequently). Even if it is not a counter, the entire state information could be transferred in the form of several pieces of partial state information with different transfer frequencies.
(87) Through the periodicity of the number generator, a terminal device that knows the state of the number generator at least at one point in time may determine the entire channel access pattern for any points in time/time slots in the future. This enables the terminal device in an energy-saving idle state to deactivate, e.g., the transmission/reception unit and to predetermine the then valid portion of the channel access pattern from the last previously known state when the transmission/reception unit is subsequently activated. An emission of the state information by the base station may therefore be done in comparatively large temporal intervals.
(88) In summary, the method described herein has the advantage that a comparatively large state space for the (pseudo-random) number R is covered through the combination of a network-specific identifier and a periodic numeric generator. This prevents the channel access patterns of networks to be identical with different network-specified identifiers, which may minimize a systematic collision of the channel accesses of different mutually uncoordinated networks. This proves to be particularly advantageous for the telegram splitting multiple access (TSMA) method.
(89) Advantageous features of the frequency/time mapper are discussed in more detail in the following sections.
Further Embodiment of the Controller
(90) According to
(91) Real radio networks are often operated with a beacon signal that is emitted regularly. In this case, each beacon emission may be provided with a counter that corresponds to a beacon sequence index. Here, this beacon sequence index is referred to as “beacon index”.
(92) It is also common practice for the time slots in a time slot-based system to be provided with a time slot index counter (that increases in the time direction) (cf.
(93)
(94) The controller 130 may comprise a memory 132, a first buffer 135_1, a second buffer 135_2, a randomizing mapper 136 and a frequency/time mapper 138.
(95) The memory (e.g. a register) 132 may be configured to store a network-specific identifier ID 140, e.g. a (individual) bit sequence that is invariable. The first buffer (e.g. a register) 135_1 may be configured to store a periodic beacon index Z1 143_1. The second buffer (e.g. a register) 135_2 may be configured to store a periodic time slot index Z2 143_2. The randomizing mapper 136 may be configured to identify a pseudo-random number R 144 as a function of the periodic beacon index Z1 143_1, the periodic time slot index Z2 143_2 and the network-specific identifier ID 140. The frequency/time mapper 138 may be configured to identify frequency information f 146 and time information t 148 on the basis of the pseudo-random number R 144. For example, the frequency information f 146 and the time information t 148 may describe, or define, a frequency channel and a time slot (or a frequency channel index and a time slot index) and therefore a resource of the channel access pattern.
(96) In other words,
(97) The controllers 130 shown in
2. Control of the Channel Access in the Frequency Domain
(98) To simplify the following illustration, what is assumed is that the frequency range (or the frequency band) is divided into discrete frequency channels and that a transfer is carried out according to the TSMA method.
(99) Mobile radio channels usually comprise signal attenuation that varies across the frequency. If a data packet is transferred in the form of several partial data packets according to the TSMA method and if the underlying mobile radio channel is not known in the transmitter, the error rate of the transfer may be reduced or even minimized on average by transferring the individual partial data packets as distributed across the entire frequency domain as possible (using the frequency diversity).
(100) For this reason, it may be advantageous (in particular if a data packet consists of only a few partial data packets) to ensure that the frequency channels on which the partial data packets are transferred have a certain (minimum) distance relative to each other in the frequency domain.
(101) Since the channel access pattern significantly determines the frequency hopping behavior in TSMA within a network, a suitable method may be used to ensure that there is a minimum distance between two consecutive frequency channels of the channel access pattern.
(102) Thus, in embodiments, the frequency/time mapper 138 (cf.
(103) Thus, the frequency/time mapper 138 in
(104)
(105) As can further be seen in
(106) In other words,
(107) By means of a suitable mapping function (Δfi,t)=map_Δft(R) in the frequency difference/time mapper, it may be ensured that only frequency channel index hops Δfi.sub.n=fi.sub.n+1−fi.sub.n (from channel access n to channel access n+1) are carried out, e.g., that are within a desired range, e.g. Δfi.sub.max≥Δfi≥Δfi.sub.min for Δfi>0 and Δfi.sub.max≥(−Δfi)≥Δfi.sub.min for Δfi<0. There are numerous methods for the implementation of such a limitation, which are not subject of the invention. An exemplary implementation in the form of a corresponding program code for MATLAB (which was used to generate
(108)
(109) 72 frequency channels are available in the illustrated example. The parameters associated with the simulation results are Δfi.sub.min=21, Δfi.sub.max=51, i.e. the size of the distance between two accesses that are consecutive in the channel access pattern is between 21 and 51 frequency channels.
(110) By suitable modifications of the exemplary program code, which are easily accessible to the person skilled in the art, other distribution forms than those shown in
3. Specification of the Temporal Channel Access Activity
(111) In a highly utilized system, all available time slots may be included in the channel access pattern. In less utilized systems, not every time slot needs to be available for the channel access. This is illustrated in the following illustration.
(112)
(113) In other words,
(114) Thus, to generate a pseudo-random channel access pattern 110, the dimension time (in the form of the time slot index) is available in addition to the dimension frequency (in the form of the frequency channel index. Thus, when generating a channel access pattern, a mean activity rate A may be specified. Here, this activity rate is defined as a mean ratio of time slots used for the channel access to maximum available time slots. Thus, the activity rate A is 1 (100%) when using every time slot. However, if only every third time slot is included in the channel access pattern on average, the mean activity rate A=⅓.
(115) Thus, the activity rate determines the (temporal) density of the resources 112 offered in the channel access pattern 110.
(116) In embodiments, the time slots selected for the channel access at a specified activity rate may be determined in a pseudo-random manner from a suitable part of the pseudo-random number R (cf.
Embodiment 1
(117) In each step n, an integer number r.sub.n may be derived from the associated pseudo random number R.sub.n, which may adopt the values between r.sub.min and r.sub.max, i.e., r.sub.min≤r.sub.n≤r.sub.max. After every time slot that is active in the channel access pattern 110, a number of r.sub.n time slots may be skipped, thus, they are not used for the channel access. This process is exemplarily illustrated in
(118) In detail,
(119) In other words,
(120) If the number r is derived from the number R such that the elements of r occur with the same frequency between r.sub.min and r.sub.max (equal distribution), the following activity rate results:
A=2/(2+r.sub.min+r.sub.max).
(121) The method presented in the above embodiment has the advantage that minimum and maximum distances between the time slots active in the channel access pattern 110 may be specified. Specifying minimum distances may be particularly advantageous for battery-powered devices, where transmission pauses of a certain minimum length between two consecutive emissions (recovery phase) increase the battery life.
(122) A comparable approach, what can be specified is that a minimum number of active time slots directly follow each other.
Embodiment 2
(123) In an implementation according to embodiment 1, what may occur are longer regions having locally significantly higher or lower activity rates than desired. This effect is avoided in the following embodiment.
(124) Here, groups of consecutive time slots in which one active time slot of the channel access pattern each is placed are periodically specified. In
(125) In detail,
(126) In other words,
(127) As can be seen in
(128) If a minimum distance between two consecutive time slots of the channel access pattern 110 is to be ensured, non-occupiable regions may be introduced between the clusters 114. They may consist of one or several time slots, as is illustrated in
(129) In detail,
(130) In other words,
(131) As can be seen in
(132) Depending on the selected activity rate, the clusters 114 may have to comprise different lengths in order to achieve the desired activity rate. In this case, the value range of v.sub.n varies according to the respective cluster length. For example, in order to set an activity rate of 40%, clusters of the length of two and the length of three may alternate.
4. Channel Access Pattern with Regions of Different Activity Rates
(133) Data packets that are to reach the receiver as quickly as possible (short latency time) involve channel accesses that follow each other as closely as possible during transfer, i.e. a comparatively high activity rate in the channel access pattern.
(134) On the other hand, for data packets where a transmission reliability (e.g. high robustness against external disturbance) is of primary importance, a distribution of the emission over a longer period of time can be advantageous, i.e. a comparatively low activity rate in the channel access pattern can be favorable. The same applies to devices where a temporally equalized energy extraction from the battery (temporally stretched transmission activity) is desired.
(135) As illustrated above, the activity rate, i.e. the frequency of the channel access, may be specified by suitable measures. In order to satisfy the different requirements in a network, if any, a channel access pattern may be designed such that it comprises regions with different activity rates. This is exemplarily illustrated in
(136) In detail,
(137) In other words,
5. Demand-Dependent (Dynamic) Adaption of the Activity Rate of the Channel Access Pattern
(138) In networks (or communication systems) 102, different utilization situations may exist at different times. As explained above, the actively usable resource supply for this network may be determined by the design of the channel access pattern 110 (i.e. its activity rate or mean temporal density).
(139) Providing a large resource supply (high activity rate) at a low actual utilization may be disadvantageous especially for battery-powered devices. An example for this is a battery-operated base station (e.g. of a PAN network, possibly in the so-called repeater operation) which operates the receiver during all active resources of the channel access pattern and therefore uses energy.
(140) Thus, it can be useful to adapt the mean activity rate dynamically, i.e. the temporal density of the resources offered by the channel access pattern 110, with respect to the existing utilization conditions. If the activity rate of the channel access pattern 110 is changed, this is accordingly signaled to the participants in the network, to which end the beacon signal (or also dedicated signaling resources) may be used, for example.
(141) If a terminal device 106 is in an extended idle state (energy-saving mode), it may not receive the emitted signaling information of the base station 104 about a possibly changed channel access pattern during the idle state. In such a scenario, it may be useful for a channel access pattern 110 to provide a minimum supply of (basic) resources that is available at any time and without special signaling, and an additional supply of resources that may be added depending on the utilization and that is subject to appropriate signaling.
(142) In the above sense, e.g., resources additionally added to the channel access pattern may be arranged temporally after the basic resources, or may be arranged interleaved with them in the time/frequency grid, as is shown in
(143) In detail,
(144) In other words,
6. Adaptive Frequency Domain Occupancy
(145) In certain unlicensed frequency bands, users may possibly decide themselves without regulatory restrictions which frequency ranges they use within the frequency band. This may lead to the fact that certain areas of the available frequency band are occupied more heavily by external users than others and are therefore exposed to stronger disturbances.
(146) If a base station 104 determines such a medium- or long term asymmetric utilization of the frequency band (e.g. through signal-to-interference power estimations per frequency channel based on received signals), the above-average occupied range of the frequency band may be avoided for the use by the own network by not including the associated frequency channels into the channel access pattern. This is to be considered in the frequency/time mapper (cf.
(147) For example, the group of the excluded frequency channels may be described by corresponding start and end frequency channel indices or by a start frequency channel index and a following channel quantity.
(148)
(149) As can be seen in
(150) In other words,
(151) With avoiding disturbance-prone frequency domains for the data transfer in the own network, there is a certain utilization balancing across the frequency band by other networks not experiencing any additional disturbances in the already heavily utilized frequency domains.
7. Bundling Resource Elements in the Frequency Domain (Frequency Channel Bundling)
(152) Depending on the hardware and software used, it is possible for a base station 104 to receive on several frequency channels simultaneously (frequency channel bundling). In this case, it is advantageous, especially with more heavily utilized systems, to accordingly increase the number of the resource elements offered within the network in the frequency dimension and to include several frequency channels within a time slot into the channel access pattern, as is shown in
(153) In detail,
(154) In other words,
(155) In a further embodiment, the frequency channels grouped into resource clusters do not necessarily have to be immediately adjacent.
8. Further Embodiments
(156)
(157)
(158)
(159)
(160)
(161) Embodiments refer to generation and application of network-individual channel access patterns, comprising at least one of the following characteristics: the channel access patterns contain amongst themselves as few overlapping partial sequences as possible, there is a large supply of channel access patterns (e.g. in areas with a high network density), the channel access patterns are designed such that they have a very high periodicity, the channel access patterns lead (if there are corresponding requirements) to an use of the available frequency channels that is uniform on average, signaling of the applied pattern is done by the coordinating instance with as little signaling information as possible, and terminal devices may already determine the content of the access pattern at any future time when the signaling of the channel access is received once and completely (this enables terminal devices, e.g. for energy saving reasons, to introduce longer reception pauses and to determine the valid channel access pattern on the basis of information received before the reception pause, when being switched on again.
(162) Embodiments are used in systems for radio transfer of data from terminal devices to a base station and from one/several base stations to terminal devices. For example, the system may be a personal area network (PAN) or a low power wide area network (LPWAN), wherein the terminal devices may be battery-operated sensors (sensor nodes), for example.
(163) Embodiments concern application cases in which a multitude of mutually not coordinated radio-based networks are operated in a common frequency band, wherein the participants of different networks are in a mutual reception range and their signals are therefore a potential mutual source of disturbance (cf.
(164) As mentioned above, the embodiments described herein may be used to transfer data between the participants of the communication system on the basis of the telegram splitting method. In the telegram splitting method, data, e.g. a telegram or a data packet, is divided into a plurality of sub-data packets (or partial data packets or partial packets), and the sub-data packets are transferred by using a time hop pattern and/or a frequency hop pattern, distributed in time and/or frequency, from a participant to another participant (e.g. from the base station to the terminal point, or from the terminal point to the base station) of the communication system, wherein the participant that receives the sub-data packets rejoins (or combines) them so as to obtain the data packet. Each of the sub-data packets contains only a part of the data packet. Furthermore, the data packet may be channel-encoded so that not all of the sub-data packets are needed to decode the data packet faultlessly, but only a part of the sub-data packets.
(165) In the transfer of data on the basis of the telegram splitting method, the sub-data packets may be transferred distributed in a subset (e.g. a selection) of the available resources of the network-specific channel access pattern. For example, one sub-data packet may be transferred per resource.
(166) In other words, embodiments may be advantageously used in systems in which a message (data packet) is transferred in several partial data packets (so-called telegram splitting, cf. DE 10 2011 082 098).
(167) Even though some aspects have been described within the context of a device, it is understood that said aspects also represent a description of the corresponding method, so that a block or a structural component of a device is also to be understood as a corresponding method step or as a feature of a method step. By analogy therewith, aspects that have been described within the context of or as a method step also represent a description of a corresponding block or detail or feature of a corresponding device. Some or all of the method steps may be performed while using a hardware device, such as a microprocessor, a programmable computer or an electronic circuit. In some embodiments, some or several of the most important method steps may be performed by such a device.
(168) Depending on specific implementation requirements, embodiments of the invention may be implemented in hardware or in software. Implementation may be effected while using a digital storage medium, for example a floppy disc, a DVD, a Blu-ray disc, a CD, a ROM, a PROM, an EPROM, an EEPROM or a FLASH memory, a hard disc or any other magnetic or optical memory which has electronically readable control signals stored thereon which may cooperate, or cooperate, with a programmable computer system such that the respective method is performed. This is why the digital storage medium may be computer-readable.
(169) Some embodiments in accordance with the invention thus comprise a data carrier which comprises electronically readable control signals that are capable of cooperating with a programmable computer system such that any of the methods described herein is performed.
(170) Generally, embodiments of the present invention may be implemented as a computer program product having a program code, the program code being effective to perform any of the methods when the computer program product runs on a computer.
(171) The program code may also be stored on a machine-readable carrier, for example.
(172) Other embodiments include the computer program for performing any of the methods described herein, said computer program being stored on a machine-readable carrier.
(173) In other words, an embodiment of the inventive method thus is a computer program which has a program code for performing any of the methods described herein, when the computer program runs on a computer.
(174) A further embodiment of the inventive methods thus is a data carrier (or a digital storage medium or a computer-readable medium) on which the computer program for performing any of the methods described herein is recorded. The data carrier, the digital storage medium, or the recorded medium are typically tangible, or non-volatile.
(175) A further embodiment of the inventive method thus is a data stream or a sequence of signals representing the computer program for performing any of the methods described herein. The data stream or the sequence of signals may be configured, for example, to be transmitted via a data communication link, for example via the internet.
(176) A further embodiment includes a processing unit, for example a computer or a programmable logic device, configured or adapted to perform any of the methods described herein.
(177) A further embodiment includes a computer on which the computer program for performing any of the methods described herein is installed.
(178) A further embodiment in accordance with the invention includes a device or a system configured to transmit a computer program for performing at least one of the methods described herein to a receiver. The transmission may be electronic or optical, for example. The receiver may be a computer, a mobile device, a memory device or a similar device, for example. The device or the system may include a file server for transmitting the computer program to the receiver, for example.
(179) In some embodiments, a programmable logic device (for example a field-programmable gate array, an FPGA) may be used for performing some or all of the functionalities of the methods described herein. In some embodiments, a field-programmable gate array may cooperate with a microprocessor to perform any of the methods described herein. Generally, the methods are performed, in some embodiments, by any hardware device. Said hardware device may be any universally applicable hardware such as a computer processor (CPU), or may be a hardware specific to the method, such as an ASIC.
(180) For example, the apparatuses described herein may be implemented using a hardware device, or using a computer, or using a combination of a hardware device and a computer.
(181) The apparatuses described herein, or any components of the apparatuses described herein, may at least be partially implement in hardware and/or software (computer program).
(182) For example, the methods described herein may be implemented using a hardware device, or using a computer, or using a combination of a hardware device and a computer.
(183) The methods described herein, or any components of the methods described herein, may at least be partially implement by performed and/or software (computer program).
(184) While this invention has been described in terms of several embodiments, there are alterations, permutations, and equivalents which fall within the scope of this invention. It should also be noted that there are many alternative ways of implementing the methods and compositions of the present invention. It is therefore intended that the following appended claims be interpreted as including all such alterations, permutations and equivalents as fall within the true spirit and scope of the present invention.
BIBLIOGRAPHY
(185) [1] DE 10 2011 082 098 B4 [2] DE 10 2017 206 236
LIST OF ABBREVIATIONS
(186) CRC: Cyclic Redundancy Check
(187) LPWAN: Low Power Wide Area Network
(188) LSB: Least Significant Bit(s)
(189) MSB: Most Significant Bit(s)
(190) PAN: Personal Area Network
(191) TLS: Transport Layer Security
(192) TSMA: Telegram-Splitting-Multiple-Access
(193) TABLE-US-00001 APPENDIX MATLAB code for section 2: N_freq=72; N_time=1500000; N_low=21; N_high=51; rand(‘state’,0); fc=zeros(1,N_time); R_f=randint(1,10*N_time,2*N_high+1); R _f=R_f-N_high; idx=find(R_f>-N_low & R_f<N_low); R_f(idx)=[ ]; R_f=R_f(1:N_time); fc(1)=30; for p=1:N_time-1; fc(p+1)=mod(fc(p)+R_f(p),N_freq); % frequency channel index end Delt_fc1 = (fc(2:end)-fc(1:end-1)); % index difference of consecutive accesses figure(1); hist(Delt_fc1,-72:72); h=gca; set(h,‘XLim’, [-72 72]); xlabel(‘\Deltafi’); ylabel(‘number of results’); title(‘histogram of \Deltafi’);